Resource Allocation Achieving High System Throughput with QoS Support in OFDMA-Based System

Device-to-Device (D2D) communications, which enable direct communication between nearby user devices over the licensed spectrum, have been considered a key technique to improve spectral efficiency and system throughput in cellular networks (CNs). However, the limited spectrum resources cannot be sufficient to support more cellular users (CUs) and D2D users to meet the growth of the traffic data in future wireless networks. Therefore, Long-Term Evolution-Unlicensed (LTE-U) and D2D-Unlicensed (D2D-U) technologies have been proposed to further enhance system capacity by extending the CUs and D2D users on the unlicensed spectrum for communications. In this paper, we consider an LTE network where the CUs and D2D users are allowed to share the unlicensed spectrum with Wi-Fi users. To maximize the sum rate of all users while guaranteeing each user’s quality of service (QoS), we jointly consider user access and resource allocation. To tackle the formulated problem, we propose a matching-iteration-based joint user access and resource allocation algorithm. Simulation results show that the proposed algorithm can significantly improve system throughput compared to the other benchmark algorithms.

Download Full-text

QoS-Constrained Resource Allocation Scheduling for LTE Network

International Journal of Wireless Networks and Broadband Technologies ◽

10.4018/ijwnbt.2015010101 ◽

2015 ◽

Vol 4 (1) ◽

pp. 1-15 ◽

Cited By ~ 5

Author(s):

Hung-Chin Jang ◽

Yun-Jun Lee

Keyword(s):

Resource Allocation ◽

Data Transmission ◽

Orthogonal Frequency Division Multiplexing ◽

Transmission Rate ◽

High Mobility ◽

System Throughput ◽

Frequency Division ◽

High Data ◽

Single Carrier ◽

Allocation Method

The goal of LTE (Long Term Evolution) is to provide high data transmission rate, scalable bandwidth, low latency, high-mobility, etc. LTE employs OFDM (Orthogonal Frequency Division Multiplexing) and SC-FDMA (Single Carrier - Frequency Division Multiple Access) for downlink and uplink data transmission, respectively. As to SC-FDMA, there are two constraints in doing resource allocation. First, the allocated resource blocks (RBs) should be contiguous. Second, those of the allocated RBs are forced to use the same modulation technique. The aim of this research is to propose a QoS-constraint resource allocation scheduling to enhance data transmission for uplink SC-FDMA. The proposed scheduling is a three-stage approach. In the first stage, it uses a time domain scheduler to differentiate user equipment (UE) services according to their distinct QoS service requirements. In the second stage, it uses a frequency domain scheduler to prioritize UE services based on channel quality. In the third stage, it limits the number of times of modulation downgrade of RBs allocation in order to enhance system throughput. In the simulations, the proposed method is compared to fixed sub-carrier dynamic resource allocation method and adaptive dynamic sub-carrier resource allocation method. Simulation results show that the proposed method outperforms the other two methods in terms of throughput, transmission delay, packet loss ratio, and RB utilization.

Download Full-text

A Low-Complexity Resource Allocation Algorithm for Indoor Visible Light Communication Ultra-Dense Networks

Applied Sciences ◽

10.3390/app9071391 ◽

2019 ◽

Vol 9 (7) ◽

pp. 1391 ◽

Cited By ~ 2

Author(s):

Xiangwei Bai ◽

Qing Li ◽

Yanqun Tang

Keyword(s):

Resource Allocation ◽

Visible Light ◽

Complexity Analysis ◽

Visible Light Communication ◽

Low Complexity ◽

System Throughput ◽

Resource Allocation Algorithm ◽

Allocation Algorithm ◽

Dense Networks ◽

Average System

In this paper, a low-complexity multi-cell resource allocation algorithm with a near-optimal system throughput is proposed to resolve the conflict between the high system throughput and low complexity of indoor visible light communication ultra-dense networks (VLC-UDNs). First, by establishing the optimal model of the resource allocation problem in each cell, we concluded that the problem is a convex optimization problem. After this, the analytic formula of the normalized scaling factor of each terminal for resource allocation is derived after reasonable approximate treatment. The resource allocation algorithm is subsequently proposed. Finally, the complexity analysis shows that the proposed algorithm has polynomial complexity, which is lower than the classical optimal inter-point method. The simulation results show that the proposed method achieves a improvement of 57% in performance in terms of the average system throughput and improvement of 67% in performance in terms of the quality of service (QoS) guarantee against the required data rate proportion allocation (RDR-PA) method.

Download Full-text

Power Control for Full-Duplex Device-to-Device Underlaid Cellular Networks: A Stackelberg Game Approach

Complexity ◽

10.1155/2020/1786349 ◽

2020 ◽

Vol 2020 ◽

pp. 1-12

Author(s):

Zhen Yang ◽

Titi Liu ◽

Guobin Chen

Keyword(s):

Resource Allocation ◽

Power Control ◽

Spectrum Sharing ◽

Stackelberg Game ◽

Full Duplex ◽

System Throughput ◽

