國立虎尾科技大學 |

Resource management in QoS-aware wireless cellular networks.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Resource management in QoS-aware wireless cellular networks./
Author:	Zhang, Zhi.
Description:	153 p.
Notes:	Source: Dissertation Abstracts International, Volume: 72-11, Section: B, page: 6955.
Contained By:	Dissertation Abstracts International72-11B.
Subject:	Information Technology. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3468820
ISBN:	9781124839677

Resource management in QoS-aware wireless cellular networks.
Zhang, Zhi.

Resource management in QoS-aware wireless cellular networks. - 153 p.

Source: Dissertation Abstracts International, Volume: 72-11, Section: B, page: 6955.

Thesis (Ph.D.)--Colorado State University, 2011.

Emerging broadband wireless networks that support high speed packet data with heterogeneous quality of service (QoS) requirements demand more flexible and efficient use of the scarce spectral resource. Opportunistic scheduling exploits the time-varying, location-dependent channel conditions to achieve multiuser diversity. In this work, we study two types of resource allocation problems in QoS-aware wireless cellular networks. First, we develop a rigorous framework to study opportunistic scheduling in multiuser OFDM systems. We derive optimal opportunistic scheduling policies under three common QoS/fairness constraints for multiuser OFDM systems---temporal fairness, utilitarian fairness, and minimum-performance guarantees. To implement these optimal policies efficiently, we provide a modified Hungarian algorithm and a simple suboptimal algorithm. We then propose a generalized opportunistic scheduling framework that incorporates multiple mixed QoS/fairness constraints, including providing both lower and upper bound constraints.

ISBN: 9781124839677Subjects--Topical Terms:

845446
Information Technology.

Resource management in QoS-aware wireless cellular networks.
LDR:03141nam 2200337 4500 001 712941
005 20121003100306.5
008 121101s2011 ||||||||||||||||| ||eng d
020 $a 9781124839677
035 $a (UMI)AAI3468820
035 $a AAI3468820
040 $a UMI $c UMI
100 1 $a Zhang, Zhi. $3 845444
245 1 0 $a Resource management in QoS-aware wireless cellular networks.
300 $a 153 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-11, Section: B, page: 6955.
500 $a Adviser: Edwin K.P. Chong.
502 $a Thesis (Ph.D.)--Colorado State University, 2011.
520 $a Emerging broadband wireless networks that support high speed packet data with heterogeneous quality of service (QoS) requirements demand more flexible and efficient use of the scarce spectral resource. Opportunistic scheduling exploits the time-varying, location-dependent channel conditions to achieve multiuser diversity. In this work, we study two types of resource allocation problems in QoS-aware wireless cellular networks. First, we develop a rigorous framework to study opportunistic scheduling in multiuser OFDM systems. We derive optimal opportunistic scheduling policies under three common QoS/fairness constraints for multiuser OFDM systems---temporal fairness, utilitarian fairness, and minimum-performance guarantees. To implement these optimal policies efficiently, we provide a modified Hungarian algorithm and a simple suboptimal algorithm. We then propose a generalized opportunistic scheduling framework that incorporates multiple mixed QoS/fairness constraints, including providing both lower and upper bound constraints.
520 $a Next, taking input queues and channel memory into consideration, we reformulate the transmission scheduling problem as a new class of Markov decision processes (MDPs) with fairness constraints. We investigate the throughput maximization and the delay minimization problems in this context. We study two categories of fairness constraints, namely temporal fairness and utilitarian fairness. We consider two criteria: infinite horizon expected total discounted reward and expected average reward. We derive and prove explicit dynamic programming equations for the above constrained MDPs, and characterize optimal scheduling policies based on those equations. An attractive feature of our proposed schemes is that they can easily be extended to fit different objective functions and other fairness measures. Although we only focus on uplink scheduling, the scheme is equally applicable to the downlink case. Furthermore, we develop an efficient approximation method---temporal fair rollout---to reduce the computational cost.
590 $a School code: 0053.
650 4 $a Information Technology. $3 845446
650 4 $a Engineering, Electronics and Electrical. $3 845382
650 4 $a Operations Research. $3 845447
690 $a 0489
690 $a 0544
690 $a 0796
710 2 $a Colorado State University. $b Electrical & Computer Engineering. $3 845445
773 0 $t Dissertation Abstracts International $g 72-11B.
790 1 0 $a Chong, Edwin K.P., $e advisor
790 1 0 $a Azimi-Sadjadi, Mahmood R. $e committee member
790 1 0 $a Young, Peter M. $e committee member
790 1 0 $a Duff, William S. $e committee member
790 $a 0053
791 $a Ph.D.
792 $a 2011
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3468820