Coverage and connectivity issues in wireless sensor networks: A survey |
| |
Authors: | Amitabha Sajal K. |
| |
Affiliation: | aAutonomous Networks Research Group (ANRG), Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA 90007, United States;bCenter for Research in Wireless Mobility and Networking (CReWMaN), Department of Computer Science and Engineering, The University of Texas at Arlington, TX 76019, United States |
| |
Abstract: | Sensing coverage and network connectivity are two of the most fundamental problems in wireless sensor networks. Finding an optimal node deployment strategy that would minimize cost, reduce computation and communication overhead, be resilient to node failures, and provide a high degree of coverage with network connectivity is extremely challenging. Coverage and connectivity together can be treated as a measure of quality of service in a sensor network; it tells us how well each point in the region is covered and how accurate is the information gathered by the nodes. Therefore, maximizing coverage as well as maintaining network connectivity using the resource constrained nodes is a non-trivial problem. In this survey article, we present and compare several state-of-the-art algorithms and techniques that aim to address this coverage–connectivity issue. |
| |
Keywords: | Wireless sensor networks Area coverage Network connectivity Computational geometry Network topology |
本文献已被 ScienceDirect 等数据库收录! |
|