BCP: A Border Coverage Protocol for wireless sensor networks

Border coverage is acknowledged as important problem addressed in literature of wireless sensor networks (WSNs). In this paper, we suggest a solution to solve this problem called Border Coverage Protocol (BCP) that preserves both border and area coverage. This protocol runs in three phases: the first one is used to detect the nodes close to the border and that will be considered as boundaries nodes. The second phase is dedicated to find the transfer and internal nodes. The last phase focused on replacing border nodes by the transfer nodes, in case of any failure. Simulation results show that BCP achieves a high coverage ratio in comparison to some known protocols.

[1]  Michael Kaufmann,et al.  A New Approach for Boundary Recognition in Geometric Sensor Networks , 2005, CCCG.

[2]  Kazi Chandrima Rahman,et al.  A Survey on Sensor Network , 2010 .

[3]  David E. Culler,et al.  System architecture directions for networked sensors , 2000, SIGP.

[4]  Sesh Commuri,et al.  Self organization of sensor networks for energy-efficient border coverage , 2009, Journal of Communications and Networks.

[5]  Jie Gao,et al.  Boundary recognition in sensor networks by topological methods , 2006, MobiCom '06.

[6]  Sándor P. Fekete,et al.  Deterministic boundary recognition and topology extraction for large sensor networks , 2005, SODA '06.

[7]  Jang-Ping Sheu,et al.  Hole detection and boundary recognition in wireless sensor networks , 2009, 2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications.

[8]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[9]  promoteur,et al.  Le traitement du problème de la couverture dans les réseaux de capteurs sans fil , 2008 .

[10]  Jang-Ping Sheu,et al.  Target tracking and boundary node selection algorithms of wireless sensor networks for internet services , 2013, Inf. Sci..

[11]  J. Chassery,et al.  2 - Diagramme de Voronoï appliqué à la segmentation d'images et à la détection d'évènements en imageris multi-sources (1) , 1991 .

[12]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[13]  Amitava Datta,et al.  Minimum Dominating Sets for Solving the Coverage Problem in Wireless Sensor Networks , 2006, UCS.

[14]  Cheng-Ta Lee,et al.  Boundary monitoring algorithms for wireless sensor networks of grouping capabilities , 2010, 2010 IEEE International Conference on Wireless Communications, Networking and Information Security.

[15]  Deborah Estrin,et al.  Guest Editors' Introduction: Overview of Sensor Networks , 2004, Computer.

[16]  Xiaohua Jia,et al.  Coverage problems in wireless sensor networks: designs and analysis , 2008, Int. J. Sens. Networks.

[17]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) using AOA , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  Yuguang Fang,et al.  Detecting Coverage Boundary Nodes in Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Networking, Sensing and Control.