2008•Unpublished venueRequires access

Throughput-Effective Scheduling with Fairness Guarantee in Wireless Mesh Networks

Zheng Liu, Min Jian Yang, Jun Tu, Hong Chen, Jufeng Dai

Open publisher page 3 citations

Abstract

Wireless mesh networks have promised to provide high-speed access for residential or mobile customers. And concurrent transmission is an effective way to enhance system throughput in wireless mesh networks. The objective of this paper is to provide an effective concurrent transmission method to enlarge throughput with specific QoS fairness guarantee in wireless mesh networks. Firstly, link relationship is obtained by the topology transformation based on the network models adopted in this paper. Secondly, a greedy concurrent transmission algorithm which constructs the scenarios of links without interference is proposed and threshold values are designed to guarantee particular fairness index for each links in the network. At last, the simulation results demonstrate that with the requirement of specific fairness index, the system throughput can be enhanced efficiently by using the algorithm proposed in this paper.

About this research paper

What this paper is about

Wireless mesh networks have promised to provide high-speed access for residential or mobile customers. And concurrent transmission is an effective way to enhance system throughput in wireless mesh networks. The objective of this paper is to provide an effective concurrent transmission method to enlarge throughput with specific QoS fairness guarantee in wireless mesh networks. Firstly, link relationship is obtained by the topology transformation based on the network models adopted in this paper. Secondly, a greedy concurrent transmission algorithm which constructs the scenarios of links without interference is proposed and threshold values are designed to guarantee particular fairness index for each links in the network. At last, the simulation results demonstrate that with the requirement of specific fairness index, the system throughput can be enhanced efficiently by using the algorithm proposed in this paper.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Wireless mesh networks have promised to provide high-speed access for residential or mobile customers. And concurrent transmission is an effective way to enhance system throughput in wireless mesh networks. The objective of this paper is to provide an effective concurrent transmission method to enlarge throughput with specific QoS fairness guarantee in wireless mesh networks. Firstly, link relationship is obtained by the topology transformation based on the network models adopted in this paper. Secondly, a greedy concurrent transmission algorithm which constructs the scenarios of links without interference is proposed and threshold values are designed to guarantee particular fairness index for each links in the network. At last, the simulation results demonstrate that with the requirement of specific fairness index, the system throughput can be enhanced efficiently by using the algorithm proposed in this paper.

Key concepts: Wireless mesh network, Maximum throughput scheduling, Computer science, Fairness measure, Computer network, Order One Network Protocol, Throughput, Switched mesh

Related papers

Back to paper searchBrowse research topicsOriginal source
Throughput-Effective Scheduling with Fairness Guarantee in Wireless Mesh Networks — Research Paper | ScholarLens