TMBT: An Efficient Index Allocation Method for Multi-Channel Data Broadcast

Authors:
Shuoi Wang;Hsing-Lung Chen
Affiliations:
National Taiwan University of Science and Technology, Taiwan;National Taiwan University of Science and Technology, Taiwan
Venue:
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02
Year:
2007

Citing 0
Cited 5

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

Journal of Signal Processing Systems
Efficient parallel data retrieval protocols with MIMO antennae for data broadcast in 4G wireless communications

DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Energy-efficient tree-based indexing schemes for information retrieval in wireless data broadcast

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
SETMES: a scalable and efficient tree-based mechanical scheme for multi-channel wireless data broadcast

Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Efficient Approximation Algorithm for Data Retrieval with Conflicts in Wireless Networks

Proceedings of International Conference on Advances in Mobile Computing & Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

Broadcast is an attractive data dissemination means over multiple wireless channels due to its scalability. Since mobile clients have limited battery power and broadcast data have different popularities, how these data are fast accessed becomes an important issue. Our solution consists of first allocating data among channels near-optimally, and adopting flat broadcast per channel. Then, a binary tree indexing structure is built for each channel and nodes of all index trees are multiplexed onto a well-known physical channel, named as TMBT (time-multiplexed multiple binary trees) Our method organizes data and index into a popularity hierarchy which results in a skewed transmission of data and index. Skewed transmission has been shown to reduce the average access time effectively. Simulation results show that the reduction of access time is on average about 48% over previous work with little tuning time overhead.