Efficient algorithms for support path with time constraint

Lili Zhang, Cheng-Kuan Lin, Xiaoqiang Chen, Jianxi Fan and Yuan-Hsiang Teng ()
Additional contact information
Lili Zhang: Soochow University
Cheng-Kuan Lin: Fuzhou University
Xiaoqiang Chen: Soochow University
Jianxi Fan: Soochow University
Yuan-Hsiang Teng: Providence University

Journal of Combinatorial Optimization, 2021, vol. 42, issue 1, No 10, 187-205

Abstract: 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.

Keywords: Target traversing; Support path; Coverage path; Delaunay triangulation algorithm; Time constraint; Wireless sensor network (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00745-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:42:y:2021:i:1:d:10.1007_s10878-021-00745-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00745-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().