Performance analysis of multi-hop flows in IEEE 802.11 networks: A flexible and accurate modeling framework

Begin, Thomas; Baynat, Bruno; Lassous, Isabelle Guérin; Abreu, Thiago

doi:10.1016/j.peva.2015.12.003

Cited by 15 publications

(14 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, link utilization is not good in long-chain topologies [11], circular topologies, and does not perform well on mobile topologies [10]. In [13], the authors proposed an analytical model that works only when the network is saturated.…”

Section: Related Workmentioning

confidence: 99%

A QoS-aware Secured Communication Scheme for IoT-based Networks

Khan¹,

Au²,

Yahya³

et al. 2019

Preprint

View full text Add to dashboard Cite

The Internet of Things (IoT) is an emerging technology that aims to enable the interconnection of a large number of smart devices and heterogeneous networks. Ad hoc networks play an important role in the designing of IoT-enabled platforms due to their efficient, flexible, low-cost, and dynamic infrastructures. These networks utilize the available resources efficiently to maintain the Quality of Service (QoS) in a multi-hop communication. However, in a multi-hop communication, the relay nodes can be malicious, thus requiring a secured and reliable data transmission. In this paper, we propose a QoS-aware secured communication scheme for IoT-based networks (QoS-IoT). In QoS-IoT, a Sybil attack detection mechanism is used for the identification of Sybil nodes and their forged identities in multi-hop communication. %by high-power and mobile nodes. After Sybil nodes detection, an optimal contention window (CW) is selected for QoS provisioning, i.e., to achieve per-flow fairness and efficient utilization of the available bandwidth. In a multi-hop communication, the MAC layer protocols do not perform well in terms of fairness and throughput, especially when the nodes generate a large amount of data. It is because the MAC layer has no capability of providing QoS to prioritized or forwarding flows. We evaluate the performance of QoS-IoT in terms of Sybil attack detection, fairness, throughput, and buffer utilization. The simulation results show that the proposed scheme outperforms the existing schemes and significantly enhances the performance of the network with a large volume of data. Moreover, the proposed scheme is resilient against Sybil attack.

show abstract

Section: Related Workmentioning

confidence: 99%

A QoS-aware Secured Communication Scheme for IoT-based Networks

Khan¹,

Au²,

Yahya³

et al. 2019

Preprint

View full text Add to dashboard Cite

show abstract

“…Another approach consists in evaluating the performance of a network from a higher level of abstraction. Two such models, that address non-saturated, multi-hop networks, are given in [6] and [7]. In a multi-hop network, a packet from node A travels across relay nodes before arriving at its destination node B (as opposed to single-hop networks, where A and B directly exchange packets).…”

Section: State Of the Artmentioning

confidence: 99%

Conflict graph-based Markovian model to estimate throughput in unsaturated IEEE 802.11 networks

Stojanova

Begin

Busson

2017

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

Self Cite

View full text Add to dashboard Cite

WLANs (Wireless Local Area Networks) have become ubiquitous in our everyday life, and are mostly based on IEEE 802.11 standards. In this paper, we consider the performance evaluation of an arbitrary-topology unsaturated network based on the IEEE 802.11 DCF. We present a conflict graphbased modeling approach to discover the attainable throughput of each node. Our model consists of a single Markov chain which aims at describing, at a high-level of abstraction, the current state of the entire wireless network. Owing to its low complexity, our approach is simple to implement, can cope with medium sized networks, and its execution speed is fast. We validate its accuracy against a discrete-event simulator. Results show that our approach is typically accurate, with associated relative errors generally less than 15%, and that it captures complex phenomena such as node starvation. We investigate two potential applications of our proposed approach in which, starting with a given network, we improve its performance in terms of overall throughput or fairness by throttling the throughput demand of a node, or by turning a node off altogether.

show abstract

“…Bruno Nardelli et al in [24] derived a closed form expression for throughput characterizing hidden terminals, information asymmetry, and flow-in-the-middle. Thomas Begin et al [25] proposed a throughput prediction modeling framework which caters the effect of interference on capacity of contending flows in scenarios including two flows in opposite directions and hidden node problem. These models [23][24][25] address subset of the overall problem and are unable to characterize throughput imbalances due to location of interfering links.…”

Section: Related Workmentioning

confidence: 99%

Modeling packet loss probability and busy time in multi-hop wireless networks

Zeeshan

Ali

Anjum

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

Throughput imbalances among contending flows are known to occur when any carrier sense multiple access (CSMA)-based protocol is employed in multi-hop wireless networks. These imbalances may vary from slight difference in throughput to complete starvation in which some flows are unable to acquire channel accesses. The root cause of such imbalances is the lack of coordination when CSMA medium access control (MAC) protocols are employed in multi-hop wireless networks. In this paper, we accurately predict per-flow throughput in general multi-hop wireless networks while addressing CSMA's coordination problem. Unlike the previous work, our analytical throughput prediction model can clearly differentiate between links interfering from transmission range and carrier sensing range. Modeling of conditional packet loss probability and busy time sensed by each station is critical for per-flow throughput prediction in arbitrary networks. The calculation of both these parameters largely depends on MAC behavior due to geometrical configuration of interfering stations; we accurately compute conditional packet loss probability and busy time based on geometrical configuration of the interfering stations and predicted per-flow throughput. Our analytical results demonstrate improved accuracy, indicate throughput imbalances, and provide better understanding of CSMA-based protocol behavior in multi-hop wireless networks that can be used to design fair, scalable, and efficient MAC layer protocols.

show abstract

Performance analysis of multi-hop flows in IEEE 802.11 networks: A flexible and accurate modeling framework

Cited by 15 publications

References 31 publications

A QoS-aware Secured Communication Scheme for IoT-based Networks

A QoS-aware Secured Communication Scheme for IoT-based Networks

Conflict graph-based Markovian model to estimate throughput in unsaturated IEEE 802.11 networks

Modeling packet loss probability and busy time in multi-hop wireless networks

Contact Info

Product

Resources

About