PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
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
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
On adaptive deterministic gossiping in ad hoc radio networks
Information Processing Letters
The impact of information on broadcasting time in linear radio networks
Theoretical Computer Science
Gossiping with Bounded Size Messages in ad hoc Radio Networks
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Randomized Broadcasting and Gossiping in Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Gossiping with Unit Messages in Known Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Deterministic Communication in Radio Networks with Large Labels
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Centralized broadcast in multihop radio networks
Journal of Algorithms
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
SIAM Journal on Discrete Mathematics
Improved schedule for radio broadcast
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
| Hi-index | 5.23 |
In this paper we study the gossiping problem (all-to-all communication) in radio networks where all nodes are aware of the network topology. We start our presentation with a deterministic gossiping algorithm that works in at most n units of time in any radio network of size n. This algorithm is optimal in the worst case scenario since there exist radio network topologies, such as lines, stars and complete graphs in which radio gossiping cannot be completed in less than n communication rounds. Furthermore, we show that there does not exist any radio network topology in which the gossiping task can be solved in less than @?log(n-1)@?+2 rounds. We also show that this lower bound can be matched from above for a fraction of all possible integer values of n, and for all other values of n we propose a solution which accomplishes gossiping in @?log(n-1)@?+2 rounds. Then we show an almost optimal radio gossiping algorithm in trees, which misses the optimal time complexity by a single round. Finally, we study asymptotically optimal O(D)-time gossiping (where D is the diameter of the network) in graphs with the maximum degree @D=O(D^1^-^1^/^(^i^+^1^)log^in), for any integer constant i=0 and D large enough.