Max-Min Fair Scheduling in OFDMA-Based Multi-Hop WiMAX Mesh Networks

Bai, Shi; Zhang, Weiyi; Liu, Yang; Wang, Chonggang

doi:10.1109/icc.2011.5963242

Cited by 8 publications

(8 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then we compare heuristic method with [21] on the experimental results of these two methods by three goals. The three goals are the ratio of average minimum satisfaction, average QoS satisfaction ratio, and average throughput.…”

Section: Experiments Resultsmentioning

confidence: 99%

“…In this paper, we propose heuristic scheduling algorithms that identify each SS to maximize the minimum satisfaction ratio in the network and, meanwhile, to meet the bandwidth requirements for each SS. We compare the QoS satisfaction ratio, throughput, and min satisfaction ratio with the previous method proposed in [21]. Experimental results show that our method is better in terms of QoS satisfaction ratio.…”

Section: Fairness Scheduling Nowadays the Related Work Onmentioning

confidence: 98%

“…In this section, we implement our heuristic algorithms and the algorithm proposed in [21] for performance comparison. We compare three parameters in the experimental results, namely, average minimum satisfaction ratio, average QoS satisfaction ratio, and average throughput.…”

Section: Simulationmentioning

confidence: 99%

“…In the beginning, we use our heuristic algorithm and scheduling method of [21] in 1500 × 1500 square units and deployed 4 RSs to compare with three goals. These three goals are minimum satisfaction ratio, QoS satisfaction ratio, and throughput.…”

Section: Simulationmentioning

confidence: 99%

See 3 more Smart Citations

Fairness Time-Slot Allocation and Scheduling with QoS Guarantees in Multihop WiMAX Mesh Networks

Lee

et al. 2013

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The WiMAX technology has been defined to provide high throughput over long distance communications and support the quality of service (QoS) control applied on different applications. This paper studies the fairness time-slot allocation and scheduling problem for enhancing throughput and guaranteeing QoS in multihop WiMAX mesh networks. For allocating time slots to multiple subscribe stations (SSs), fairness is a key concern. The notion of max-min fairness is applied as our metric to define the QoS-based max-min fair scheduling problem for maximizing the minimum satisfaction ratio of each SS. We formulate an integer linear programming (ILP) model to provide an optimal solution on small-scale networks. For large-scale networks, several heuristic algorithms are proposed for better running time and scalability. The performance of heuristic algorithms is compared with previous methods in the literatures. Experimental results show that the proposed algorithms are better in terms of QoS satisfaction ratio and throughput.

show abstract

Section: Experiments Resultsmentioning

confidence: 99%

Section: Fairness Scheduling Nowadays the Related Work Onmentioning

confidence: 98%

Section: Simulationmentioning

confidence: 99%

Section: Simulationmentioning

confidence: 99%

See 2 more Smart Citations

Fairness Time-Slot Allocation and Scheduling with QoS Guarantees in Multihop WiMAX Mesh Networks

Lee

et al. 2013

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…The well-known α-utility function is employed to factor fairness between users in that as α → ∞, the problem converges to a max-min SINR balanced allocation a [29]. Moreover, another appealing feature is that the α-utility function falls in the framework in [19], which makes NoP convex.…”

Section: System Model and Nominal Problem Formulationmentioning

confidence: 99%

Robust power allocation in two-tier heterogeneous networks

Liu

et al. 2014

J Wireless Com Network

View full text Add to dashboard Cite

This paper focuses on a robust distributed power allocation scheme for downlink two-tier heterogeneous networks (HetNets). The objective is to maximize the network aggregate utility of femtocell users (FUEs) which factors the fairness between users under the constraint of not causing serious interference to existing macrocell users (MUEs). Being impractical for different nodes to cooperate in HetNets to obtain precise estimated values of the channel gains between them, it is a challenge to guarantee the performance of the power allocation algorithm by using existing methods. This work makes a step forward in the direction of conquering this challenge by taking into account channel uncertainty, and the robust counterpart of nominal problem, without channel uncertainty, is framed by using worst-case robust optimization theory. To make the robust counterpart computationally tractable, we exploit its convexity and derive that the channel uncertainties between a FUE and nearby femtocell base stations (FBSs) fall into water-filling form being related to the received power from interference sources. Based on the inherent relationship between channel uncertainty and received power, we design a distributed algorithm which merely needs to solve a deterministic problem. The algorithm is devised based on alternating direction method of multipliers (ADMM) with a fast convergence speed. The simulation results demonstrate the robustness of our proposed approach, and the corresponding cost of robustness is investigated.

show abstract