Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/91825
DC FieldValueLanguage
dc.contributor張敏寬zh_TW
dc.contributorMin-Kuan Changen_US
dc.contributor.authorChih-Sheng Liuen_US
dc.contributor.author劉稚聖zh_TW
dc.contributor.other通訊工程研究所zh_TW
dc.date2013zh_TW
dc.date.accessioned2015-12-11T07:30:48Z-
dc.identifier.citation[1] J. Boyer, D. D. Falconer, and H. Yanikomeroglu, “Multihop diversity in wireless relaying channels,” Communications, IEEE Transactions on, vol. 52, no. 10, pp. 1820–1830, 2004. [2] Z. Yi and I.-M. Kim, “Relay ordering in a multi-hop cooperative diversity network,” Communications, IEEE Transactions on, vol. 57, no. 9, pp. 2590– 2596, 2009. [3] M. O. Hasna and M.-S. Alouini, “Outage probability of multihop transmission over nakagami fading channels,” Communications Letters, IEEE, vol. 7, no. 5, pp. 216–218, 2003. [4] H. Xu and B. Li, “Seen as stable marriages,” in INFOCOM, 2011 Proceedings IEEE. IEEE, 2011, pp. 586–590. [5] P. A. Anghel and M. Kaveh, “Exact symbol error probability of a cooperative network in a rayleigh-fading environment,” Wireless Communications, IEEE Transactions on, vol. 3, no. 5, pp. 1416–1421, 2004. [6] T. E. Hunter, S. Sanayei, and A. Nosratinia, “Outage analysis of coded cooperation,” Information Theory, IEEE Transactions on, vol. 52, no. 2, pp. 375–391, 2006. [7] Y. Zhao, R. Adve, and T. J. Lim, “Symbol error rate of selection amplify-andforward relay systems,” Communications Letters, IEEE, vol. 10, no. 11, pp. 757–759, 2006. [8] A. Bletsas, H. Shin, and M. Z. Win, “Outage optimality of opportunistic amplify-and-forward relaying,” Communications Letters, IEEE, vol. 11, no. 3, pp. 261–263, 2007. [9] A. S. Ibrahim, A. K. Sadek, W. Su, and K. R. Liu, “Cooperative communications with relay-selection: when to cooperate and whom to cooperate with?” Wireless Communications, IEEE Transactions on, vol. 7, no. 7, pp. 2814–2827, 2008. [10] A. Nosratinia, T. E. Hunter, and A. Hedayat, “Cooperative communication in wireless networks,” Communications Magazine, IEEE, vol. 42, no. 10, pp. 74–80, 2004. [11] A. Bletsas, A. Khisti, D. P. Reed, and A. Lippman, “A simple cooperative diversity method based on network path selection,” Selected Areas in Commu- nications, IEEE Journal on, vol. 24, no. 3, pp. 659–672, 2006. [12] G. K. Karagiannidis, T. A. Tsiftsis, and R. K. Mallik, “Bounds for multihop relayed communications in nakagami-m fading,” Communications, IEEE Transactions on, vol. 54, no. 1, pp. 18–22, 2006. [13] M. O. Hasna and M.-S. Alouini, “End-to-end performance of transmission systems with relays over rayleigh-fading channels,” Wireless Communications, IEEE Transactions on, vol. 2, no. 6, pp. 1126–1131, 2003.zh_TW
dc.identifier.urihttp://hdl.handle.net/11455/91825-
dc.description.abstract在本篇論文中,我們先假設第一種演算法:在無線網路合作式通訊多點網路之中繼點排序之演算法。 此演算法減少了中繼點的使用比較先前的研究中之演算法。 接下來,為了更進一步減少幫助傳輸之中繼點。我們提出了第二種演算法: 在無線網路合作式通訊多點網路之中繼點排序之演算法,改變了選取無線網路合作式通訊多點網路中幫助傳輸的中繼點之機制。 確實的第二種無線網路合作式通訊多點網路之中繼點排序之演算法更近一步地減少了中繼點的使用上較第一種演算法。 接下來,我們提出了第三種演算法:二階段穩態配對方法演算法運用於無線網路合作式通訊多點網路之中繼點排序,此穩態配對方法通常用作解決資源最佳化運用或者是運用於賽局理論中。 在一個有著多個中繼點之無線網路合作式通訊網路中,我們利用模擬去得到這些無線網路合作式通訊多點網路之中繼點排序之性能經由終端到終端的信號對雜信比率之表示式。 這些分析以及數據化的結果演示這三種無線網路合作式通訊多點網路之中繼點排序對於幫助傳輸信號的中繼點之選取機制會在下方表示出。 最後,這些模擬的結果會以圖式的方式去表示出我們所假設這些無線網路合作式通訊多點網路之中繼點排序之幫助傳輸中繼點選取機制的性能。zh_TW
dc.description.abstractIn this paper,we first propose Algorithm of relay ordering for a wireless multihop cooperative diversity network. This Algorithm of relay ordering reduce the relay used than present research. Furthermore, for reduce the relay used more another step. We second propose another Algorithm of relay ordering in a different relay selection mechanism. Indeed the second Algorithm of relay ordering reduce more relay used than the first Algorithm. In the other hand we third propose two-stage stable matching algorithm of relay ordering which base on the stable matching framework in solving networking problem, which are traditionally solved using utility-based optimization or game theory. For a cooperative network with multiple relays, we simulate to performance of these Algorithm by using an approximate end-to-end signal-to-noise ratio expression. The analysis and the numerical results demonstrate that these selection mechanism of relay ordering shown below. Finally, the simulation results illustrate the performance of the proposed relay selection mechanism.en_US
dc.description.tableofcontents1. Introduction 1 2. System Model 4 3. Relay Ordering for Multi-Hop Networks 6 3.1. Algorithm 1 Algorithm of Relay Ordering: . . . . . . . . . . . . . . . 7 3.2. Algorithm 2 Algorithm of Relay Ordering: . . . . . . . . . . . . . . . 10 3.3. Algorithm 3 Two-Stage Matching Algorithm of Relay Ordering: . . . 14 3.4. Algorithm 4 Two-Stage Matching Algorithm of Relay Ordering Matching Stage: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 3.5. Algorithm 5 Two-Stage Stable Matching Algorithm of Relay Ordering - Construction of Transmission Sequence: . . . . . . . . . . . . . . . . 18 4. Simulation Results 19 5. Conclusion 26 Bibliography 29zh_TW
dc.language.isoen_USzh_TW
dc.rights不同意授權瀏覽/列印電子全文服務zh_TW
dc.subjectrelayen_US
dc.subject中繼點zh_TW
dc.title中繼點排序問題之研究zh_TW
dc.titleStudy in relay ordering in wireless cooperative communication systemen_US
dc.typeThesis and Dissertationen_US
dc.date.paperformatopenaccess2016-10-09zh_TW
dc.date.openaccess10000-01-01-
item.openairetypeThesis and Dissertation-
item.fulltextwith fulltext-
item.cerifentitytypePublications-
item.grantfulltextrestricted-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en_US-
Appears in Collections:通訊工程研究所
Files in This Item:
File SizeFormat Existing users please Login
nchu-102-7100093013-1.pdf478.38 kBAdobe PDFThis file is only available in the university internal network    Request a copy
Show simple item record
 

Google ScholarTM

Check


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