Achieving Maximum Throughput in Random Access Protocols with Multipacket Reception

被引:28
作者
Bae, Yun Han [1 ]
Choi, Bong Dae [1 ]
Alfa, Attahiru S. [2 ]
机构
[1] Sangmyung Univ, Dept Math Educ, Seoul 110743, South Korea
[2] Univ Manitoba, Dept Elect & Comp Engn, Winnipeg, MB R3T 2N2, Canada
基金
新加坡国家研究基金会; 加拿大自然科学与工程研究理事会;
关键词
Multipacket reception; slotted-Aloha; CSMA; optimal transmission probability; WLAN; 802.11; DCF; PERFORMANCE ANALYSIS; SLOTTED ALOHA; WIRELESS LANS; IEEE-802.11; DELAY; CAPABILITY; STABILITY; NETWORKS; BACKOFF; CHANNEL;
D O I
10.1109/TMC.2012.254
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper considers random access protocols with multipacket reception (MPR), which include both slotted-Aloha and slotted tau-persistent CSMA protocols. For both protocols, each node makes a transmission attempt in a slot with a given probability. The goals of this paper are to derive the optimal transmission probability maximizing a system throughput for both protocols and to develop a simple random access protocol with MPR, which achieves a system throughput close to the maximum value. To this end, we first obtain the optimal transmission probability of a node in the slotted-Aloha protocol. The result provides a useful guideline to help us develop a simple distributed algorithm for estimating the number of active nodes. We then obtain the optimal transmission probability in the tau-persistent CSMA protocol. An in-depth study on the relation between the optimal transmission probabilities in both protocols shows that under certain conditions the optimal transmission probability in the slotted-Aloha protocol is a good approximation for the tau-persistent CSMA protocol. Based on this result, we propose a simple tau-persistent CSMA protocol with MPR which dynamically adjusts the transmission probability tau depending on the estimated number of active nodes, and thus can achieve a system throughput close to the maximum value.
引用
收藏
页码:497 / 511
页数:15
相关论文
共 24 条
[1]  
[Anonymous], 2007, 80211 IEEE WG LANMAN
[2]  
[Anonymous], 2003, 8021542003 IEEE
[3]  
Bianchi DE, 2005, IEEE COMMUN LETT, V9, P765, DOI [10.1109/LCOMM.2005.1496609, 10.1109/LCOMM.2005.08029]
[4]   Performance analysis,of the IEEE 802.11 distributed coordination function [J].
Bianchi, G .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (03) :535-547
[5]   IEEE 802.11 protocol:: Design and performance evaluation of an adaptive backoff mechanism [J].
Calì, F ;
Conti, M ;
Gregori, E .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (09) :1774-1786
[6]  
Chan D.S., 2004, P ALL C COMM CONTR C
[7]  
Chan D.S., 2004, P REC 38 AS C SIGN S
[8]   Probability Models for the Splitting Algorithm in Wireless Access Networks with Multipacket Reception and Finite Nodes [J].
Gau, Rung-Hung ;
Chen, Kuan-Mei .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2008, 7 (12) :1519-1535
[9]  
Gerla M., 1977, P ACM SPEC INT GROUP, P210
[10]   OPTIMAL DECENTRALIZED CONTROL IN THE RANDOM-ACCESS MULTIPACKET CHANNEL [J].
GHEZ, S ;
VERDU, S ;
SCHWARTZ, SC .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1989, 34 (11) :1153-1163