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

DOI10.1007/s00453-020-00704-8zbMath1455.68035OpenAlexW3020618888MaRDI QIDQ2006940

Aritra Banik, Paz Carmi, Stav Ashur, Matthew J. Katz, Harel Yedidsion, 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)

Cites Work

• Unnamed Item
• 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
• On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
• Unit disk graphs
• The densest packing of 19 congruent circles in a circle
• Fast approximations for sums of distances, clustering and the Fermat-Weber problem
• Planar Formulae and Their Uses

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