Energy-Efficient SINR-Based Routing for Multihop Wireless Networks

In this paper, we develop an energy-efficient routing scheme that takes into account the interference created by existing flows in the network. The routing scheme chooses a route such that the network expends the minimum energy satisfying with the minimum constraints of flows. Unlike previous works, we explicitly study the impact of routing a new flow on the energy consumption of the network. Under certain assumptions on how links are scheduled, we can show that our proposed algorithm is asymptotically (in time) optimal in terms of minimizing the average energy consumption. We also develop a distributed version of the algorithm. Our algorithm automatically detours around a congested area in the network, which helps mitigate network congestion and improve overall network performance. Using simulations, we show that the routes chosen by our algorithm (centralized and distributed) are more energy efficient than the state of the art.