Bandwidth mapping model for IEEE 802.11 DCF in unsaturated condition

Abstract

In multi-hop ad hoc networks, sources may pump more traffic into the networks than that can be supported, resulting in high end-to-end delay and packet-loss rate. Controlling the offered load at the sources can eliminate this problem. To conduct traffic control, the throughput of the network is necessary. In addition, the authors propose a concept of bandwidth mapping to analyse how much traffic in application can be injected to make the network supporting the maximum throughput. A multi-dimensional Markov model is built to analyse the performance of IEEE 802.11 DCF in unsaturated condition, in which M/G/1/K queuing model is used to analyse the service condition of the packet queue inside the node. The effects of carrier sensing property, hidden-node problem and signal capture property are considered together to analyse the contention experienced by the nodes in the network. Furthermore, the bandwidth mapping situation of voice and video traffic is analysed in string topology of a multi-hop ad hoc network. This analysis can provide a theoretical guide for the traffic admission control.

Throughput and delay analysis for IEEE 802.11 multi-hop networks considering data rate

“…The theoretical analysis using airtime concept has shown the applicability in IEEE 802.11 wireless networks under various conditions. [10][11][12][13][14][15][16][17][18][19][20] The airtime concept was initially proposed in Chung and Liew 10 to construct a model for the maximum saturation throughput. However, the model assumed that simultaneous frame transmissions are negligible.…”

“…In theory, several articles theoretically analyze the network performance of multi-hop wireless, mostly the string topology, using the airtime concept. [10][11][12][13][14][15][16][17][18][19][20] First introduced in Chung and Liew 10 for saturation throughput in IEEE 802.11 networks, the concept combines a contention graph to derive the saturated throughput model for a given source-destination pair in Gao et al 11 In Sugimoto et al, 13 the authors have extended the model to account for the throughput of two-way flows (of a VoIP traffic). Other IEEE 802.11 features such as Request To Send/Clear To Send (RTS/CTS), hidden node collision, long-frame communications, and back-off-stage synchronization have been investigated in previous studies, [14][15][16] respectively.…”

“…Other IEEE 802.11 features such as Request To Send/Clear To Send (RTS/CTS), hidden node collision, long-frame communications, and back-off-stage synchronization have been investigated in previous studies, [14][15][16] respectively. In Qinjuan et al, 17 the integration of airtime Markov chain analysis has well handled the IEEE 802.11 multihop network's unsaturated condition. The proposed model in Shimoyamada et al 18 can formulate multihop networks' performance using the IEEE 802.11e Enhanced Distributed Channel Access (EDCA).…”

Saturated distributed coordination function Markov model for noisy soft‐real‐time industrial wireless networks

“…DCF performance analysis has been extensively studied in the literature, but lack of a comprehensive model has leaded to an ongoing research [4][5][6][7][8][9][10][11]. The first and simplest DTMC model was proposed by Bianchi [3] assuming infinite-RL and ideal channel.…”

“…n is the number of competing nodes (node density). By solving the non-linear (10) and (11) for each scenario, p and t can be calculated.…”