Resource allocation for wireless networks: learning, competition and coordination.

Abstract

Lin, Xingqin.Thesis (M.Phil.)--Chinese University of Hong Kong, 2011.Includes bibliographical references (p. 103-109).Abstracts in English and Chinese.Abstract --- p.iAcknowledgement --- p.iiiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Motivation --- p.1Chapter 1.2 --- Background --- p.3Chapter 1.2.1 --- Wireless Communication Schemes --- p.3Chapter 1.2.2 --- Mathematical Preliminaries --- p.8Chapter 1.3 --- Outline of the Thesis --- p.12Chapter 2 --- Learning for Parallel Gaussian Interference Channels --- p.14Chapter 2.1 --- System Model and Problem Formulation --- p.16Chapter 2.2 --- Stochastic Algorithm for Learning --- p.18Chapter 2.2.1 --- Algorithm Design --- p.18Chapter 2.2.2 --- Convergence Analysis --- p.21Chapter 2.3 --- Continuous Time Approximation --- p.26Chapter 2.4 --- Learning with Averaging --- p.28Chapter 2.5 --- Numerical Results --- p.29Chapter 3 --- Power Control for One-to-Many Transmissions --- p.34Chapter 3.1 --- System Model --- p.35Chapter 3.2 --- A GNEP Approach --- p.38Chapter 3.2.1 --- Problem Formulation --- p.38Chapter 3.2.2 --- Preliminary Results --- p.39Chapter 3.3 --- Algorithm Design --- p.42Chapter 3.4 --- Numerical Results --- p.46Chapter 4 --- Flow Allocation in Multiple Access Networks --- p.50Chapter 4.1 --- System Model and Problem Formulation --- p.52Chapter 4.1.1 --- System Model --- p.52Chapter 4.1.2 --- Problem Formulation --- p.53Chapter 4.2 --- Characterization of NE --- p.57Chapter 4.2.1 --- Feasibility Assumption --- p.57Chapter 4.2.2 --- Existence and Uniqueness of NE --- p.58Chapter 4.3 --- Distributed Algorithms Design --- p.60Chapter 4.3.1 --- D-SBRA --- p.60Chapter 4.3.2 --- P-SBRA --- p.61Chapter 4.3.3 --- Best Response and Layered Structure --- p.65Chapter 4.4 --- Performance Evaluation --- p.67Chapter 4.4.1 --- Protocol Evaluation --- p.67Chapter 4.4.2 --- Convergence and Performance --- p.69Chapter 4.4.3 --- Flow Distribution --- p.71Chapter 4.4.4 --- A Grid Network Simulation --- p.73Chapter 5 --- Relay Assignment in Cooperative Networks --- p.76Chapter 5.1 --- System Model and Problem Formulation --- p.77Chapter 5.1.1 --- Three-Node Relay Model --- p.77Chapter 5.1.2 --- Network Model --- p.78Chapter 5.1.3 --- Problem Formulation --- p.78Chapter 5.2 --- Centralized Scheme --- p.80Chapter 5.2.1 --- Generalized Relay Assignment --- p.80Chapter 5.2.2 --- Admission Control --- p.83Chapter 5.2.3 --- Iteration Algorithm and Some Remarks --- p.84Chapter 5.3 --- A Simple Distributed Algorithm --- p.84Chapter 5.4 --- Numerical Results --- p.86Chapter 6 --- Conclusions and Future Work --- p.88Chapter 6.1 --- Conclusions --- p.88Chapter 6.2 --- Future Work --- p.89Chapter A --- Proof of Theorem 21 --- p.93Chapter B --- Proof of Theorem 22 --- p.96Chapter C --- Proof of Proposition 31 --- p.98Chapter D --- Proof of Proposition 44 --- p.101Bibliography --- p.10