By Topic

Using Density-based d-Hop Connected d-Dominating Sets Routing Scheme to Achieve Load Balancing for Wireless Sensor 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)
Ren-Song Ko ; Dept. of Comput. Sci. & Inf. Eng., National Chung Cheng Univ., Chia-Yi ; Chi-Hung Huang

Due to the energy limitation, sensor networks may schedule sensor activities so that some nodes may enter the sleeping mode to minimize energy consumption. However, sensor networks may face the constraints about sensing coverage introduced by the scheduling. From the coverage perspective, it is not always preferable to use short path for routing, especially when communications only happen among few nodes. We propose a density-based d-hop connected d-dominating sets routing algorithm which may evenly distribute energy consumption to the whole network and, hence, prolong the lifetime. We also prove the approach can be recovered within d hops of the failed d-dominating node. Our simulation results show that our approach can evenly distribute energy consumption when communications only happen among few nodes.

Published in:

Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE

Date of Conference:

11-15 March 2007