Wireless networks with retransmission diversity access mechanisms: Stable throughput and delay properties

被引:28
作者
Dimic, G [1 ]
Sidiropoulos, ND
Tassiulas, L
机构
[1] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
[2] Tech Univ Crete, Dept Elect & Comp Engn, Iraklion, Greece
[3] Univ Maryland, Dept Elect & Comp Engn, College Pk, MD 20742 USA
基金
美国国家科学基金会;
关键词
random access; signal processing aspects of network protocols; stability;
D O I
10.1109/TSP.2003.814471
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Building on the concept of retransmission diversity, a class of collision resolution protocols [(B)NDMA] has been introduced recently for wireless packet multiple access. These protocols provide the means for improved performance compared with random access and splitting-based collision resolution protocols at a moderate receiver complexity cost. However, stability of these protocols has not been established, and the available steady-state analysis is restricted to symmetric (common-rate) systems. In this paper, the stability region of (B)NDMA is formally analyzed. The tools used in the analysis range from a preliminary dominant system approach to the Foster-Lyapunov recurrence criterion and the (a, p) deterministic fluid arrivals approach. It is rigorously established that maximum stable throughput is close to 1. This is followed by a simpler and more general steady-state analysis, bypassing the earlier generating function approach, using instead only balance equations. This approach allows dealing with asymmetry (multirate systems), yielding expressions for throughput and delay per queue. Finally, we generalize BNDMA and the associated analysis to multicode systems.
引用
收藏
页码:2019 / 2030
页数:12
相关论文
共 17 条
[1]  
Altman E., 1994, P 32 ALL C COMM CONT, P396
[2]   THE STABILITY REGION OF THE FINITE-USER SLOTTED ALOHA PROTOCOL [J].
ANANTHARAM, V .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (03) :535-540
[3]  
[Anonymous], 1979, PROBLEMY PEREDACHI I
[4]  
Asmussen S, 2008, APPL PROBABILITY QUE, V51
[5]  
BACCELLI F, 1993, 2015 INRIA
[6]  
Bertsekas D. P., 1992, DATA NETWORKS
[7]   TREE ALGORITHMS FOR PACKET BROADCAST CHANNELS [J].
CAPETANAKIS, JI .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (05) :505-515
[8]   A CALCULUS FOR NETWORK DELAY .1. NETWORK ELEMENTS IN ISOLATION [J].
CRUZ, RL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (01) :114-131
[9]  
Dimic G, 2000, CONF REC ASILOMAR C, P1230, DOI 10.1109/ACSSC.2000.910759
[10]  
Dimic GZ, 2002, INT CONF ACOUST SPEE, P2133