Sciweavers

140 search results - page 1 / 28
» Limitations of Current Wireless Scheduling Algorithms
Sort
View
RTS
2011
123views more  RTS 2011»
12 years 11 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
PIMRC
2008
IEEE
13 years 11 months ago
An adaptive holdoff algorithm based on node state for IEEE 802.16 mesh mode with coordinated distributed scheduling
Wireless mesh networks (WMNs) are one of the key features of beyond 3G system because of their flexible and lowcost deployment. IEEE 802.16 mesh mode has recently emerged as an alt...
Bong Chan Kim, Dong Gu Kwak, Heecheol Song, Hwang ...
ICC
2009
IEEE
200views Communications» more  ICC 2009»
13 years 11 months ago
Fast Distributed Multi-Cell Scheduling with Delayed Limited-Capacity Backhaul Links
— Both fast scheduling and spatial signal processing have proven to be capacity-increasing methods in wireless communication systems. However, when applied in the downlink of a c...
Ralf Bendlin, Yih-Fang Huang, Michel T. Ivrlac, Jo...
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 4 months ago
How Much Multiuser Diversity is Required for Energy Limited Multiuser Systems?
Multiuser diversity (MUDiv) is one of the central concepts in multiuser (MU) systems. In particular, MUDiv allows for scheduling among users in order to eliminate the negative effe...
Youngwook Ko, Sergiy A. Vorobyov, Masoud Ardakani
ICC
2008
IEEE
109views Communications» more  ICC 2008»
13 years 11 months ago
Wireless Scheduling Algorithms with O(1) Overhead for M-Hop Interference Model
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
Yung Yi, Mung Chiang