Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/16746
Title: Dynamic resource allocation for energy-constrained wireless networks over time-varying channels
Authors: ZHANG XIAOLU
Keywords: dynamic resource allocation; wireless networks; convex optimization; utility; relay;OFDM
Issue Date: 17-Mar-2009
Source: ZHANG XIAOLU (2009-03-17). Dynamic resource allocation for energy-constrained wireless networks over time-varying channels. ScholarBank@NUS Repository.
Abstract: The focus of this thesis is on the establishment of a theoretical framework on dynamic resource allocation for energy-constrained wireless networks over time-varying channels. This framework chooses the end-user application needs as the optimization objective, establishes the theoretically optimal performance benchmark under system constraints, and designs solution that is easy to be integrated in practice systems using mathematical tools. This framework is applied to different network situations including infrastructure-based wireless network, wireless sensor network (WSN) and OFDM-based multi-hop network. We attempt to address the following three questions: 1) How to jointly optimize average rate and rate oscillation in variable-rate wireless networks; 2) How to jointly design quantization and transmission for lifetime maximization in WSNs; 3) how to minimize end-to-end outage and maximize average rate in OFDM-based relay networks. All above problems are investigated using convex optimization-based approaches. The optimization results will provide an innovative insight into the design of wireless resource allocation.
URI: http://scholarbank.nus.edu.sg/handle/10635/16746
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
ZHANGXiaolu.pdf1.24 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

248
checked on Dec 11, 2017

Download(s)

218
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.