DocumentCode :
480013
Title :
Intra-cluster Nodes Scheduling Algorithm Satisfying Expected Coverage Degree of Application in Distributed Clustering WSNs
Author :
Xin-lian, ZHOU ; Bo, GONG
Volume :
3
fYear :
2008
fDate :
12-14 Dec. 2008
Firstpage :
332
Lastpage :
335
Abstract :
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.
Keywords :
pattern clustering; protocols; scheduling; wireless sensor networks; data gathering protocol; distributed clustering wireless sensor network; expected coverage degree; intracluster nodes scheduling algorithm; node active-sleep theory; Application software; Clustering algorithms; Computer science; Energy consumption; Information science; Monitoring; Protocols; Scheduling algorithm; Software engineering; Wireless sensor networks; Coverage of intra-cluster; Scheduling of intra-cluster active nodes; Wireless Sensor Networks; distributed clustering;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Software Engineering, 2008 International Conference on
Conference_Location :
Wuhan, Hubei
Print_ISBN :
978-0-7695-3336-0
Type :
conf
DOI :
10.1109/CSSE.2008.886
Filename :
4722353
Link To Document :
بازگشت