1505 search results - page 40 / 301 » On wireless network scheduling with intersession network cod... |
128
click to vote
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
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...
ICDCN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. The availability of multiple orthogonal channels in a wireless network can lead to substantial performance improvement by alleviating contention and interference. However...
149
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small...
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
—E-limited (or K-limited) scheduling is attractive because its performance is close to that of the exhaustive scheduling which is proven to be the optimal polling scheme for symm...