The Research of Inner-cluster Nodes Scheduling Algorithm in mWSN
Xinlian Zhou, Jianbo Xu · 2010
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.