Upper bound of loss probability in an OFDMA system with randomly located users
Laurent Decreusefond (LTCI), Eduardo Ferraz (LTCI), Philippe Martins, (LTCI)

TL;DR
This paper derives an easily computed upper bound on the probability of communication loss in OFDMA systems caused by insufficient sub-channels, considering random user locations and sub-channel allocations.
Contribution
It introduces a novel method using point process theory to estimate loss probability bounds in OFDMA systems with random user positions and resource allocations.
Findings
Provides a practical upper bound for loss probability
Utilizes point process theory for analysis
Simplifies calculations using moments of sub-carrier requirements
Abstract
For OFDMA systems, we find a rough but easily computed upper bound for the probability of loosing communications by insufficient number of sub-channels on downlink. We consider as random the positions of receiving users in the system as well as the number of sub-channels dedicated to each one. We use recent results of the theory of point processes which reduce our calculations to the first and second moments of the total required number of sub-carriers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Wireless Communication Networks Research · Coding theory and cryptography
