.png){kind=icon}
返回
Asynchronous Distributed Greedy Link Scheduling in Multihop Wireless Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2018.2864091.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of link scheduling in multihop wireless networks subject to interference constraints. We consider a graph-based representation it wireless networks where scheduled links adhere to the K-hop link interference model. For this scheduling problem. we develop an asynchronous and distributed greedy heuristic. Furthermore, we show that this distributed heuristic computes the exact same schedule as the well-known centralized greedy link scheduling algorithm.
Keyword:
Wireless link scheduling
greedy heuristic
distributed algorithm
asynchronous algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
.png){kind=icon}
分享收藏
Adaptive Instantiation of the Protocol Interference Model in Wireless Networked Sensing and Control
PREAI
分享收藏
没有更多内容
没有更多内容