MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
PE-WASUN '04 Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Re-routing Instability in IEEE 802.11 Multi-hop Ad-hoc Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Grouping Strategy for Solving Hidden Node Problem in IEEE 802.15.4 LR-WPAN
WICON '05 Proceedings of the First International Conference on Wireless Internet
Exploiting the capture effect for collision detection and recovery
EmNets '05 Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors
Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks
IEEE Transactions on Mobile Computing
Throughput analysis considering coupling effect in IEEE 802.11 networks with hidden stations
IEEE Communications Letters
Goodput analysis of a WLAN with hidden nodes under a non-saturated condition
IEEE Transactions on Wireless Communications
Optimizing 802.11 wireless mesh networks based on physical carrier sensing
IEEE/ACM Transactions on Networking (TON)
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network
IEEE Transactions on Computers
Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?
IEEE Communications Magazine
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This work seeks to develop an analytical model for the per-node throughput analysis of IEEE 802.11 WLAN networks with hidden nodes by extending the Bianchi's model. With the analytic model we derive the per-node throughput of each node and quantify the impact of hidden nodes on per-node throughput. Through our analysis, we find that nodes having more hidden nodes are likely to have worse throughput performance than nodes having less hidden nodes, so resulting in unfairness in per-node throughput. We next propose a new algorithm, called the fake collision algorithm, to solve the unfairness due to hidden nodes. The proposed fake collision algorithm allows nodes with poor throughput to acquire more transmission opportunities by slightly modifying the Binary Exponential Backoff algorithm of the IEEE 802.11 Distributed Coordination Function. To this end, the fake collision algorithm uses a new control parameter called the fake collision probability which can be obtained from a computation algorithm that we develop based on our analytic model. We show that the fairness in per-node throughput can be achieved with the fake collision probability for each node through simulation.