Comments on "Throughput Analysis for Persistent CSMA Systems"

Sohraby, K.; Molle, Mart L.; Venetsanopoulos, A.N.

doi:10.1109/tcom.1987.1096735

Cited by 24 publications

(27 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The station is forced to back off for a random amount of time if the channel is busy or another station acquires control of the channel at the end of the persistence time. Our analysis of limited persistence is based on earlier work on 1-persistent CSMA by Sohraby et al [8]. Although this analysis assumes a fully-connected network, our results can be extrapolated to networks with hidden terminals, because RIMA and FAMA protocols provide correct collision avoidance, which means that the relative performance differences among these protocols observed in the analysis apply also to networks with hidden terminals.…”

Section: Discussionmentioning

confidence: 96%

“…Our modeling of limited-persistent carrier-sensing MAC protocols is based on the model first introduced by Sohraby et al [8] which requires the following assumptions to be made:…”

Section: A Modeling Assumptionsmentioning

confidence: 99%

“…Following the analysis by Sohraby et al [8], we define the state of the system at the beginning of a transmission period to be the type of that transmission period. Because the type of transmission period reached depends only on the number of arrivals in the prior transmission period, the three possible states of the system and the possible transitions between them, correspond to a three-state Markov chain embedded at the beginning of the transmission periods.…”

Section: B Analysismentioning

confidence: 99%

“…Given that the arrival of RTRs or RTSs is Poisson with parameter , the probability of this event equals ´ ·Ýµ . Unconditioning, we have [8]:…”

Section: B Analysismentioning

confidence: 99%

“…The use of persistence in MAC protocols has been reported for CSMA [7], [8] and CSMA/CD [10]. The persistence strategies reported in the literature consist of a node with a packet to send that senses the channel being busy to persist with certain probability in sending its packet as soon as the channel is sensed idle again.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

The effect of exerting adequate persistence in collision avoidance protocols

Garcia-Luna-Aceves

Tzamaloukas²

1999 IEEE International Workshop on Mobile Multimedia Communications (MoMuC'99) (Cat. No.99EX384)

View full text Add to dashboard Cite

Abstract-Many medium-access control (MAC) protocols based on a collision-avoidance handshake between the sender and the receiver have been proposed for wireless networks. To date, however, the analysis of these protocols has assumed non-persistent strategies in sending control packets for collision avoidance. The persistent strategies discussed in the past for CSMA and CSMA/CD provide performance improvements over non-persistent access only at small traffic loads. We present and analyze a limited persistence approach to the transmission of collision-avoidance control packets. With limited persistence, a node senses the channel before sending collision-avoidance control packets. If the channel is sensed busy, the node persists sensing for an amount of time proportional to the transmission time of a control packet. The node can transmit its control packet if the channel is idle within its persistence waiting time and the channel is known to be available for transmissions; otherwise, the node backs off for a random amount of time and tries sending its control packet at the end of that time. We analyze the effect of limited persistence in sourceinitiated and receiver-initiated collision avoidance protocols by comparing their throughput with and without persistence; the analysis shows that limited persistence makes collision-avoidance protocols more efficient.

show abstract

Section: Discussionmentioning

confidence: 96%

“…Our modeling of limited-persistent carrier-sensing MAC protocols is based on the model first introduced by Sohraby et al [8] which requires the following assumptions to be made:…”

Section: A Modeling Assumptionsmentioning

confidence: 99%

Section: B Analysismentioning

confidence: 99%

“…Given that the arrival of RTRs or RTSs is Poisson with parameter , the probability of this event equals ´ ·Ýµ . Unconditioning, we have [8]:…”

Section: B Analysismentioning

confidence: 99%