Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/13587

Title: Resource allocation and optimization techniques in wireless relay networks
Authors: Hu, Juncheng
Keywords: Two way relay network
Cognitive radio
Issue Date: 2013
Publisher: © Juncheng Hu
Abstract: Relay techniques have the potential to enhance capacity and coverage of a wireless network. Due to rapidly increasing number of smart phone subscribers and high demand for data intensive multimedia applications, the useful radio spectrum is becoming a scarce resource. For this reason, two way relay network and cognitive radio technologies are required for better utilization of radio spectrum. Compared to the conventional one way relay network, both the uplink and the downlink can be served simultaneously using a two way relay network. Hence the effective bandwidth efficiency is considered to be one time slot per transmission. Cognitive networks are wireless networks that consist of different types of users, a primary user (PU, the primary license holder of a spectrum band) and secondary users (SU, cognitive radios that opportunistically access the PU spectrum). The secondary users can access the spectrum of the licensed user provided they do not harmfully affect to the primary user. In this thesis, various resource allocation and optimization techniques have been investigated for wireless relay and cognitive radio networks.
Description: A Doctoral Thesis. Submitted in partial fulfilment of the requirements for the award of Doctor of Philosophy of Loughborough University.
URI: https://dspace.lboro.ac.uk/2134/13587
Appears in Collections:PhD Theses (Mechanical, Electrical and Manufacturing Engineering)

Files associated with this item:

File Description SizeFormat
Form-2013-Hu.pdf948.2 kBAdobe PDFView/Open
Thesis-2013-Hu.pdf1.84 MBAdobe PDFView/Open


SFX Query

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