Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A wireless fair service algorithm for packet cellular networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
An analysis of short-term fairness in wireless media access protocols (poster session)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Distributed fair scheduling in a wireless LAN
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit
IEEE/ACM Transactions on Networking (TON)
Ordered packet scheduling in wireless ad hoc networks: mechanisms and performance analysis
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A capacity analysis for the IEEE 802.11 MAC protocol
Wireless Networks
Delay Analysis of IEEE 802.11 in Single-Hop Networks
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Achieving MAC fairness in wireless ad-hoc networks using adaptive transmission control
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Throughput analysis and rate control for IEEE 802.11 Wireless LAN with hidden terminals
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Throughput analysis and bandwidth allocation for IEEE 802.11 WLAN with hidden terminals
Journal of Parallel and Distributed Computing
IEEE 802.11 saturation throughput analysis in the presence of hidden terminals
IEEE/ACM Transactions on Networking (TON)
Collaborative approach to mitigating ARP poisoning-based Man-in-the-Middle attacks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
IEEE 802.11 exhibits both short-term and long-term unfairness. The short-term fairness automatically gives rise to long-term fairness, but not vice versa. When we thoroughly investigated a simple scenario with hidden terminals, we found it to be unfair on the short-term basis, though it provides fair access on a long-term basis. It implies that the protocol cannot be used to provide fair access for delay sensitive traffic even in a simple scenario. In this paper, we analyze the short-term behavior using the embedded-Markov chain method to answer the following two questions: (i) once a node gets control of the medium, what is the average number of packets this node can transmit consecutively without experiencing any collision, (ii) once a node loses its control of the medium, what is the average time the node has to wait before it gets control of the medium again. The first question reflects on how long a node can capture the medium, whereas the second question reflects on how long a node may be starved. The analytical model is validated by the simulation results. Our work is distinct from most of the work published in the literature in two aspects: we focus on the short-term behavior rather than the long-term, and the analytical method is adopted for the study.