Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30174
Coverage and Connectivity Problem in Sensor Networks

Authors: Meenakshi Bansal, Iqbal Singh, Parvinder S. Sandhu

Abstract:

In over deployed sensor networks, one approach to Conserve energy is to keep only a small subset of sensors active at Any instant. For the coverage problems, the monitoring area in a set of points that require sensing, called demand points, and consider that the node coverage area is a circle of range R, where R is the sensing range, If the Distance between a demand point and a sensor node is less than R, the node is able to cover this point. We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a sensor. In some applications, when the network is sufficiently dense, area coverage can be approximated by guaranteeing point coverage. In this case, all the points of wireless devices could be used to represent the whole area, and the working sensors are supposed to cover all the sensors. We also introduce Hybrid Algorithm and challenges related to coverage in sensor networks.

Keywords: Wireless sensor networks, network coverage, Energy conservation, Hybrid Algorithms.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1070907

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1397

References:


[1] Zongheng Zhou,+ Samir Das, Himanshu Gupta Department of Computer Science., Connected K-Coverage Problem in Sensor Networks, ieee 2004.
[2] Shuhui YangÔÇá, Fei DaiÔÇí, Mihaela CardeiÔÇá, and Jie WuÔÇá. On Multiple Point Coverage in Wireless Sensor Networks ,ieee, 2005
[3] Yuling Lei, Yan Zhang , Yanjuan Zhao.The research of coverage problems in wireless sensor network,ieee, 2009.
[4] Fl'avio V. C. Martins, Frederico P. Quint˜ao, Fab'ıola G. Nakamura,Geraldo R. Mateus Model and Algorithms for the Density, Coverage and Connectivity Control Problem in FlatWSNs
[5] ILOG. ILOG CPLEX. Source: http://www.ilog.com/products/cplex/,May 2006.
[6] S. Megerian and M. Potkonjak. Low power 0/1 Coverage and Scheduling Techniques in Sensor Networks. Technical Report 030001, University of California, Los Angeles, January 2003.
[7] F.G. Nakamura, F.P. Quintao, G.C. Menezes, and G.R. Mateus. An Optimal Node Scheduling for flat Wireless Sensor Networks. In Proceedings of the IEEE InternationalConference on Networking (ICN05), volume 3420, pages 475-483, 2005.
[8] F.P. Quintao, F.G. Nakamura, and G. R. Mateus. A Hybrid Approach to solve the Coverage and Connectivity Problem in Wireless Sensor Networks. In Proceedings of the IV European Workshop on Metaheuristics (EU/ME04), volume 1, 2004.
[9] F.P. Quintao, F.G. Nakamura, and G. R. Mateus. Evolutionary Algorithm for the Dynamic Coverage Problem Applied to Wireless Sensor Networks Design. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC05), volume 2, pages 1589-1596, 2005.
[10] J. Wu and H. Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proc. of the 3rd Int-l Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial M), 1999.
[11] M.A.M. Vieira, L.F.M. Vieira, L.B. Ruiz, A.A.F. Loureiro, A.O. Fernandes, and J.M.S. Nogueira. Scheduling Nodes in Wireless Sensor Networks: A Voronoi Approach. In Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (LCN03), pages 423-429, 2003.
[12] F. Ye, G. Zhong, and J. Cheng e L. Zhang. Peas: A robust energy conserving protocol for long-lived sensor networks. In Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS03), pages 28-37, 2003.
[13] M. Cardei, J. Wu, M. Lu, and M. O. Pervaiz. Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In Proc. of IEEE International Conference on Wireless and Mobile Computing, Networking and Communications(WiMob), 2005.
[14] J. Carle and D. Simplot-Ryl. Energy efficient area monitoring by sensor networks. IEEE Computer, 37(2):40-46, 2004.
[15] D. Tian and N. Georganas. A coverage-preserving node scheduling scheme for large wireless sensor networks. In Proc. of the 1st ACM Workshop on Wireless Sensor Networks and Applications, 2002.
[16] S. Slijepcevic and M. Potkonjak, "Power efficient organization of wireless sensor networks," in Proceedings of rhe Inrernarional Conference on Communication (ICC), 2001.