Directional Sensor Placement with Optimal Sensing Range, Field of View and Orientation

This paper introduces a new wireless sensor network planning problem referred to as the Optimal Sensor Configuration (OSC) problem. In this problem, the goal is to find an optimal subset of locations where directional sensors and base stations are installed in order to minimize the total network cost while satisfying the requirements of coverage and connectivity. This goal is achieved by appropriately choosing the base station type and configuring each sensor to be installed in the sensor field. The optimal configuration of each sensor is determined by three parameters which are sensing range, field of view and orientation. The paper also gives an integer linear programming formulation of the OSC problem. The viability and effectiveness of the proposed formulation are illustrated through numerical results.

[1]  Jorge Urrutia,et al.  Guarding rectangular art galleries , 1994, Discret. Appl. Math..

[2]  Miodrag Potkonjak,et al.  Optimal Worst-Case Coverage of Directional Field-of-View Sensor Networks , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[3]  Ning Zhong,et al.  Efficient point coverage in wireless sensor networks , 2006, J. Comb. Optim..

[4]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[5]  Sartaj Sahni,et al.  Approximation Algorithms for Sensor Deployment , 2007, IEEE Transactions on Computers.

[6]  W.B. Heinzelman,et al.  On the coverage problem in video-based wireless sensor networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[7]  Sartaj Sahni,et al.  Algorithms for Wireless Sensor Networks , 2005, Int. J. Distributed Sens. Networks.

[8]  Bruce A. Draper,et al.  A system to place observers on a polyhedral terrain in polynomial time , 2000, Image Vis. Comput..

[9]  R. Lienhart,et al.  On the optimal placement of multiple visual sensors , 2006, VSSN '06.

[10]  Jian Zhao,et al.  Multi-Camera Surveillance with Visual Tagging and Generic Camera Placement , 2007, 2007 First ACM/IEEE International Conference on Distributed Smart Cameras.

[11]  Xiang Cao,et al.  Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[12]  Shanshan Li,et al.  Maximal Coverage Scheduling in Randomly Deployed Directional Sensor Networks , 2007, 2007 International Conference on Parallel Processing Workshops (ICPPW 2007).

[13]  Simeon C. Ntafos,et al.  Optimum Placement of Guards , 1994, Inf. Sci..

[14]  Csaba D. Tóth.  Art galleries with guards of uniform range of vision , 2002, Comput. Geom..

[15]  Csaba D. Tóth.  Art gallery problem with guards whose range of vision is 180 , 2000, Comput. Geom..

[16]  Rainer Lienhart,et al.  Approximating Optimal Visual Sensor Placement , 2006, 2006 IEEE International Conference on Multimedia and Expo.

[17]  Alhussein A. Abouzeid,et al.  Coverage by directional sensors in randomly deployed wireless sensor networks , 2006, J. Comb. Optim..

[18]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[19]  Minglu Li,et al.  Target-oriented scheduling in directional sensor networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[20]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.