Ning Du
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ning Du has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Changqing Zhou
No. 513 Institute, No. 5 Academy, China Aerospace Science & Technology Corporation, Yantai, China
2 shared publications Changqing Zhou
Shandong Institute of Space Electronic Technology
1 shared publication- Chinmay Chakraborty
Centre of Innovation and Research (COIR) in Medical Technology, KIIT Deemed to be University, Bhubaneswar, Odisha, India
1 shared publication Fa-Sheng Liu
Shandong University of Science and Technology
1 shared publication- Fasheng Liu
College of Electrical Engineering and Automation
1 shared publication - Hongxiang Shen
Department of Electrical and Computer Engineering, Yokohama National University, Yokohama 240-8501, Japan
1 shared publication
Latest Publications
- 4 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (3) , 4969-4977
A Novel Power Allocation Algorithm for Minimizing Energy Consumption in D2D Communication Systems
Device to device (D2D) is becoming one of the critic technologies of green smart cities. The uplink power allocation is investigated, when D2D users reuse subchannels of cellular users. The overall goal lies in minimization of energy consumption under guarantee of required data transmission rate, which belongs to a nondeterministic polynomial (NP) hard optimization problem. After analysis, we find that the constraint has implicit monotonicity, so we introduce a new vector to transform it into a monotonic optimization problem. Then, the equivalence of the problem before and after transformation is proved. To search global optimal energy conservation solution, we design a novel power allocation algorithm based on principle of reverse polyblock approximation and prove its convergence. It is demonstrated that our proposal is able to reduce power consumption in comparison to the most advanced alternatives. The proposed algorithm can be used as a benchmark to evaluate other algorithms.
- 4 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (3) , 4969-4977
A Novel Power Allocation Algorithm for Minimizing Energy Consumption in D2D Communication Systems
Device to device (D2D) is becoming one of the critic technologies of green smart cities. The uplink power allocation is investigated, when D2D users reuse subchannels of cellular users. The overall goal lies in minimization of energy consumption under guarantee of required data transmission rate, which belongs to a nondeterministic polynomial (NP) hard optimization problem. After analysis, we find that the constraint has implicit monotonicity, so we introduce a new vector to transform it into a monotonic optimization problem. Then, the equivalence of the problem before and after transformation is proved. To search global optimal energy conservation solution, we design a novel power allocation algorithm based on principle of reverse polyblock approximation and prove its convergence. It is demonstrated that our proposal is able to reduce power consumption in comparison to the most advanced alternatives. The proposed algorithm can be used as a benchmark to evaluate other algorithms.
- Open Access
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
A Novel Subchannel and Power Allocation Algorithm in V2V Communication
This paper investigates resource allocation of latency constrained vehicle‐to‐vehicle (V2V) communication. When a subchannel of a vehicle‐to‐infrastructure (V2I) link can be reused by multiple V2V links, a nonlinear mixed integer optimization problem with the goal of maximizing the spectral efficiency of the system is derived under the constraints of minimum transmission rate of V2I links and transmission latency of V2V links. The subchannel allocation problem is solved by means of two‐sided exchange matching theory, optimal transmission power of V2I and V2V links is solved based on the poly‐block approximation (PBA) algorithm, and the system spectrum efficiency is maximized through loop iteration. In order to reduce the computational complexity of power allocation problem, a power allocation algorithm based on iterative convex optimization (ICO) is proposed. The convergence of the resource allocation algorithm is also proved. The simulation results show that the proposed algorithms can guarantee transmission latency requirements of V2V links and improve the system sum rate and access ratio of V2V links. Compared with two traditional algorithms, latency of poly‐block approximation combined with many to one matching (PBAMTO) is reduced by 30.41% and 20.43%, respectively.
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Open AccessA Novel Subchannel and Power Allocation Algorithm in V2V Communication
This paper investigates resource allocation of latency constrained vehicle‐to‐vehicle (V2V) communication. When a subchannel of a vehicle‐to‐infrastructure (V2I) link can be reused by multiple V2V links, a nonlinear mixed integer optimization problem with the goal of maximizing the spectral efficiency of the system is derived under the constraints of minimum transmission rate of V2I links and transmission latency of V2V links. The subchannel allocation problem is solved by means of two‐sided exchange matching theory, optimal transmission power of V2I and V2V links is solved based on the poly‐block approximation (PBA) algorithm, and the system spectrum efficiency is maximized through loop iteration. In order to reduce the computational complexity of power allocation problem, a power allocation algorithm based on iterative convex optimization (ICO) is proposed. The convergence of the resource allocation algorithm is also proved. The simulation results show that the proposed algorithms can guarantee transmission latency requirements of V2V links and improve the system sum rate and access ratio of V2V links. Compared with two traditional algorithms, latency of poly‐block approximation combined with many to one matching (PBAMTO) is reduced by 30.41% and 20.43%, respectively.
- Open Access
- 8 January 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-11
A Novel Access Control and Energy-Saving Resource Allocation Scheme for D2D Communication in 5G Networks
This paper investigates access link control and resource allocation for the device-to-device (D2D) communication in the fifth generation (5G) cellular networks. The optimization objective of this problem is to maximize the number of admitted D2D links and minimize the total power consumption of D2D links under the condition of meeting the minimum transmission rate requirements of D2D links and common cellular links. This problem is a two-stage nondeterministic polynomial (NP) problem, the solving process of which is very complex. So, we transform it into a one-stage optimization problem. According to the monotonicity of objective function and constraint conditions, a monotone optimization problem is established, which is solved by reverse polyblock approximation algorithm. In order to reduce the complexity of this algorithm, a solution algorithm based on iterative convex optimization is proposed. Simulation results show that both algorithms can maximize the number of admitted D2D links and minimize the total power consumption of D2D links. The proposed two algorithms are better than the energy efficiency optimization algorithm.
- 8 January 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-11
Open AccessA Novel Access Control and Energy-Saving Resource Allocation Scheme for D2D Communication in 5G Networks
This paper investigates access link control and resource allocation for the device-to-device (D2D) communication in the fifth generation (5G) cellular networks. The optimization objective of this problem is to maximize the number of admitted D2D links and minimize the total power consumption of D2D links under the condition of meeting the minimum transmission rate requirements of D2D links and common cellular links. This problem is a two-stage nondeterministic polynomial (NP) problem, the solving process of which is very complex. So, we transform it into a one-stage optimization problem. According to the monotonicity of objective function and constraint conditions, a monotone optimization problem is established, which is solved by reverse polyblock approximation algorithm. In order to reduce the complexity of this algorithm, a solution algorithm based on iterative convex optimization is proposed. Simulation results show that both algorithms can maximize the number of admitted D2D links and minimize the total power consumption of D2D links. The proposed two algorithms are better than the energy efficiency optimization algorithm.
- Open Access
- 21 May 2017
- Published by MDPI AG in Applied Sciences
- Vol. 7 (5) , 520
Joint Resource Allocation in Secure OFDMA-Based Networks Taking a Base Station as a Two-Way Relay
Due to the broadcast nature of wireless media, all nodes in the coverage of a transmitter are capable of capturing its signals, thus wireless transmission is sensitive to wiretapping. Several existing schemes place an emphasis on secrecy rate improvement, under the protocols of amplify-and-forward or decode-and-forward, when there are only relay users in the network. We set up a novel communication model in which normal and two-way relay users coexist in the same cell, taking the base station as a relay. Our objective is to maximize the total secrecy rate, taking subcarrier pairing, subcarrier assignment and power allocation into account, when there is one eavesdropper in one cell of the cellular network. Although this problem is very intricate, we reformulate it as a convex optimization problem by means of Lagrange duality. In order to reduce the computational complexity, equal power allocation is proposed. Lastly, the experimental results show the proposed resource allocation scheme can obtain a higher secrecy rate than traditional schemes.
- 21 May 2017
- Published by MDPI AG in Applied Sciences
- Vol. 7 (5) , 520
Open AccessJoint Resource Allocation in Secure OFDMA-Based Networks Taking a Base Station as a Two-Way Relay
Due to the broadcast nature of wireless media, all nodes in the coverage of a transmitter are capable of capturing its signals, thus wireless transmission is sensitive to wiretapping. Several existing schemes place an emphasis on secrecy rate improvement, under the protocols of amplify-and-forward or decode-and-forward, when there are only relay users in the network. We set up a novel communication model in which normal and two-way relay users coexist in the same cell, taking the base station as a relay. Our objective is to maximize the total secrecy rate, taking subcarrier pairing, subcarrier assignment and power allocation into account, when there is one eavesdropper in one cell of the cellular network. Although this problem is very intricate, we reformulate it as a convex optimization problem by means of Lagrange duality. In order to reduce the computational complexity, equal power allocation is proposed. Lastly, the experimental results show the proposed resource allocation scheme can obtain a higher secrecy rate than traditional schemes.
- 1 August 2016
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 17 (8) , 825-833
A novel resource optimization scheme for multi-cell OFDMA relay network
- 1 August 2016
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 17 (8) , 825-833
A novel resource optimization scheme for multi-cell OFDMA relay network