Fast distributed algorithm for convergecast in ad hoc geometric radio networks
Authors:
- Alex KesselmanAKAlex Kesselman
- Dariusz R. KowalskiDKDariusz R. Kowalski
- 1 April 2006
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 66 (4) , 578-585
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Energy efficient communication in ad hoc networks from user's and designer's perspectiveACM SIGMOBILE Mobile Computing and Communications Review, 2005
- The minimum broadcast range assignment problem on linear multi-hop wireless networksTheoretical Computer Science, 2003
- On adaptive deterministic gossiping in ad hoc radio networksInformation Processing Letters, 2002
- Location systems for ubiquitous computingComputer, 2001
- Power consumption in packet radio networksTheoretical Computer Science, 2000
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio NetworksSIAM Journal on Computing, 1998
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomizationJournal of Computer and System Sciences, 1992
- A lower bound for radio broadcastJournal of Computer and System Sciences, 1991
- The wave expansion approach to broadcasting in multihop radio networksIEEE Transactions on Communications, 1991
- The strongly connecting problem on multihop packet radio networksIEEE Transactions on Communications, 1989