On the stability of interacting queues in a multiple-access system

Rao, Ramesh R.; Ephremides, Anthony

doi:10.1109/18.21216

Cited by 334 publications

(328 citation statements)

References 8 publications

Supporting

Mentioning

325

Contrasting

Unclassified

Order By: Relevance

“…Proposition 1 is proven in Appendix E. Note that when , the rate region given in (16) equals the random multiple access throughput and stability regions of the collision channel [17], which also approaches the asynchronous information capacity region of the collision channel as [18]. Proposition 1 therefore motivates the question whether there is a fundamental connection between the achievable rate region studied in this paper and the throughput, stability, information capacity regions of the random multiple access channel discussed in [11].…”

Section: Propositionmentioning

confidence: 93%

“…Let be a given user subset. If the asymptotic distribution , and hence the entropy functions, are continuous in at , we can find a small enough and a bound with , such that the following inequality holds for all rates , with and : (17) where the mutual information is evaluated using input distribution and the mutual information is evaluated using input distribution . Let be the actual source message.…”

Section: A) Proof Of Theoremmentioning

confidence: 99%

See 1 more Smart Citation

A New Approach to Random Access: Reliable Communication and Reliable Collision Detection

Luo

Ephremides

2012

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-This paper applies information theoretic analysis to packet-based random multiple access communication systems. A new channel coding approach is proposed for coding within each data packet with built-in support for bursty traffic properties, such as message underflow, and for random access properties, such as packet collision detection. The coding approach does not require joint communication rate determination either among the transmitters or between the transmitters and the receiver. Its performance limitation is characterized by an achievable region defined in terms of communication rates, such that reliable packet recovery is supported for all rates inside the region and reliable collision detection is supported for all rates outside the region. For random access communication over a discrete-time memoryless channel, it is shown that the achievable rate region of the introduced coding approach equals the Shannon information rate region without a convex hull operation. Further connections between the achievable rate region and the Shannon information rate region are developed and explained.

show abstract

Section: Propositionmentioning

confidence: 93%

Section: A) Proof Of Theoremmentioning

confidence: 99%

A New Approach to Random Access: Reliable Communication and Reliable Collision Detection

Luo

Ephremides

2012

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…On the other hand, if one of the two users queues never empties, then the other user will never get served by the WR. Studying stability conditions for interacting queues is a difficult problem that has been studied in the context of ALOHA systems, i.e., random access systems [15], [16]. Rao and Ephremides [15] introduced the concept of dominant systems to help finding bounds on the stability region of a system of interacting queues.…”

Section: A Protocol S 1 : Implementation and Analysismentioning

confidence: 99%

“…Studying stability conditions for interacting queues is a difficult problem that has been studied in the context of ALOHA systems, i.e., random access systems [15], [16]. Rao and Ephremides [15] introduced the concept of dominant systems to help finding bounds on the stability region of a system of interacting queues. This was studied in the context of random access, and the dominant system was defined in a way to help decouple the interacting queues.…”

Section: A Protocol S 1 : Implementation and Analysismentioning

confidence: 99%

“…This was studied in the context of random access, and the dominant system was defined in a way to help decouple the interacting queues. The dominant system in [15] was defined by allowing a set of users who have no packets to transmit to continue transmitting dummy packets. In our system S 1 , we define the dominant system in a different way that suits the TDMA framework and the employed WR in order to help decouple the interaction of the queues and hence analyze the system performance.…”

Section: A Protocol S 1 : Implementation and Analysismentioning

confidence: 99%

See 1 more Smart Citation

Collaborative Multiple-Access Protocols for Wireless Networks

Sadek

Liu

Ephremides

2006

2006 IEEE International Conference on Communications

View full text Add to dashboard Cite

Abstract-In this paper, a new multiple access approach is proposed that takes into account the broadcast nature of the wireless channel. The new approach employs a relay to boost the system throughput. This approach is based on a new idea in which the relay utilizes the empty time slots available in a TDMA frame. The relay stores the packets that failed transmissions in previous time slots. At each time slot, the relay listens to the channel and retransmits the packet at the head of its queue if the channel is free. This will better utilize the channel resources and will introduce on-demand spatial diversity into the network. Two different protocols are proposed to implement this new multiple-access scheme. The stability criteria of the associated queueing systems are studied and analytical expressions for the maximum stable throughput are provided for the symmetrical users case. Numerical results indicate a significant increase in the maximum stable throughput by using the new multiple-access protocol over pure TDMA.

show abstract

Small Cell Network Modeling and Analysis

Yang¹,

Quek²

2020

Wiley 5G Ref

View full text Add to dashboard Cite

Small cell networks are deemed one of the key solutions for next‐generation (5G) wireless networks. In such networks, along with the spatial densification of access points, temporal traffic can also vary largely from cell to cell. To this end, a complete understanding of the impact from spatial and temporal aspects is thus essential for network operators to adequately advance the deployment of small cell networks. In this article, based on stochastic geometry and queuing theory, we develop a mathematical framework that captures the interplay between the spatial location of small access points (SAPs), which determines the magnitude of mutual interference, and their temporal traffic dynamic. We derive a tractable expression for the signal‐to‐interference‐plus‐noise ratio (SINR) distribution, as well as the mean delay distributions under two different scheduling policies, i.e. the random scheduling and round robin. We also verify the accuracy of our mathematical analysis via simulations. Based on our analysis, we find a number of useful guidelines for the deployment of small cell networks.

show abstract

On the stability of interacting queues in a multiple-access system

Cited by 334 publications

References 8 publications

A New Approach to Random Access: Reliable Communication and Reliable Collision Detection

A New Approach to Random Access: Reliable Communication and Reliable Collision Detection

Collaborative Multiple-Access Protocols for Wireless Networks

Small Cell Network Modeling and Analysis

Contact Info

Product

Resources

About