Data broadcasting with multi-dimensional index on multiple channels

Broadcasting data together with an index structure is an effective way to disseminate data in a wireless, mobile environment. In this paper we mainly consider scheduling the broadcast of data with a multi-dimensional index tree on multiple channels. A mobile client can tune into any channel at one time instance. Poorly designed multichannel broadcast schedule and client query algorithms can result in an increase in the latency (time elapsed from requesting to receiving data) compared to a single channel environment. We provide an algorithm for scheduling the broadcast and the resulting schedule has an optimal cycle length and can reduce the latency by a factor of 1/c for a simple query where c is the number of channels. We also provide a simple protocol for the range-like query which results in a partial traversal of the index tree. We finally conclude this paper with our simulation work.