Title

Distributed Fair Queuing Algorithm Based On Compensation Coordination Scheduling In Wmn

Keywords

Distributed scheduling; Fair queuing; Fairness; Wireless mesh network (WMN)

Abstract

This paper proposes a distributed fair queuing algorithm which is based on compensation coordination scheduling in wireless mesh networks, considering such problems as the location-dependent competition and unfair channel bandwidth allocation among nodes. The data communication process requiring the establishment of compensation coordination scheduling model is divided into three periods: the sending period, the compensation period and the dormancy period. According to model parameters, time constraint functions are designed to limit the execution length of each period. The algorithms guarantee that the nodes complete fair transmission of network packets together in accordance with the fixed coordination scheduling rule of the model. Simulations and analysis demonstrate the effectiveness of the proposed algorithm in network throughput and fairness. Copyright © by HIGH TECHNOLOGY LETTERS PRESS.

Publication Date

9-1-2012

Publication Title

High Technology Letters

Volume

18

Issue

3

Number of Pages

314-320

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.3772/j.issn.1006-6748.2012.03.015

Socpus ID

84868365355 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84868365355

This document is currently not available here.

Share

COinS