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

DOI10.1007/S00453-020-00704-8zbMATH Open1455.68035OpenAlexW3020618888MaRDI QIDQ2006940FDOQ2006940

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

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

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)

Cites Work

• Fast approximations for sums of distances, clustering and the Fermat-Weber problem
• Unit disk graphs
• Planar Formulae and Their Uses
• Title not available (Why is that?)
• On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
• The densest packing of 19 congruent circles in a circle
• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
• A new bound on maximum independent set and minimum connected dominating set in 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)