Skip to main content
Log in

Analyze the Performance of the Cyclic Indexing Schemes for the Wireless Data Broadcast

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

Wireless data broadcast is an effective approach to disseminate information to a massive number of users. Indexing techniques for broadcasting data can reduce the battery power consumptions of mobile terminals by decreasing the tuning time. The organization of the indexes affects the efficiency of data searching. We investigate how the degree of the index node affects the tuning time, and thus minimize the power consumption of user’s terminals. We proposed a performance measurement for the tuning time and a cyclic indexing algorithm. The numerical results suggest the degree of an index node be 3 when the access probabilities of the data tend to be uniformly distributed so that the expected tuning time is minimal. When the access distribution of the data nodes is skewer, the tuning time can be minimized by setting the degree in the index node 2.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6

Similar content being viewed by others

References

  1. Imielinski, T., Viswanathan, S., & Badrinath, B. R. (1994). Energy efficiency indexing on air. In Proceedings of the International Conference on SIGMOD (pp. 25–36).

  2. Imielinski, T., Viswanathan, S., & Badrinath, B. R. (1997). Data on air: Organization and access. IEEE Transactions on Knowledge and Data Engineering, 9(3), 353–372. doi:10.1109/69.599926.

    Article  Google Scholar 

  3. Su, C.-J., & Tassiulas, L. (2000). Joint broadcast scheduling and user’s cache management for efficient information delivery. Wireless Networks, 6, 279–288. doi:10.1023/A:1019102017510.

    Article  MATH  Google Scholar 

  4. Lee, W. C., & Lee, D. L. (1996). Using signature techniques for information filtering in wireless and mobile environments. Distributed and Parallel Databases, 4(3), 205–227. doi:10.1007/BF00140950.

    Article  Google Scholar 

  5. Lee, C. K., Leong, H. V., & Si, A. (2000). A semantic broadcast scheme for a mobile environment based on dynamic chunking. 20th International Conference on Distributed Computing Systems (pp. 522–529).

  6. Saran, H., Shorey, R., & Kumar, A. (2000). Policies for increasing throughput and decreasing power consumption in bluetooth MAC. 2000 IEEE International Conference on Personal Wireless Communications (pp. 90–94).

  7. Lo, S.-C., & Chen, L. P. (2000). An adaptive access method for broadcast data under an error-prone mobile environment. IEEE Transactions on Knowledge and Data Engineering, 12(4), 609–620. doi:10.1109/69.868910.

    Article  Google Scholar 

  8. Hu, J.-H., Yeung, K.-L., Feng, G., & Leung, K.-F. (2000). A novel push-and-pull hybrid data broadcast scheme for wireless information networks. 2000 IEEE International Conference on Communications, 3, 1778–1782.

    Google Scholar 

  9. Shivakumar, N., & Venkatasubramanian, S. (1996). Energy-efficient indexing for information dissemination in wireless systems. ACM-Baltzer Journal of Mobile Networks and Nomadic Applications, 1, 433–446.

    Google Scholar 

  10. Peng, W.-C., & Chen, M.-S. (2000). Dynamic generation of data broadcasting programs for a broadcast disk array in a mobile computing environment. Proceedings of the ACM 9th International Conference on Information and Knowledge Management (CIKM-00), Nov. (pp. 6–11).

  11. Hu, T. C., & Tucker, A. C. (1971). Optimal computer search trees and variable-length alphabetic codes. SIAM Journal on Applied Mathematics, 21(4), 514–532. doi:10.1137/0121057.

    Article  MATH  MathSciNet  Google Scholar 

  12. Knuth, D. E. (1985). Dynamic Huffman encoding. Journal of Algorithms, 6(2), 163–180. doi:10.1016/0196-6774(85)90036-7.

    Article  MATH  MathSciNet  Google Scholar 

  13. Li, W. (1992). Random texts exhibit Zipf’s law-like word frequency distribution. IEEE Transactions on Information Theory, 36(6), 1842–1845. doi:10.1109/18.165464.

    Article  Google Scholar 

  14. Waluyo, A. B., Goh, G., Srinivasan, B., & Taniar, D. (2005). Applying multi-channelling and indexing scheme for efficient data retrieval in wireless broadcast environment, Proceedings of the 2005 International Conference on Intelligent Sensing and Information Processing, Jan. (pp. 32–37).

  15. Wang, S., & Wang, H.-L. (2007). TMBT: An efficient index allocation method for multi-channel data broadcast. AINAW’07. 21st International Conference on Advanced Information Networking and Applications Workshops 2007, May (pp. 236–242).

  16. Yao, Y., Tang, X., Lim, E.-P., & Sun, A. (2006). An energy-efficient and access latency optimized indexing scheme for wireless data broadcast. IEEE Transactions on Knowledge and Data Engineering, 18(8), 1111–1124. Aug.

    Article  Google Scholar 

  17. Zipf, G. K. (1949). Human behavior and the principle of least effort. Cambridge, Massachusetts: Addison-Wesley.

    Google Scholar 

  18. 3GPP TS 25.324: Radio interface for broadcast/multicast services.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Long-Sheng Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, LS., Chang, MF. & Lee, GC. Analyze the Performance of the Cyclic Indexing Schemes for the Wireless Data Broadcast. J Sign Process Syst Sign Image Video Technol 59, 103–110 (2010). https://doi.org/10.1007/s11265-008-0269-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-008-0269-4

Keywords

Navigation