Analyze the performance of the cyclic indexing schemes for the wireless data broadcast

Long Sheng Li*, Ming-Feng Chang, Gwo Chuan Lee

*Corresponding author for this work

Research output: Contribution to journalArticle


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.

Original languageEnglish
Pages (from-to)103-110
Number of pages8
JournalJournal of Signal Processing Systems
Issue number1
StatePublished - 1 Apr 2010


  • Access time
  • Broadcast
  • The Hu-Tucker algorithm
  • Tuning cost
  • Tuning time
  • Wireless

Fingerprint Dive into the research topics of 'Analyze the performance of the cyclic indexing schemes for the wireless data broadcast'. Together they form a unique fingerprint.

  • Cite this