Randomized energy aware routing algorithms in mobile ad hoc networks

We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about itself, its neighbors and the destination. The objective of energy aware routing algorithms is to minimize the total power for routing a message from source to destination or to maximize the total number of routing tasks that a node can perform before its battery power depletes. In this paper we extend our previous work on randomized localized routing algorithms that achieve high packet delivery rates and show that they have good overall power consumption. We present two different variants of energy aware randomized routing, namely “greedy” and “compass”, and we study their performance using different cost metrics (e.g., forwarding power, remaining node energy, or a combination of both). We study their performance experimentally on different topologies and compare it with other existing algorithms...

• Type: Conference
• Year: 2005
• Where: MSWIM
• Authors: Israat Tanzeena Haque, Chadi Assi, J. William Atwood
• Keywords: Localized Routing, Modelling And Simulation, MSWIM 2005, Routing, Routing Algorithms