Source and channel aware resource allocation for wireless networks
| dc.contributor.advisor | Vishwanath, Sriram | en |
| dc.contributor.committeeMember | Andrews, Jeffrey G. | en |
| dc.contributor.committeeMember | Shakkottai, Sanjay | en |
| dc.contributor.committeeMember | de Veciana, Gustavo | en |
| dc.contributor.committeeMember | Morton, David | en |
| dc.creator | Jose, Jubin | en |
| dc.date.accessioned | 2011-10-21T19:27:56Z | en |
| dc.date.accessioned | 2017-05-11T22:23:35Z | |
| dc.date.available | 2011-10-21T19:27:56Z | en |
| dc.date.available | 2017-05-11T22:23:35Z | |
| dc.date.issued | 2011-08 | en |
| dc.date.submitted | August 2011 | en |
| dc.date.updated | 2011-10-21T19:28:09Z | en |
| dc.description | text | en |
| dc.description.abstract | Wireless networks promise ubiquitous communication, and thus facilitate an array of applications that positively impact human life. At a fundamental level, these networks deal with compression and transmission of sources over channels. Thus, accomplishing this task efficiently is the primary challenge shared by these applications. In practice, sources include data and video while channels include interference and relay networks. Hence, effective source and channel aware resource allocation for these scenarios would result in a comprehensive solution applicable to real-world networks. This dissertation studies the problem of source and channel aware resource allocation in certain scenarios. A framework for network resource allocation that stems from rate-distortion theory is presented. Then, an optimal decomposition into an application-layer compression control, a transport-layer congestion control and a network-layer scheduling is obtained. After deducing insights into compression and congestion control, the scheduling problem is explored in two cross-layer scenarios. First, appropriate queue architecture for cooperative relay networks is presented, and throughput-optimality of network algorithms that do not assume channel-fading and input-queue distributions are established. Second, decentralized algorithms that perform rate allocation, which achieve the same overall throughput region as optimal centralized algorithms, are derived. In network optimization, an underlying throughput region is assumed. Hence, improving this throughput region is the next logical step. This dissertation addresses this problem in the context of three significant classes of interference networks. First, degraded networks that capture highly correlated channels are explored, and the exact sum capacity of these networks is established. Next, multiple antenna networks in the presence of channel uncertainty are considered. For these networks, robust optimization problems that result from linear precoding are investigated, and efficient iterative algorithms are derived. Last, multi-cell time-division-duplex systems are studied in the context of corrupted channel estimates, and an efficient linear precoding to manage interference is developed. | en |
| dc.description.department | Electrical and Computer Engineering | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.slug | 2152/ETD-UT-2011-08-4015 | en |
| dc.identifier.uri | http://hdl.handle.net/2152/ETD-UT-2011-08-4015 | en |
| dc.language.iso | eng | en |
| dc.subject | Networking | en |
| dc.subject | Network control | en |
| dc.subject | Queueing theory | en |
| dc.subject | Rate allocation | en |
| dc.subject | Distributed algorithms | en |
| dc.subject | Wireless communication | en |
| dc.subject | Interference channel | en |
| dc.subject | Capacity | en |
| dc.subject | Multiple antennas | en |
| dc.title | Source and channel aware resource allocation for wireless networks | en |
| dc.type.genre | thesis | en |