摘要
为减少多信道数据广播环境中的多信道平均延迟时间,提出一种基于贪心策略的多信道数据广播调度算法,将数据项合理地分配到各信道,最小化多信道数据项平均访问时间,在每个信道内采用近似最优的Log-time算法。实验结果表明,在不同的系统环境下,该算法都能够达到近似最优的性能。
In order to reduce the multi-channel average delay time in multi-channel data broadcast, this paper proposes a multi-channel data broadcast schedule algorithm based on greedy strategy, a multi-channel data allocation method that rationally allocates data items to different channels in order to minimize the Multi-channel Average Expected Delay（MCAED）. And within each channel, the Log-time algorithm which is supposed to he optimal in single channel is adopted. Experimental results show that the algorithm can get the near-optimal solution under a variety of circumstances.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第12期179-181,共3页
Computer Engineering
基金
国家"973"计划基金资助项目(2005CB321903)
中国下一代互联网示范工程基金资助项目(CNGI-09-01-10)
关键词
移动计算
多信道
贪心策略
数据广播
数据调度
mobile computing
multi-channel
greedy strategy
data broadcast
data schedule
