R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation
IEEE Transactions on Parallel and Distributed Systems
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
ER: efficient retransmission scheme for wireless LANs
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Multi-data Delivery Based on Network Coding in On-demand Broadcast
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
On Bandwidth-Efficient Data Broadcast
IEEE Transactions on Knowledge and Data Engineering
Data Broadcast with Adaptive Network Coding in Heterogeneous Wireless Networks
IEEE Transactions on Mobile Computing
Information Sciences: an International Journal
RTCSA '09 Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Batch scheduling for demand-driven servers in wireless environments
Information Sciences: an International Journal
On the performance of real-time multi-item request scheduling in data broadcast environments
Journal of Systems and Software
On-demand broadcast for multiple-item requests in a multiple-channel environment
Information Sciences: an International Journal
Scheduling time-critical requests for multiple data objects in on-demand broadcast
Concurrency and Computation: Practice & Experience
Processing generalized k-nearest neighbor queries on a wireless broadcast stream
Information Sciences: an International Journal
Information Sciences: an International Journal
Location-aware private service discovery in pervasive computing environment
Information Sciences: an International Journal
| Hi-index | 0.07 |
On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and the ability to handle dynamic user access patterns. In traditional on-demand broadcast, only one data item can be retrieved by mobile clients during the course of each broadcast, which limits bandwidth utilization and throughput. In this paper, we consider data broadcast with network coding in on-demand broadcast environments. We analyze the coding problem in on-demand broadcast and transform it into the problem of finding the maximum clique in graph theory. Based on our analysis, we first propose a new coding strategy called AC, which exploits the cached information related to clients and data items requested by them, to implement a flexible coding mechanism. Then, based on AC, we propose two novel coding assisted algorithms called ADC-1 and ADC-2 which consider data scheduling, in addition to network coding. In ADC-1 data scheduling and coding are considered separately, while these two factors are fully integrated in ADC-2. The performance gain of our proposed algorithms over traditional and other coding assisted broadcast algorithms is demonstrated through simulation results. Our algorithms not only reduce request response time but also utilize broadcast channel bandwidth more efficiently.