Placement and Orientation of Rotating Directional Sensors

We analyze several new problems that arise from the use of rotating directional sensors. The coverage region of a rotating directional sensor is restricted to a certain direction, and its orientation varies at constant speed. For already placed rotating directional sensors, we consider three problems for which the goal is to minimize the dark time (i.e. uncovered time) of all point in the area. We also consider the problem of placement and orientation of the minimum number of sensors, so to reduce to zero the dark time of all points. In addition, we study barrier coverage problems, in which the goal is to detect all intruders (or the largest number of them) that are trying to cross the monitored area. We show that these problems are NP-hard and some of them also NP-hard to approximate. We provide approximations algorithms that are easy to decentralize, and hence allow the sensors to self organize themselves.

[1]  Li Zhang,et al.  Strong Barrier Coverage with Directional Sensors , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

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

[3]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[4]  Giordano Fusco,et al.  Selection and Orientation of Directional Sensors for Coverage Maximization , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[5]  David Haussler,et al.  Epsilon-nets and simplex range queries , 1986, SCG '86.

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

[7]  Ai Chen,et al.  Designing localized algorithms for barrier coverage , 2007, MobiCom '07.

[8]  Jie Wang,et al.  Barrier Coverage of Line-Based Deployed Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[9]  Pankaj K. Agarwal,et al.  Efficient Sensor Placement for Surveillance Problems , 2009, DCOSS.

[10]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[11]  Jie Wang,et al.  Strong barrier coverage of wireless sensor networks , 2008, MobiHoc '08.

[12]  T. Shermer.  Recent Results in Art Galleries , 1992 .

[13]  Giordano Fusco,et al.  -Net Approach to Sensor -Coverage , 2009 .

[14]  Dong Xuan,et al.  Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks , 2008, MobiHoc '08.

[15]  T. C. Shermer,et al.  Recent results in art galleries (geometry) , 1992, Proc. IEEE.

[16]  Subir Kumar Ghosh,et al.  Visibility Algorithms in the Plane , 2007 .

[17]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[18]  Daji Qiao,et al.  Barrier Information Coverage with Wireless Sensors , 2009, IEEE INFOCOM 2009.

[19]  Béla Bollobás,et al.  Reliable density estimates for coverage and connectivity in thin strips of finite length , 2007, MobiCom '07.

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

[21]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[22]  Douglas W. Gage,et al.  Command Control for Many-Robot Systems , 1992 .

[23]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[24]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[25]  P. Valtr.  Guarding galleries where no point sees a small area , 1998 .