Reducing the energy drain in multihop ad hoc networks

Géraud Allard*, Bernard Mans

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

4 Citations (Scopus)

Abstract

Numerous studies on energy-efficient routing for Multihop Ad Hoc Networks (MANET) look at extending battery life by minimizing the cost at the transmitting node. In this paper, we study the complexity of energy-efficient routing when the energy cost of receiving packets is also considered. We first prove that, surprisingly, even when all nodes transmit at the same power, finding a simple unicast path that guarantees enough remaining energy locally at each node in the network then becomes an NP-complete problem. Hence we propose several heuristics based on Dijkstra's shortest path algorithm in which we integrate the notion of remaining energy in order to satisfy flow requirements. We show with several simulations that these heuristics not only allow the computation of routes that save energy of nodes with low battery but also allow the network to handle more flows.

Original languageEnglish
Title of host publication2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2005
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages24-31
Number of pages8
ISBN (Print)0780394658
DOIs
Publication statusPublished - 2005
Event2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2005 - Washington, United States
Duration: 7 Nov 200510 Nov 2005

Other

Other2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2005
CountryUnited States
CityWashington
Period7/11/0510/11/05

Fingerprint Dive into the research topics of 'Reducing the energy drain in multihop ad hoc networks'. Together they form a unique fingerprint.

Cite this