1783 search results - page 39 / 357 » Low-Complexity Distributed Scheduling Algorithms for Wireles... |
110
click to vote
QSHINE
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper presents two new layer 4 fairness measures, the worst case TCP fairness index and the TCP fairness index. The purpose of the two indices is to measure the performance o...
109
Voted
INFOCOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
144
click to vote
COMSUR
2011
14 years 1 months ago
2011
Abstract—We provide an overview of link scheduling algorithms in Spatial Time Division Access (STDMA) wireless mesh networks. These algorithms can be classified into three categ...
124
click to vote
ITRE
2005
IEEE
15 years 7 months ago
2005
IEEE
— Wireless networks are characterized by bursty and location-dependent errors. Although many fair scheduling methods have been proposed to address these issues, most of them assu...
TIT
2008
15 years 1 months ago
2008
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...