Abstract
On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and capability to handle dynamic user access patterns. Previous studies on time-critical on-demand data broadcast were under the assumption that each client requests only one data item at a time. With rapid growth of time-critical information dissemination services in emerging applications, there is an increasing need for systems to support efficient processing of real-time multi-item requests. Little work, however, has considered on-demand broadcast environment with time-critical multi-item requests. In this paper, we investigate the scheduling problem arising in this new environment and observe that existing single item request based algorithms are unable to manage multi-item requests efficiently. Thus, an innovative algorithm that combines the strengths of data item scheduling and request scheduling is proposed. The performance results of our simulation show that the proposed algorithm is superior to other classical algorithms under a variety of circumstances. Our algorithm not only reduces deadline miss ratio of requests, but also saves broadcast channel bandwidth. © 2008 IEEE.
Original language | English |
---|---|
Title of host publication | Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008 |
Pages | 207-216 |
DOIs | |
Publication status | Published - 2008 |
Event | 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008 - Kaohsiung, Taiwan Duration: 25 Aug 2008 → 27 Aug 2008 |
Conference
Conference | 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008 |
---|---|
Country/Territory | Taiwan |
City | Kaohsiung |
Period | 25/08/08 → 27/08/08 |