Node Coverage and Round-robin Schedule Algorithm Based on Nodes Scattering Track
Yanrong Cui · Jisuanji gongcheng · 2009
This paper analyzes stochastic deployment of sensor nodes,puts forward a new Node Coverage and Round-robin Schedule(NCRS) algorithm based on nodes track. Working role of node is negotiated according to the built location information of monitoring objects,each monitoring sensor node constructs an independent routing path to sink nodes,which including those not yet unused relaying nodes,thus all of monitoring objects will be covered by different monitoring sensor nodes more than one times. Simulation experimental results indicate that NCRS can not only improve the coverage degree of monitoring objects effectively,but also increase the proportion of working nodes,and prolong the life time of sensor networks.