Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Neighborhood aware source routing
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Power-aware source routing protocol for mobile ad hoc networks
Proceedings of the 2002 international symposium on Low power electronics and design
An on-demand minimum energy routing protocol for a wireless ad hoc network
ACM SIGMOBILE Mobile Computing and Communications Review
Multi-path Ad Hoc Routing Considering Path Redundancy
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks
IEEE Communications Magazine
| Hi-index | 0.00 |
To extend the network lifetime, the route may be periodically alternated to prevent the energy consumption being concentrated to a small number of nodes. This method incurs large routing traffic incurred by frequent route discovery, which implies that it may not increase the network life time as much as it intends to. To solve this problem, we propose an energy efficient routing algorithm which uses two levels of route alternation. When it first finds the end to end route, it also caches the backup routes. It first changes the route using the backup routes and after the all the costs of the backup routes increase more than a certain amount, it begins to find a new end to end route and new backup routes. When it alternates routes using the backup route, the routing overhead is very small. In this way HPSR can reduce the routing overhead while distributing the cost throughout the network. We compare the performance of HPSR with existing routing algorithms using OPNET.