Joint Radio Resource Allocation and Beamforming Optimization for Industrial Internet of Things in Software-Defined Networking-Based Virtual Fog-Radio Access Network 5G-and-Beyond Wireless Environments

Rahimi, Payam and Chrysostomou, Chrysostomos and Pervaiz, Haris and Vassiliou, Vasos and Ni, Qiang (2022) Joint Radio Resource Allocation and Beamforming Optimization for Industrial Internet of Things in Software-Defined Networking-Based Virtual Fog-Radio Access Network 5G-and-Beyond Wireless Environments. IEEE Transactions on Industrial Informatics, 18 (6). pp. 4198-4209. ISSN 1551-3203

[img]
Text (Final author manuscript_TII)
Final_author_manuscript_TII.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.

Download (936kB)

Abstract

Fog computing-based radio access network (Fog-RAN) leveraging the software-defined networking (SDN) and network function virtualization (NFV) is the most promising solution to offer real-time support for the massive number of connected devices in the industrial Internet of Things (IIoT) networks. However, designing an optimal dynamic radio resource allocation to handle the fluctuating traffic loads is critical. In this article, a novel architectural design of an SDN-based virtual Fog-RAN is proposed, in which we jointly study radio resource allocation and transmit beamforming to improve resource utilization and IIoT users’ satisfaction, by minimizing the network power consumption (NPC) and maximizing the achievable sum-rate (ASR), simultaneously. To this end, we first formulate a mixed-integer nonlinear problem to optimize the physical resource block allocation, the assignment of user equipments, and radio unit, and the downlink transmit beamforming, by considering imperfect channel state information. To solve the ntractable MINLP, we exploit the successive convex approximation approach. Then, we formulate a multiple knapsack problem (MKP) to optimize the assignment between RUs and virtual baseband units, by exploiting the set of active RUs minimized in the previous problem. We solve the formulated MKP by decomposing the dual problems and solving them through the dual descent method. Through performance analysis, we show the proposed approach provides a high users’ satisfaction rate, maximizes the ASR and minimizes the NPC, and provides better savings, in terms of the number of radio and baseband resources utilized, than its counterparts.

Item Type:
Journal Article
Journal or Publication Title:
IEEE Transactions on Industrial Informatics
Additional Information:
©2021 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2200/2208
Subjects:
ID Code:
167527
Deposited By:
Deposited On:
17 Mar 2022 14:40
Refereed?:
Yes
Published?:
Published
Last Modified:
22 May 2022 00:35