EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Energy-Efficient Algorithms for Path Coverage in Sensor Networks

Zhixiong Liu, Wei Zhou iD

Sensors · 2023

DOI: 10.3390/s23115026 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, 2023. Verfasst von Zhixiong Liu und 1 weiteren Autor:innen. Beteiligte Einrichtung: School of Computer Science and Engineering, Changsha University, Changsha 410022, China. Hauptthemen laut MEDLINE: Computer Communication Networks, Algorithms. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 18 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Path coverage attracts many interests in some scenarios, such as object tracing in sensor networks. However, the problem of how to conserve the constrained energy of sensors is rarely considered in existing research. This paper studies two problems in the energy conservation of sensor networks that have not been addressed before. The first problem is called the least movement of nodes on path coverage. It first proves the problem as NP-hard, and then uses curve disjunction to separate each path into some discrete points, and ultimately moves nodes to new positions under some heuristic regulations. The utilized curve disjunction technique makes the proposed mechanism unrestricted by the linear path. The second problem is called the largest lifetime on path coverage. It first separates all nodes into independent partitions by utilizing the method of largest weighted bipartite matching, and then schedules these partitions to cover all paths in the network by turns. We eventually analyze the energy cost of the two proposed mechanisms, and evaluate the effects of some parameters on performance through extensive experiments, respectively.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Computer Communication NetworksAlgorithmsComputer SimulationPhysical Phenomena

Stichwörter der Autor:innen

curve disjunctionleast movementpath coveragesensor networkweighted bipartite matching

Autor:innen und Institutionen

  • School of Computer Science and Engineering, Changsha University, Changsha 410022, China.
  • Department of Computer Science and Software Engineering, Swinburne University of Technology, Hawthorn 3122, Australia.

ORCID-Profile: Wei Zhou

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Liu, Z., & Zhou, W. (2023). Energy-Efficient Algorithms for Path Coverage in Sensor Networks. Sensors. https://doi.org/10.3390/s23115026

Vancouver

Liu Z, Zhou W. Energy-Efficient Algorithms for Path Coverage in Sensor Networks. Sensors. 2023. doi:10.3390/s23115026

BibTeX
@article{Liu2023,
  author = {Liu, Zhixiong and Zhou, Wei},
  title = {Energy-Efficient Algorithms for Path Coverage in Sensor Networks},
  journal = {Sensors},
  year = {2023},
  doi = {10.3390/s23115026}
}
Kostenlos starten →