Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/6862
標題: 解碼合作式通訊系統的中繼器選擇機制
A Novel Relay Node Selection for Opportunistic Decode-and-Forward (DF) Cooperative Communication Systems
作者: 彭述珊
Peng, Shu-Shan
關鍵字: Relay Node Selection;解碼合作式;Cooperative Communication Systems;decode-and-forward signal;中繼器選擇機制;合作式通訊系統;解碼-轉送訊號;中繼節點選擇演算法
出版社: 電機工程學系所
引用: [1] A. Sendonaris, E. Erkip, and E. Aazhang, “User cooperation diversity- part I: System description,” IEEE Transactions on Communications, vol. 51, no. 11, pp. 1927-1938, Nov. 2003. [2] ——, “User cooperation diversity- part II: Implementation aspects and performance analysis,” IEEE Transactions on Communications, vol. 51, no. 11, pp. 1939-1948, Nov. 2003. [3] J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: Efficient protocols andoutage behavior,” IEEE Transactions on Information Theory, vol. 50, pp. 3062-3079, Dec. 2004. [4] A. H. Madsen, “Capacity bounds for cooperative diversity,” IEEE Transactions on Information Theory, vol. 52, pp. 1522-1544, Apr. 2006. [5] W. Su, A. K. Sadek, and K. J. R. Liu, “SER performance analysis and optimum power allocation for decode-and-forward cooperation protocol in wireless networks,” in Proc. IEEE WCNC05, Mar. 2005, pp. 984-989. [6] J. Hu and N. C. Beaulieui, “Performance analysis of decode-and-forward relaying with selection combining,” IEEE Communications Letters, vol. 11, no. 6, pp. 489-491, Jun. 2007. [7] B. Maham and A. Hjorungnes, “Asymptotic performance analysis of amplify-and-forward cooperative networks in a nakagami-m fading environment,” IEEE Communications Letters, vol. 13, no. 5, pp. 300-302, May 2009. [8] K. J. R. Liu, A. K. Sadek, W. Su, and A. Kwasinsnski, Cooperative Communications and Networking. New York: Cambridge University Press, 2009. [9] Q. Liu, X. Ma, and G. T. Zhou, “A general diversity gain function and its application in amplify-and-forward cooperative networks,” IEEE Transactions on Signal Processing, vol. 59, no. 2, pp. 859-863, Feb. 2011. [10] Y. Zhao, R. Adve, and T. J. Lim, “Symbol error rate of selection amplify-and-forward relay systems,” IEEE Communications Letters, vol. 10, no. 11, pp. 757-759, Nov. 2006. [11] A. Bletsas, H. Shin, and M. Z. Win, “Outage optimality of opportunistic amplify-and-forward relaying,” IEEE Communications Letters, vol. 11, no. 3, pp. 261-263, Mar. 2007. [12] Y. Zhao, R. Adve, and T. J. Lim, “Improving amplify-and-forward relay networks: optimal power allocation versus selection,” IEEE Transactions on Wireless Communications, vol. 6, no. 8, pp. 3114-3123, Aug. 2007. [13] A. Bletsas, H. Shin, and M. Z. Win, “Cooperative communications with outage-optimal opportunistic relaying,” IEEE Transactions on Wireless Communications, vol. 6, no. 9, pp. 3450-3460, Sep. 2007. [14] I. Krikidis, J. Thompson, S. McLaughlin, and T. J. Lim, “Amplify-and-forward with partial relay selections,” IEEE Communications Letters, vol. 12, no. 4, pp. 235-237, Apr. 2008. [15] Y. Jing and H. Jafarkhani, “Single and multiple relay selection schemes and their achievable diversity orders,” IEEE Transactions on Wireless Communications, vol. 8, no. 3, pp. 1414-1423, Mar. 2009. [16] Z. Fang, X. Zhou, X. Bao, and Z. Wang, “Outage minimized relay selection with partial channel information,” in Proc. IEEE ICASSP2009, Apr. 2009, pp. 2617-2620. [17] S. Chen, W. Wang, and X. Zhang, “Performance analysis of multiuser diversity in cooperative multi-relay networks under Rayleigh-fading channels,” IEEE Transactions on Wireless Communications, vol. 8, no. 7, pp. 3415-3419, Jul. 2009. [18] S. Wu and J. Zhu, “A statistic channel information-based relay selection scheme in cooperative networks,” in Proc. Global Mobile Congress 2009, Oct. 2009, p. 1. [19] K.-S. Hwang, Y.-C. Ko, and M.-S. Alouini, “Performance analysis of incremental opportunistic relaying over identically and non-identically distributed cooperative paths,” IEEE Transactions on Wireless Communications, vol. 8, no. 4, pp. 1536-1276, Apr. 2009. [20] D. B. da Costa and S. A issa, “Performance analysis of relay selection techniques with clustered fixed-gain relays,” IEEE Signal Processing Letters, vol. 17, no. 2, pp. 201-204, Feb. 2010. [21] G. Amarasuriya, M. Ardakani, and C. Tellambura, “Adaptive multiple relay selection scheme for cooperative wireless networks,” in Proc. IEEE WCNC2010, Apr. 2010, pp. 1 - 6. [22] X. Chen, T.-W. Siu, Q. F. Zhou, and F. C. M. Lau, “High-snr analysis of opportunistic relaying based on the maximum harmonic mean selection criterion,” IEEE Signal Processing Letters, vol. 17, no. 8, pp. 719-722, Aug. 2010. [23] Q. Liu, X. Ma, and G. T. Zhou, “A general diversity gain function and its application in amplify-and-forward cooperative networks,” IEEE Transactions on Signal Processing, vol. 59, no. 2, pp. 859-863, Feb. 2011. [24] Y. Chen, C.-X. Wang, H. Xiao, and D. Yuan, “Novel partial selection schemes for af relaying in nakagami-m fading channe,” IEEE Transactions on Vehicular Technology - to be appeared, 2011. [25] A. Bletsas, A. Khisti, D. P. Reed, and A. Lippman, “A simple cooperative diversity method based on network path selection,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 3, pp. 659-672, Mar. 2006. [26] Z. Yi and I.-M. Kim, “Diversity order analysis of the decode-and-forward cooperative networks with relay selection,” IEEE Transactions on Wireless Communications, vol. 7, no. 5, pp. 1792-1799, May 2008. [27] T. Duong and V. Bao, “Performance analysis of selection decode-and-forward relay networks,” IEEE Electronics Letters, vol. 44, no. 20, Sep. 2008. [28] D. S. Michalopoulos and G. K. Karagiannidis, “Performance analysis of single relay selection in rayleigh fading,” IEEE Transactions on Wireless Communications, vol. 7, no. 10, Oct. 2008. [29] A. S. Ibrahim, A. K. Sadek, W. Su, and K. J. R. Liu, “Cooperative communications with relay-selection: When to cooperate and whom to cooperate with?” IEEE Transactions on Wireless Communications, vol. 7, no. 7, pp. 2814-2827, Jul. 2010. [30] N.-E. Wu, W.-C. Huang, and H.-J. Li, “A novel relay selection algorithm for relaying networks,” in Proc. IEEE VTC2009-Fall, Sep. 2009, p. 1. [31] S. S. Ikki and M. H. Ahmed, “Performance analysis of adaptive decode-and-forward cooperative diversity networks with best-relay selection,” IEEE Transactions on Communications, vol. 58, no. 1, pp. 68-72, Jan. 2010. [32] X. Chen, Q. F. Zhou, T.-W. Siu, and F. C. M. Lau, “Asymptotic analysis of opportunistic relaying based on the maxgeneralized-mean selection criterion,” IEEE Transactions on Wireless Communications, vol. 10, no. 4, pp. 1050-1057, Apr. 2011. [33] J. G. Proakis, Digital Communications, 4th ed. McGraw-Hill, 2001 [34] Robert Bacal, “Conflict Prevention In The Workplace: Using Cooperative Communication”, ISBN: 0-9683722-9
摘要: 
在傳統的無線點對點通信,若傳輸通道被阻塞或是連接無效,目的節點無法接收到來源節點之訊息,因此無法保證傳輸過程能順暢且不中斷的溝通。近年來,新的無線網路架構稱「合作式通訊系統」,以互利的原則相互合作,協助彼此傳輸訊息,形成一個多通道的虛擬線路,合作式通訊系統是一種多點通訊網路,各中繼節點在傳輸的過程之中,出現了各種隨機變化性,使目的節點在挑選適合的傳輸中繼節點變得複雜;著眼於此,本文提出一個論點,藉由公式推導及Matlab進行模擬比對,證明此一新演算法可以取得最好的有效路徑。

In the conventional point-to-point wireless communications, if the transmitted channel is blocked or channel link is invalid, the destination node is not able to receive the message from source node, and therefore the continuous communication is not guaranteed in the process of transmission. In recent years, new wireless network scheme known as "cooperative communication system" help each other to relay messages with the principle of mutual benefit cooperatively, and form a multi-channel virtual circuit in order that the wireless network is used more efficiently. The cooperative communication system is a kind of the point-to-point communications network. Because each relay node causes a variety of random variables in the process of transmission, it becomes more complex that the destination node selects the best transmitted relay node.
Base in this, we proposed a new algorithm for finding out the best relay node and we proved it by Matlab simulation.
URI: http://hdl.handle.net/11455/6862
其他識別: U0005-2105201215462200
Appears in Collections:電機工程學系所

Show full item record
 

Google ScholarTM

Check


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