Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Energy-Aware On-Demand Routing for Mobile Ad Hoc Networks
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Routing Mechanisms for Mobile Ad Hoc Networks Based on the Energy Drain Rate
IEEE Transactions on Mobile Computing
New routing for balanced energy consumption in mobile ad hoc networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks
IEEE Communications Magazine
Hi-index | 0.00 |
Ad Hoc networks usually consist of mobile battery operated computing devices that communicate over the wireless medium. These devices are battery operated and therefore need to be energy conserving so that the battery life of each individual node can be prolonged. To maximize the lifetime of an ad hoc network, it is essential to prolong each individual node (mobile) life through minimizing the total transmission energy consumption for each communication request. Therefore, an efficient routing protocol must satisfy that the energy consumption rate at each node is evenly distributed and at the same time the total transmission energy for each request is minimized. To devise a routing protocol meeting the above two conflict objectives simultaneously is very difficult due to the NP hardness of the problem. Instead, an approximation solution is desirable and appreciated. At last, we implement the algorithm within AODV routing protocol by NS2, the results of our simulation-based analysis are presented. We conducted a complete set of simulations to compare and contrast the performance of energy consumption and network lifetime metrics. Our analysis provides a comparison of the performances between EA_AODV and AODV protocol.