This thesis proposes an alternative cooperating strategy for cooperative communications
through the use of parley algorithm in cooperative communications. When employing
parley algorithm in cooperative communications, the relay nodes and the destination node
need to disseminate and agree on a common decision throughout the cooperation network
via a consensus flooding procedure. In this thesis, a heuristic approach for improving
the performance of the parley algorithm is proposed. This heuristic approach is to design
power allocation method during each iteration of consensus flooding protocol. Specifically,
when distributing the power to each node within the cooperative network, this thesis
adopts the criterion of maximum capacity of the broadcast channel used for consensus
flooding procedures. The simulation result obtained from the investigation of this thesis
shows that the proposed power allocation approach can improve the performance in terms
of bit error rate as compared with the parley algorithm with uniform power allocation,
and, hence, confirms the proposed idea is useful.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0719110-173410 |
| Date | 19 July 2010 |
| Creators | Wu, Wei-Chia |
| Contributors | Jwo-Yuh Wu, Chao-Kai Wen, Chih-Peng Li, Tsang-Yi Wang, Chao-Tan Yu |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0719110-173410 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0034 seconds