Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
1 LANs: Saturation Throughput in the Presence of Noise
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
A novel association algorithm for congestion relief in IEEE 802.11 WLANs
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Throughput analysis and admission control for IEEE 802.11a
Mobile Networks and Applications
Modeling the 802.11 distributed coordination function in nonsaturated heterogeneous conditions
IEEE/ACM Transactions on Networking (TON)
CSMA/CA performance under high traffic conditions: throughput and delay analysis
Computer Communications
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The fairness behavior and throughput performance of IEEE 802.11 distributed coordination function and request-to-send/clear-to-send channel access scheme in the presence of hidden nodes are investigated. A mathematical model which accurately predicts a user's throughput performance and packet collision probability in non-saturated traffic and asymmetric hidden node environments is developed. The model allows us to see many interesting results in networks with hidden nodes. In an asymmetric hidden node network environment, the network fairness performance depends on the traffic load. In low traffic conditions, users get their fair share of the resources. However, in moderate-to-high traffic conditions, users that experience less number of hidden nodes dominate the network, causing badly located stations in a network to starve. In addition, the performance of request-to-send/clear-to-send channel access scheme, which is developed as a solution to hidden node problem, in networks with hidden nodes, is also estimated. It is shown that request-to-send/clear-to-send contention resolution scheme greatly improves the network fairness performance in hidden node scenarios. The developed model enables us to more accurately estimate the performance of practical wireless local area networks, where hidden node occurrence is common. Theoretical analysis presented in the paper is validated with simulation results.