Movement- assisted Sensor deployment in WSN.pdfVIP

1Movement- assisted Sensor deployment in WSN Yinying Yang Mar 2, 2007 Outline ? Introduction ? Distributed movement-assistant sensor deployment protocols – SMART: a Scan-based method – VEC, VOR and Minimax protocols ? Conclusion ? Reference Introduction ? Improve the initial deployment – Incremental sensor deployment – Movement-assisted sensor deployment ? How to move? – Self-propelling: via wheels, micro-rockets, spring (flip-based) – Attaching themselves to transporters: robots, vehicles (Each vehicle carries only a single sensor, cooperation issues), animals, air, and water SMART: a Scan-based sensor deployment method – Clustering sensors in a region; monitored area forms 2-D mesh; clusterhead directs the movement – Using 1-D solution to solve 2-D problem ? Row-wise balance, followed by column-wise balance – Convergence rate is increased, especially applied on non-uniform initial deployment – Similar to the traditional load balancing problem Basic idea ? The sensor network : n × n 2-D mesh of clusters ? Clusterhead of a cluster communicates with other clusters and directs the movement of its non- clusterhead sensors ? Two rounds of balancing for each dimension: row, column ? Measurement – Total moving distance – The number of moves – Convergence rate/round number 2SMART(1-D) ? Clustering – A cluster can be covered: at least one sensor in it – Adjacent clusterheads can communicate: inter-, intra- cluster transmission range ? Scan of the array – First sweep: positive direction, calculation of prefix sum – Second sweep: negative direction, forwarding of average – Moving: determine give/take state of each cluster 18 4 12 2 30 4 16 48Prefix sum average 99 99 36 45 54 9 Standard prefix sum 12 30 move 3 1 5 49 54 9 9 9 18 27 12 SMART(1-D) ? Give-right/give-left ? Take-right/take-left ? Here, SMART(1-D) ? An optimal scan in 1-D array – For each cluster i in give state, the clusterhead sends out sensors to left and/or right according to its cal