A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring

DOI10.1007/s10878-015-9840-7zbMath1343.90020OpenAlexW2053954987MaRDI QIDQ281797

Donghyun Kim, Joong-Lyul Lee, Weili Wu, Alade O. Tokuta, Wei Wang, Deying Li

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9840-7

zbMATH Keywords

path planningtraveling salesman problemwireless sensor networkcommunication power controlenergy-efficiencymessage ferrying

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Related Items (1)

Group sweep coverage with guaranteed approximation ratio

Cites Work

• Min-max tree covers of graphs.
• The Euclidean traveling salesman problem is NP-complete
• Worst-case analysis of a new heuristic for the travelling salesman problem
• Approximation algorithms for TSP with neighborhoods in the plane
• A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane
• Minimum Spanning Tree with Neighborhoods
• Unnamed Item
• Unnamed Item

This page was built for publication: A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring