Probability Models for the Splitting Algorithm in Wireless Access Networks with Multipacket Reception and Finite Nodes

Authors:
Rung-Hung Gau;Kuan-Mei Chen
Affiliations:
National Sun Yat-Sen University, Kaohsiung;National Sun Yat-Sen University, Kaohsiung
Venue:
IEEE Transactions on Mobile Computing
Year:
2008

Citing 0
Cited 3

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
Modeling the slotted nonpersistent CSMA protocol for wireless access networks with multiple packet reception

IEEE Communications Letters
A distributed contention resolution algorithm in multi-packet reception ALOHA systems

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an analytical approach for performance evaluation of the classic tree/stack splitting algorithm in an interference-dominating wireless access network with random traffic and finite nodes. In an interference-dominating wireless access network, a receiver could simultaneously receive multiple packets from a variety of transmitters, as long as the signal-to-interference-plus-noise ratio exceeds a predetermined threshold. We use discrete-time Markov chains and regenerative processes to derive the throughput curve, the packet blocking probability, the average system size, and the average packet delay. We show that the exact performance of the splitting algorithm depends on the total number of nodes in the network. We verify our numerical results by rigorous mathematical proof and computer simulations.