A novel gossip-based sensing coverage algorithm for dense wireless sensor networks

1. A novel gossip-based sensing coverage algorithm for dense wireless sensor networks Vinh Tran-Quang a , Takumi Miyoshi a,b a Graduate School of Engineering, Shibaura Institute of Technology, Saitama 337-8570, Japan b College of Systems Engineering and Science, Shibaura Institute of Technology, Saitama 337-8570, Japan Computer Networks Volume 53, Issue 13, 28 August 2009, Pages 2275-2287

2. Outline • Introduction • Definitions and MSCR problem formulation • Application of the MSCR algorithm • Maximum sensing coverage region algorithm • Performance evaluation • Conclusion

3. Introduction • In wireless sensor networks • Once deployed, however, most applications of sensor networks expect a long system lifetime. • The energy expenditure of sensors has to be wisely managed by their architectures and protocols to prolong the overall network lifetime.

4. Introduction • In a dense network • The sensing areas of different nodes may be similar and overlap with those of neighboring nodes. • It is important to place or select them so that the monitored area is covered as much as possible without diminishing the overall system coverage.

5. Introduction • We propose a new architecture for routing in large distributed WSNs • Removing redundant sensor nodes • Permits configurable QoS coverage parameters • Low communication overhead

6. Definitions and MSCR problem formulation • Definition 1. • The neighbor set of a sensor node si Communication Range Neighbor Sensing Range Overlapping neighbor 2Rs Si Sj Rs

7. Definitions and MSCR problem formulation • Definition 2. • The sensing region of a sensor si located at (xi, yi), denoted by Siregion, is a set of all points within si’s sensing range. A point p is said to be k-covered if it is within at least k sensors’ sensing regions. Sj Si 2-covered 1-covered

8. Definitions and MSCR problem formulation • Definition 3. Boundary arc • The arc created by two overlapped sensor nodes si and sj is the arc created by two intersection points between two sensing region boundaries. 90o 180o 0o 270o

9. Definitions and MSCR problem formulation • Definition 4. MSRC (Maximum sensing coverage region) • Given a set of m sensors S=s1, s2, . . . , sm deployed in a desired area and a natural number k • The MSCR problem is the problem of finding a subset • S’ guarantees that the whole area is k-covered • Achieves a maximum sensing region

10. Application of the MSCR algorithm Setup phase Steady phase Send sleep_msg. or Send active_msg.

11. Maximum sensing coverage region algorithm S2 S3 Si S1 S4 S5 k times

12. Maximum sensing coverage region algorithm k=1 S3 S2 S3 S3 S3 Si Redundant Node S1 S4 S5 Send sleep_msg

13. Performance evaluation

14. Performance evaluation • MSCR-LEACHG • k=2 Active Node Cluster Head Redundant Node

15. Performance evaluation

16. Performance evaluation

17. Performance evaluation

18. Conclusion • We have defined the maximum sensing coverage region problem for randomly distributed WSNs and proposed a gossip-based sensing-coverage-aware algorithm to solve this problem. • Simulation results confirmed • Reduced total energy consumption • Significantly increased network lifetime