Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flows. To maximize ...network lifetime, the paths for message flows are chosen in such a way that the total energy consumed along the path is minimized while avoiding energy depleted nodes. Finding paths which consume minimum energy and finding paths which do not use energy depleted nodes lead to conflicting objectives. In this paper, we propose two-phased energy aware routing strategies that balance these two conflicting objectives by transforming the routing problem into a multi-metric widest path problem. We find that the proposed approaches outperform the best-known algorithms in the literature. We also demonstrate a simple but insightful relationship between the total energy required along a path and the minimum remaining energy of a node along the path. We further exploit this relationship to show that staying within the solution space of paths with high residual energy
and low total energy provides much improved lifetimes in general.
We can improve the end-to-end throughput between a sender and receiver in a wireless network using multiple paths which do not interfere with each other. Given that the problem of finding such paths ...is computationally hard, the paper focuses on finding multiple paths which may have interference between them, but still are able to obtain the maximum possible throughput. It is achieved by observing that the pattern of interference is more important than the number of interfering links. The nature of path sets with non-destructive interference is discussed and based on these observations, combinatorial techniques for finding interference aware disjoint paths in a wireless network are presented. Simulation results indicate that the proposed solutions achieve throughputs that are significantly higher than the established theoretical results.
On energy aware routing in wireless networks Mohanoor, Aravind B.; Radhakrishnan, Sridhar; Sarangan, Venkatesh
2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07),
2007-Sep.
Conference Proceeding
Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flows. To maximize ...network lifetime, the paths for message flows are chosen in such a way that the total energy consumed along the path is minimized while avoiding energy depleted nodes. Finding paths which consume minimum energy and finding paths which do not use energy depleted nodes lead to conflicting objectives. In this paper, we propose a two-phased energy-aware routing strategy that balances these two conflicting objectives by transforming the routing problem into a multi-metric widest path problem. We find that the proposed approach outperforms the best known algorithm in literature. We also demonstrate a simple but insightful relationship between the total energy required along a path and the minimum remaining energy of a node along the path.
