Improving the performance of the wireless data broadcast by the cyclic indexing schemes

Authors:
Long-Sheng Li;Ming-Feng Chang;Gwo-Chuan Lee
Affiliations:
Department of Computer Science and information Engineering, National Chiayi University, Chiayi, Taiwan, R.O.C.;Department of Computer Science and information Engineering, National Chiayi University, Chiayi, Taiwan, R.O.C.;Department of Computer Science and information Engineering, National Chiayi University, Chiayi, Taiwan, R.O.C.
Venue:
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Year:
2007

Citing 8
Cited 0

Dynamic Huffman coding

Journal of Algorithms
Energy efficient indexing on air

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Efficient indexing for broadcast based wireless systems

Mobile Networks and Applications - Special issue on mobile computing and system services
Joint broadcast scheduling and user's cache management for efficient information delivery

Wireless Networks
Dynamic generation of data broadcasting programs for a broadcast disk array in a mobile computing environment

Proceedings of the ninth international conference on Information and knowledge management
Data on Air: Organization and Access

IEEE Transactions on Knowledge and Data Engineering
An Adaptive Access Method for Broadcast Data under an Error-Prone Mobile Environment

IEEE Transactions on Knowledge and Data Engineering
A Semantic Broadcast Scheme for a Mobile Environment Based on Dynamic Chunking

ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)

Quantified Score

Hi-index	0.00

Visualization

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.