Abstract
Target traversing is an important research topic in wireless sensor networks, with most studies examining coverage issues of the target’s moving paths. The best coverage path is one that minimizes the target support to the sensors. Most existing algorithms either ensure that the target remains as close as possible to the sensors or deploy sensors to enhance coverage. In this paper, we consider a scenario where the target must traverse the sensor network within a certain time constraint. Furthermore, we propose some algorithms to ensure that the target stays close to the sensors within this time constraint. Simulations show that the proposed algorithms can solve traversal path problems in wireless sensor networks.
Similar content being viewed by others
References
Bondy JA, Murty USR (1976) Graph theory with application. Elsevier, New York
Carbunar B, Grama A, Vitek J, Carbunar O (2004) Coverage preserving redundancy elimination in sensor networks. In: Proceeding of IEEE Communications Society Conference on the Sensor and Ad Hoc Communications and Networks, pp. 377-386
Chunseok L, Donghoo S, Sang BW, Sunghee C (2013) Best and worst-case coverage problems for arbitrary paths in wireless sensor networks. Ad Hoc Networks 11:1699–1714
Gage W (1992) Command control for many-robot system. Unmanned Syst 10(4):28–34
Goldsmith A, Wicker S (2002) Design challenges for energy-constrained Ad-hoc wireless networks. Wirel Commun 9(4):8–27
Howard A, Mataric M, Sukhatme G (2002) Mobile sensor network deployment using potential fields: a distributed, scalable solution to the area coverage problem. Distrib Auton Robot Syst 5:299–308
Intanagonwiwat C, Govindan R, Estrin D (2000) Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proceedings of Annual International Conference on Mobile computing and networking, pp 56-67
Li XY, Wan PJ, Frieder O (2003) Coverage in wireless Ad-hoc sensor networks. IEEE Trans Comput 52(6):753–763
Luo Q, Lin YP (2010) Heuristic traversal path algorithm based on linear aggregation in wireless sensor networks. J Comput Res Dev 47(11):1919–1927
Mahboubi H, Momeni A, Aghdam AG, Sayrafian-Pour K, Marbukh V (2012) An efficient target monitoring scheme with controlled node mobility for sensor networks. Control Syst Technol 20(6):1522–1532
Mao XF, Liu YH, Tang SJ, Liu HF, Han JK, Li XY (2013) Finding best and worst \(k\)-coverage paths in multihop wireless sensor networks. IEEE Tras Parallel Distrib Syst 24(12):2396–2406
Megerian S, Koushanfar F, Potkonjak M, Srivastava MB (2005) Worst and best-case coverage in sensor networks. IEEE Trans Mob Comput 4(1):4–92
Okabe A, Boots B, Sugihara K, Chiu SN (1999) Spatial tessellations: concepts and applications of voronoi diagram. Wiley, London
Pottie GJ, Kaiser WJ (2000) Wireless integrated network sensors. Commun of the ACM 43(5):51–58
Preparata FP, Shamos MI (1985) Computational Geometry. Springer-Verlag, Switzerland
Roy SB, Das G, Das SK (2012) Algorithms for computing best coverage path in the presence of obstacles in a sensor field. J Discrete Algorithms 13:86–97
Shen XF, Chen JM, Wang Z, Dai GJ (2008) Coverage quality measuring and optimization for moving target in sensor networks. J Commun 29(11):246–252
Shih KP, Chen YD, Chiang CW, Liu BI (2006) A distributed active sensor selection scheme for wireless sensor networks. In: Proceeding of IEEE Symposium on Computers and Communications, pp 923-928
Wang X, Xing G, Zhang Y, Lu C, Pless R, Gill C (2003) Integrated coverage and connectivity configuration in wireless sensor networks. In: Proceedings of International Conference on Embedded Networked Sensor Systems, pp 28-39
Zhang L, Chen X, Fan J, Lin CK (2016) Support path with time constraint in wireless sensor networks. In: 2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)
Zhao Q, Gurusamy M (2006) Maximizing network lifetime for connected target coverage in wireless sensor networks. In: Proceeding of IEEE International Conference on Networking and Communications, pp 94-101
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This paper is an extended version of work presented at the APNOMS 2016 Conference.
Rights and permissions
About this article
Cite this article
Zhang, L., Lin, CK., Chen, X. et al. Efficient algorithms for support path with time constraint. J Comb Optim 42, 187–205 (2021). https://doi.org/10.1007/s10878-021-00745-x
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-021-00745-x