.png){kind=icon}
返回
Low-Complexity Distributed Scheduling Algorithms for Wireless Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TNET.2009.2021609.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Low-complexity and distributed algorithms
maximal scheduling
provable efficiency ratios
wireless scheduling algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
分享收藏分享收藏The effect of substratum on the growth of Terpios, an encrusting sponge which kills corals.png)
Coral Reefs
Coral ReefsIF0
PREAI
分享收藏
查看更多内容