IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference 2007
DOI: 10.1109/glocom.2007.958
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Distributed Scheduling Algorithm for Wireless Mesh Networks

Abstract: Wireless multi-hop, mesh networks are being considered as a candidate to backhaul data traffic from access networks to the wired Internet. These mesh networks are referred to as wireless backhaul networks. Existing medium access control (MAC) protocols and scheduling algorithms are devised for wireless access. So although they have been adopted for the wireless backhaul networks, they do not yield good performance. In this paper, we propose a novel distributed scheduling algorithm, composed of a framework and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2009
2009
2011
2011

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…In network layer, the integrated QoS routing protocol [9], [10] is used to provide sub-optimal candidate routes with multiple QoS constraints. MAC layer uses distributed opportunities scheduler developed in [11]. In PHY Layer, the Rayleigh fading channel model [13] is used for the wireless channel representation while the required PER is derived based on SINR curves for the used adaptive modulation and coding scheme.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In network layer, the integrated QoS routing protocol [9], [10] is used to provide sub-optimal candidate routes with multiple QoS constraints. MAC layer uses distributed opportunities scheduler developed in [11]. In PHY Layer, the Rayleigh fading channel model [13] is used for the wireless channel representation while the required PER is derived based on SINR curves for the used adaptive modulation and coding scheme.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Moreover, Gaussian traffic arrival assumption may not always hold, thus achievable capacity region could be inaccurate. Works [9], [10] study extensively on the integrated QoS routing protocol and the actual interface between the scheduling [11] and routing schemes, to provide optimum routes that guarantee multiple QoS constraints.…”
Section: Related Workmentioning
confidence: 99%
“…where c i is a positive proportionality constant for node i and φ * i is the optimal solution for node i. Hou and Leung [35] proved that if the optimization problem for each node i is to maximize the objective function f (φ i ) as,…”
Section: Utility Definitionmentioning
confidence: 99%
“…Due to the fact in [10,28,18] that finding a perfect match with the highest network throughput is NP-complete [25,14] for centralized scheduling algorithms, various distributed scheduling algorithms were proposed. Recently, [15,16] proposed a distributed opportunistic scheduling algorithm for backhaul networks, which provides multi-user diversity gain in the wireless environments, enforces resource allocation in the long run and maintains strong temporal correlation for interference, without which channel quality and interference cannot be tracked and predicted with reasonable accuracy.…”
Section: Related Workmentioning
confidence: 99%
“…This is because opportunistic decisions usually introduce more fluctuating instantaneous performance at individual incoming and outgoing links. In order to overcome this difficulty and enforce QoS, the distributed opportunistic proportional fair scheduler proposed in [15,16] is considered in our cross-layer framework. In this scheme, the utility function (or scheduling metric) combines both routing and scheduling parameters and in a way that not only achieves opportunistic gain but can also supports quality of service as committed by the routing algorithm in use.…”
Section: Mac Protocolmentioning
confidence: 99%