Bit Reversal Broadcast Scheduling for Ad Hoc Systems
We consider the scenario where a broadcaster sends messages to an ad hoc subset of receivers. We assume that once a receiver becomes active, it must receive all messages directed to it.
The problem considered in this paper is minimization of the energy usage for the receiver. As most of the energy is spent for the receiver’s antenna, our goal is to minimize the time period, when this antenna is active.
In this paper we present and analyze RBO broadcast scheduling protocol that attempts to minimize the extra energy usage due to receiving messages that in fact are not meant for the receiver. While RBO scheme enjoys such important properties like correctness in case of transmission failures and ease of implementation, estimating extra energy cost requires a lot of effort.
In this paper we present tight upper bounds for this extra energy together with a rigorous proof. Namely, for a broadcast cycle of length 2k we show that the overhead is limited to 2k + 3 extra messages, while there are cases where the overhead is 2k − 1 extra messages. As it is hard to imagine how to break this upper bound, RBO might be a good choice for broadcast scheduling, when energy efficiency and ease to implementation are concerned.
Keywordsbroadcast ad hoc system scheduling energy cost upper bound
Unable to display preview. Download preview PDF.
- 1.Morton, G.: A computer oriented geodetic data base and a new technique in file sequencing. IBM technical report Ottawa, Canada (1966)Google Scholar
- 2.Kik, M.: RBO protocol: Broadcasting huge databases for tiny receivers. CoRR abs/1108.5095 (2011)Google Scholar
- 3.Kik, M.: Notes on bit-reversal broadcast scheduling. CoRR abs/1201.3318 (2012)Google Scholar
- 4.Kik, M., Gebala, M., Kutyłowski, M.: One-side energy costs of the RBO receiver. CoRR abs/1209.4605 (2012)Google Scholar
- 5.Imielinski, T., Viswanathan, S., Badrinath, B.R.: Energy efficient indexing on air. In: Snodgrass, R.T., Winslett, M. (eds.) SIGMOD Conference, pp. 25–36. ACM Press (1994)Google Scholar
- 14.Fukuchi, D., Sommer, C., Sei, Y., Honiden, S.: Distributed arrays: A P2P data structure for efficient logical arrays. In: IEEE INFOCOM, pp. 1458–1466 (2009)Google Scholar
- 15.Shao, J., Davis, B.T.: The bit-reversal sdram address mapping. In: Kavi, K.M., Cytron, R. (eds.) SCOPES. ACM International Conference Proceeding Series, vol. 136, pp. 62–71 (2005)Google Scholar