Per-node throughput and fairness analysis of IEEE 802.11 wireless networks with hidden nodes

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 412
  • Download : 0
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 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.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2015-05
Language
English
Article Type
Article
Keywords

AD-HOC NETWORKS; PERFORMANCE; ACCESS

Citation

PERFORMANCE EVALUATION, v.87, pp.60 - 73

ISSN
0166-5316
DOI
10.1016/j.peva.2015.01.002
URI
http://hdl.handle.net/10203/199469
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0