Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage

Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper investigates a suite of novel problems related to connected coverage in directional sensor networks where sensors only sense directionally and have a sector-like sensing range. We first consider the problems of deploying a minimum number of directional sensors to form a connected network to cover either a set of pointlocations (Connected Point-Coverage Deployment (CPD)) or the entire target sensing area (Connected Region-Coverage Deployment (CRD)). CPD is NP-hard as its subproblem of Geometric Sector Cover (GSC) is NP-hard. We present two approximation algorithms for GSC as subroutines, and develop a general solution framework for CPD with approximation ratio σ + O(1), where σ is the approximation ratio of the selected GSC subroutine. We also describe two efficient deployment patterns with guaranteed cov...

• Type: Conference
• Year: 2008
• Where: SECON
• Authors: Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chung Shen
• Keywords: Communications, Connected Coverage, Connected Coverage Problem, Directional Sensors, SECON 2008