Mobile wireless computing: challenges in data management
Communications of the ACM
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
“Data in your face”: push technology in perspective
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
A study on channel allocation for data dissemination in mobile computing environments
Mobile Networks and Applications - Special issue: resource management in mobile wireless communication networks
Broadcast protocols to support efficient retrieval from databases by mobile users
ACM Transactions on Database Systems (TODS)
Scheduling data broadcast to “impatient” users
Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
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
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Efficient Data Allocation over Multiple Channels at Broadcast Servers
IEEE Transactions on Computers
Data Allocation on Wireless Broadcast Channels for Efficient Query Processing
IEEE Transactions on Computers
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Adaptive Data Broadcast in Hybrid Networks
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Channel allocation methods for data dissemination in mobile computing environments
HPDC '97 Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing
Broadcast on Demand: Efficient and Timely Dissemination of Data in Mobile Environments
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
Multi-Level Multi-Channel Air Cache Designs for Broadcasting in a Mobile Environment
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Optimal Index and Data Allocation in Multiple Broadcast Channels
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Dynamic Data Broadcasting with Traffic Awareness
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
IEEE Transactions on Knowledge and Data Engineering
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel
IEEE Transactions on Computers
Time-Constrained Service on Air
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation
IEEE Transactions on Parallel and Distributed Systems
Design and Performance Evaluation of Broadcast Algorithms for Time-Constrained Data Retrieval
IEEE Transactions on Knowledge and Data Engineering
On-demand broadcast for multiple-item requests in a multiple-channel environment
Information Sciences: an International Journal
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Efficient Approximation Algorithm for Data Retrieval with Conflicts in Wireless Networks
Proceedings of International Conference on Advances in Mobile Computing & Multimedia
Hi-index | 0.00 |
We study the problem of disseminating data of time-constrained services through multiple broadcast channels. By time-constrained services, we mean those services whose data must reach clients before a certain constrained time. Otherwise, the data would become useless or substantially less valuable to the clients. We first explore the difficulties of solving the problem and derive the theoretical minimum number of channels required for the task. Then, we propose a transformation-based data allocation (TDA) algorithm that guarantees to fulfill the task (i.e., all requested data reach the clients within the constrained time) by using the minimum number of channels. Finally, we analyze the computation complexity and prove the validity and optimality of the TDA algorithm.