Abstract
Wireless sensor network consists of a large number of tiny sensor nodes owned capable of perception in monitoring region by self-organized wireless communication, has been widely applied in military and civil fields. From the perspective of resource- saving, under the condition of the network’s connectivity and specific coverage, the number of sensor nodes is assumed to be opened as few as possible. So, computing the sensor nodes collection which meeting the requirements is called the problem of network coverage optimization for Wireless Sensor Network; also called the problem of minimum connected covering node set. The innovation point of the article is: Firstly, it analyzed the deficiencies of traditional evolution algorithm fitness function, put forward an improved fitness function design scheme, and has been proved that it has advantage of solving problem on wireless sensor networks coverage optimization; Secondly, it applied the method of control variables, comparison and analysis of the influence on the various operations and parameters selection in evolution algorithm on the optimization results and performance, and then point out how to design algorithm to manage to the best optimize effect and performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Limin, Sun, et al.: Wireless Sensor Networks. Tsinghua University Press, Beijing (2005)
Lu, Y., Zhu, G., Liu, A.: Intelligent network system research and construction program. In: International Conference on Multimedia Technology (ICMT), pp. 4954–4957 (2011)
Jamali, M.A., Bakhshivand, N., Easmaeilpour, M., et al.: An energy-efficient algorithm for connected target coverage problem in wireless sensor networks. In: 3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT), pp. 249–254 (2010)
Mao, Y.-C., Chen, L.-J., Chen, D.-X.: A survey on coverage control techniques for wireless sensor networks. Comput. Sci. 21(5), 20–26 (2007)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., et al.: Coverage problems in wireless ad-hoc sensor networks: INFOCOM. In: Proceedings of Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1380–1387. IEEE (2001)
Jourdan, D., de Weck, O.L.: Layout optimization for a wireless sensor network using a multi-objective genetic algorithm. In: 2004 IEEE 59th Vehicular Technology Conference, VTC 2004-Spring, vol. 5, pp. 2466–2470 (2004)
Cardei, M., Jie, W., Mingming, L., et al.: Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In: IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2005, vol. 3, pp. 438–455 (2005)
Erfu, Y., Erdogan, A.T., Arslan, T., et al.: Multi-objective evolutionary optimizations of a space-based reconfigurable sensor network under hard constraints. In: ECSIS Symposium on Bio-inspired, Learning, and Intelligent Systems for Security, BLISS 2007, pp. 72–75 (2007)
Quintao, F.P., Nakamura, F.G., Mateus, G.R.: Evolutionary algorithm for the dynamic coverage problem applied to wireless sensor networks design. In: The 2005 IEEE Congress on Evolutionary Computation, vol. 2, pp. 1589–1596 (2005)
Dhillon, S.S., Chakrabarty, K., Iyengar, S.S.: Sensor placement for grid coverage under imprecise detections. In: Proceedings of the Fifth International Conference on Information Fusion, vol. 2, pp. 1581–1587 (2002)
Chen, H., Wu, H., Tzeng, N.F: Grid-based approach for working node selection in wireless sensor networks. In: IEEE International Conference on Communications, vol. 6, pp. 3673–3678 (2004)
Hoffmann, F., Kaufmann, M., Kriegel, K.: The art gallery theorem for polygons with holes. In: Proceedings of 32nd Annual Symposium on Foundations of Computer Science, pp. 39–48 (1991)
Gregg, W.W., Esaias, W.E., Feldman, G.C., et al.: Coverage opportunities for global ocean color in a multimission era. IEEE Trans. Geosci. Remote Sens. 36(5), 1620–1627 (1998)
Yong, X., Xin, Y.: A GA approach to the optimal placement of sensors in wireless sensor networks with obstacles and preferences. In: 2006 3rd IEEE on Consumer Communications and Networking Conference, CCNC 2006, pp. 127–131 (2006)
Dhillon, S.S., Chakrabarty, K.: Sensor placement for effective coverage and surveillance in distributed sensor networks. In: 2003 IEEE Conference on Wireless Communications and Networking, WCNC 2003, vol. 3, pp. 1609–1614 (2003)
Yi, Z., Chakrabarty, K.: Uncertainty-aware sensor deployment algorithms for surveillance applications. In: 2003 Global Telecommunications Conference, GLOBECOM 2003, vol. 5, pp. 2972–2976. IEEE (2003)
Zhengjun, Pan, Lishan, Kang, Yuping, Chen: Evolutionary Computation. Tsinghua University Press, Beijing (2009)
Zhang, J., et al.: Computational Intelligence. Tsinghua University Press, Beijing (2009)
Acknowledgements
This work is supported by the National Natural Science Foundation of China with the Grant No. 61573157, the Fund of Natural Science Foundation of Guangdong Province of China with the Grant No. 2014A030313454.
This work was jointly supported by Natural Science Foundation of Guangdong Province of China (#2015A030313408).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media Singapore
About this paper
Cite this paper
Li, K., Wen, Z., Li, S. (2016). Coverage Optimization for Wireless Sensor Networks by Evolutionary Algorithm. In: Li, K., Li, J., Liu, Y., Castiglione, A. (eds) Computational Intelligence and Intelligent Systems. ISICA 2015. Communications in Computer and Information Science, vol 575. Springer, Singapore. https://doi.org/10.1007/978-981-10-0356-1_6
Download citation
DOI: https://doi.org/10.1007/978-981-10-0356-1_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-0355-4
Online ISBN: 978-981-10-0356-1
eBook Packages: Computer ScienceComputer Science (R0)