Proceedings of the ninth international conference on Information and knowledge management
A near optimal algorithm for generating broadcast programs on multiple channels
Proceedings of the tenth international conference on Information and knowledge management
Proceedings of the tenth international conference on Information and knowledge management
Handbook of wireless networks and mobile computing
Data Allocation on Wireless Broadcast Channels for Efficient Query Processing
IEEE Transactions on Computers
Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
Minimum Back-Walk-Free Latency Problem
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Query Processing in Broadcasted Spatial Index Trees
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Dynamic leveling: adaptive data broadcasting in a mobile computing environment
Mobile Networks and Applications
Broadcast data allocation for efficient access of multiple data items in mobile environments
Mobile Networks and Applications
Efficient data access to multi-channel broadcast programs
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Dependent Data Broadcasting for Unordered Queries in a Multiple Channel Mobile Environment
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel
IEEE Transactions on Computers
TOSA: a near-optimal scheduling algorithm for multi-channel data broadcast
Proceedings of the 6th international conference on Mobile data management
An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels
Distributed and Parallel Databases
Efficient, Energy Conserving Transaction Processing in Wireless Data Broadcast
IEEE Transactions on Knowledge and Data Engineering
SOM: Dynamic Push-Pull Channel Allocation Framework for Mobile Data Broadcasting
IEEE Transactions on Mobile Computing
Design and Performance Evaluation of Broadcast Algorithms for Time-Constrained Data Retrieval
IEEE Transactions on Knowledge and Data Engineering
Efficient index and data allocation for wireless broadcast services
Data & Knowledge Engineering
A skewed distributed indexing for skewed access patterns on the wireless broadcast
Journal of Systems and Software
MULS: A General Framework of Providing Multilevel Service Quality in Sequential Data Broadcasting
IEEE Transactions on Knowledge and Data Engineering
Efficient heuristics for data broadcasting on multiple channels
Wireless Networks
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast data access and energy-efficient protocol for wireless data broadcast
Wireless Communications & Mobile Computing
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Algebraic data retrieval algorithms for multi-channel wireless data broadcast
Theoretical Computer Science
| Hi-index | 0.01 |
The issue of data broadcast has received much attention in mobile computing. A periodic broadcast of frequently requested data can reduce the workload of the up-link channel and facilitate data access for the mobile user. Since the mobile units usually have limited battery capacity, the minimization of the access latency for the broadcast data is an important problem. The indexing and scheduling techniques on the broadcast data should be considered.In this paper we propose a solution to find the optimal index and data allocation, which minimizes the access latency for any number of broadcast channels. We represent all the possible allocations as a tree in which the optimal one is searched, and propose a pruning strategy based on some properties to greatly reduce the search space. Experiments are performed to show the effectiveness of the pruning strategy. Moreover, we pro-pose two heuristics to solve the same problem when the size of the broadcast data is large.