Approximating the Size of a Radio Network in Beeping Model
2016
In a single-hop radio network, nodes can communicate with each other by broadcasting to a shared wireless channel. In each time slot, all nodes receive feedback from the channel depending on the number of transmitters. In the Beeping Model, each node learns whether zero or at least one node have transmitted. In such a model, a procedure estimating the size of the network can be used for efficiently solving the problems of leader election or conflict resolution. We introduce a time-efficient uniform algorithm for size estimation of single-hop networks. With probability at least \(1-1/f\) our solution returns \((1+\varepsilon )\)-approximation of the network size n within \(\mathcal {O}\left( \log \log n+\log f/\varepsilon ^2\right) \) time slots. We prove that the algorithm is asymptotically time-optimal for any constant \(\varepsilon >0\).
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
27
References
21
Citations
NaN
KQI