Sensor network topology design and analysis for efficient data gathering by a mobile mule

DOI10.1007/S00453-020-00704-8MaRDI QIDQ2006940zbMATH OpenOpenAlexFDO

Authors Harel Yedidsion, Stav Ashur, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal

Publication date 12 October 2020

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-020-00704-8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Wireless sensor networks as related to computer science (68M18)

Recommendations

• Improved solution to data gathering with mobile mule
• Optimally Fast Data Gathering in Sensor Networks
• Robotic data mules for collecting data over sparse sensor fields
• Algorithmic Aspects of Wireless Sensor Networks
• Exact and approximate balanced data gathering in energy-constrained sensor networks

Cites work

• scientific article; zbMATH DE number 1775442 (Why is no real title available?)
• A new bound on maximum independent set and minimum connected dominating set in unit disk graphs
• Fast approximations for sums of distances, clustering and the Fermat-Weber problem
• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
• On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
• Planar Formulae and Their Uses
• The densest packing of 19 congruent circles in a circle
• Unit disk graphs

Cited in

(4)

• Optimal relay node placement and trajectory computation in sensor networks with mobile data collector
• Locality sensitive algotrithms for data mule routing problem
• Robotic data mules for collecting data over sparse sensor fields
• Improved solution to data gathering with mobile mule

This page was built for publication: Sensor network topology design and analysis for efficient data gathering by a mobile mule

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