Delay Analysis of Cooperative Truncated HARQ With Opportunistic Relaying

被引:42
作者
Boujemaa, Hatem [1 ]
机构
[1] SupCom, Higher Sch Commun Tunis, High Data Rate Commun Tech & Audio Proc TECHTRA R, Ariana 2083, Tunisia
关键词
Cooperative communications; hybrid automatic repeat request (HARQ); Nakagami-m channel; opportunistic relaying; HYBRID ARQ SCHEME; PERFORMANCE; CODES; PROTOCOLS; NETWORKS; TIME;
D O I
10.1109/TVT.2009.2027329
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
080906 [电磁信息功能材料与结构]; 082806 [农业信息与电气工程];
摘要
In this paper, we evaluate the delay experienced by Poisson arriving packets for cooperative truncated hybrid automatic repeat request (HARQ) with opportunistic relaying. We derive the theoretical expressions of the expected waiting time and the packet's sojourn time in the queue of truncated opportunistic cooperative ARQ, HARQ I with and without packet combining (PC), and HARQ II with code combining (CC). The analysis is valid for block Nakagami-m fading channels and any number of relays for both amplify-and-forward (AF) and decode-and-forward (DF) relaying. In opportunistic AF cooperative HARQ, packet retransmission is done by the relay offering the highest instantaneous signal-to-noise ratio (SNR) of the relaying link (source-relay-destination). In opportunistic DF cooperative HARQ, retransmission is done by the relay offering the highest instantaneous SNR of the relay-destination link among the relays that have correctly decoded the transmitted packet by the source. If no relay has correctly decoded, the retransmission is made by the source. Simulation results are also provided to verify the tightness of the derived expressions. The results indicate a significant improvement of packet delivery delays when compared with the absence of cooperation.
引用
收藏
页码:4795 / 4804
页数:10
相关论文
共 25 条
[1]
Exact symbol error probability of a cooperative network in a Rayleigh-Fading environment [J].
Anghel, PA ;
Kaveh, M .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2004, 3 (05) :1416-1421
[2]
[Anonymous], IEEE J SEL AREAS COM
[3]
Selection cooperation in multi-source cooperative networks [J].
Beres, Elzbieta ;
Adve, Raviraj .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2008, 7 (01) :118-127
[4]
Delay models of single-source single-relay cooperative ARQ protocols in slotted radio networks with Poisson frame arrivals [J].
Cerutti, Isabella ;
Fumagalli, Andrea ;
Gupta, Puja .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2008, 16 (02) :371-382
[5]
Pollaezek-Khinchin formula for the M/G/1 queue in discrete time with vacations [J].
Chan, WC ;
Lu, TC ;
Chen, RJ .
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1997, 144 (04) :222-226
[6]
ELBAHRI MW, 2005, P GRETSI LOUV LA NEU
[7]
Distributed linear convolutive space-time codes for asynchronous cooperative communication networks [J].
Guo, Xiaoyong ;
Xia, Xiang-Gen .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2008, 7 (05) :1857-1861
[8]
Recursive method for generating weight enumerating functions of trellis codes [J].
Huang, XL ;
Phamdo, N ;
Ping, L .
ELECTRONICS LETTERS, 2001, 37 (12) :773-774
[9]
Performance of multiple-relay cooperative diversity systems with best relay selection over Rayleigh fading channels [J].
Ikki, Salama S. ;
Ahmed, Mohamed H. .
EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2008, 2008 (1)
[10]
GENERALIZED TYPE-II HYBRID ARQ SCHEME USING PUNCTURED CONVOLUTIONAL CODING [J].
KALLEL, S ;
HACCOUN, D .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1990, 38 (11) :1938-1946