.png){kind=icon}
返回
Link Scheduling Algorithms for Wireless Mesh Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/SURV.2011.040510.00008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Wireless Mesh Networks (WMNs) have the potential of being a cost effective solution to provide connectivity and coverage in both urban and rural areas. Typically, a WMN is a backbone network that carries high data rate traffic and employs Time Division Multiple Access (TDMA) like access mechanisms. For a WMN to provide high throughput, the design of an efficient link scheduling algorithm is of paramount importance. Towards this end, we provide an overview of link scheduling algorithms in Spatial TDMA wireless mesh networks. These algorithms can be classified into three categories: those based only on a communication graph model of the network, those based on a communication graph model and Signal to Interference and Noise Ratio (SINR) threshold conditions at receivers and those based on an SINR graph model of the network. We first outline a framework for modeling STDMA networks. We review representative research works and provide the description of an algorithm from each of these classes. We describe the relative merits and demerits of each class of algorithms and compare their performance via simulations. We conclude with a discussion on practical implementation of these algorithms and open research problems.
Keyword:
Spatial reuse
link scheduling
wireless networks
spatial TDMA
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
46.7
论文数:
1.5K
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏
Implications of the Dominant Role of Transporters in Drug Uptake by Cells (Supplementary Material)
PREAI
分享收藏
查看更多内容