DocumentCode :
3068925
Title :
The Research of Inner-cluster Nodes Scheduling Algorithm in mWSN
Author :
Zhou, Xin-Lian ; Xu, Jian-Bo
Author_Institution :
Sch. of Comput. Sci. & Eng., Hunan Univ. of Sci. & Technol., Xiangtan, China
Volume :
3
fYear :
2010
fDate :
16-18 July 2010
Firstpage :
131
Lastpage :
134
Abstract :
This paper presents one inner-cluster scheduling algorithm, avoiding mobile nodes´ location affect, satisfying expected coverage scale and high-effect. This excludes the number of smallest inner-cluster active nodes k, which can satisfy expected coverage scale in monitored area, according to coverage analysis theory. In inner-cluster, we only select k nodes with higher energy and nearer close to fixed node(should be avoided inner-cluster nodes leaving), others should be sleeping. Consequently realizes the schedule of higher energy nodes round sleeping. Simulation result display by this schedule, EDG (Efficient Data Gathering) decreases data delay, and largely relieves the burden of cluster-head, and has apparent energy-saving effect, and thinks about node´s mobility, can preferably suit to mobile wireless sensor network.
Keywords :
mobile radio; scheduling; wireless sensor networks; EDG; coverage analysis theory; efficient data gathering; inner-cluster nodes scheduling algorithm; mWSN; mobile nodes; mobile wireless sensor network; Delay; Mobile communication; Mobile computing; Monitoring; Protocols; Schedules; Wireless sensor networks; active-sleep theory; clustering; data gathering; mobile wireless sensor networks(mWSN);
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology and Applications (IFITA), 2010 International Forum on
Conference_Location :
Kunming
Print_ISBN :
978-1-4244-7621-3
Electronic_ISBN :
978-1-4244-7622-0
Type :
conf
DOI :
10.1109/IFITA.2010.229
Filename :
5634702
Link To Document :
بازگشت