Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Randomized Initialization Protocols for Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Oblivious gossiping in ad-hoc radio networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Distributed multi-broadcast in unknown radio networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On adaptive deterministic gossiping in ad hoc radio networks
Information Processing Letters
A Randomized Algorithm for Gossiping in Radio Networks
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
Journal of Parallel and Distributed Computing
Optimal time slot assignment for mobile ad hoc networks
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Hi-index | 0.00 |
We present a deterministic broadcast algorithm for the class of mobile ad hoc networks where the mobile nodes possess collision detection capabilities. The algorithm is based on a breadth-first traversal of the network, allows multiple transmissions in the same time slot and completes broadcast in O(n log n) time in the worst case. It is mobility resilient even for networks where topology changes are very frequent. The idea of this broadcast algorithm is then extended to develop a gossiping algorithm having O((n+D)Dlog n) worst case run time, where D is the diameter of the network graph, which is an improvement over the existing algorithms.