Simple analytical method for wireless distributed networks considering contending and hidden nodes

Okada, Hiraku; Mase, Kenji

doi:10.1587/comex.1.101

Cited by 2 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, several simple analytical expressions for WLANs in both saturated [15] and non-saturated conditions [16,17] were obtained. In addition, simple analytical model, taking into account frame collisions induced by hidden nodes in the nonsaturated state, appears in [18].…”

Section: Throughput Analyses For Ieee 80211 Dcfmentioning

confidence: 99%

End-to-end throughput analysis for IEEE 802.11e EDCA string-topology wireless multi-hop networks

Yuta

Sanada

Komuro

et al. 2015

NOLTA

View full text Add to dashboard Cite

This paper proposes analytical expressions of end-to-end throughput for IEEE 802.11e Enhanced Distributed Channel Access (EDCA) wireless string-topology multi-hop networks. For obtaining the IEEE 802.11e EDCA performance, internal collisions between Access Categories (ACs) in a node, frame collisions with external nodes, and frame-existence probabilities of buffers at each AC are expressed as functions of EDCA access parameters. Therefore, it is possible to obtain the effects of the EDCA access parameters to Quality of Service (QoS) support in the EDCA. It is possible to obtain the end-to-end throughput at any offered load with respect to each AC because the buffer states can be expressed according to ACs. The obtained analytical expressions are verified by showing the quantitative agreements with simulation results.

show abstract

Section: Throughput Analyses For Ieee 80211 Dcfmentioning

confidence: 99%

End-to-end throughput analysis for IEEE 802.11e EDCA string-topology wireless multi-hop networks

Yuta

Sanada

Komuro

et al. 2015

NOLTA

View full text Add to dashboard Cite

show abstract

An Approach from Queueing Theory for Wireless Networks

Okada

2018

IEICE Fundamentals Review

View full text Add to dashboard Cite

This article discusses wireless networks from the viewpoint of queueing theory. First, queueing theory and its scale effect are explained. Then, it is discussed how to obtain the scale effect in wireless networks. Finally, the following examples of applications of queueing theory are described: simple analysis for contending and hidden nodes, dynamic channel selection in vehicular ad hoc Networks (VANETs), and a performance comparison of wireless networks using single-user/multiuser multiple input multiple output (MIMO) systems.

show abstract

Simple analytical method for wireless distributed networks considering contending and hidden nodes

Cited by 2 publications

References 4 publications

End-to-end throughput analysis for IEEE 802.11e EDCA string-topology wireless multi-hop networks

End-to-end throughput analysis for IEEE 802.11e EDCA string-topology wireless multi-hop networks

An Approach from Queueing Theory for Wireless Networks

Contact Info

Product

Resources

About