Analysis Tool ◽

Spectrum Utilization ◽

Dual Decomposition ◽

Device To Device

In spectrum sharing cognitive radio networks, unauthorized users (secondary users) are allowed to use the spectrum of authorized users (primary users) to improve spectrum utilization. Due to limited spectrum resources, how to formulate a reasonable spectrum allocation scheme is very important. As a mathematical analysis tool, game theory can solve the problem of resource allocation well. In recent years, it has been applied to the research of resource allocation in spectrum sharing networks by some literatures. In a cellular network consisting of multiple cellular users and full-duplex end-to-end communication users D2D (device-to-device), the self-interference caused by full-duplex communication and the interference caused by the D2D users to the cellular users will significantly reduce system throughput. In order to reduce the interference in the network, this paper introduces a power control algorithm based on Stackelberg game, which sets the cellular users and D2D users as the leaders and followers, respectively. The cellular users and the D2D users compete with each other to minimize the cost, and we propose new utility functions. We build an optimization problem under the outage probability constraint and power constraint and the transmission power of the users is obtained by using the Lagrangian dual decomposition method. The simulation results show that the proposed game algorithm improves network performance compared with other existing schemes.

Download Full-text

Throughput Analysis for Non-Orthogonal Multiple Access (NOMA)-Based 5G Networks

International Journal of Recent Technology and Engineering - 2 ◽

10.35940/ijrte.c1019.1083s19 ◽

2019 ◽

Vol 8 (3S) ◽

pp. 101-108

Keyword(s):

Power Allocation ◽

Interference Cancellation ◽

Multiple Access ◽

System Throughput ◽

Superposition Coding ◽

5G Networks ◽

Throughput Analysis ◽

Radio Access ◽

5G Network ◽

High System

Non-Orthogonal Multiple Access (NOMA) scheme is one of the emerging radio access techniques to enhance the system performance for 5G networks. The powerdomain NOMA is one of the basic NOMA schemes that perform superposition coding (SC) at the transmitter and successive interference cancellation (SIC) at the receiver. Power Allocation (PA) plays a significant role in attaining successful SIC and high system throughput. This work is focusing on power allocation to maximize the throughput for NOMA-based 5G network. The objective functions, algorithms, constraints and limitations of the system design in power allocation techniques for NOMA-based 5G networks in terms of throughput analysis are extensively investigated and reported.

Download Full-text

Resource Allocation for Indoor Self-blockage WmWave Device-to-Device Communications

10.36227/techrxiv.11798400 ◽

2020 ◽

Author(s):

Lei Wang ◽

Xiaoting Yu ◽

Baoyu Zheng ◽

Jiming Yao ◽

Guan Gui

Keyword(s):

Resource Allocation ◽

Vertex Coloring ◽

System Throughput ◽

Maximum Throughput ◽

Performance Simulation ◽

Closed Expression ◽

Link State ◽

Proposed Model ◽

Accurate Expression ◽

Intelligent Devices

Millimeter wave (mmWave) technology can meet the requirements of large amount of data communications among intelligent devices for indoor scenario. With high requirement of throughput, reducing interference in an enclosed region is still a challenge. For indoor scenario, the human bodies are considered as the main blockages besides conventional blockages. In this paper, we present a new system model by exploiting the self-blockage model to capture the effects of human body, while using multi-ball Line of Sight (LOS) link state model to describe the conventional blockage. The combination of the two components provides a more comprehensive and accurate expression of indoor obstruction. We give a closed expression of coverage rate to analyze the system performance. Simulation results show that the proposed model is highly accurate to describe the distribution of blockages for indoor case. Then, we formulate the resource allocation as an optimization problem under this scenario. The target of this optimization is to achieve the maximum throughput by minimizing interference. To reach this goal, an improved Powell Multi Vertex Coloring algorithm (PMVC) is proposed. The throughput raises apparently when we modify this scheme to put more flows in different time-slots evenly. Numerical experiments show that the improved algorithm can achieve higher system throughput than traditional greedy algorithm and Powell Vertex Coloring (PVC) scheme.

Download Full-text

A Novel Resource Allocation Scheme in NOMA-Based Cellular Network with D2D Communications

Future Internet ◽

10.3390/fi12010008 ◽

2020 ◽

Vol 12 (1) ◽

pp. 8 ◽

Cited By ~ 1

Author(s):

Jingpu Wang ◽

Xin Song ◽

Yatao Ma

Keyword(s):

Resource Allocation ◽

Power Allocation ◽

Interference Cancellation ◽

Cellular Network ◽

System Throughput ◽

Search Rate ◽

D2d Communications ◽

Selection Scheme ◽

Allocation Algorithm ◽

Complexity Cost

