Location-unaware coverage in wireless sensor networks

✍ Scribed by Ossama Younis; Marwan Krunz; Srinivasan Ramasubramanian

• Publisher: Elsevier Science
• Year: 2008
• Tongue: English
• Weight: 1018 KB
• Volume: 6
• Category: Article
• ISSN: 1570-8705
• DOI: 10.1016/j.adhoc.2007.10.003

✦ Synopsis

In scenarios where sensors are placed randomly, redundant deployment is essential for ensuring adequate field coverage. This redundancy needs to be efficiently exploited by periodically selecting a subset of nodes (referred to as a ''cover'') that actively monitor the field, and putting the remaining nodes to sleep. We consider networks in which sensors are not aware of their locations or the relative directions of their neighbors. We develop several geometric and density-based tests that enable a location-unaware sensor to intelligently determine whether it should turn itself off without degrading the quality of field coverage. These tests rely on distance measurements and exchanged two-hop neighborhood information. We design an algorithm (LUC) that exploits these tests for computing covers. Based on this algorithm, we propose two distributed protocols (LUC-I and LUC-P) that periodically select covers and switch between them so as to extend the network lifetime and tolerate unexpected failures. Our protocols are highly efficient in terms of message overhead and processing complexity. We implement LUC-I in TinyOS and evaluate it using the TOSSIM simulator. Experimental results indicate that our approach significantly prolongs the network lifetime and achieves comparable performance to location-aware protocols.