Distributed fair scheduling in a wireless LAN
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Performance of Collision Avoidance Protocols in Single-Channel Ad Hoc Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Markov-based modeling of wireless local area networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Security in wireless sensor networks
Communications of the ACM - Wireless sensor networks
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
An enhanced HCF for IEEE 802.11e wireless networks
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Denial of service resilience in ad hoc networks
Proceedings of the 10th annual international conference on Mobile computing and networking
The feasibility of launching and detecting jamming attacks in wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
802.11 denial-of-service attacks: real vulnerabilities and practical solutions
SSYM'03 Proceedings of the 12th conference on USENIX Security Symposium - Volume 12
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
IEEE 802.11 protocol: design and performance evaluation of an adaptive backoff mechanism
IEEE Journal on Selected Areas in Communications
Saturation throughput analysis of IEEE 802.11e enhanced distributed coordination function
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.