Data networks (2nd ed.)
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Stability of N interacting queues in random-access systems
IEEE Transactions on Information Theory
Secure Communication Over Fading Channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In this paper, we consider the standard discrete-time slotted ALOHA with a finite number of terminals with infinite size buffers. In our study, we jointly consider the stability of this system together with the physical layer security. We conduct our studies on both dominant and original systems, where in a dominant system each terminal always has a packet in its buffer unlike in the original system. For N = 2, we obtain the secrecy-stability regions for both dominant and original systems. Furthermore, we obtain the transmission probabilities, which optimize system throughput. Lastly, this paper proposes a new methodology in terms of obtaining the joint stability and secrecy regions.