首页> 外文期刊>Networking, IEEE/ACM Transactions on >Low-Complexity Distributed Scheduling Algorithms for Wireless Networks
【24h】

Low-Complexity Distributed Scheduling Algorithms for Wireless Networks

机译:无线网络的低复杂度分布式调度算法

获取原文
获取原文并翻译 | 示例

摘要

We consider the problem of designing distributed scheduling algorithms for wireless networks. We present two algorithms, both of which achieve throughput arbitrarily close to that of maximal schedules, but whose complexity is low due to the fact that they do not necessarily attempt to find maximal schedules. The first algorithm requires each link to collect local queue-length information in its neighborhood, and its complexity is otherwise independent of the size and topology of the network. The second algorithm, presented for the node-exclusive interference model, does not require nodes to collect queue-length information even in their local neighborhoods, and its complexity depends only on the maximum node degree in the network.
机译:我们考虑为无线网络设计分布式调度算法的问题。我们提出了两种算法,这两种算法都可以实现任意接近最大调度程序的吞吐量,但是由于它们不必尝试查找最大调度程序,因此其复杂度较低。第一种算法要求每个链路在其附近收集本地队列长度信息,否则它的复杂性与网络的大小和拓扑无关。针对节点专有干扰模型提出的第二种算法不需要节点即使在其本地附近也可以收集队列长度信息,并且其复杂度仅取决于网络中的最大节点程度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号