Cross-Layer Rate Control and Resource Allocation in Spectrum-Sharing OFDMASmall Cell Networks with Delay Constraints

Guo, Yashuang; Yang, Qinghai; Liu, Jiayi; Kwak, Kyung Sup

doi:10.1109/tvt.2016.2606644

Cited by 16 publications

(13 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lyapunov optimization is a powerful methodology for studying long-term optimization problems, which is able to transform long-term objective function into a series of short-term subproblems and transform the long-term constraints into queue stability constraints. It has been applied in various application scenarios such as D2D networks [7], edge computing [8], and OFDMA-based cellular networks [9]. In [3] HCRANs subject to individual front-haul capacity as well as multiple interference constraints to sense queue and proposed an online resource allocation algorithm based on Lyapunov optimization.…”

Section: Related Workmentioning

confidence: 99%

Joint rate control and power allocation for low-latency reliable D2D-based relay network

Wang

et al. 2019

J Wireless Com Network

View full text Add to dashboard Cite

Emerging 5G applications impose stringent requirements on network latency and reliability. In this work, we propose a low-latency reliable device-to-device (D2D) relay network framework to improve the cell coverage and user satisfaction. Particularly, we develop a cross-layer low-complexity resource allocation algorithm, which jointly optimizes the rate control and power allocation from a long-term perspective. The long-term optimization problem is transformed into a series of short-term subproblems by using Lyapunov optimization, and the objective function is separated into two independent subproblems related to rate control in network layer and power allocation in physical layer. Next, the Karush-Kuhn-Tucher (KKT) conditions and alternating direction method of multipliers (ADMM) algorithm are employed to solve the rate control subproblem and power allocation subproblem, respectively. Finally, simulation results demonstrate that the proposed algorithm can reach 99.9% of the optimal satisfaction of D2D pairs with lower average network delay compared to the baseline algorithm. Furthermore, the convergence time of the ADMM-based power allocation algorithm is only about 1.7% of that by using the CVX toolbox.

show abstract

Section: Related Workmentioning

confidence: 99%

Joint rate control and power allocation for low-latency reliable D2D-based relay network

Wang

et al. 2019

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Although some studies, e.g. [26] consider a fair resource allocation, they focused mainly on the network throughput without sharing costs. However, selfish BSs emphasize on improving their own utility without considering other BSs of different MNOs.…”

Section: A Prior Work and Motivationmentioning

confidence: 99%

“…By Lemma 1, we have transformed the optimization problem OP 2 into minimizing the rightside term of (73) at each time slot t. According to [26], the control policy should be adjusted to minimize the upper bound. Thus, we will decompose the optimization problem and present an online dynamic control algorithm for the green resource allocation and energy management.…”

Section: A Lyapunov Optimizationmentioning

confidence: 99%

Green resource allocation and energy management in heterogeneous small cell networks powered by hybrid energy

Han

Yang

Song

et al. 2020

Computer Communications

View full text Add to dashboard Cite

In heterogeneous networks (HetNets), how to improve spectrum efficiency is a crucial issue. Meanwhile increased energy consumption inspires network operators to deploy renewable energy sources as assistance to traditional electricity. Based on above aspects, we allow base stations (BSs) to share their licensed spectrum resource with each other and adjust transmission power to adapt to the renewable energy level. Considering the sharing fairness among BSs, we formulate a multi-person bargaining problem as a stochastic optimization problem. We divide the optimization problem into three parts: data rate control, resource allocation and energy management. An online dynamic control algorithm is proposed to control admission rate and resource allocation to maximize the transmission and sharing profits with the least grid energy consumption. Simulation results investigate the time-varying data control and energy management of BSs and demonstrate the effectiveness of the proposed scheme.

show abstract

“…This point will be discussed in more details in Section in this paper. However, most of the previously provided scheduling techniques suffer from different weak points such as the high system complexity, the lower throughput for real time (RT) applications, the high dependency of the scheduling algorithm on the design parameters, the lower system spectral efficiency, and the high packet loss rate (PLR) for RT applications …”

Section: Introductionmentioning

confidence: 99%

“…However, most of the previously provided scheduling techniques suffer from different weak points such as the high system complexity, the lower throughput for real time (RT) applications, the high dependency of the scheduling algorithm on the design parameters, the lower system spectral efficiency, and the high packet loss rate (PLR) for RT applications. [19][20][21][22] In this article, a novel scheduler is proposed in order to meet a predefined level of service quality by guaranteeing a specific delay threshold for delay-sensitive applications in the LTE cellular system in a very simple way. Hence, this will lead to minimizing the PLR and maximizing the achieved throughput for the delay-sensitive applications.…”

Section: Introductionmentioning

confidence: 99%

Enhanced fair earliest due date first scheduling strategy for multimedia applications in LTE downlink framework

Elhadad

El‐Shafai

El‐Rabaie

et al. 2020

Int J Communication

View full text Add to dashboard Cite

Summary Guaranteeing a certain delay threshold for delay‐sensitive applications in long term evolution (LTE) cellular communication system is a very challenging mission. By implementing an optimal scheduling strategy, this mission will be achieved. In this article, a novel scheduler is introduced in order to meet a predefined level of service quality by guaranteeing a specific delay threshold for delay‐sensitive applications in LTE cellular systems. The proposed scheduler assigns the available resource blocks (RBs) to active user equipments (UEs) tacking into consideration several attributes. The expiration date of each packet, the channel quality, the average data rate previously achieved by each UE, and the number of dropped packets for each UE compared with the average number of packets totally dropped are all considered in the proposed scheduler working mechanism. Consequently, the proposed scheduling strategy reduces the number of packets dropped for multimedia applications, and at the same time maximizes the overall throughput of the network. Simulation results are provided to study and evaluate the performance of the proposed scheduling strategy. A comparative study is presented between the proposed strategy and the most recent scheduling techniques. The obtained results prove that the proposed scheduling strategy has considerably acceptable and appreciated results compared with the results of the state‐of‐the‐art scheduling techniques.

show abstract

Cross-Layer Rate Control and Resource Allocation in Spectrum-Sharing OFDMASmall Cell Networks with Delay Constraints

Cited by 16 publications

References 38 publications

Joint rate control and power allocation for low-latency reliable D2D-based relay network

Joint rate control and power allocation for low-latency reliable D2D-based relay network

Green resource allocation and energy management in heterogeneous small cell networks powered by hybrid energy

Enhanced fair earliest due date first scheduling strategy for multimedia applications in LTE downlink framework

Contact Info

Product

Resources

About