The cooperative relaying scheme is a promising technique for increasing the capacity and reliability of wireless communication.
Even though extensive research has performed in information theoretical aspect, there are still many unresolved practical problems of cooperative relaying system.
This dissertation analyzes the performance of cooperative decode-and-forward (DF) relaying systems in the presence of multiple interferers and improve network throughput for these systems.
We propose and summarize various systems in the view of network topology, transmission structure, and slot allocation.
We present closed-form expressions for the end-to-end outage probability, average symbol-error-probability, average packet-error-probability, and network throughput of the proposed systems.
This dissertation shows that the robustness of the destination against interference is more important than robustness of the relay against interference from an interference management perspective, and increasing the number of branches yields better outage and error performance improvements against shadowing than increasing the number of hops.
In cellular networks, the cooperative diversity systems can outperform the dual-Rx antenna system, but only when the relay is located in a relatively small portion of the total cell area with respect the the destination mobile terminal.
The results also show that since the effective regions of the uplink and the downlink do not overlap, different relays should be utilized for cell sectorization in the uplink and the downlink.
Finally, the proposed variable-slot selection DF scheme can reduce the system complexity and make the maximum throughput point in the low and moderate signal-to-interference-plus-noise ratio region.
Identifer | oai:union.ndltd.org:GATECH/oai:smartech.gatech.edu:1853/45744 |
Date | 16 July 2012 |
Creators | Yu, Hyungseok |
Publisher | Georgia Institute of Technology |
Source Sets | Georgia Tech Electronic Thesis and Dissertation Archive |
Detected Language | English |
Type | Dissertation |
Page generated in 0.0024 seconds