An Efficient Partition and Matching Algorithm for Query-Set-based Broadcasting in Multiple Channel Mobile Environment

摘要

Broadcast is an efficient and scalable method for resolving the bandwidth limitation in a wireless environment. In many applications, mobile clients might need more than one data item. However, most previous researches on query-set-based broadcasting are restricted to a single broadcast channel environment. The results are limited applicability to the upcoming mobile environments. In this paper, we relax this restriction and explore the problem of query-set-based broadcasting in multiple broadcast channels. In multi-channel query-set-based broadcasting, we discover data collision (two data items in the same query set are arranged on two channels at the same time slot) is an important factor to affect users' access time. In this paper, we introduce the new data collision problem motivated by multi-channel query-set-based broadcasting environment. We then present a two-stage scheme of data partitioning and data matching to solve the new data collision problem. Experiments are performed to justify the benefit of our approach