A high-throughput random access protocol for multiuser MIMO systems
Research Letters in Communications - Regular issue
Conflict-resolving tree algorithm stable to incomplete interference damping
Automation and Remote Control
Improved high maximum stable throughput FCFS tree algorithms with interference cancellation
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Wireless networks with retransmission diversity and carrier-sense multiple access
IEEE Transactions on Signal Processing
Design and analysis of a splitting algorithm for a multi-packet reception ALOHA system
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
On the maximum stable throughput of tree algorithms with free access
IEEE Transactions on Information Theory
Interference cancellation tree algorithms with κ-signal memory locations
IEEE Transactions on Communications
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
Random multiple access in a vector disjunctive channel
Problems of Information Transmission
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 754.90 |
Random access is well motivated and has been widely applied when the network traffic is bursty and the expected throughput is not high. The main reason behind relatively low-throughput expectations is that collided packets are typically discarded. In this paper, we develop a novel protocol exploiting successive interference cancellation (SIC) in a tree algorithm (TA), where collided packets are reserved for reuse. Our SICTA protocol can achieve markedly higher maximum stable throughput relative to existing alternatives. Throughput performance is analyzed for general d-ary SICTA with both gated and window access. It is shown that the throughput for d-ary SICTA with gated access is about (ln d)/(d - 1), and can reach 0.693 for d = 2. This represents a 40% increase over the renowned first-come-first-serve (FCFS) 0.487 tree algorithm. Delay performance is also analyzed for SICTA with gated access, and numerical results are provided.