By Topic

Expected number of Cluster Members clustering algorithm in 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

3 Author(s)
Huiying Wei ; Dept. of Phys. & Electron., Henan Univ., Kaifeng, China ; Lijia Chen ; Yi Zhang

This paper proposes a protocol, ENCM (Expected Number of Cluster Members clustering algorithm), that's designed for single-hop wireless sensor networks in which plain sensor nodes communicate directly with the CHs (Cluster Heads). All nodes are commonly resource constrained and have limited amount of energy. In wireless sensor networks, BS (Base Station) is generally set up away from the target area. When CHs transmit data directly to the BS, the CHs further away from the BS consume more energy related to distance and tend to die faster, leaving areas of the network uncovered and resulting in shortening the lifetime of the network. Aiming to prolong the network lifetime, we use ENCM to group the cluster members of different CHs and push the energy consumption of every CH to achieve the average value which is calculated in this paper. Simulation results comparing with previous protocols prove that our new algorithm is able to extend the network lifetime observably and moderately reduces the variance of energy consumption by the CHs.

Published in:

Systems and Informatics (ICSAI), 2012 International Conference on

Date of Conference:

19-20 May 2012