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 language | English (US) |
|---|---|
| Pages (from-to) | 190-201 |
| Number of pages | 12 |
| Journal | International Journal of Mobile Network Design and Innovation |
| Volume | 2 |
| Issue number | 3-4 |
| DOIs | |
| State | Published - Feb 2007 |
All Science Journal Classification (ASJC) codes
- Software
- Management Information Systems
- Computer Networks and Communications
- Artificial Intelligence