Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/30268
Title: Robust Beamforming for Cognitive and Cooperative Wireless Networks
Authors: EBRAHIM AVAZKONANDEH GHARAVOL
Keywords: Robust Beamforming, Cognitive Radio Wireless Network, Cooperative Wireless Network, Relay, Broadcast Channel, Joint Transceiver Optimization
Issue Date: 19-Jan-2011
Source: EBRAHIM AVAZKONANDEH GHARAVOL (2011-01-19). Robust Beamforming for Cognitive and Cooperative Wireless Networks. ScholarBank@NUS Repository.
Abstract: In this thesis four different problems in the area of the robust beamforming in cognitive and cooperative wireless networks, namely, robust downlink beamforming in cognitive radio networks, robust joint transceiver optimization in MIMO ad hoc networks, and finally robust relay beamforming for both one-way and twoway relay channels, are studied. In these problems, it is assumed that the channel state information is not perfectly known and its imperfection, is modeled using either a Stochastic Error (SE) model or a Norm Bounded Error (NBE) model. In the case of the SE model of uncertainty, the average performance measure and in the case of the NBE model of uncertainty, the worst case performance measures are optimized. In the former case an algorithm containing second order cone programming problems, and in the latter case, an algorithm containing semidefinite programming problems are proposed to perform the beamforming process. Finally, numerical simulations are provided as well to assess the performance of the proposed algorithms.
URI: http://scholarbank.nus.edu.sg/handle/10635/30268
Appears in Collections:Ph.D Theses (Open)

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

OPEN

NoneView/Download

Page view(s)

291
checked on Jan 15, 2018

Download(s)

561
checked on Jan 15, 2018

Google ScholarTM

Check


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