Non-orthogonal multiple access (NOMA) has become a promising technology for 5G. With the support of effective resource allocation algorithms, it can improve the spectrum resource utilization and system throughput. In this article, a new resource allocation algorithm in the NOMA-enhanced cellular network with device-to-device (D2D) communications is proposed, in which we use two new searching methods and an optimal link selection scheme to maximize the system throughput and limit the interferences of the NOMA-based cellular network. In the proposed joint user scheduling, tree-based search power allocation and link selection algorithm, we simplify the solving process of previous methods and set up the optimization function, which does not need to be derivable. With successive interference cancellation (SIC) technology, we give conditions for the D2D devices accessing into the network. We also propose a suboptimal scheme to schedule cellular users and D2D devices into multiple subchannels, which reduces the complexity of the exhaustive search method. Through consistent tree-based searching for the power allocation coefficients, we can get the maximum arithmetic average of the system sum rate. Meanwhile, for the existence of the part of interferences from larger power users which can be canceled by the SIC in NOMA systems, the search options are decreased for increasing the search rate of the power allocation algorithm. Moreover, we propose a distance-aware link selection scheme to guarantee the quality of communications. In summary, the proposed algorithm can improve the system throughput, has a low complexity cost and potentially increases spectral utilization. Numerical results demonstrate that the proposed algorithm achieves a higher data transmission rate than some of the traditional methods and we also investigate the convergence and the computational complexity cost of the joint algorithm.

Download Full-text

Resource Allocation Scheme Based on Rate-Requirement for Device-to-Device Downlink Communications

International Journal of Pattern Recognition and Artificial Intelligence ◽

10.1142/s0218001419590407 ◽

2019 ◽

Vol 33 (13) ◽

pp. 1959040

Author(s):

Xin Wang ◽

Zhihong Qian ◽

Xue Wang ◽

Lan Huang

Keyword(s):

Resource Allocation ◽

Low Complexity ◽

Superior Performance ◽

System Throughput ◽

Allocation Scheme ◽

Resource Reallocation ◽

Restricted Area ◽

Device To Device ◽

Resource Allocation Scheme ◽

Rate Requirement

The rate-requirement of device-to-device (D2D) users is associated with the context information of velocity and data size of users to some extent. In this study, an efficient context-aware resource allocation scheme based on rate requirement (RARR) is proposed. This scheme consists of two allocation phases. In the rate-ensuring resource allocation phase, D2D pairs are allocated a certain amount of spectrum resource according to their rate requirement. In the allocation, the interference restricted area is limited to exclude cellular users that bring a negative capacity gain to the communication system. In the residual resource reallocation phase, surplus resources are assigned to D2D pairs according to the system fairness. Simulation results indicate that the proposed RARR scheme efficiently leads to superior performance in terms of system throughput and fairness and exhibits low complexity relative to traditional resource allocation.

Download Full-text

Integer-Linear-Programing Optimization in Scalable Video Multicast with Adaptive Modulation and Coding in Wireless Networks

The Scientific World JOURNAL ◽

10.1155/2014/769241 ◽

2014 ◽

Vol 2014 ◽

pp. 1-7 ◽

Cited By ~ 1

Author(s):

Dongyul Lee ◽

Chaewoo Lee

Keyword(s):

Resource Allocation ◽

Video Streaming ◽

Adaptive Modulation ◽

Scalable Video Coding ◽

Video Quality ◽

System Throughput ◽

Adaptive Modulation And Coding ◽

Scalable Video ◽

Wireless Multimedia ◽

Channel Conditions

The advancement in wideband wireless network supports real time services such as IPTV and live video streaming. However, because of the sharing nature of the wireless medium, efficient resource allocation has been studied to achieve a high level of acceptability and proliferation of wireless multimedia. Scalable video coding (SVC) with adaptive modulation and coding (AMC) provides an excellent solution for wireless video streaming. By assigning different modulation and coding schemes (MCSs) to video layers, SVC can provide good video quality to users in good channel conditions and also basic video quality to users in bad channel conditions. For optimal resource allocation, a key issue in applying SVC in the wireless multicast service is how to assign MCSs and the time resources to each SVC layer in the heterogeneous channel condition. We formulate this problem with integer linear programming (ILP) and provide numerical results to show the performance under 802.16 m environment. The result shows that our methodology enhances the overall system throughput compared to an existing algorithm.

Download Full-text

AN OPTIMAL SYSTOLIC DICTIONARY

Parallel Processing Letters ◽

10.1142/s0129626495000412 ◽

1995 ◽

Vol 05 (03) ◽

pp. 451-460

Author(s):

I. W. CHAN ◽

F. CHOI

Keyword(s):

Response Time ◽

System Throughput ◽

Optimal Response ◽

Vlsi Technology ◽

Systolic Algorithm ◽

Average Latency ◽

High System

We present a simple systolic algorithm for implementing dictionary machine based on the VLSI technology. Our design makes use of a dynamic. global tree rebalancing scheme to attain high system throughput. Our scheme is simple to implement and requires low sophistication in the design of processing nodes. Results from analysis and simulation show that our algorithm has optimal response time and achieves an average latency close to 1. This represents a significant improvement over many of the previous designs. Unlike most parallel dictionary machines reported in the literature, our approach requires no compression operations.

Download Full-text