Randomized energy aware routing algorithms in mobile ad hoc networks

Authors:
Israat Tanzeena Haque;Chadi Assi;J. William Atwood
Affiliations:
Concordia University, Montréal, Québec, Canada;Concordia University, Montréal, Québec, Canada;Concordia University, Montréal, Québec, Canada
Venue:
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Year:
2005

Citing 6
Cited 4

Power-aware routing in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges

DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Power-Aware Localized Routing in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Maximum lifetime routing in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Minimum energy mobile wireless networks

IEEE Journal on Selected Areas in Communications

Voice transmission over ad hoc network adapting optimum approaches to maximize the performance

Computer Communications
Geographic and energy-aware routing in Wireless Sensor Networks

International Journal of Ad Hoc and Ubiquitous Computing
Power-aware semi-beaconless 3D georouting algorithms using adjustable transmission ranges for wireless ad hoc and sensor networks

Ad Hoc Networks
Locally Optimal Source Routing for energy-efficient geographic routing

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. Our simulation results show that energy aware randomized algorithms achieve superior packet delivery rates and moderate energy consumption.