FAME: A Flow Aggregation MEtric for Shortest Path Routing Algorithms in Multi-Hop Wireless Networks

Laubé, Alexandre; Martin, Steven; Quadri, Dominique; Agha, Khaldoun Al; Pujolle, Guy

doi:10.1109/wcnc.2017.7925496

Cited by 3 publications

(7 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…NI can be determined in several ways using, for example, a connected dominating set or a Steiner tree. However, our results in [3] have showed that the use of sources and destinations is the best choice.…”

Section: Flow Aggregation Metricmentioning

confidence: 78%

“…However, this solution requires a lot of computing power to reach the optimum, which makes it inapplicable to networks with high flow fluctuations. We solved this problem in [3] by developing a routing metric to allow the shortest path routing algorithms to aggregate flows close to optimality, increasing the number of nodes that can be turned off. However, this work does not take into account interference, which leads to overloading the network areas where flows are aggregated.…”

Section: Related Workmentioning

confidence: 99%

“…If the set of flows changes, all routes have to be recalculated through integer linear programming. To deal with this, we have proposed the Flow Aggregation MEtric (FAME) [3].…”

Section: Heuristic For Flow Aggregationmentioning

confidence: 99%

“…In this paper, we confirm this observation by comparing our flow aggregation routing with a routing solution that minimizes the overall energy consumption of the network. We also extend our Flow Aggregation MEtric [3] (FAME) so that it considers interference and prevents excessive aggregation. Our contributions are twofold:…”

Section: Introductionmentioning

confidence: 99%

“…ese contributions are evaluated by simulation using CPLEX [4] and adopting the same methodology and parameters as in [3,5]. To obtain our results, we first generate 5 random networks of 49 nodes.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Simple and Efficient Way to Save Energy in Multihop Wireless Networks with Flow Aggregation

Laubé

Quadri

Martin

et al. 2019

Journal of Computer Networks and Communications

Self Cite

View full text Add to dashboard Cite

Today, whether in industry, research, or civil applications, there are many incentives to reduce the energy footprint of automated systems. In multihop wireless networks, the main objective in that regard is usually to maximize the lifetime of the network by distributing the load over all nodes. In this paper, we improve a solution that aggregates flows to optimize the number of nodes that can be turned off. We introduce interference awareness in a routing metric designed to aggregate flows to avoid overloading the network and to preserve the quality of service required by the flows. This way, it becomes possible to integrate this metric into classical shortest path routing algorithms that do not consider interference. We also show that flow aggregation and overall energy consumption are equivalent problems.

show abstract

Section: Flow Aggregation Metricmentioning

confidence: 78%

Section: Related Workmentioning

confidence: 99%

“…If the set of flows changes, all routes have to be recalculated through integer linear programming. To deal with this, we have proposed the Flow Aggregation MEtric (FAME) [3].…”

Section: Heuristic For Flow Aggregationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations