Abstract

A wireless network with unsaturated traffic and N classes of users sharing a channel under random access is analyzed here. Necessary and sufficient conditions for the network stability are derived, along with simple closed formulas for the stationary packet transmission success probabilities and mean packet delays for all classes under stability conditions. We also show, through simple and elegant expressions, that the channel sharing mechanism in the investigated scenario can be seen as a process of partitioning a well-defined quantity into portions, each portion assigned to each user class, the size of which determined by system parameters and performance metrics of that user class. Using the derived expressions, optimization problems are then formulated and solved to minimize the mean packet delay and to maximize the channel throughput per unit of area. These results indicate that the proposed analysis is capable of assessing the trade-off involved in radio-resource management when different classes of users are considered.

Highlights

  • Efficient use of radio resources has always been an important aspect in the deployment of large-scale wireless communications systems [1]

  • The model presented in the paper considers a scenario where transmitters with buffer communicate with the closest receiver belonging to a son Poisson point process

  • We derived necessary and sufficient conditions for stability in a network with N user classes; we provided simple closed-form expressions for the packet success probability and mean delay

Read more

Summary

INTRODUCTION

Efficient use of radio resources has always been an important aspect in the deployment of large-scale wireless communications systems [1]. Stamatiou and Haenggi [15] investigated the scenario described above, by combining the use of the stochastic dominance technique with stochastic geometry models and queueing theory results They studied the stability and the delay of random networks, where terminals are located according to a Poisson point processes (PPP), and obtained necessary and sufficient conditions for stability in a network with one or two classes of users. Let us assume that (i) the separation distance between a given pair TX - RX is equal to r, (ii) the positions of the interferers (users who will transmit packets in a given time slot) follow a PPP of density λeff, and (iii) every transmitter has the same transmit power. Remark 3: Corollary 1 and Proposition 2 are the simplest and the most meaningful results of the present paper, as they translate the behavior of the network in simple equations, which do not directly depend on the transmission powers

DELAY OPTIMIZATION
Findings
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call