1 / 15

Complete Coverage in Wireless Sensor Networks Without Location Information

This paper presents an innovative algorithm for selecting active sensor nodes to achieve full coverage in wireless sensor networks without relying on location information. The proposed approach addresses the crucial issue of maintaining system sensing coverage while ensuring connectivity. Through a detailed analysis of existing methods such as OGDC (Optimal Geographical Density Control) and PEAS (Probing Environment and Adaptive Sleeping), the authors develop a solution that prevents blind spots and optimizes network performance. Simulation results demonstrate the algorithm's effectiveness.

alana-joyner
Download Presentation

Complete Coverage in Wireless Sensor Networks Without Location Information

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Determining active sensor nodes for complete coverage without location information Tzu-Ting Wu and Kuo-Feng Ssu Department of Electrical Engineering, National Cheng Kung University, Tainan, 701 Taiwan International Journal of Ad Hoc and Ubiquitous Computing 2005

  2. Outline • Introduction • Related works • The algorithm for complete coverage • Simulation results • Conclusions

  3. Introduction • Selecting a partial set of sensor nodes for maintaining full system sensing coverage is an important issue in wireless sensor networks. • Connectivity • Minimum the links • Sensing Coverage • Minimum set of sensor nodes

  4. Related works • Topology control with minimum links • Power control • According to the locations of its neighboring nodes • Topology control with a set of active nodes • With location information • OGDC (Optimal Geographical Density Control) • Without location information • PEAS (Probing Environment and Adaptive Sleeping)

  5. Related works --- OGDC --- • OGDC • Select a minimal number of sensor nodes to maintain the coverage • Preserve the network connectivity

  6. Related works --- OGDC ---

  7. Related works --- OGDC ---

  8. Related works --- PEAS --- • PEAS • Prolong the network lifetime • Maintain a necessary set of working nodes and tuning off redundant ones

  9. Related works --- PEAS ---

  10. x y z x Related works --- PEAS --- • PEAS could have blind spots.

  11. Goal • This paper proposes a coverage solution for selecting a set of sensor nodes in the location-free environment without blind spots

  12. Algorithm for complete coverage --- System model --- • Signal strength of received messages

  13. Algorithm for complete coverage --- Network Environment --- m-δ n-δ n δ δ m

  14. Algorithm for complete coverage • The algorithm includes two parts • Active neighbor collection • Triangular self-test mechanism

More Related