Cognitive multiple access via cooperation: Protocol design and performance analysis

被引:204
作者
Sadek, Ahmed K. [1 ]
Liu, K. J. Ray [1 ]
Ephremides, Anthony [1 ]
机构
[1] Univ Maryland, Syst Res Inst, Dept Elect & Comp Engn, College Pk, MD 20742 USA
关键词
cooperative communications; delay analysis; diversity techniques; multiple access; queueing theory; relay channel; stability analysis; stability region;
D O I
10.1109/TIT.2007.904784
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a novel cognitive multiple-access strategy in the presence of a cooperating relay is proposed. Exploiting an important phenomenon in wireless networks, source burstiness, the cognitive relay utilizes the periods of silence of the terminals to enable cooperation. Therefore, no extra channel resources are allocated for cooperation and the system encounters no bandwidth losses. Two protocols are developed to implement the proposed multiple-access strategy. The maximum stable throughput region and the delay performance of the proposed protocols are characterized. The results reveal that the proposed protocols provide significant performance gains over conventional relaying strategies such as selection and incremental relaying, specially at high spectral efficiency regimes. The rationale is that the lossless bandwidth property of the proposed protocols results in a graceful degradation in the maximum stable throughput with increasing the required rate of communication. On the other hand, conventional relaying strategies suffer from catastrophic performance degradation because of their inherent bandwidth inefficiency that results from allocating specific channel resources for cooperation at the relay. The analysis reveals that the throughput region of the proposed strategy is a subset of its maximum stable throughput region, which is different from random access, where both regions are conjectured to be identical.
引用
收藏
页码:3677 / 3696
页数:20
相关论文
共 33 条
[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], 1979, PROBLEMY PEREDACHI I
[3]   On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels [J].
Azarian, K ;
El Gamal, H ;
Schniter, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4152-4172
[4]  
Bertsekas D., 1987, DATA NETWORKS
[5]  
Boyd S., CONVEX OPTIMIZATION
[6]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[7]   STABILITY PROPERTIES OF SLOTTED ALOHA WITH MULTIPACKET RECEPTION CAPABILITY [J].
GHEZ, S ;
VERDU, S ;
SCHWARTZ, SC .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1988, 33 (07) :640-649
[8]   On the capture probability for a large number of stations [J].
Hajek, B ;
Krishna, A ;
LaMaire, RO .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1997, 45 (02) :254-260
[9]  
KOBAYASHI M, 2005, P SPAWC 2005 6 IEEE
[10]   Cooperative strategies and capacity theorems for relay networks [J].
Kramer, G ;
Gastpar, M ;
Gupta, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (09) :3037-3063