Title :
Hybrid greedy/multicasting power-aware routing protocol in ad hoc networks
Author :
Li, Jiageng ; Cordes, David
Author_Institution :
Dept. of Comput. Sci., Alabama Univ., Tuscaloosa, AL, USA
Abstract :
Traditional routing algorithms tend to use shortest path algorithms with minimum hop count to reduce transmission latency and error rates, resulting in a quick exhaustion of a small subset of nodes where the traffic load is heavy and risking a disconnection of the entire network. We define a new power-aware cost metric with the aim of reflecting both power-saving perspectives: maximizing network lifetime and minimizing the power consumption of a routing task. We also propose a new location-aided, power-aware routing protocol that is based on a combination of greedy and multicasting strategies. The decision on applying greedy or multicasting within its routing zone depends on the link cost and the node´s neighborhood distribution. Simulation results show that performances on network lifetime and average power consumption for routing tasks are greatly improved without sacrifices in the delivery rate of the ad hoc network.
Keywords :
ad hoc networks; algorithm theory; multicast protocols; power consumption; routing protocols; telecommunication traffic; ad hoc networks; greedy strategy; multicasting strategy; network lifetime maximization; power consumption minimization; power-aware routing protocol; power-saving perspective; routing algorithms; shortest path algorithms; Ad hoc networks; Batteries; Costs; Delay; Energy consumption; Error analysis; Intelligent networks; Multicast algorithms; Routing protocols; Telecommunication traffic;
Conference_Titel :
Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on
Print_ISBN :
0-7695-2108-8
DOI :
10.1109/ITCC.2004.1286741