摘要
Data broadcasting is an efficient and highly scalable technique for delivering data to mobile clients in wireless environments. In this paper, we study the problem of scheduling broadcast data that are with an expected time within which the client is expecting to receive the data item. We analyze the problem and derive the minimum number of broadcast channels required for such a task. Also, we discuss the problems when the number of available channels is not enough. We propose novel solutions for both of the cases and the performance study indicates that our method is much better than the previous ones and performs very close to optimal.
| 原文 | English |
|---|---|
| 頁面 | 739-748 |
| 頁數 | 10 |
| 出版狀態 | Published - 2005 一月 1 |
| 事件 | 25th IEEE International Conference on Distributed Computing Systems - Columbus, OH, United States 持續時間: 2005 六月 6 → 2005 六月 10 |
Other
| Other | 25th IEEE International Conference on Distributed Computing Systems |
|---|---|
| 國家 | United States |
| 城市 | Columbus, OH |
| 期間 | 05-06-06 → 05-06-10 |
指紋
All Science Journal Classification (ASJC) codes
- Software
- Hardware and Architecture
- Computer Networks and Communications
引用此文
}
Time-constrained service on air. / Chung, Yu Chi; Chen, Chao-Chun; Lee, Chiang.
2005. 739-748 論文發表於 25th IEEE International Conference on Distributed Computing Systems, Columbus, OH, United States.研究成果: Paper
TY - CONF
T1 - Time-constrained service on air
AU - Chung, Yu Chi
AU - Chen, Chao-Chun
AU - Lee, Chiang
PY - 2005/1/1
Y1 - 2005/1/1
N2 - Data broadcasting is an efficient and highly scalable technique for delivering data to mobile clients in wireless environments. In this paper, we study the problem of scheduling broadcast data that are with an expected time within which the client is expecting to receive the data item. We analyze the problem and derive the minimum number of broadcast channels required for such a task. Also, we discuss the problems when the number of available channels is not enough. We propose novel solutions for both of the cases and the performance study indicates that our method is much better than the previous ones and performs very close to optimal.
AB - Data broadcasting is an efficient and highly scalable technique for delivering data to mobile clients in wireless environments. In this paper, we study the problem of scheduling broadcast data that are with an expected time within which the client is expecting to receive the data item. We analyze the problem and derive the minimum number of broadcast channels required for such a task. Also, we discuss the problems when the number of available channels is not enough. We propose novel solutions for both of the cases and the performance study indicates that our method is much better than the previous ones and performs very close to optimal.
UR - http://www.scopus.com/inward/record.url?scp=27944449332&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=27944449332&partnerID=8YFLogxK
M3 - Paper
AN - SCOPUS:27944449332
SP - 739
EP - 748
ER -