...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of ad hoc and ubiquitous computing >Delay analysis of randomised algorithms for link scheduling in wireless networks
【24h】

Delay analysis of randomised algorithms for link scheduling in wireless networks

机译：无线网络中链路调度的随机算法的时延分析

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

To design a link scheduling algorithm that can maximise the throughput region yet meet the average delay constraint is a challenging issue in wireless networks. In this paper we aim to analyse and improve the delay performance of the well-studied randomised link scheduling algorithms. To this end, we first introduce a novel concept, the average hitting time, and analyse its impact on the upper bound of the average delay. We analytically show that for two given randomised algorithms achieving the same throughput region, the one with a smaller average hitting time has less average delay bound. We also show that by assigning traffic priorities in some specific applications, the achievable throughput region delivered by the randomised algorithm remains intact. This result is much valuable in the design of algorithms for some real-time applications by prioritising the traffic to reduce the average delay of those applications. The simulation results are consistent with our theoretical analysis.
机译：设计一种可以使吞吐量区域最大化但又满足平均延迟约束的链路调度算法是无线网络中的一个难题。本文旨在分析和改善经过充分研究的随机链路调度算法的延迟性能。为此，我们首先介绍一个新颖的概念，即平均击球时间，并分析其对平均延迟上限的影响。我们分析性地表明，对于两种实现相同吞吐量区域的给定随机算法，平均命中时间较小的算法具有较小的平均延迟范围。我们还表明，通过在某些特定应用中分配流量优先级，由随机算法提供的可达到的吞吐量区域将保持不变。通过优先处理流量以减少这些应用程序的平均延迟，此结果对于某些实时应用程序的算法设计非常有价值。仿真结果与我们的理论分析一致。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号