An E±cient Protocol for Disseminating Data with Multi-dimensional Index on Multiple Broadcasting Channels

Abstract

In this paper we consider scheduling the broadcast of data with a multi-dimensional index tree on multiple channels. Poorly designed multi-channel broadcast schedule and client query algorithms can result in an increase in the latency (time elapsed from requesting to receiving data) compared to a sin- gle channel environment. We provide an algorithm for scheduling the broadcast and the resulting sched- ule 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 an e±- cient protocol for the range-like query which results in a partial traversal of the index tree. We ¯nally conclude this paper with our simulation work.