Randomized broadcast in radio networks with collision detection
We present a randomized distributed algorithm that in radio networks with collision detection broadcasts a single message in O(D+log6n) rounds, with high probability. This time complexity is most interesting because of its optimal additive dependence on the network diameter D. It improves over the c...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Berlin Heidelberg
2016
|
| Online Access: | http://hdl.handle.net/1721.1/103593 https://orcid.org/0000-0003-4213-9898 |