By Topic

A distributed energy-efficient routing scheme in 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

4 Author(s)
Hongbin Wang ; Sch. of Comput., Wuhan Univ., China ; Lifeng Zhang ; Dongru Zhou ; Chengbo Wang

We present a distributed energy-efficient routing algorithm - local neighborhood broadcast routing (LNBR) algorithm. LNBR use a local scanner to scan all one node's neighborhoods. The nodes need only to know its neighborhoods in its transmission range instead of the whole topology information in ad hoc networks. LNBR maintain a minimal energy routing in which nodes visited by scanner until find the destination node. The nodes compare the energy cost and select the smaller energy consumption routing when the same identification scanner reaches it. Furthermore, LNBR let the node send the scanner exceeding one time. When scanner reach one node's all neighborhoods, the neighborhoods can forward it to their own neighborhoods, this makes the LNBR distribute in ad hoc network In the end, we compare our algorithm to other algorithms, the results show that better network performance may be achieved according to LNBR and the minimal energy consumption routing can be find. The correlative conclusion and future research work are given.

Published in:

Computer and Information Technology, 2004. CIT '04. The Fourth International Conference on

Date of Conference:

14-16 Sept. 2004