Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
An Adaptive Protocol for Reliable Multicast in Mobile Multi-hop Radio Networks
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Reliable Broadcast in Wireless Mobile Ad Hoc Networks
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 09
Reliable communication in mobile ad hoc networks
Reliable communication in mobile ad hoc networks
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
Journal of Parallel and Distributed Computing
Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Deterministic Collision Free Communication Despite Continuous Motion
Algorithmic Aspects of Wireless Sensor Networks
Fast message dissemination in random geometric ad-hoc radio networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Reliable neighbor discovery for mobile ad hoc networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
DISC'10 Proceedings of the 24th international conference on Distributed computing
Maintaining information about nearby processors in a mobile environment
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Mobility tolerant broadcast in mobile ad hoc networks
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Neighbor Knowledge of Mobile Nodes in a Road Network
ICDCS '12 Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems
| Hi-index | 0.00 |
Consider a set of n processors traveling with bounded speed along continuous trajectories on a line and suppose that each processor must share a piece of information with all other processors in the set. This is known as the gossiping task. Each processor has a radio transmitter with transmission radius R and interference radius R' ≥ R. We present a deterministic algorithm for the gossiping task, under certain network density assumptions, that is provably correct and terminates within O(n) time slots.