By Topic

Intra-cluster Nodes Scheduling Algorithm Satisfying Expected Coverage Degree of Application in Distributed Clustering WSNs

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
$33 $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)
Zhou Xin-lian ; Sch. of Inf. Sci. & Eng., Central South Univ., Changsha ; Gong Bo

To satisfying expected coverage degree of application, we derived the smallest active node number K through node active-sleep theory. We also achieved intra-cluster active nodes scheduling algorithm. In data gathering protocol, this algorithm can make vast intra-member nodes obtain sleep, reduce data delay, lighten cluster head burden. The simulated experiment shows that the result of the algorithm in saving energy is very apparent.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:3 )

Date of Conference:

12-14 Dec. 2008