Abstract
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.
Supported by project “Detectors and sensors for measuring factors hazardous to environment – modeling and monitoring of threats”, financed by the European Union via the European Regional Development Fund and the Polish state, Operational Programme Innovative Economy 2007-2013. Ref. No. POIG.01.03.01-02-002/08-00.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Morton, G.: A computer oriented geodetic data base and a new technique in file sequencing. IBM technical report Ottawa, Canada (1966)
Kik, M.: RBO protocol: Broadcasting huge databases for tiny receivers. CoRR abs/1108.5095 (2011)
Kik, M.: Notes on bit-reversal broadcast scheduling. CoRR abs/1201.3318 (2012)
Kik, M., Gebala, M., Kutyłowski, M.: One-side energy costs of the RBO receiver. CoRR abs/1209.4605 (2012)
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)
Imielinski, T., Viswanathan, S., Badrinath, B.R.: Power efficient filtering of data an air. In: Jarke, M., Bubenko, J., Jeffery, K. (eds.) EDBT 1994. LNCS, vol. 779, pp. 245–258. Springer, Heidelberg (1994)
Imielinski, T., Viswanathan, S., Badrinath, B.R.: Data on air: Organization and access. IEEE Trans. Knowl. Data Eng. 9(3), 353–372 (1997)
Datta, A., VanderMeer, D.E., Celik, A., Kumar, V.: Broadcast protocols to support efficient retrieval from databases by mobile users. ACM Trans. Database Syst. 24(1), 1–79 (1999)
Khanna, S., Zhou, S.: On indexed data broadcast. JCSS 60(3), 575–591 (2000)
Vaidya, N.H., Hameed, S.: Scheduling data broadcast in asymmetric communication environments. Wireless Networks 5(3), 171–182 (1999)
Chung, Y.D., Lee, J.Y.: An indexing method for wireless broadcast xml data. Inf. Sci. 177(9), 1931–1953 (2007)
Chung, Y.D., Yoo, S., Kim, M.H.: Energy- and latency-efficient processing of full-text searches on a wireless broadcast stream. IEEE Trans. Knowl. Data Eng. 22(2), 207–218 (2010)
Shalev, O., Shavit, N.: Split-ordered lists: Lock-free extensible hash tables. J. ACM 53(3), 379–405 (2006)
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)
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)
Hefeeda, M., Hsu, C.H.: On burst transmission scheduling in mobile tv broadcast networks. IEEE/ACM Trans. Netw. 18(2), 610–623 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kik, M., Gębala, M., Kutyłowski, M. (2013). Bit Reversal Broadcast Scheduling for Ad Hoc Systems. In: Pathan, M., Wei, G., Fortino, G. (eds) Internet and Distributed Computing Systems. IDCS 2013. Lecture Notes in Computer Science, vol 8223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41428-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-41428-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41427-5
Online ISBN: 978-3-642-41428-2
eBook Packages: Computer ScienceComputer Science (R0)