Please use this identifier to cite or link to this item:
Study in relay ordering in wireless cooperative communication system
|引用:|| 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.  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.  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.  H. Xu and B. Li, “Seen as stable marriages,” in INFOCOM, 2011 Proceedings IEEE. IEEE, 2011, pp. 586–590.  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.  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.  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.  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.  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.  A. Nosratinia, T. E. Hunter, and A. Hedayat, “Cooperative communication in wireless networks,” Communications Magazine, IEEE, vol. 42, no. 10, pp. 74–80, 2004.  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.  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.  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.|
接下來,為了更進一步減少幫助傳輸之中繼點。我們提出了第二種演算法: 在無線網路合作式通訊多點網路之中繼點排序之演算法,改變了選取無線網路合作式通訊多點網路中幫助傳輸的中繼點之機制。 確實的第二種無線網路合作式通訊多點網路之中繼點排序之演算法更近一步地減少了中繼點的使用上較第一種演算法。
In 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.
|Appears in Collections:||通訊工程研究所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.