Scheduling dependent items in data broadcasting environments
Proceedings of the 2006 ACM symposium on Applied computing
Broadcasting dependent data with minimized access latency in a multi-channel environment
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Disseminating dependent data in wireless broadcast environments
Distributed and Parallel Databases
MULS: A General Framework of Providing Multilevel Service Quality in Sequential Data Broadcasting
IEEE Transactions on Knowledge and Data Engineering
Effective protocols for kNN search on broadcast multi-dimensional index trees
Information Systems
| Hi-index | 0.00 |
In recent years, data broadcasting becomes a promising technique to design a mobile information system with power conservation, high scalability and high bandwidth utilization. However, prior reseach topics in data broadcasting are mainly based on the assumption that the disseminated data items are of the same size. We explore in this paper the problem of generating broadcast programs in a diverse data broadcasting environment, in which disseminated data items can be of different sizes. Given the broadcast database and the channel number, we propose algorithms DRP (Dimemsion Reduction Partitioning) to perform the channel allocation for each data item. Moreover, a Cost-Diminishing Selection mechanism is also used to help DRP achieve the local optimum with low complexity. With the capability of generating effective broadcast programs efficiently, the proposed mechanism can be practically used in a diverse data broadcasting environment.