Modelling and analysis of bandwidth competition in 802.11 wireless networks

Research output: Contribution to journalArticle

Abstract

In a wireless network, bandwidth is shared and nodes are in fact 'competing' with each other for resources. Therefore, the Quality of Service (QoS) an individual node can offer to applications is determined by how intense the competition is and how much bandwidth it can win in the competition. In this paper, we propose a Markov chain model to study the bandwidth competition in 802.11 networks. A set of heuristic formulas are derived to analyse and predict bandwidth competition. The formulas can be used to compute the exact quantity of bandwidth allocated to competing nodes, given their demands and their traffic parameters. It is illustrated that nodes that demand the same amount of bandwidth may receive very different allocations, and nodes that demand more bandwidth do not always obtain more bandwidth than other nodes. The findings in this study imply that (1) nodes can share the bandwidth precisely according to their demands with full cooperation, (2) or a node can guarantee its own bandwidth while suppressing others with a deliberate consideration in composing packets.

Original languageEnglish (US)
Pages (from-to)190-201
Number of pages12
JournalInternational Journal of Mobile Network Design and Innovation
Volume2
Issue number3-4
DOIs
StatePublished - Feb 1 2007

Fingerprint

Wireless networks
Bandwidth
Modeling
Node
Markov processes
Quality of service

All Science Journal Classification (ASJC) codes

  • Management Information Systems
  • Software
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

@article{d3922b6edeb946de96962ac88836a679,
title = "Modelling and analysis of bandwidth competition in 802.11 wireless networks",
abstract = "In a wireless network, bandwidth is shared and nodes are in fact 'competing' with each other for resources. Therefore, the Quality of Service (QoS) an individual node can offer to applications is determined by how intense the competition is and how much bandwidth it can win in the competition. In this paper, we propose a Markov chain model to study the bandwidth competition in 802.11 networks. A set of heuristic formulas are derived to analyse and predict bandwidth competition. The formulas can be used to compute the exact quantity of bandwidth allocated to competing nodes, given their demands and their traffic parameters. It is illustrated that nodes that demand the same amount of bandwidth may receive very different allocations, and nodes that demand more bandwidth do not always obtain more bandwidth than other nodes. The findings in this study imply that (1) nodes can share the bandwidth precisely according to their demands with full cooperation, (2) or a node can guarantee its own bandwidth while suppressing others with a deliberate consideration in composing packets.",
author = "Qijun Gu and Chu, {Chao Hsien} and Peng Liu",
year = "2007",
month = "2",
day = "1",
doi = "10.1504/IJMNDI.2007.017323",
language = "English (US)",
volume = "2",
pages = "190--201",
journal = "International Journal of Mobile Network Design and Innovation",
issn = "1744-2869",
publisher = "Inderscience Enterprises Ltd",
number = "3-4",

}

Modelling and analysis of bandwidth competition in 802.11 wireless networks. / Gu, Qijun; Chu, Chao Hsien; Liu, Peng.

In: International Journal of Mobile Network Design and Innovation, Vol. 2, No. 3-4, 01.02.2007, p. 190-201.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Modelling and analysis of bandwidth competition in 802.11 wireless networks

AU - Gu, Qijun

AU - Chu, Chao Hsien

AU - Liu, Peng

PY - 2007/2/1

Y1 - 2007/2/1

N2 - In a wireless network, bandwidth is shared and nodes are in fact 'competing' with each other for resources. Therefore, the Quality of Service (QoS) an individual node can offer to applications is determined by how intense the competition is and how much bandwidth it can win in the competition. In this paper, we propose a Markov chain model to study the bandwidth competition in 802.11 networks. A set of heuristic formulas are derived to analyse and predict bandwidth competition. The formulas can be used to compute the exact quantity of bandwidth allocated to competing nodes, given their demands and their traffic parameters. It is illustrated that nodes that demand the same amount of bandwidth may receive very different allocations, and nodes that demand more bandwidth do not always obtain more bandwidth than other nodes. The findings in this study imply that (1) nodes can share the bandwidth precisely according to their demands with full cooperation, (2) or a node can guarantee its own bandwidth while suppressing others with a deliberate consideration in composing packets.

AB - In a wireless network, bandwidth is shared and nodes are in fact 'competing' with each other for resources. Therefore, the Quality of Service (QoS) an individual node can offer to applications is determined by how intense the competition is and how much bandwidth it can win in the competition. In this paper, we propose a Markov chain model to study the bandwidth competition in 802.11 networks. A set of heuristic formulas are derived to analyse and predict bandwidth competition. The formulas can be used to compute the exact quantity of bandwidth allocated to competing nodes, given their demands and their traffic parameters. It is illustrated that nodes that demand the same amount of bandwidth may receive very different allocations, and nodes that demand more bandwidth do not always obtain more bandwidth than other nodes. The findings in this study imply that (1) nodes can share the bandwidth precisely according to their demands with full cooperation, (2) or a node can guarantee its own bandwidth while suppressing others with a deliberate consideration in composing packets.

UR - http://www.scopus.com/inward/record.url?scp=77958454630&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77958454630&partnerID=8YFLogxK

U2 - 10.1504/IJMNDI.2007.017323

DO - 10.1504/IJMNDI.2007.017323

M3 - Article

VL - 2

SP - 190

EP - 201

JO - International Journal of Mobile Network Design and Innovation

JF - International Journal of Mobile Network Design and Innovation

SN - 1744-2869

IS - 3-4

ER -