Dual Power Multiple Access with Multipacket Reception using Local CSI

被引:21
作者
Yim, Raymond [1 ]
Mehta, Neelesh B. [1 ,2 ]
Molisch, Andreas F. [1 ,3 ]
Zhang, Jinyun [1 ]
机构
[1] MERL, Cambridge, MA USA
[2] Indian Inst Sci, Elect Commun Eng Dept, Bangalore 560012, Karnataka, India
[3] Univ So Calif, Los Angeles, CA USA
关键词
Splitting algorithms; multiple access; contention; multiple packet reception; collision; power control; successive interference cancelation; receive signal strength indicator; PACKET LENGTHS; ALOHA; DELAY;
D O I
10.1109/TWC.2009.080425
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Contention-based multiple access is a crucial component of many wireless systems. Multiple-packet reception (MPR) schemes that use interference cancellation techniques to receive and decode multiple packets that arrive simultaneously are known to be very efficient. However, the MPR schemes proposed in the literature require complex receivers capable of performing advanced signal processing over significant amounts of soft undecodable information received over multiple contention steps. In this paper, we show that local channel knowledge and elementary received signal strength measurements, which are available to many receivers today, can actively facilitate multi-packet reception and even simplify the interference canceling receiver's design. We introduce two variants of a simple algorithm called Dual Power Multiple Access (DPMA) that use local channel knowledge to limit the receive power levels to two values that facilitate successive interference cancellation. The resulting receiver structure is markedly simpler, as it needs to process only the immediate received signal without having to store and process signals received previously. Remarkably, using a set of three feedback messages, the first variant, DPMA-Lite, achieves a stable throughput of 0.6865 packets per slot. Using four possible feedback messages, the second variant, Turbo-DPMA, achieves a stable throughput of 0.793 packets per slot, which is better than all contention algorithms known to date.
引用
收藏
页码:4078 / 4088
页数:11
相关论文
共 29 条
[1]  
*3GPP, 2007, 25101 3GPP
[2]  
*3GPP, 2007, 45005V790 3GPP
[3]   Exploiting decentralized channel state information for random access [J].
Adireddy, S ;
Tong, L .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (02) :537-561
[4]  
[Anonymous], P FALL JOINT COMP C
[5]  
[Anonymous], 2008, 80216 IEEE
[6]  
CHEZ S, 1988, IEEE T AUTOMATIC CON, V33, P640
[7]   Energy-constrained modulation optimization [J].
Cui, SG ;
Goldsmith, AJ ;
Bahai, A .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2005, 4 (05) :2349-2360
[8]  
Gallager R.G., 1978, Proc. AFOSR Workshop Comm. Theory and Appl, P74
[9]  
GANESAN G, 2006, P GLOB
[10]  
Grimmett Geoffrey, 2020, Probability and Random Processes, V4