Queuing Analysis of Multi-Hop CSMA/CA Wireless Networks Handling Many Traffic Flows

Lauwens, Ben; Scheers, Bart; Capelle, Antoine Van de

doi:10.4108/icst.simutools2008.3037

Cited by 1 publication

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This methodology will be used to analyze the queuing behavior in a multi-hop wireless network. The analysis in [32] can be adapted to the analytical procedure in this paper so that the ideal CSMA protocol can be replaced by a realistic unslotted CSMA/CA scheme with truncated exponential back-offs. Topics for further research also include: Implementation of the ACK scheme.…”

Section: Resultsmentioning

confidence: 99%

Performance analysis of unslotted CSMA/CA in wireless networks

2009

Self Cite

View full text Add to dashboard Cite

In this paper a novel analytical model for the saturation throughput of unslotted Carrier Sensing Multiple Access with Collision Avoidance (CSMA/CA) in wireless networks is proposed. A fixed point procedure is developed based on the interaction of the Physical layer (PHY) and the Medium Access Control sub-layer (MAC). The output of the Clear Channel Assessment (CCA), i.e. idle or busy medium in the neighborhood of a node, serves as a feedback mechanism for the dynamical scheduling rate controlled by the back-off procedure. The PHY is described by a renewal process between successful transmissions with failed attempts and collided packets in between. A semi-Markov process of the internal states of a node is used as a model for the MAC. An event-driven simulator for the non-beacon enabled IEEE Std 802.15.4™MAC is developed to verify the numerical results of the analytical method. A detailed analysis of the idle period after a transmission is carried out based on the proposed analytical approach. The probability that the CCA senses the channel idle depends clearly on the actual back-off stage and the first back-off expiration after a transmission cannot be modeled by a exponential distribution when a finite number of nodes are in contention. The output of the event-driven simulations confirms both statements in great detail and the saturated throughput evaluated B. Lauwens ( ) · B. Scheers CISS, Royal Military Academy, 30 Renaissancelaan,

show abstract

Section: Resultsmentioning

confidence: 99%