Design of Fair Weights for Heterogeneous Traffic Scheduling in Multichannel Wireless Networks

Abstract-This work considers the problem of user association to small-cell base stations (SBSs) in a heterogeneous and small-cell network (HetSNet). Two optimization problems are investigated, which are maximizing the set of associated users to the SBSs (the unweighted problem) and maximizing the set of weighted associated users to the SBSs (the weighted problem), under signal-to-interference-plus-noise ratio constraints. Both problems are formulated as linear integer programs. The weighted problem is known to be NP-hard and, in this paper, the unweighted problem is proved to be NP-hard as well. Therefore, this paper develops two heuristic polynomial-time algorithms to solve both problems. The computational complexity of the proposed algorithms is evaluated and is shown to be far more efficient than the complexity of the optimal brute-force (BF) algorithm. Moreover, the paper benchmarks the performance of the proposed algorithms against the BF algorithm, the branchand-bound CPLEX-based algorithm and state-of-the-art algorithms, through numerical simulations. The results demonstrate the close-to-optimal performance of the proposed algorithms. They also show that the weighted problem can be solved to provide solutions that are fair between users or to balance the load among SBSs.

show abstract

“…Based on the steps given by Algorithm 3 and using the matrix defined by equation (23), the instance I 0v is easily obtained. ; x X /.…”

Section: Discussionmentioning

confidence: 99%

“…Weights Design: The weights can be designed based on fair rate or fair time allocation [23]. Since the problem involves user-BS association, we choose the fair time allocation.…”

Section: B Weighted User-bs Associationmentioning

confidence: 99%

User–Base-Station Association in HetSNets: Complexity and Efficient Algorithms

Mlika

Goonewardena

Ajib

et al. 2017

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…Although not treated in this article, the unified crosslayer optimization approach defined in (34) can also be extended to scheduling rules such as those proposed in [16,23,[40][41][42]. Notably, Al-Manthari et al [41] propose the use of utility functions that are based on both the throughput and the average delay.…”

Section: Other Scheduling Rulesmentioning

confidence: 99%

Unified approach to cross-layer scheduling and resource allocation in OFDMA wireless networks

Femenias

Dañobeitia

Riera-Palou

2012

J Wireless Com Network

View full text Add to dashboard Cite

Orthogonal frequency division multiple access (OFDMA) has been selected as the core physical layer access scheme for state-of-the-art and next-generation wireless communications standards. In these systems, scheduling and resource allocation algorithms, jointly assigning transmission data rates, bandwidth and power, become crucial to optimize the resource utilization while providing support to multimedia applications with heterogeneous quality of service (QoS) requirements. In this article, a unified framework for channeland queue-aware QoS-guaranteed cross-layer scheduling and resource allocation algorithms for heterogeneous multiservice OFDMA wireless networks is presented. The framework encompasses different types of traffic, uniform and continuous power allocation, discrete and continuous rate allocation, and protocols with different amounts of channel-and queue-awareness. System parameters and QoS requirements are projected into utility functions and the optimization problem is then formulated as a constrained utility maximization problem. Optimal solutions for this problem are obtained for the uniform power allocation schemes, and novel quasioptimal algorithms are proposed for the adaptive power allocation strategies. Remarkably, these techniques exhibit complexities that are linear in the number of resource units and users. Simulation results demonstrate the validity and merits of the proposed cross-layer unified approach.

show abstract

“…The authors in [18] take network throughput and fairness of user equipment into account by performing interference management. An opportunistic fair scheduling scheme for CDMA (code division multiple access) networks was developed in [19], which relates the average transmission of users to their fair weights achieved. In [20], an optimization framework was proposed to balance the performance of lifetime and fairness.…”

Section: Introductionmentioning

confidence: 99%

Balancing Long Lifetime and Satisfying Fairness in WBAN Using a Constrained Markov Decision Process

Yin

Cen

et al. 2015

International Journal of Antennas and Propagation

View full text Add to dashboard Cite

As an important part of the Internet of Things (IOT) and the special case of device-to-device (D2D) communication, wireless body area network (WBAN) gradually becomes the focus of attention. Since WBAN is a body-centered network, the energy of sensor nodes is strictly restrained since they are supplied by battery with limited power. In each data collection, only one sensor node is scheduled to transmit its measurements directly to the access point (AP) through the fading channel. We formulate the problem of dynamically choosing which sensor should communicate with the AP to maximize network lifetime under the constraint of fairness as a constrained markov decision process (CMDP). The optimal lifetime and optimal policy are obtained by Bellman equation in dynamic programming. The proposed algorithm defines the limiting performance in WBAN lifetime under different degrees of fairness constraints. Due to the defect of large implementation overhead in acquiring global channel state information (CSI), we put forward a distributed scheduling algorithm that adopts local CSI, which saves the network overhead and simplifies the algorithm. It was demonstrated via simulation that this scheduling algorithm can allocate time slot reasonably under different channel conditions to balance the performances of network lifetime and fairness.

show abstract

Design of Fair Weights for Heterogeneous Traffic Scheduling in Multichannel Wireless Networks

Cited by 34 publications

References 23 publications

User–Base-Station Association in HetSNets: Complexity and Efficient Algorithms

User–Base-Station Association in HetSNets: Complexity and Efficient Algorithms

Unified approach to cross-layer scheduling and resource allocation in OFDMA wireless networks

Balancing Long Lifetime and Satisfying Fairness in WBAN Using a Constrained Markov Decision Process

Contact Info

Product

Resources

About