2011 IEEE 13th International Conference on Communication Technology 2011
DOI: 10.1109/icct.2011.6157956
|View full text |Cite
|
Sign up to set email alerts
|

Fairness enhancement in IEEE 802.11s multi-hop wireless mesh networks

Abstract: Wireless mesh network (WMN) is a practical and cost effective solution for home and business networks. However, in multi-hop wireless mesh networks, the throughput decays significantly with an increase in hop counts. This is primarily due to the increase in successive spatial contentions. As a result, flows with longer hops from the gateway suffer from bandwidth starvation and fair link access disparities. In this paper, we show that the packet size and the minimum contention window size (CW ) play an essentia… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 16 publications
0
3
0
Order By: Relevance
“…All the users in the Smart Grid should be serviced with guaranteed QoS. In [7], the author improved the fairless problem in the 802.11s mesh network by proposing a fair share algorithm (FSA) which allows node to adapt different packet sizes and various contention windows according to the location and traffic load. Nevertheless, the scenario used in the work does not show the impact of the routing protocol upon the network performance.…”
Section: Introductionmentioning
confidence: 99%
“…All the users in the Smart Grid should be serviced with guaranteed QoS. In [7], the author improved the fairless problem in the 802.11s mesh network by proposing a fair share algorithm (FSA) which allows node to adapt different packet sizes and various contention windows according to the location and traffic load. Nevertheless, the scenario used in the work does not show the impact of the routing protocol upon the network performance.…”
Section: Introductionmentioning
confidence: 99%
“…Applying this model to the concurrent transmission scenario as shown in Figure 3 for a contention based shared medium access scheme where Tp is unbounded, indicating that constrains in concurrent transmission between multi-hops could limit the per user throughput when multiple user consume network bandwidth [14] …”
Section: Multi-hop Network Throughput Analysismentioning
confidence: 99%
“…Because the MMDA algorithm uses the contention mechanism to reserve MDAOPs, an MP may reserve more MDAOPs than the other MPs and result in unfairness problem. The contention window (CW) size may play an essential role in improving fairness [32]; therefore, ABP is to adjust the backoff time parameters according to the number of MDAOPs owned by an MP, which allows the MP having less MDAOPs may have higher probability to reserve MDAOPs.…”
Section: Adaptive Backoff Processmentioning
confidence: 99%