TY - JOUR
T1 - ROC
T2 - Resilient online coverage for surveillance applications
AU - Younis, Ossama Mohamed
AU - Krunz, Marwan M.
AU - Ramasubramanian, Srinivasan
N1 - Funding Information:
Manuscript received September 08, 2008; revised August 02, 2009 and May 10, 2010; accepted June 29, 2010; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor D. Yau. Date of publication July 26, 2010; date of current version February 18, 2011. This work was supported in part by the National Science Foundation (NSF) under Grants CNS-0721935, CNS-0904681, and IIP-0832238; Raytheon; and the “Connection One” Center.
PY - 2011/2
Y1 - 2011/2
N2 - We consider surveillance applications in which sensors are deployed in large numbers to improve coverage fidelity. Previous research has studied how to select active sensor covers (subsets of nodes that cover the field) to efficiently exploit redundant node deployment and tolerate unexpected node failures. Little attention was given to studying the tradeoff between fault tolerance and energy efficiency in sensor coverage. In this work, our objectives are twofold. First, we aim at rapidly restoring field coverage under unexpected sensor failures in an energy-efficient manner. Second, we want to flexibly support different degrees of redundancy in the field without needing centralized control. To meet these objectives, we propose design guidelines for applications that employ distributed cover-selection algorithms to control the degree of redundancy at local regions in the field. In addition, we develop a new distributed technique to facilitate switching between active covers without the need for node synchronization. Distributed cover selection protocols can be integrated into our referred to as resilient online coverage (ROC) framework. A key novelty in ROC is that it allows every sensor to control the degree of redundancy and surveillance in its region according to current network conditions. We analyze the benefits of ROC in terms of energy efficiency and fault tolerance. Through extensive simulations, we demonstrate the effectiveness of ROC in operational scenarios and compare its performance with previous surveillance techniques.
AB - We consider surveillance applications in which sensors are deployed in large numbers to improve coverage fidelity. Previous research has studied how to select active sensor covers (subsets of nodes that cover the field) to efficiently exploit redundant node deployment and tolerate unexpected node failures. Little attention was given to studying the tradeoff between fault tolerance and energy efficiency in sensor coverage. In this work, our objectives are twofold. First, we aim at rapidly restoring field coverage under unexpected sensor failures in an energy-efficient manner. Second, we want to flexibly support different degrees of redundancy in the field without needing centralized control. To meet these objectives, we propose design guidelines for applications that employ distributed cover-selection algorithms to control the degree of redundancy at local regions in the field. In addition, we develop a new distributed technique to facilitate switching between active covers without the need for node synchronization. Distributed cover selection protocols can be integrated into our referred to as resilient online coverage (ROC) framework. A key novelty in ROC is that it allows every sensor to control the degree of redundancy and surveillance in its region according to current network conditions. We analyze the benefits of ROC in terms of energy efficiency and fault tolerance. Through extensive simulations, we demonstrate the effectiveness of ROC in operational scenarios and compare its performance with previous surveillance techniques.
KW - Coverage
KW - distributed algorithms
KW - energy efficiency
KW - fault tolerance
KW - sensor networks
UR - http://www.scopus.com/inward/record.url?scp=79951952510&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79951952510&partnerID=8YFLogxK
U2 - 10.1109/TNET.2010.2057258
DO - 10.1109/TNET.2010.2057258
M3 - Article
AN - SCOPUS:79951952510
SN - 1063-6692
VL - 19
SP - 251
EP - 264
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 1
M1 - 5524099
ER -