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
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
Broadcasting in radio networks
Handbook of wireless networks and mobile 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
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Urban multi-hop broadcast protocol for inter-vehicle communication systems
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Performance Analysis of Broadcast Protocols in Ad Hoc Networks Based on Self-Pruning
IEEE Transactions on Parallel and Distributed Systems
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Efficient Broadcasting with Guaranteed Coverage in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Reliable Broadcast in Wireless Mobile Ad Hoc Networks
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 09
Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks
The Journal of Supercomputing
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Energy-efficient broadcasting in all-wireless networks
Wireless Networks
Smart antenna based broadcasting in wireless ad hoc networks
Ad Hoc Networks
Mobility tolerant broadcast in mobile ad hoc networks
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Gossiping in one-dimensional synchronous ad hoc wireless radio networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
| Hi-index | 0.00 |
We present a mobility resilient deterministic broadcast algorithm with worst-case time complexity of O(nlogn) for ad hoc networks where the nodes possess collision detection capabilities; n is the total number of nodes in the network. The algorithm is based on a breadth-first traversal of the network and allows multiple simultaneous transmissions by the nodes. The idea of this broadcast algorithm is then extended to develop a mobility resilient deterministic gossiping algorithm having O(Dnlogn) worst-case run time (D is the diameter of the network graph), which is an improvement over the existing algorithms. Simulation results show that on an average, the time for completing the broadcast or gossiping is significantly lower than the theoretical worst-case time requirement.