1687 search results - page 28 / 338 » On the complexity of scheduling in wireless networks |
ICDCN
2010
Springer
15 years 4 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...
111
click to vote
CORR
2011
Springer
14 years 1 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 3 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...
VTC
2006
IEEE
15 years 3 months ago
2006
IEEE
— We propose a new multicast scheduling scheme which can achieve the proportional fair (PF) allocation in the wireless cellular systems. In case of multicast, the scheduler in th...
VTC
2008
IEEE
15 years 3 months ago
2008
IEEE
— Sensor networks with a large amount of sensor nodes usually have high redundancy in sensing coverage. The network lifetime can be further extended by proper scheduling and putt...