.png){kind=icon}
.png){kind=icon}
Return
Generalized p-Persistent CSMA for Asynchronous Multiple-Packet Reception
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2019.2931326.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper considers a multiple-access system with multiple-packet reception (MPR) capability gamma, i.e., a packet can be successfully received as long as it overlaps with gamma - 1 or fewer other packets at any instant during its lifetime. To efficiently utilize the MPR capability, this paper generalizes p-persistent carrier-sense multiple access (CSMA) to consider that a user with carrier sensing capability c adopts the transmission probability p(n) if this user has sensed n ongoing transmissions for n = 0, 1, ..., c - 1. This paper aims to model the characteristics of such CSMA and to design transmission probabilities for achieving maximum saturation throughput. To this end, we first formulate such CSMA as a parameterized Markov decision process (MDP) and use the long-run average performance to evaluate the saturation throughput. Second, by observing that the exact values of optimal transmission probabilities are in general infeasible to find, we modify this MDP to establish an upper bound on the maximum throughput, and modify this MDP again to propose a heuristic design with near-optimal performance. Simulations with respect to a wide range of configurations are provided to validate our study. The throughput performance under more general models and the robustness of our design are also investigated.
Keywords:
Access protocols
multiple-packet reception
performance analysis
Markov decision process
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W