Fast distributed algorithm for convergecast in ad hoc geometric radio networks

DOI10.1016/j.jpdc.2005.11.004zbMath1096.68781OpenAlexW2015710071MaRDI QIDQ2497727

Dariusz R. Kowalski, Alexander Kesselman

Publication date: 4 August 2006

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.11.004

zbMATH Keywords

randomized algorithmsconvergecastradio networksenergy/latency trade-off

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (12)

Broadcasting in UDG radio networks with missing and inaccurate information ⋮ Broadcasting in UDG radio networks with unknown topology ⋮ Weighted total acquisition ⋮ The minimum scheduling time for convergecast in wireless sensor networks ⋮ Gossiping by energy-constrained mobile agents in tree networks ⋮ Approximating All-to-All Broadcast in Wireless Networks ⋮ Minimum-latency aggregation scheduling in wireless sensor network ⋮ Improved algorithm for minimum data aggregation time problem in wireless sensor networks ⋮ Communication Problems for Mobile Agents Exchanging Energy ⋮ Time-Efficient Broadcast in Radio Networks ⋮ TIGHT ANALYSIS OF SHORTEST PATH CONVERGECAST IN WIRELESS SENSOR NETWORKS ⋮ Convergecast and broadcast by power-aware mobile agents

This page was built for publication: Fast distributed algorithm for convergecast in ad hoc geometric radio networks