摘要
Owing to its potential to satisfy all outstanding requests for the same data item with a single response, on-demand data broadcast becomes a widely accepted approach to dynamic and scalable wireless information dissemination. In some emerging applications, such as road traffic navigation system, users prefer to request multiple dependent data items at a time. In addition, requests usually have deadline constraints for real-time applications. However, in existing works, clients will not know that their requests cannot be satisfied until the deadlines expire. In this paper, admission control is introduced to data broadcast systems such that clients can be informed in advance in the case that their requests have no hope to be satisfied so that earlier remedial actions can be taken. Furthermore, a matching based allocation scheme is proposed to maximize data sharing among requests in multi-channel architectures. Simulation results show that our proposed algorithms have better performance and quality of service (QoS) than traditional algorithms.
| 源语言 | 英语 |
|---|---|
| 页 | 202-211 |
| 页数 | 10 |
| DOI | |
| 出版状态 | 已出版 - 2012 |
| 已对外发布 | 是 |
| 活动 | 18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012 - Seoul, 韩国 期限: 19 8月 2012 → 22 8月 2012 |
会议
| 会议 | 18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012 |
|---|---|
| 国家/地区 | 韩国 |
| 市 | Seoul |
| 时期 | 19/08/12 → 22/08/12 |
指纹
探究 'Admission control and channel allocation of multi-item requests for real-time data broadcast' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver