Notes on Bit-reversal Broadcast Scheduling
Marcin Kik

TL;DR
This paper extends results on RBO, an efficient broadcast scheduling method for battery-powered radios, analyzing its performance, bounds, and protocol complexity for key-based data retrieval in unreliable networks.
Contribution
It provides revised bounds and extended analysis of RBO's efficiency, including performance in unreliable networks and computational complexity of its protocol.
Findings
RBO transmits at most 2k+1 frames outside the key interval before success
Expected effort to receive desired frames is bounded by a function of p and k
Protocol's wake-up time computation is O(k) operations
Abstract
This report contains revision and extension of some results about RBO [arXiv:1108.5095]. RBO is a simple and efficient broadcast scheduling of uniform frames for battery powered radio receivers. Each frame contains a key from some arbitrary linearly ordered universe. The broadcast cycle -- a sequence of frames sorted by the keys and permuted by -bit reversal -- is transmitted in a round robin fashion by the broadcaster. At arbitrary time during the transmission, the receiver may start a simple protocol that reports to him all the frames with the keys that are contained in a specified interval of the key values . RBO receives at most other frames' keys before receiving the first key from or noticing that there are no such keys in the broadcast cycle. As a simple corollary, is upper bound the number of keys outside that will…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Distributed systems and fault tolerance · Real-Time Systems Scheduling
