Stability conditions for some distributed systems: buffered random access systems

Szpankowski, Wojciech

doi:10.1017/s0001867800026318

Cited by 96 publications

(184 citation statements)

References 15 publications

Supporting

Mentioning

182

Contrasting

Unclassified

Order By: Relevance

“…These probabilities actually depend on the detailed characteristics of the arrival processes, see e.g. [26]. For N = 3 and Bernoulli arrivals, the stability region can be characterized [26].…”

Section: B Related Workmentioning

confidence: 99%

Asymptotic Stability Region of Slotted Aloha

Bordenave

McDonald

Proutière

2012

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-We analyze the stability of standard, buffered, slotted-Aloha systems. Specifically, we consider a set of N users, each equipped with an infinite buffer. Packets arrive into user i's buffer according to some stationary ergodic Markovian process of intensity λ i . At the beginning of each slot, if user i has packets in its buffer, it attempts to transmit a packet with fixed probability p i over a shared resource / channel. The transmission is successful only when no other user attempts to use the channel. The stability of such systems has been open since their very first analysis in 1979 by Tsybakov and Mikhailov. In this paper, we propose an approximate stability condition, that is provably exact when the number of users N grows large. We provide theoretical evidence and numerical experiments to explain why the proposed approximate stability condition is extremely accurate even for systems with a restricted number of users (even two or three). We finally extend the results to the case of more efficient CSMA systems.

show abstract

Section: B Related Workmentioning

confidence: 99%

Asymptotic Stability Region of Slotted Aloha

Bordenave

McDonald

Proutière

2012

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…Denote the queue sizes of the transmitting nodes at any time by the vector Q = [ , ∈ ℳ ]. We adopt the following definition of stability used in [34]. Queue ∈ ℳ is stable if,…”

Section: B Queuing Modelmentioning

confidence: 99%

Joint Design of Spectrum Sensing and Channel Access in Cognitive Radio Networks

El-Sherif

Liu

2011

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-Spectrum sensing is an essential functionality of cognitive radio networks. However, the effect of errors in the spectrum sensing process on the performance of the multiple access layer of both primary and secondary networks has not gained much attention. This paper aims at bridging the gap between the study of spectrum sensing and the multiple access of cognitive radio networks. To achieve this goal we pose and answer the question how the spectrum sensing errors affects the performance of cognitive radio networks from a multiple access protocol design point of view. The negative effects of the spectrum sensing errors on the throughput of both primary and secondary networks are characterized through queuing theory analysis of both networks. To alleviate these negative effects a novel joint design of the spectrum sensing and channel access mechanisms is proposed. This design is based on the observation that, in a binary hypothesis testing problem, the value of the test statistics could be used as a confidence measure for the test outcome. Therefore, this value will be used to define different channel access probabilities for secondary users. Results reveal a significant performance improvement in the maximum stable throughput of both primary and secondary networks by virtue of the proposed technique.

show abstract

“…We adopt the definition of stability used in [11] Definition 2: Queue i ∈ T of the system is stable, if…”

Section: A Protocol S 1 : Implementation and Analysismentioning

confidence: 99%

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

Stability conditions for some distributed systems: buffered random access systems

Cited by 96 publications

References 15 publications

Asymptotic Stability Region of Slotted Aloha

Asymptotic Stability Region of Slotted Aloha

Joint Design of Spectrum Sensing and Channel Access in Cognitive Radio Networks

Collaborative Multiple-Access Protocols for Wireless Networks

Contact Info

Product

Resources

About