SETMES: a scalable and efficient tree-based mechanical scheme for multi-channel wireless data broadcast

  • Authors:

  • Xin Lu;Xiaofeng Gao;Yongtian Yang;Jiaofei Zhong

  • Affiliations:

  • Shanghai Jiao Tong University, Shanghai, China;Shanghai Jiao Tong University, Shanghai, China;Shanghai Jiao Tong University, Shanghai, China;University of Central Missouri, MO

  • Venue:
  • Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Wireless data broadcast is a widely used approach to disseminate frequently requested data to a mass number of mobile clients. Indexing technology is a kernel strategy in wireless data broadcast systems to help clients reducing their information retrieval costs. However, existing broadcast schemes are usually designed for a specifical broadcast environment with constrained programs. The limited scalability of such data broadcast systems restricts their developments and implementations for real-world applications. In this paper, we propose a Scalable and Efficient Tree-based MEchanical Scheme for multi-channel wireless broadcast, referring as SETMES. Our design can deal with asynchronous multi-channel environment with arbitrary data size and flexible bandwidth capacities. Instead of well-structured B+-Tree index, we choose Alphabetic Huffman Tree (H-Tree) to illustrate general SETMES construction. SETMES is a holistic scheme: given the number of available channels and the data program, SETMES mechanically generate the index and data sequences, and then allocate them onto channels, with optimal average client-retrieval costs. We illustrate theoretically the construction of a global optimization function for SETMES, and decompose this function into an expression by the maximal linear irrelative variable tuple (k, l, m), where k is the k-ary H-Tree, l is the replicated cutting level, and m is the number of index channels. We also provide simulations to evaluate the performance between SETMES and B+-Tree scheme from previous reference. Numerical experiments validate the efficiency and scalability of SETMES.