Locality sensitive algotrithms for data mule routing problem

DOI10.1007/978-3-030-27195-4_22MaRDI QIDQ6199020zbMATH OpenOpenAlexFDO

Authors P. L. A. Munhoz, Felipe P. do Carmo, Uéverton S. Souza, Lúcia M. A. Drummond, Pedro Henrique González, Luiz S. Ochi, Philippe Michelon

Publication date 23 February 2024

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-27195-4_22

zbMATH Keywords

convex hulldata mulelocality sensitivityrouting problem

Mathematics Subject Classification ID

Wireless sensor networks as related to computer science (68M18) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Improved solution to data gathering with mobile mule
• General variable neighborhood search for the data mule scheduling problem
• Robotic data mules for collecting data over sparse sensor fields
• Sensor network topology design and analysis for efficient data gathering by a mobile mule
• A fast algorithm for data collection along a fixed track

This page was built for publication: Locality sensitive algotrithms for data mule routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199020)