2008 IEEE Wireless Communications and Networking Conference 2008
DOI: 10.1109/wcnc.2008.464
|View full text |Cite
|
Sign up to set email alerts
|

Providing QoS to Real and Data Applications in WiMAX Mesh Networks

Abstract: Abstract-We consider the problem of centralized routing and scheduling for IEEE 802.16 mesh networks so as to provide Quality of Service (QoS) to individual real and interactive data applications. We first obtain an optimal and fair routing and scheduling policy for aggregate demands for different sourcedestination pairs. We then present scheduling algorithms which provide per flow QoS guarantees while utilizing the network resources efficiently. Our algorithms are also scalable: they do not require per flow p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2009
2009
2014
2014

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 24 publications
0
3
0
Order By: Relevance
“…Most of the existing work that relates to our study focuses on devising centralized scheduling techniques that help in building routing trees of WiMAX OFDM TDMA/TDM mesh networks. The main goal is to maximize the total throughput 6–13. In Reference 6, the authors investigated the performance of the mesh mode by proposing an algorithm for constructing the WiMAX mesh tree.…”
Section: Related Studiesmentioning
confidence: 99%
See 1 more Smart Citation
“…Most of the existing work that relates to our study focuses on devising centralized scheduling techniques that help in building routing trees of WiMAX OFDM TDMA/TDM mesh networks. The main goal is to maximize the total throughput 6–13. In Reference 6, the authors investigated the performance of the mesh mode by proposing an algorithm for constructing the WiMAX mesh tree.…”
Section: Related Studiesmentioning
confidence: 99%
“…The link with the largest flow in the network is considered as the link joining its corresponding SS to its immediate parent and all other links that join this SS to other possible parents are regarded as interference links. In Reference [13], the authors considered the problem of centralized routing and scheduling so as to provide quality of service (QoS) to individual real and interactive data applications.…”
Section: Related Studiesmentioning
confidence: 99%
“…In order to ensure fairness, we maximize the minimum of the satisfied fractions of demand of the sensor nodes in the network. This notion of fairness has been previously used ( [28], [16]). The ratio of net flow from a node to the fusion node to the node's demanded rate is the satisfied fraction of demand for that node.…”
Section: Problem Formulationmentioning
confidence: 99%