Optimal Flow Aggregation for Global Energy Savings in Multi-hop Wireless Networks

Abstract

International audienceToday, regardless of economic or environmental incentives, reducing energy consumption is of great importance when designing IT systems. In a multi-hop wireless network, taking into account energy usually consists in maximizing the lifetime of the network by uniformly distributing the traffic all over the nodes. In this paper, we propose a new routing paradigm which aggregates flows on a minimum number of nodes to maximize the number of nodes that can be turned off in the network. In this way, we intend to significantly reduce global energy consumption. To maintain the same quality of service while keeping the same network capacity, we combine flow aggregation with network coding. Our approach is particularly effective, in part because aggregation increases coding opportunities, as shown in the simulations in terms of global energy savings and network load compared to conventional routing algorithms

Hybrid Internet of Things Network for Energy-Efficient Video Surveillance System

“…There have been numerous efforts and attempts to reduce energy consumption in wireless multimedia sensor networks (WMSNs) using a variety of methodologies [100,30,53,71,26,83,63,48,33]. Some made significant efforts to reduce energy consumption by designing improved hardware at the device level or by designing efficient network architectures.…”

Flow Aggregation for Energy-Aware Ad-Hoc Wireless Networks Respecting QoS Provisions

“…The proposed approach is based on topology control, and its simplicity makes it suitable for use to enhance the performance of other network scenarios, such as WSNs, VANETs and CRNs. In [13], the authors prove that the distribution of load over a large number of nodes forces them to remain active throughout the communication process, which results in very low global energy consumption. Then, it is necessary to exploit mechanisms that allow to switch off unused nodes for good management of network resources.…”

“…If enough branches are pruned in this way, the tree can be reduced to a computationally manageable size. Thus, the branch-and-bound approach is not a heuristic or approximating procedure, but an exact method that finds an optimal solution [13].…”

“…The majority of these studies have proposed algorithms that make numerous assumptions about the computing power of the nodes to reduce energy consumption locally. Classic approaches are usually based on equitable distribution of load between all nodes, so that their batteries are exhausted uniformly in order to prevent a node from dying prematurely because of its overuse [13]. We also notice that energy consumption of a node may be attributed to several phenomena, including those related to the wireless interface.…”

Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks

“…In [46], the authors proposed a linear programming model to compute optimal routing, that minimizes the number of data transmissions, without taking into account the interference. In [38], a mixed-integer linear program was proposed to optimize the routing with network coding, but the effect of energy saved by network coding was not considered.…”