Flow Starvation Mitigation for Wireless Mesh Networks

Ronasi, Keivan; Gopalakrishnan, Sathish; Wong, Vincent W. S.

doi:10.1109/wcnc.2009.4917728

Cited by 14 publications

(13 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…CSMA/CA based MAC protocols permit a node, which succeeds in transmitting a data packet, to hold the channel for many consecutive time slots; thus, it can result in end-user starvation. Indeed, when nodes encounter a packet collision event, they have to increase their contention window in order to reduce the chance of further collisions in future which will cause the occurrence of starvation for them [33]. Moreover, the multi-S. D. Sajjadi Torshizi et al hop nature of WMN is vulnerable to the throughput degradation problem [2,13,16].…”

Section: Fairness Issues In Wmnsmentioning

confidence: 99%

An Adaptive Rate Allocation System to Mitigate Starvation Dilemma in Multi-Radio Multi-Hop Wireless Mesh Networks

Sajjadi

Hashim

Kwong

et al. 2015

Wireless Pers Commun

View full text Add to dashboard Cite

To this date, although a rich surge of research studies have been conducted on Wireless Mesh Networks (WMNs), still impartial distribution of network resources is one of the open issues in this area. In WMNs, stations that are more hops away from the gateway nodes generally suffer from higher throughput degradation and delay. One of the key reasons for the occurrence of such an incident is the existing limitations in MAC layers of wireless technologies. In this paper, a thorough solution based on an adaptive rate allocation mechanism is proposed to alleviate the fairness issues of WMNs. It is important to note that the presented solution is independent from MAC and underlying layers. This property differentiates it from many other related works on addressing fairness problems in WMNs. Furthermore, the ability of traffic control over UDP and TCP streams, supporting multi-radio mesh routers and restriction of internal greedy traffic within WMNs can be regarded as the main advantages of the offered solution in comparison to the earlier related works. For assessment and evaluation of the proposed scheme, several experiments have been carried out through real testbed environment. The consistency of the represented results substantiates the efficiency of the proposed mechanism in terms of addressing starvation issues and fairness provisioning for end-users of WMNs.

show abstract

Section: Fairness Issues In Wmnsmentioning

confidence: 99%

An Adaptive Rate Allocation System to Mitigate Starvation Dilemma in Multi-Radio Multi-Hop Wireless Mesh Networks

Sajjadi

Hashim

Kwong

et al. 2015

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…Ronasi, et al, [16] proposed an algorithm called Fair Binary Exponential Backoff algorithm (FBEB) which is an upgradation of Binary Exponential Backoff algorithm (BEB). The binary exponential backoff algorithm is an extensively used backoff algorithm, which regulates the contention window size by calculating the traffic in the nodes (in its communication medium) by the total successive collisions occurring to the same packet.…”

Section: Related Workmentioning

confidence: 99%

A Packet Priority Approach to Mitigate Starvation in Wireless Mesh Network with Multimedia Traffic

Potti¹,

Subramanyam²,

Prasad³

2013

IJCA

View full text Add to dashboard Cite

Wireless Mesh Networks (WMN) faces the inherent problem of increased end to end delay over a multiple hop wireless link. The delay becomes more obvious as the number of hops count between the source and destination increases. Experimental results have shown two hop neighbours face starvation when there are one hop nodes within the same gateway. In this paper, it is proposed to study the effect of starvation in WMN for multimedia traffic which are governed by the end to end delay and jitter for QOS. A novel packet priority technique, Dynamic Weighted Round Robin (DWRR) is proposed to reduce the effect of starvation for multi hop nodes. The proposed technique is implemented and compared with network without packet priority techniques. Results show that the proposed technique can be used to reduce starvation in WMN. General TermsWireless Mesh Network (WMN), End to end delay, Jitter

show abstract

“…The authors have proposed a graph-based algorithm in [18] for improving fairness in WMNs that is based on employing multiple queues per node, using different back-off parameters and EIFS values. In [19], the authors have proposed a fair binary exponential back-off algorithm by adapting the contention window to reduce the effect of flow starvation, thereby improving fairness in a WMN. All of these schemes have used Jain's fairness index [20] as a measure of the network fairness.…”

Section: Related Studymentioning

confidence: 99%

“…All of these schemes have used Jain's fairness index [20] as a measure of the network fairness. Unlike [16][17][18][19], our proposed CAAs, e-TICA and e-TICA2, improve fairness among flows through a more accurate CA and improve medium access fairness by reducing the conflicting channels, respectively.…”

Section: Related Studymentioning

confidence: 99%

Improving throughput and fairness by improved channel assignment using topology control based on power control for multi-radio multi-channel wireless mesh networks

Chaudhry

Ahmad

Hafez

2012

J Wireless Com Network

View full text Add to dashboard Cite

Multi-radio multi-channel (MRMC) wireless mesh networks (WMNs) achieve higher throughput using multiple simultaneous transmissions and receptions. However, due to limited number of non-overlapping channels, such networks suffer from co-channel interference, which degrades their performance. To mitigate co-channel interference, effective channel assignment algorithms (CAAs) are desired. In this article, we propose a novel CAA, Topology-controlled Interference-aware Channel-assignment Algorithm (TICA), for MRMC WMNs. This algorithm uses topology control based on power control to assign channels to multi-radio mesh routers such that co-channel interference is minimized, network throughput is maximized, and network connectivity is guaranteed. We further propose to use two-way interference-range edge coloring, and call the improved algorithm Enhanced TICA (e-TICA), which improves the fairness among flows in the network. However, the presence of relatively long links in some topologies leads to conflicting channel assignments due to their high interference range. To address this issue, we propose to utilize minimum spanning tree rooted at the gateway to reduce conflicting channels, and in turn, improve medium access fairness among the mesh nodes. We call the improved algorithm e-TICA version 2 (e-TICA2). We evaluate the performance of the proposed CAAs using simulations in NS2. We show that TICA significantly outperforms the Common Channel Assignment scheme in terms of network throughput, and e-TICA and e-TICA2 achieve better fairness among traffic flows as compared to TICA. It is also shown that e-TICA2 leads to improved network throughput, as compared to TICA and e-TICA.

show abstract

Flow Starvation Mitigation for Wireless Mesh Networks

Cited by 14 publications

References 19 publications

An Adaptive Rate Allocation System to Mitigate Starvation Dilemma in Multi-Radio Multi-Hop Wireless Mesh Networks

An Adaptive Rate Allocation System to Mitigate Starvation Dilemma in Multi-Radio Multi-Hop Wireless Mesh Networks

A Packet Priority Approach to Mitigate Starvation in Wireless Mesh Network with Multimedia Traffic

Improving throughput and fairness by improved channel assignment using topology control based on power control for multi-radio multi-channel wireless mesh networks

Contact Info

Product

Resources

About