By Topic

Reducing the energy drain in multihop ad hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

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

Published in:

Mobile Adhoc and Sensor Systems Conference, 2005. IEEE International Conference on

Date of Conference:

7-7 Nov. 2005