Abstract
Achieving optimal field coverage is a significant challenge in various sensor network applications. In some specific situations, the sensor field (target) may have coverage gaps due to the random deployment of sensors; hence, the optimized level of target coverage cannot be obtained. Given a set of sensors in the plane, the target coverage problem is to separate the sensor into different groups and provide them specific time intervals, so that the coverage lifetime can be maximized. Here, the constraint is that the network should be connected. Presently, target coverage problem is widely studied due to its lot of practical application in Wireless Sensor Network (WSN). This paper focuses on target coverage problem along with the minimum energy usage of the network so that the lifetime of the whole network can be increased. Since constructing a minimum connected target coverage problem is known to be NP-Complete, so several heuristics, as well as approximation algorithms, have been proposed. Here, we propose a heuristic for connected target coverage problem in WSN. We compare the performance of our heuristic with the existing heuristic, which states that our algorithm performs better than the existing algorithm for connected target coverage problem. Again, we have implemented the 2-connected target coverage properties for the network which provide fault tolerance as well as robustness to the network. So, we propose one algorithm which gives the target coverage along with 2-connectivity.
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
Abrams, Z., Goel, A., Plotkin, S.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, pp. 424–432. ACM (2004)
Bajaj, D., et al.: Maximum coverage heuristics (MCH) for target coverage problem in wireless sensor network. In: IEEE International Advance Computing Conference (IACC), pp. 300–305 (2014)
Cardei, M., Du, D.Z.: Improving wireless sensor network lifetime through power aware organization. Wirel. Netw. 11(3), 333–340 (2005)
Cardei, M., Wu, J.: Energy-efficient coverage problems in wireless ad-hoc sensor networks. Comput. Commun. 29(4), 413–420 (2006)
Mishra, S., Swain, R.R., Samal, T.K., Kabat, M.R.: CS-ATMA: a hybrid single channel MAC layer protocol for wireless sensor networks. In: Jain, L.C., Behera, H.S., Mandal, J.K., Mohapatra, D.P. (eds.) Computational Intelligence in Data Mining - Volume 3. SIST, vol. 33, pp. 271–279. Springer, New Delhi (2015). doi:10.1007/978-81-322-2202-6_24
Panda, B.S., Shetty, D.P.: An incremental power greedy heuristic for strong minimum energy topology in wireless sensor networks. In: Natarajan, R., Ojo, A. (eds.) ICDCIT 2011. LNCS, vol. 6536, pp. 187–196. Springer, Heidelberg (2011). doi:10.1007/978-3-642-19056-8_13
Cheng, M.X., Gong, X.: Maximum lifetime coverage preserving scheduling algorithms in sensor networks. J. Glob. Optim. 51(3), 447–462 (2011)
Swain, R.R., Mishra, S., Samal, T.K., Kabat, M.R.: An energy efficient advertisement based multichannel distributed MAC protocol for wireless sensor networks (Adv-MMAC). In: Wireless Personal Communications, pp. 1–28 (2016)
Deshpande, A., Khuller, S., Malekian, A., Toossi, M.: Energy efficient monitoring in sensor networks. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 436–448. Springer, Heidelberg (2008). doi:10.1007/978-3-540-78773-0_38
Gil, J.M., Han, Y.H.: A target coverage scheduling scheme based on genetic algorithms in directional sensor networks. Sensors 11(2), 1888–1906 (2011)
Keskin, M.E., Altinel, I.K., Aras, N.: Wireless sensor network design by lifetime maximisation: an empirical evaluation of integrating major design issues and sink mobility. Int. J. Sensor Netw. 20(3), 131–146 (2016)
Li, D., Cao, J., Liu, D., Yu, Y., Sun, H.: Algorithms for the m-coverage problem and k-connected m-coverage problem in wireless sensor networks. In: Li, K., Jesshope, C., Jin, H., Gaudiot, J.-L. (eds.) NPC 2007. LNCS, vol. 4672, pp. 250–259. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74784-0_26
Li, D., Cao, J., Liu, M., Zheng, Y.: K-connected target coverage problem in wireless sensor networks. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 20–31. Springer, Heidelberg (2007). doi:10.1007/978-3-540-73556-4_5
Luo, W., Wang, J., Guo, J., Chen, J.: Parameterized complexity of max-lifetime target coverage in wireless sensor networks. Theor. Comput. Sci. 518, 32–41 (2014)
Singhal, S., Bharti, S.K., Kaushik, G.: Localization in wireless sensor network: an optimistic approach. Int. J. Comput. Sci. Inf. Technol. 4(2), 224–226 (2013)
Wang, Y., Li, F., Dahlberg, T.A.: Energy-efficient topology control for three-dimensional sensor networks. Int. J. Sensor Netw. 4(1–2), 68–78 (2008)
Zheng, C., Yin, L., Zhang, Y.: Constructing r-hop 2-connected dominating sets for fault-tolerant backbone in wireless sensor networks. In: 8th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM), pp. 1–4. IEEE (2012)
Zhou, Z., Das, S., Gupta, H.: Connected k-coverage problem in sensor networks. In: 13th International Conference on Computer Communications and Networks (ICCCN), pp. 373–378. IEEE (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Panda, B.S., Bhatta, B.K., Mishra, S.K. (2017). Improved Energy-Efficient Target Coverage in Wireless Sensor Networks. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2017. ICCSA 2017. Lecture Notes in Computer Science(), vol 10409. Springer, Cham. https://doi.org/10.1007/978-3-319-62407-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-62407-5_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62406-8
Online ISBN: 978-3-319-62407-5
eBook Packages: Computer ScienceComputer Science (R0)