Optimal Node Scheduling for Desired Percentage of Coverage in Wireless Sensor Networks

DOI: 10.4236/wsn.2012.45018   PDF   HTML   XML   5,871 Downloads   9,159 Views   Citations


Recent developments in wireless communication and embedded computing technologies have led to the advent of wireless sensor network technology. Hundreds of thousands of these micro sensors can be deployed in many areas including health, environment and battlefield in order to monitor the domain with desired level of accuracy. When wireless sensors are deployed in an area, the lifetime of the network should last as long as possible according to the original amount of energy. Therefore, reducing energy consumption in WSNs is of primary concern. We have proposed a node scheduling solution that solves the coverage and connectivity problem in sensor networks in an integrated manner. In this way we will divide network life time to finite number of rounds and in each round we will generate a coverage bitmap of sensors of the domain and based on this bitmap it will decided which sensors remain active or go to sleep. We will check the connection of the sensor network by using Laplacian of adjancy graph of active nodes in each round. Also the network will be capable of producing desired percentage of coverage by using coverage bitmap. We will define the connected coverage problem as an optimization problem and we will seek a solution for the problem by using Genetic Algorithm optimization method.

Share and Cite:

H. Khosravi, "Optimal Node Scheduling for Desired Percentage of Coverage in Wireless Sensor Networks," Wireless Sensor Network, Vol. 4 No. 5, 2012, pp. 127-132. doi: 10.4236/wsn.2012.45018.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] I. Akyildiz, “Wireless Sensor Networks: A Survey,” Computer Networks, Vol. 38, No. 4, 2002, pp. 393-422. doi:10.1016/S1389-1286(01)00302-4
[2] C.F. Garcia-Hernández, P. H. Ibarguengoytia-González and J. A. Pérez-Diaz, “Wireless Sensor Networks and Applications: A Survey,” International Journal of Computer Science and Network Security (IJCSNS), Vol. 7, No. 3, 2007, pp. 264-273.
[3] H. Alemdar and C. Ersoy, “Wireless Sensor Networks for Healthcare: A Survey,” Computer Networks, Vol. 54, No. 15, 2010, pp. 2688-2710. doi:10.1016/j.comnet.2010.05.003
[4] S. Mahfoudh and P. Minet, “Survey of Energy Efficient Strategies in Wireless Ad Hoc and Sensor Networks,” International Conference on Networking (ICN), IEEE, 13-18 April 2008, pp. 1-7.
[5] H. üster and H. Lin, “Integrated Topology Control and Routing in Wireless Sensor Networks for Prolonged Network Lifetime,” Ad Hoc Networks, Vol. 9, No. 5, 2011, pp. 835-851. doi:10.1016/j.adhoc.2010.09.010
[6] M. Li and B. Yang, “A Survey on Topology Issues in Wireless Sensor Network,” International Conference on Wireless Networks (ICWN), 2006,
[7] G. Anastasi, M. Conti, M. Di Francesco and A. Passarella, “Energy Conservation in Wireless Sensor Networks: A Survey,” Ad Hoc Networks, Vol. 7, No. 3, 2009, pp. 537-568. doi:10.1016/j.adhoc.2008.06.003
[8] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless and C. Gill, “Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks,” Proceedings of the First International Conference on Embedded Networked Sensor Systems (Sen-Sys’03), 2003, p. 28.
[9] B. Chen, K. Jamieson, H. Balakrishnan and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Wireless Networks, Vol. 8, No. 5, 2002, pp. 481-494. doi:10.1023/A:1016542229220
[10] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless and C. Gill, “Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks,” ACM International Conference on Embedded Networked Sensor Systems (SenSys), ACM Press, New York, 2003, p. 28. doi:10.1145/958491.958496
[11] C.-F. Huang, Y.-C. Tseng and H.-L. Wu, “Distributed Protocols for Ensuring both Coverage and Connectivity of a Wireless Sensor Network,” ACM Transactions on Sensor Networks (TOSN), Vol. 3, No. 1, 2007, p. 5-es.
[12] S. Das and H. Gupta, “Connected K-Coverage Problem in Sensor Net-works,” Proceedings of 13th International Conference on Computer Communications and Networks, 11-13 October 2004, pp. 373-378.
[13] A. Ghosh and S. K. Das, “A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks,” Distributed Compu-ting in Sensor Systems, Vol. 3560, 2005, pp. 340-353.
[14] H. Khosravi and L. Aslanyan, “SOCCP: Self Organize Coverage and Connectivity Protocol,” 2011 Third International Conference on Computational Intel-ligence, Modelling & Simulation (CIMSiM), 20-22 September 2011, pp. 317-322.

comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.