By Topic

A clustering routing algorithm of WSN based on uneven nodes deployment

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)
Yan Gu ; Coll. of. Comput. & Inf. Eng., Hohai Univ., Nanjing, China ; Yucheng Shao ; Han Han ; Tong Yi

The network topology and routing protocol have a great impact on the performance of wireless sensor networks (WSN). A clustering routing algorithm based on uneven node deployment (CRAUND) is presented. The sensing area is divided into several concentric annuli and nodes are distributed unevenly in the area. The density of sensor nodes in closer area to the sink node is greater than those in further area. In order to balance energy consumption in network, energy cost in each annulus for every period can be made nearly equal. Inner-cluster node competition is introduced to optimize cluster head (CH) selection. Multi-hop transmission between CHs is employed to reduce energy cost, so as to improve their energy efficiency. Simulation results indicate that CRAUND has better performance in terms of balancing and reducing network energy consumption.

Published in:

Wireless Communications and Signal Processing (WCSP), 2011 International Conference on

Date of Conference:

9-11 Nov. 2011