Optimal downlink scheduling policies for slotted wireless time-varying channels

Tsibonis, V.; Georgiadis, Leonidas

doi:10.1109/twc.2005.850349

Cited by 17 publications

(23 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The problems of utility-based bandwidth allocation have been studied in [1], [13], [14], [20]. In [13], a set of stationary stochastic processes, which are functions of the channel conditions, are used to model the utilities or performance values achieved by the users in a time-slotted system.…”

Section: Related Workmentioning

confidence: 99%

“…A reward-based multiuser multirate time-varying channel scheduling problem has been addressed in [20]. The communication channel has a finite set of channel states such that each user can send at a certain user-specific rate when the channel is in a certain state.…”

Section: Related Workmentioning

confidence: 99%

“…To realize the rate constraints in the long run, each user is associated with a token counter so that the token arrival rate depends on the sign of the token counter. Similar to [20], the gradient method is employed to choose a user for transmission at a time slot, where the selection function of each user is also a function of the token counter of that user.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks

Cao

Leung²,

Li³

2008

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks

Cao

Leung²,

Li³

2008

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

“…Recently, many researchers have investigated schedulers to maximize throughput with fairness constraints and the tradeoff between throughput and fairness based on different requirement [5,6], some others have investigated the utilitybased resource allocation [7,8]. However, they do not take into account the number of satisfied users.…”

Section: Introductionmentioning

confidence: 99%

A low complexity scheduling for maximizing satisfied users in wireless networks

Uc-Rios

Lara-Rodriguez

2010

2010 4th International Conference on Signal Processing and Communication Systems

View full text Add to dashboard Cite

Traditional scheduling algorithms are focused in maximizing system throughput considering a grade of fairness. However, maximizing the system throughput does not necessarily result in maximizing the number of satisfied users (users with a packet delay below a threshold). More over, the throughput maximization could cause a low grade of fairness. In this paper, we propose a low complexity scheduling algorithm that improves fairness and maximizes the number of satisfied users in the system. The main idea of this algorithm is to find the optimum data transmission rate for each user, based on their statistical channel variations and their required qualities of service (QoS). The algorithm dynamically adapts to the optimum data transmission rate for each user according to their channel variations. We consider a channel gain that reflects the effects of shadowing and multipath fading. The results show that, with this algorithm, the system capacity is increased 10% and the throughput for user in bad channel conditions increased 42% over the Modified Largest Weighted Delay first (M-LWDF) scheduler.

show abstract

“…It reflects practical requirement of causality and realtime decision making given one-step channel prediction. Whether such an optimization necessarily reaches the optimal long-run throughputs requires more profound studies[27,28,29,30,31].…”

mentioning

confidence: 99%

Coordinated load balancing, handoff/cell-site selection, and scheduling in multi-cell packet data systems

Sang¹,

Wang²,

Madihian³

et al. 2006

Wireless Netw

View full text Add to dashboard Cite

We investigate a wireless system of multiple cells, each having a downlink shared channel in support of highspeed packet data services. In practice, such a system consists of hierarchically organized entities including a central server, Base Stations (BSs), and Mobile Stations (MSs). Our goal is to improve global resource utilization and reduce regional congestion given asymmetric arrivals and departures of mobile users, a goal requiring load balancing among multiple cells. For this purpose, we propose a scalable cross-layer framework to coordinate packet-level scheduling, call-level cell-site selection and handoff, and system-level cell coverage based on load, throughput, and channel measurements. In this framework, an opportunistic scheduling algorithm-the weighted Alpha-Rule-exploits the gain of multiuser diversity in each cell independently, trading aggregate (mean) downlink throughput for fairness and minimum rate guarantees among MSs. Each MS adapts to its channel dynamics and the load fluctuations in neighboring cells, in accordance with MSs' mobility or their arrival and departure, by initiating load-aware handoff and cell-site selection. The central server adjusts schedulers of all cells to coordinate their coverage by prompting cell breathing or distributed MS handoffs. Across the whole system, BSs and MSs constantly monitor their load, throughput, or channel quality in order to facilitate the overall system coordination.Our specific contributions in such a framework are highlighted by the minimum-rate guaranteed weighted Alpha-Rule scheduling, the load-aware MS handoff/cell-site selection, and the Media Access Control (MAC)-layer cell breathing. Our evaluations show that the proposed framework can improve global resource utilization and load balancing, resulting in a smaller blocking rate of MS arrivals without extra resources while the aggregate throughput remains roughly the same or improved at the hot-spots. Our simulation tests also show that the coordinated system is robust to dynamic load fluctuations and is scalable to both the system dimension and the size of MS population.

show abstract

Optimal downlink scheduling policies for slotted wireless time-varying channels

Cited by 17 publications

References 27 publications

Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks

Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks

A low complexity scheduling for maximizing satisfied users in wireless networks

Coordinated load balancing, handoff/cell-site selection, and scheduling in multi-cell packet data systems

Contact Info

Product

Resources

About