Abstract
Path coverage is an important issue in wireless sensor networks. Some algorithms are presented to solve path coverage problem in some specialized situations. However, they cannot be applied in common sensor networks applications. Moreover, energy conservation is not considered in these works. This paper presented a maximum lifetime path coverage algorithm in sensor networks. The goal is to divide the sensors into h groups, and schedule all groups such that the maximum lifetime can be achieved. We transform the problem into several sub problems and give a heuristic algorithm for it. Simulation experiments are conducted to find the impact of the size, the initial energy and the sensing radius of the sensor to the maximum lifetime.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Kumar, S., Lai, T.H., Posner, M.E., et al.: Maximizing the lifetime of a barrier of wireless sensors. IEEE Trans. Mob. Comput. 9(8), 1161–1172 (2010)
Dhawan, A.: Maximum lifetime scheduling in wireless sensor networks. Wirel. Sens. Netw. Technol. Protoc. 2012, 1–3 (2012)
Mini, S., Udgata, S.K., Sabat, S.L.: Sensor deployment and scheduling for target coverage problem in wireless sensor networks. Sens. J. IEEE 14(3), 636–644 (2014)
Abrams, Z., Goel, A., et al.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks, pp. 424–432 (2003)
Cardei, M., Du, D.Z.: Improving wireless sensor network lifetime through power aware organization. Wirel. Netw. 11(3), 333–340 (2005)
Lu, Z., Li, W.W., Pan, M.: Maximum lifetime scheduling for target coverage and data collection in wireless sensor networks. IEEE Trans. Veh. Technol. 64(2), 714–727 (2015)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., et al.: Coverage problems in wireless ad-hoc sensor networks. In: Proceedings of IEEE INFOCOM 2001, Twentieth Joint Conference of the IEEE Computer and Communications Societies. IEEE Xplore, vol. 3, pp. 1380–1387 (2001)
Lu, M., Wu, J., Cardei, M., Li, M.: Energy-efficient connected coverage of discrete targets in wireless sensor networks. In: Lu, X., Zhao, W. (eds.) ICCNMC 2005. LNCS, vol. 3619, pp. 43–52. Springer, Heidelberg (2005). https://doi.org/10.1007/11534310_7
Gu, Y., Pan, M., Li, W.: Prolonging the lifetime of large scale wireless sensor networks via base station placement. In: Vehicular Technology Conference, pp. 1–5. IEEE (2013)
Gu, Y., Pan, M., Li, W.: Maximizing the lifetime of delay-sensitive sensor networks via joint routing and sleep scheduling. In: International Conference on Computing, Networking and Communications, pp. 540–544. IEEE (2014)
Zhang, Y., Huang, H., Sun, P., Li, Y.: Improving path-coverage for moving targets in wireless multimedia sensor networks. J. Commun. 9(11), 843–850 (2014)
Acknowledgment
This work is sponsored by the National Natural Science Foundation of China under Grant Nos. 61379117, 61502057.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Ethics declarations
The authors declare that there is no conflict of interest regarding the publication of this manuscript.
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Liu, H., Liu, Z. (2019). Algorithms for Maximum Lifetime of Covering Path. In: Sun, F., Liu, H., Hu, D. (eds) Cognitive Systems and Signal Processing. ICCSIP 2018. Communications in Computer and Information Science, vol 1005. Springer, Singapore. https://doi.org/10.1007/978-981-13-7983-3_20
Download citation
DOI: https://doi.org/10.1007/978-981-13-7983-3_20
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-7982-6
Online ISBN: 978-981-13-7983-3
eBook Packages: Computer ScienceComputer Science (R0)