Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Physically Secure and Stable Slotted ALOHA System

Published 28 Oct 2009 in cs.IT and math.IT | (0910.5339v1)

Abstract: 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.

Citations (3)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.