Responsive image
博碩士論文 etd-0719110-173410 詳細資訊
Title page for etd-0719110-173410
論文名稱
Title
一個使用談判演算法的新合作法則在合作式通訊的研究
A New Cooperative Strategy Using Parley Algorithm for Cooperative Communications.
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
22
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2010-06-11
繳交日期
Date of Submission
2010-07-19
關鍵字
Keywords
功率分配、最佳化、合作式通訊網路
optimal problem, power constrain, Cooperative communication
統計
Statistics
本論文已被瀏覽 5635 次,被下載 0
The thesis/dissertation has been browsed 5635 times, has been downloaded 0 times.
中文摘要
本篇論文的架構主要是合作式通訊網路(cooperative communication) 和協商演算法(parley
algorithm) 的結合。協商演算法的精神, 主要在於結點間的互相溝通, 當然在此包含終端節點
(destination) 。當節點與結點間得到共識時, 才會作出最後的決策。再結點與結點間不斷的傳
輸繼而得到決策的過程中, 我們直觀的認為結點的傳輸功率將會影響整體系統的效能。而我們
在討論工率分配的問題時, 特別將系統的通道容量(capacity) 拿出來做討論。當通道容量達最
大值時的功率分配, 在合作式網路下, 會使得結點間得到共識時的效能提高。且在系統模擬部分
我們也得到相關的驗證, 在有效的功率分配下, 系統的錯誤率相對的比在平均工率分配的錯誤率
還來的低, 則證明此作法的可效性。
Abstract
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.
目次 Table of Contents
1 Introduction 1
2 System Model and Problem Statement 4
2.0.1 Review of parley algorithm . . . . . . . . . . . . . . . . . . . . . . . 4
2.0.2 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . . . . . 6
3 Proposed power allocation for parley algorithm in cooperative networks 8
4 Simulation results 11
5 Conclusion 15
參考文獻 References
[1] A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity-part i: System
description,” IEEE Trans. Commun., vol. 51, no. 11, pp. 1927–1938, November 2003.
[2] Y.-W. Hong, W.-J. Huang, F.-H. Chiu, and C.-C. J. Kuo, “Cooperative communica-
tions in resource-constrained wireless networks,” IEEE Trans. Signal Processing, pp.
47–57, May 2007.
[3] J. Luo, R. S. Blum, L. J. Cimini, L. J. Greenstein, and A. M. Haimovich, “Decode-
and-forward cooperative diversity with power allocation in wireless networks,” IEEE
Trans. Wireless Commun., vol. 6, no. 3, pp. 793 – 799, March 2007.
[4] M. N. Khormuji and E. G. Larsson, “Cooperative transmission based on decode-and-
forward relaying with partial repetition coding,” IEEE Trans. Wireless Commun.,
vol. 8, no. 4, pp. 1716 – 1725, April 2009.
[5] C. K. Lo, S. Vishwanath, and J. Robert W. Heath, “Relay subset selection in wireless
networks using partial decode-and-forward transmission,” IEEE Trans. Commun.
Technol., vol. 58, no. 2, pp. 692–704, February 2009.
[6] M. Kaneko, K. Hayashi, P. Popovski, K. Ikeda, H. Sakai, and R. Prasad, “Amplify-
and-forward cooperative diversity schemes for multi-carrier systems,” IEEE Trans.
Wireless Commun., vol. 7, no. 5, pp. 1845–1850, May 2008.
[7] R. H. Y. Louie, Y. Li, H. A. Suraweera, and B. Vucetic, “Performance analysis of
beamforming in two hop amplify and forward relay networks with antenna correla-
tion,” IEEE Trans. Wireless Commun., vol. 8, no. 6, pp. 3132–3141, June 2009.
[8] W. Mesbah and T. N. Davidson, “Joint power and channel resource allocation for two-
user orthogonal amplify-and-forward cooperation,” IEEE Trans. Wireless Commun.,
vol. 7, no. 11, pp. 4681–4691, November 2008.
[9] P. F. Swaszek and P.Willett, “Parley as an approach to distributed detection,” IEEE
Trans. Aerosp. Electron. Syst., vol. 31, no. 1, pp. 447–457, January 1995.
[10] C. T. K. Ng and A. J. Goldsmith, “The impact of csi and power allocation on relay
channel capacity and cooperation strategies,” IEEE Trans.Wireless Commun., vol. 7,
no. 12, pp. 5380 – 5389, December 2008.
[11] T. Shu and Z. Niu, “Uplink capacity optimization by power allocation for multimedia
cdma networks with imperfect power control,” IEEE Journal of Selected Areas in
Communications, vol. 21, no. 10, pp. 1585–1594, December 2003.
[12] W. Wang and R. Wu, “Capacity maximization for ofdm two-hop relay system with
separate power constraints,” IEEE Trans. Commun. Technol., vol. 58, no. 9, pp.
4943–4954, November 2009.
[13] T. M. Cover and J. A. Thomas, Elements of information theory. United States of
America: Wiley, 1938.
[14] A. Dua, K. Medepalli, and A. J. Paulraj, “Receive antenna selection in mimo systems
using convex optimization,” IEEE Trans. Wireless Commun., vol. 5, no. 9, pp. 2353–
2357, September 2006.
[15] S. Boyd and L. Vandenberghe, Convex Optimization. New York: Cambredge uni-
versity press, 2004.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內校外均不公開 not available
開放時間 Available:
校內 Campus:永不公開 not available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 3.141.2.96
論文開放下載的時間是 校外不公開

Your IP address is 3.141.2.96
This thesis will be available to you on Indicate off-campus access is not available.

紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code