Energy-aware routing protocol for ad hoc wireless sensor networks

Authors:
Raminder P. Mann;Kamesh R. Namuduri;Ravi Pendse
Affiliations:
Department of Electrical and Computer Engineering, Wichita State University, Wichita, KS;Department of Electrical and Computer Engineering, Wichita State University, Wichita, KS;Department of Electrical and Computer Engineering, Wichita State University, Wichita, KS
Venue:
EURASIP Journal on Wireless Communications and Networking
Year:
2005

Citing 5
Cited 1

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications
Time division multiple access methods for wireless personal communications

IEEE Communications Magazine

Prediction free energy neutral power management for energy harvesting wireless sensor nodes

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless ad hoc sensor networks differ from wireless ad hoc networks from the following perspectives: low energy, lightweight routing protocols, and adaptive communication patterns. This paper proposes an energy-aware routing protocol (EARP) suitable for ad hoc wireless sensor networks and presents an analysis for its energy consumption in various phases of route discovery and maintenance. Based on the energy consumption associated with route request processing, EARP advocates the minimization of route requests by allocating dynamic route expiry times. This paper introduces a unique mechanism for estimation of route expiry time based on the probability of route validity, which is a function of time, number of hops, and mobility parameters. In contrast to AODV, EARP reduces the repeated flooding of route requests by maintaining valid routes for longer durations.