Search

In the field of armored vehicles, up to 70% of accidents are associated with low levels of situational awareness among the occupants, highlighting the importance of situational awareness in improving task performance. In this study, we explored the mechanisms influencing situational awareness by simulating an armored vehicle driving platform with 14 levels of experimentation in terms of five factors: experience, expectations, attention, the cueing channel, and automation. The experimental data included SART and SAGAT questionnaire scores, eye movement indicators, and electrocardiographic and electrodermal signals. Data processing and analysis revealed the following conclusions: (1) Experienced operators have higher levels of situational awareness. (2) Operators with certain expectations have lower levels of situational awareness. (3) Situational awareness levels are negatively correlated with information importance affiliations and the frequency of anomalous information in non-primary tasks. (4) Dual-channel cues lead to higher levels of situational awareness than single-channel cues. (5) Operators' situational awareness is lower at high automation levels. [ABSTRACT FROM AUTHOR]

With the progression of smart vehicles, i.e., connected autonomous vehicles (CAVs), and wireless technologies, there has been an increased need for substantial computational operations for tasks such as path planning, scene recognition, and vision-based object detection. Managing these intensive computational applications is concerned with significant energy consumption. Hence, for this article, a low-cost and sustainable solution using computational offloading and efficient resource allocation at edge devices within the Internet of Vehicles (IoV) framework has been utilised. To address the quality of service (QoS) among vehicles, a trade-off between energy consumption and computational time has been taken into consideration while deciding on the offloading process and resource allocation. The offloading process has been assigned at a minimum wireless resource block level to adapt to the beyond 5G (B5G) network. The novel approach of joint optimisation of computational resources and task offloading decisions uses the meta-heuristic particle swarm optimisation (PSO) algorithm and decision analysis (DA) to find the near-optimal solution. Subsequently, a comparison is made with other proposed algorithms, namely CTORA, CODO, and Heuristics, in terms of computational efficiency and latency. The performance analysis reveals that the numerical results outperform existing algorithms, demonstrating an 8% and a 5% increase in energy efficiency. [ABSTRACT FROM AUTHOR]

Edge computing provides higher computational power and lower transmission latency by offloading tasks to nearby edge nodes with available computational resources to meet the requirements of time-sensitive tasks and computationally complex tasks. Resource allocation schemes are essential to this process. To allocate resources effectively, it is necessary to attach metadata to a task to indicate what kind of resources are needed and how many computation resources are required. However, these metadata are sensitive and can be exposed to eavesdroppers, which can lead to privacy breaches. In addition, edge nodes are vulnerable to corruption because of their limited cybersecurity defenses. Attackers can easily obtain end-device privacy through unprotected metadata or corrupted edge nodes. To address this problem, we propose a metadata privacy resource allocation scheme that uses searchable encryption to protect metadata privacy and zero-knowledge proofs to resist semi-malicious edge nodes. We have formally proven that our proposed scheme satisfies the required security concepts and experimentally demonstrated the effectiveness of the scheme. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) use multiple channels to communicate using wireless access in vehicular environment (WAVE) standards to provide a variety of vehicle-related applications. The current IEEE 802.11p WAVE communication channel structure is composed of one control channel (CCH) and several service channels (SCHs). SCHs are used for non-safety data transmission, while the CCH is used for broadcasting beacons, control, and safety. WAVE devices transmit data that alternate between CCHs and SCHs, and each channel is active for a duration called the CCH interval (CCHI) and SCH interval (SCHI), respectively. Currently, both intervals are fixed at 50 ms. However, fixed-length intervals cannot effectively respond to dynamically changing traffic loads. Additionally, when many vehicles are simultaneously using the limited channel resources for data transmission, the network performance significantly degrades due to numerous packet collisions. Herein, we propose an adaptive resource allocation technique for efficient data transmission. The technique dynamically adjusts the SCHI and CCHI to improve network performance. Moreover, to reduce data collisions and optimize the network's backoff distribution, the proposed scheme applies reinforcement learning (RL) to provide an intelligent channel access algorithm. The simulation results demonstrate that the proposed scheme can ensure high throughputs and low transmission delays. [ABSTRACT FROM AUTHOR]

In Vehicular Edge Computing Network (VECN) scenarios, the mobility of vehicles causes the uncertainty of channel state information, which makes it difficult to guarantee the Quality of Service (QoS) in the process of computation offloading and the resource allocation of a Vehicular Edge Computing Server (VECS). A multi-user computation offloading and resource allocation optimization model and a computation offloading and resource allocation algorithm based on the Deep Deterministic Policy Gradient (DDPG) are proposed to address this problem. Firstly, the problem is modeled as a Mixed Integer Nonlinear Programming (MINLP) problem according to the optimization objective of minimizing the total system delay. Then, in response to the large state space and the coexistence of discrete and continuous variables in the action space, a reinforcement learning algorithm based on DDPG is proposed. Finally, the proposed method is used to solve the problem and compared with the other three benchmark schemes. Compared with the baseline algorithms, the proposed scheme can effectively select the task offloading mode and reasonably allocate VECS computing resources, ensure the QoS of task execution, and have a certain stability and scalability. Simulation results show that the total completion time of the proposed scheme can be reduced by 24–29% compared with the existing state-of-the-art techniques. [ABSTRACT FROM AUTHOR]

Vehicular clouds represent an appealing approach, leveraging vehicles' resources to generate value-added services. Thus, efficiently searching for and allocating resources is a challenge for the successful construction of vehicular clouds. Many recent schemes have relied on hierarchical network architectures using clusters to address this challenge. These clusters are typically constructed based on vehicle proximity, such as being on the same road or within the same region. However, this approach struggles to rapidly search for and consistently allocate resources, especially considering the diverse resource types and varying mobility of vehicles. To address these limitations, we propose the Resource Cluster-based Resource Search and Allocation (RCSA) scheme. RCSA constructs resource clusters based on resource types rather than vehicle proximity. This allows for more efficient resource searching and allocation. Within these resource clusters, RCSA supports both intra-resource cluster search for the same resource type and inter-resource cluster search for different resource types. In RCSA, vehicles with longer connection times and larger resource capacities are allocated in vehicular clouds to minimize cloud breakdowns and communication traffic. To handle the reconstruction of resource clusters due to vehicle mobility, RCSA implements mechanisms for replacing Resource Cluster Heads (RCHs) and managing Resource Cluster Members (RCMs). Simulation results validate the effectiveness of RCSA, demonstrating its superiority over existing schemes in terms of resource utilization, allocation efficiency, and overall performance. [ABSTRACT FROM AUTHOR]

Smart cities are powered by several new technologies to enhance connectivity between devices and develop a network of connected objects which can lead to many smart industrial applications. This network known as the Industrial Internet of Things (IIoT) consists of sensor nodes that have limited computing capacity and are sometimes not able to execute intricate industrial tasks within their stipulated time frame. For faster execution, these tasks are offloaded to nearby fog nodes. Internet access and the diverse nature of network types make IIoT nodes vulnerable and are under serious malicious attacks. Malicious attacks can cause anomalies in the IIoT network by overloading complex tasks, which can compromise the fog processing capabilities. This results in an increased delay of task computation for trustworthy nodes. To improve the task execution capability of the fog computing node, it is important to avoid complex offloaded tasks due to malicious attacks. However, even after avoiding the malicious tasks, if the offloaded tasks are too complex for the fog node to execute, then the fog nodes may struggle to process all legitimate tasks within their stipulated time frame. To address these challenges, the Trust-based Efficient Execution of Offloaded IIoT Trusted tasks (EEOIT) is proposed for fog nodes. EEOIT proposes a mechanism to detect malicious nodes as well as manage the allocation of computing resources so that IIoT tasks can be completed in the specified time frame. Simulation results demonstrate that EEOIT outperforms other techniques in the literature in an IIoT setting with different task densities. Another significant feature of the proposed EEOIT technique is that it enhances the computation of trustable tasks in the network. The results show that EEOIT entertains more legitimate nodes in executing their offloaded tasks with more executed data, with reduced time and with increased mean trust values as compared to other schemes. [ABSTRACT FROM AUTHOR]

Car-sharing systems require accurate demand prediction to ensure efficient resource allocation and scheduling decisions. However, developing precise predictive models for vehicle demand remains a challenging problem due to the complex spatio-temporal relationships. This paper introduces USTIN, the Unified Spatio-Temporal Inference Prediction Network, a novel neural network architecture for demand prediction. The model consists of three key components: a temporal feature unit, a spatial feature unit, and a spatio-temporal feature unit. The temporal unit utilizes historical demand data and comprises four layers, each corresponding to a different time scale (hourly, daily, weekly, and monthly). Meanwhile, the spatial unit incorporates contextual points of interest data to capture geographic demand factors around parking stations. Additionally, the spatio-temporal unit incorporates weather data to model the meteorological impacts across locations and time. We conducted extensive experiments on real-world car-sharing data. The proposed USTIN model demonstrated its ability to effectively learn intricate temporal, spatial, and spatiotemporal relationships, and outperformed existing state-of-the-art approaches. Moreover, we employed negative binomial regression with uncertainty to identify the most influential factors affecting car usage. [ABSTRACT FROM AUTHOR]

The development of emerging information technologies, such as the Internet of Things (IoT), edge computing, and blockchain, has triggered a significant increase in IoT application services and data volume. Ensuring satisfactory service quality for diverse IoT application services based on limited network resources has become an urgent issue. Generalized processor sharing (GPS), functioning as a central resource scheduling mechanism guiding differentiated services, stands as a key technology for implementing on-demand resource allocation. The performance prediction of GPS is a crucial step that aims to capture the actual allocated resources using various queue metrics. Some methods (mainly analytical methods) have attempted to establish upper and lower bounds or approximate solutions. Recently, artificial intelligence (AI) methods, such as deep learning, have been designed to assess performance under self-similar traffic. However, the proposed methods in the literature have been developed for specific traffic scenarios with predefined constraints, thus limiting their real-world applicability. Furthermore, the absence of a benchmark in the literature leads to an unfair performance prediction comparison. To address the drawbacks in the literature, an AI-enabled performance benchmark with comprehensive traffic-oriented experiments showcasing the performance of existing methods is presented. Specifically, three types of methods are employed: traditional approximate analytical methods, traditional machine learning-based methods, and deep learning-based methods. Following that, various traffic flows with different settings are collected, and intricate experimental analyses at both the feature and method levels under different traffic conditions are conducted. Finally, insights from the experimental analysis that may be beneficial for the future performance prediction of GPS are derived. [ABSTRACT FROM AUTHOR]

Mobile cloud computing (MCC) provides resources to users to handle smart mobile applications. In MCC, task scheduling is the solution for mobile users' context-aware computation resource-rich applications. Most existing approaches have achieved a moderate service reliability rate due to a lack of instance-centric resource estimations and task offloading, a statistical NP-hard problem. The current intelligent scheduling process cannot address NP-hard problems due to traditional task offloading approaches. To address this problem, the authors design an efficient context-aware service offloading approach based on instance-centric measurements. The revised machine learning model/algorithm employs task adaptation to make decisions regarding task offloading. The proposed MCVS scheduling algorithm predicts the usage rates of individual microservices for a practical task scheduling scheme, considering mobile device time, cost, network, location, and central processing unit (CPU) power to train data. One notable feature of the microservice software architecture is its capacity to facilitate the scalability, flexibility, and independent deployment of individual components. A series of simulation results show the efficiency of the proposed technique based on offloading, CPU usage, and execution time metrics. The experimental results efficiently show the learning rate in training and testing in comparison with existing approaches, showing efficient training and task offloading phases. The proposed system has lower costs and uses less energy to offload microservices in MCC. Graphical results are presented to define the effectiveness of the proposed model. For a service arrival rate of 80%, the proposed model achieves an average 4.5% service offloading rate and 0.18% CPU usage rate compared with state-of-the-art approaches. The proposed method demonstrates efficiency in terms of cost and energy savings for microservice offloading in mobile cloud computing (MCC). [ABSTRACT FROM AUTHOR]

This paper investigates an intelligent reflecting surface (IRS)-aided integrated sensing and communication (ISAC) framework to cope with the problem of spectrum scarcity and poor wireless environment. The main goal of the proposed framework in this work is to optimize the overall performance of the system, including sensing, communication, and computational offloading. We aim to achieve the trade-off between system performance and overhead by optimizing spectrum and computing resource allocation. On the one hand, the joint design of transmit beamforming and phase shift matrices can enhance the radar sensing quality and increase the communication data rate. On the other hand, task offloading and computation resource allocation optimize energy consumption and delay. Due to the coupled and high dimension optimization variables, the optimization problem is non-convex and NP-hard. Meanwhile, given the dynamic wireless channel condition, we formulate the optimization design as a Markov decision process. To tackle this complex optimization problem, we proposed two innovative deep reinforcement learning (DRL)-based schemes. Specifically, a deep deterministic policy gradient (DDPG) method is proposed to address the continuous high-dimensional action space, and the prioritized experience replay is adopted to speed up the convergence process. Then, a twin delayed DDPG algorithm is designed based on this DRL framework. Numerical results confirm the effectiveness of proposed schemes compared with the benchmark methods. [ABSTRACT FROM AUTHOR]

Traditional low earth orbit (LEO) satellite networks are typically independent of terrestrial networks, which develop relatively slowly due to the on-board capacity limitation. By integrating emerging mobile edge computing (MEC) with LEO satellite networks to form the business-oriented "end-edge-cloud" multi-level computing architecture, some computing-sensitive tasks can be offloaded by ground terminals to satellites, thereby satisfying more tasks in the network. How to make computation offloading and resource allocation decisions in LEO satellite edge networks, nevertheless, indeed poses challenges in tracking network dynamics and handling sophisticated actions. For the discrete-continuous hybrid action space and time-varying networks, this work aims to use the parameterized deep Q-network (P-DQN) for the joint computation offloading and resource allocation. First, the characteristics of time-varying channels are modeled, and then both communication and computation models under three different offloading decisions are constructed. Second, the constraints on task offloading decisions, on remaining available computing resources, and on the power control of LEO satellites as well as the cloud server are formulated, followed by the maximization problem of satisfied task number over the long run. Third, using the parameterized action Markov decision process (PAMDP) and P-DQN, the joint computing offloading, resource allocation, and power control are made in real time, to accommodate dynamics in LEO satellite edge networks and dispose of the discrete-continuous hybrid action space. Simulation results show that the proposed P-DQN method could approach the optimal control, and outperforms other reinforcement learning (RL) methods for merely either discrete or continuous action space, in terms of the long-term rate of satisfied tasks. [ABSTRACT FROM AUTHOR]

D2D communication is a promising technology for enhancing spectral efficiency (SE) in cellular networks, and full-duplex (FD) has the potential to double SE. Due to D2D's short-distance communication and low transmittance power, it is natural to integrate FD into D2D, creating FD-D2D to underlay a cellular network to further improve SE. However, the residual self-interference (RSI) resulting from FD-D2D and interference arising from spectrum sharing between D2D users (DUs) and cellular users (CUs) can restrict D2D link performance. Therefore, we propose an FD-D2D underlying cellular system in which DUs jointly share uplink and downlink spectral resources with CUs. Moreover, we present two algorithms to enhance the performance experience of DUs while improving the system's SE. For the first algorithm, we tackle an optimization problem aimed at maximizing the sum rate of FD-DUs in the system while adhering to transmittance power constraints. This problem is formulated as a mixed-integer nonlinear programming problem (MINLP), known for its mathematical complexity and NP-hard nature. In order to address this MINLP, our first algorithm decomposes it into two subproblems: power control and spectral resource allocation. The power control aspect is treated as a nonlinear problem, which we solve through one-dimensional searching. Meanwhile, spectral resource allocation is achieved using the Kuhn–Munkres algorithm, determining the pairing of CUs and DUs sharing the same spectrum. As for the second algorithm, our objective is to enhance the individual performance of FD-DUs by maximizing the minimum rate among them, ensuring more uniform rate performance across all FD-DUs. In order to solve this optimization problem, we propose a novel spectral resource allocation algorithm based on bisection searching and the Kuhn–Munkres algorithm, whereas the power control aspect remains the same as in the first algorithm. The numerical results demonstrate that our proposed algorithm effectively enhances the performance of DUs in an FD-D2D underlying cellular network when compared to the sum rate maximization design. [ABSTRACT FROM AUTHOR]

Compared to cloud computing, mobile edge computing (MEC) is a promising solution for delay-sensitive applications due to its proximity to end users. Because of its ability to offload resource-intensive tasks to nearby edge servers, MEC allows a diverse range of compute- and storage-intensive applications to operate on resource-constrained devices. The optimal utilization of MEC can lead to enhanced responsiveness and quality of service, but it requires careful design from the perspective of user-base station association, virtualized resource provisioning, and task distribution. Also, considering the limited exploration of the federation concept in the existing literature, its impacts on the allocation and management of resources still remain not widely recognized. In this paper, we study the network and MEC resource scheduling problem, where some edge servers are federated, limiting resource expansion within the same federations. The integration of network and MEC is crucial, emphasizing the necessity of a joint approach. In this work, we present NAFEOS, a proposed solution formulated as a two-stage algorithm that can effectively integrate association optimization with vertical and horizontal scaling. The Stage-1 problem optimizes the user-base station association and federation assignment so that the edge servers can be utilized in a balanced manner. The following Stage-2 dynamically schedules both vertical and horizontal scaling so that the fluctuating task-offloading demands from users are fulfilled. The extensive evaluations and comparison results show that the proposed approach can effectively achieve optimal resource utilization. [ABSTRACT FROM AUTHOR]

The increasing densification and diversification of modern and upcoming wireless networks have become an important motivation for the development of agile spectrum sharing. Radio environment maps (REMs) are a basic tool for spectrum utilisation characterisation and adaptive resource allocation, but they need to be estimated through accurate interpolation methods. This work evaluated the performance of two established algorithms for spatial three-dimensional (3D) data collected in two real-world scenarios: indoors, through a mechanical measuring system, and outdoors, through an unmanned aerial vehicle (UAV) for measurement collection. The investigation was undertaken for the complete dataset on two-dimensional (2D) planes of different altitudes and for a subset of limited samples (representing the regions of interest or RoIs), which were combined together to describe the spatial 3D environment. A minimum error of −9.5 dB was achieved for a sampling ratio of 21%. The methods' performance and the input data were analysed through the resulting Kriging error standard deviation (STD) and the STD of the distances between the measurement and the estimated points. Based on the results, several challenges for the interpolation performance and the analysis of the spatial RoIs are described. They facilitate the future development of 3D spectrum occupancy characterisation in indoor and UAV-based scenarios. [ABSTRACT FROM AUTHOR]

In this paper, in order to reduce the energy consumption and time of data transmission, the non-orthogonal multiple access (NOMA) and mobile edge caching technologies are jointly considered in mobile edge computing (MEC) networks. As for the cache-assisted vehicular NOMA–MEC networks, a problem of minimizing the energy consumed by vehicles (mobile devices, MDs) is formulated under time and resource constraints, which jointly optimize the computing resource allocation, subchannel selection, device association, offloading and caching decisions. To solve the formulated problem, we develop an effective joint computation offloading and task-caching algorithm based on the twin-delayed deep deterministic policy gradient (TD3) algorithm. Such a TD3-based offloading (TD3O) algorithm includes a designed action transformation (AT) algorithm used for transforming continuous action space into a discrete one. In addition, to solve the formulated problem in a non-iterative manner, an effective heuristic algorithm (HA) is also designed. As for the designed algorithms, we provide some detailed analyses of computation complexity and convergence, and give some meaningful insights through simulation. Simulation results show that the TD3O algorithm could achieve lower local energy consumption than several benchmark algorithms, and HA could achieve lower consumption than the completely offloading algorithm and local execution algorithm. [ABSTRACT FROM AUTHOR]

Water quality monitoring systems that are enabled by the Internet of Things (IoT) and used in water applications to collect and transmit water data to data processing centers are often resource-constrained in terms of power, bandwidth, and computation resources. These limitations typically impact their performance in practice and often result in forwarding their data to remote stations where the collected water data are processed to predict the status of water quality, because of their limited computation resources. This often negates the goal of effectively monitoring the changes in water quality in a real-time manner. Consequently, this study proposes a new resource allocation method to optimize the available power and time resources as well as dynamically allocate hybrid access points (HAPs) to water quality sensors to improve the energy efficiency and data throughput of the system. The proposed system is also integrated with edge computing to enable data processing at the water site to guarantee real-time monitoring of any changes in water quality and ensure timely access to clean water by the public. The proposed method is compared with a related method to validate the system performance. The proposed system outperforms the existing system and performs well in different simulation experiments. The proposed method improved the baseline method by approximately 12.65% and 16.49% for two different configurations, demonstrating its effectiveness in improving the energy efficiency of a water quality monitoring system. [ABSTRACT FROM AUTHOR]

Low-Earth orbit (LEO) satellites have limited on-board resources, user terminals are unevenly distributed in the constantly changing coverage area, and the service requirements vary significantly. It is urgent to optimize resource allocation under the constraint of limited satellite spectrum resources and ensure the fairness of service admission control. Therefore, we propose an intelligent hierarchical admission control (IHAC) strategy based on deep reinforcement learning (DRL). This strategy combines the deep deterministic policy gradient (DDPG) and the deep Q network (DQN) intelligent algorithm to construct upper and lower hierarchical resource allocation and admission control frameworks. The upper controller considers the state features of each ground zone and satellite resources from a global perspective, and determines the beam resource allocation ratio of each ground zone. The lower controller formulates the admission control policy based on the decision of the upper controller and the detailed information of the users' services. At the same time, a designed reward and punishment mechanism is used to optimize the decisions of the upper and lower controllers. The fairness of users' services admissions in each ground zone is achieved as far as possible while ensuring the reasonable allocation of beam resources among zones. Finally, online decision-making and offline learning were combined, so that the controller could make full use of a large number of historical data to learn and generate intelligent strategies with stronger adaptive ability while interacting with the network environment in real time. A large number of simulation results show that IHAC has better performance in terms of a successful service admission rate, service drop rate, and fair resource allocation. Among them, the number of accepted services increased by 20.36% on average, the packet loss rate decreased by 17.56% on average, and the resource fairness increased by 17.16% on average. [ABSTRACT FROM AUTHOR]

Cloud organizations now face a challenge in managing the enormous volume of data and various resources in the cloud due to the rapid growth of the virtualized environment with many service users, ranging from small business owners to large corporations. The performance of cloud computing may suffer from ineffective resource management. As a result, resources must be distributed fairly among various stakeholders without sacrificing the organization's profitability or the satisfaction of its customers. A customer's request cannot be put on hold indefinitely just because the necessary resources are not available on the board. Therefore, a novel cloud resource allocation model incorporating security management is developed in this paper. Here, the Deep Linear Transition Network (DLTN) mechanism is developed for effectively allocating resources to cloud systems. Then, an Adaptive Mongoose Optimization Algorithm (AMOA) is deployed to compute the beamforming solution for reward prediction, which supports the process of resource allocation. Moreover, the Logic Overhead Security Protocol (LOSP) is implemented to ensure secured resource management in the cloud system, where Burrows–Abadi–Needham (BAN) logic is used to predict the agreement logic. During the results analysis, the performance of the proposed DLTN-LOSP model is validated and compared using different metrics such as makespan, processing time, and utilization rate. For system validation and testing, 100 to 500 resources are used in this study, and the results achieved a make-up of 2.3% and a utilization rate of 13 percent. Moreover, the obtained results confirm the superiority of the proposed framework, with better performance outcomes. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) has emerged as a promising solution to support multiple devices on the same network resources, improving spectral efficiency and enabling massive connectivity required by ever-increasing Internet of Things devices. However, traditional NOMA schemes operate in a grant-based fashion and require channel-state information and power control, which hinders its implementation for massive machine-type communications. Accordingly, this paper proposes synchronous grant-free NOMA (GF-NOMA) frameworks that effectively integrate user equipment (UE) clustering and low-complexity power control to facilitate the power-reception disparity required by the power-domain NOMA. Although single-level GF-NOMA (SGF-NOMA) designates an identical transmit power for all UEs, multi-level GF-NOMA (MGF-NOMA) groups UEs into partitions based on the sounding reference signals strength and assigns partitions with different identical power levels. Based on the objective of interest (e.g., max–sum or max–min rate), the proposed UE clustering scheme iteratively admits UEs to form clusters whose size is dynamically determined based on the number of UEs and available resource blocks (RBs). Once the UEs are acknowledged with power levels and allocated RBs through random-access response (RAR) messages, UEs can transmit anytime without grant acquisition. Numerical results show that the proposed GF-NOMA frameworks can compute clusters in the order of milliseconds for hundreds of UEs. The MGF-NOMA can reach up to 96–99% of the optimal benchmark max–sum rate, and the SGF-NOMA reaches 87% of the optimal benchmark max–sum rate at the same power consumption. Since the MGF-NOMA and optimal benchmark enforce the strongest and weakest channel UEs to transmit at maximum and minimum transmit powers, respectively, the SGF-NOMA also offers a significantly higher energy consumption fairness and network lifetime as all UEs consume equal transmit powers. Although the MGF-NOMA delivers an inferior max–min rate performance, the SGF-NOMA is shown to reach 3e6 MbpJ energy efficiency compared to the 1e7 MbpJ benchmark. [ABSTRACT FROM AUTHOR]

In this paper, we optimize the secrecy capacity of the legitimate user under resource allocation and security constraints for a multi-antenna environment for the simultaneous transmission of wireless information and power in a dynamic downlink scenario. We study the relationship between secrecy capacity and harvested energy in a power-splitting configuration for a nonlinear energy-harvesting model under co-located conditions. The capacity maximization problem is formulated for the vehicle-to-vehicle communication scenario. The formulated problem is non-convex NP-hard, so we reformulate it into a convex form using a divide-and-conquer approach. We obtain the optimal transmit power matrix and power-splitting ratio values that guarantee positive values of the secrecy capacity. We analyze different vehicle-to-vehicle communication settings to validate the differentiation of the proposed algorithm in maintaining both reliability and security. We also substantiate the effectiveness of the proposed approach by analyzing the trade-offs between secrecy capacity and harvested energy. [ABSTRACT FROM AUTHOR]

Spectral efficiency is a crucial metric in wireless communication systems, as it defines how much information can be transmitted over a given amount of spectrum resources. Non-orthogonal multiple access (NOMA) is a promising technology that has captured the interest of the wireless research community because of its capacity to enhance spectral efficiency. NOMA allows multiple users to share the same frequency band and time slot by assigning different power levels and modulation schemes to different users. Furthermore, channel assignment is a critical challenge in OFDMA-NOMA systems that must be addressed to achieve optimal performance. In this context, we propose a solution for both channel and power assignment based on channel condition by splitting the problem into two parts: first, we introduce a novel algorithm to solve the channel user allocation problem, which we refer to as Channel User Sorting and Filling (CUSF). Then, we solve the power allocation problem in two steps: we apply the water filling algorithm at the power assignment and then we implement the Fractional Transmit Power Control (FTPC) algorithm in the NOMA power assignment. [ABSTRACT FROM AUTHOR]

In this article, we utilize Digital Twins (DT) with edge networks using blockchain technology for reliable real-time data processing and provide a secure, scalable solution to bridge the gap between physical edge networks and digital systems. Then, we suggest a Federated Learning (FL) framework for collaborative computing that runs on a blockchain and is powered by the DT edge network. This framework increases data privacy while enhancing system security and reliability. The provision of sustainable Resource Allocation (RA) and ensure real-time data-processing interaction between Internet of Things (IoT) devices and edge servers depends on a balance between system latency and Energy Consumption (EC) based on the proposed DT-empowered Deep Reinforcement Learning (Deep-RL) agent. The Deep-RL agent evaluates the performance action based on RA actions in DT to distribute its bandwidth resources to IoT devices based on iteration and the actions taken to generate the best policy and enhance learning efficiency at every step. The simulation results show that the proposed Deep-RL-agent-based DT is able to exploit the best policy, select 47.5% of computing activities that are to be carried out locally with 1 MHz bandwidth and minimize the weighted cost of the transmission policy of edge-computing strategies. [ABSTRACT FROM AUTHOR]

This paper presents a detailed framework for adaptive low-complexity and power-efficient resource allocation in decentralized device-to-device (D2D) networks. The adopted system model considers that active devices can directly communicate via specified signaling channels. Each D2D receiver attempts to allocate its D2D resources by selecting a D2D transmitter and one of its spectral channels that can meet its performance target. The process is performed adaptively over successive packet durations with the objective of limiting the transmit power on D2D links while reducing the processing complexity. The proposed D2D link adaptation scheme is modeled and analyzed under generalized channel conditions. It considers the random impact of potential D2D transmitters as well as the random number of co-channel interference sources on each D2D link. Interference cancelation schemes are also addressed to alleviate co-channel interference, which can ease the D2D resource allocation process. Generalized formulations for the statistics of the resulting signal-to-interference plus noise ratio (SINR) of the proposed adaptation scheme are presented. Moreover, generic analytical results were developed for some important performance measures as well as processing load measures. They facilitate tradeoff studies between the achieved performance and the processing complexity of the proposed scheme. Insightful results for the distributions of SINRs on individual D2D links under specific fading models are shown in this paper. The results herein add enhancements to some previous contributions and can handle various practical constraints. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) networks offer a wide range of applications in an overload situation, broadcasting and advertising, public safety, disaster management, etc. Providing robust communication services to mobile users (MUs) is a challenging task because of the dynamic characteristics of MUs. Resource allocation, including subchannels, transmit power, and serving users, is a critical transmission problem; further, it is also crucial to improve the coverage and energy efficacy of UAV-assisted transmission networks. This paper presents an Enhanced Slime Mould Optimization with Deep-Learning-based Resource Allocation Approach (ESMOML-RAA) in UAV-enabled wireless networks. The presented ESMOML-RAA technique aims to efficiently accomplish computationally and energy-effective decisions. In addition, the ESMOML-RAA technique considers a UAV as a learning agent with the formation of a resource assignment decision as an action and designs a reward function with the intention of the minimization of the weighted resource consumption. For resource allocation, the presented ESMOML-RAA technique employs a highly parallelized long short-term memory (HP-LSTM) model with an ESMO algorithm as a hyperparameter optimizer. Using the ESMO algorithm helps properly tune the hyperparameters related to the HP-LSTM model. The performance validation of the ESMOML-RAA technique is tested using a series of simulations. This comparison study reports the enhanced performance of the ESMOML-RAA technique over other ML models. [ABSTRACT FROM AUTHOR]

Aiming to address the limitations of traditional resource allocation algorithms in the Internet of Vehicles (IoV), whereby they cannot meet the stringent demands for ultra-low latency and high reliability in vehicle-to-vehicle (V2V) communication, this paper proposes a wireless resource allocation algorithm for V2V communication based on the multi-agent deep Q-network (MDQN). The system model utilizes 5G network slicing technology as its fundamental feature and maximizes the weighted spectrum–energy efficiency (SEE) while satisfying reliability and latency constraints. In this approach, each V2V link is treated as an agent, and the state space, action, and reward function of MDQN are specifically designed. Through centralized training, the neural network parameters of MDQN are determined, and the optimal resource allocation strategy is achieved through distributed execution. Simulation results demonstrate the effectiveness of the proposed scheme in significantly improving the SEE of the network while maintaining a certain success rate for V2V link load transmission. [ABSTRACT FROM AUTHOR]

Natural disasters, including earthquakes, floods, landslides, tsunamis, wildfires, and hurricanes, have become more common in recent years due to rapid climate change. For Post-Disaster Management (PDM), authorities deploy various types of user equipment (UE) for the search and rescue operation, for example, search and rescue robots, drones, medical robots, smartphones, etc., via the Internet of Robotic Things (IoRT) supported by cellular 4G/LTE/5G and beyond or other wireless technologies. For uninterrupted communication services, movable and deployable resource units (MDRUs) have been utilized where the base stations are damaged due to the disaster. In addition, power optimization of the networks by satisfying the quality of service (QoS) of each UE is a crucial challenge because of the electricity crisis after the disaster. In order to optimize the energy efficiency, UE throughput, and serving cell (SC) throughput by considering the stationary as well as movable UE without knowing the environmental priori knowledge in MDRUs aided two-tier heterogeneous networks (HetsNets) of IoRT, the optimization problem has been formulated based on emitting power allocation and user association combinedly in this article. This optimization problem is nonconvex and NP-hard where parameterized (discrete: user association and continuous: power allocation) action space is deployed. The new model-free hybrid action space-based algorithm called multi-pass deep Q network (MP-DQN) is developed to optimize this complex problem. Simulations results demonstrate that the proposed MP-DQN outperforms the parameterized deep Q network (P-DQN) approach, which is well known for solving parameterized action space, DQN, as well as traditional algorithms in terms of reward, average energy efficiency, UE throughput, and SC throughput for motionless as well as moveable UE. [ABSTRACT FROM AUTHOR]

Simultaneous wireless information and power transfer (SWIPT) technology can effectively extend the lifecycle of energy-constrained networks. In order to improve the energy harvesting (EH) efficiency and network performance in secure SWIPT networks, this paper studies the resource allocation problem based on the quantitative EH mechanism in the secure SWIPT network. Based on a quantitative EH mechanism and nonlinear EH model, a quantified power-splitting (QPS) receiver architecture is designed. This architecture is applied in the multiuser multi-input single-output secure SWIPT network. With the goal of maximizing the network throughput, the optimization problem model is established under the conditions of meeting the legal user's signal-to-interference-plus-noise ratio (SINR), EH requirements, the total transmit power of the base station, and the security SINR threshold constraints. Due to the coupling of variables, the problem is a nonconvex optimization problem. To deal with the nonconvex optimization problem, a hierarchical optimization method is adopted. Firstly, an optimization algorithm based on the optimal received power of EH circuit is proposed, and a power mapping table is constructed through the optimization algorithm, from which the optimal power ratio to meet the user's EH requirements is obtained; then, the nonconvex problem is transformed into a convex problem by using variable substitution, semidefinite relaxation, dichotomous optimization, etc. The simulation results show that compared with the power splitting receiver architecture, the input power threshold range of the QPS receiver architecture is larger, which can avoid the EH circuit falling into the saturated working area and maintain high network throughput. [ABSTRACT FROM AUTHOR]

The 5G network is designed to serve three main use cases: enhanced mobile broadband (eMBB), massive machine-type communications (mMTC), and ultra-reliable and low-latency communications (uRLLC). There are many new technological enablers, including the cloud radio access network (C-RAN) and network slicing, that can support 5G and meet its requirements. The C-RAN combines both network virtualization and based band unit (BBU) centralization. Using the network slicing concept, the C-RAN BBU pool can be virtually sliced into three different slices. 5G slices require a number of Quality of service (QoS) metrics, such as average response time and resource utilization. In order to enhance the C-RAN BBUs utilization while protecting the minimum QoS of the coexisting three slices, a priority-based resource allocation with queuing model is proposed. The uRLLC is given the highest priority, while eMBB has a higher priority than mMTC services. The proposed model allows the eMBB and mMTC to be queued and the interrupted mMTC to be restored in its queue to increase its chance to reattempt the service later. The proposed model's performance measures are defined and derived using a continuous-time Markov chain (CTMC) model and evaluated and compared using different methodologies. Based on the results, the proposed scheme can increase C-RAN resource utilization without degrading the QoS of the highest-priority uRLLC slice. Additionally, it can reduce the forced termination priority of the interrupted mMTC slice by allowing it to re-join its queue. Therefore, the comparison of the results shows that the proposed scheme outperforms the other states of the art in terms of improving the C-RAN utilization and enhancing the QoS of eMBB and mMTC slices without degrading the QoS of the highest priority use case. [ABSTRACT FROM AUTHOR]

Intelligent telemedicine technology has been widely applied due to the quick development of the Internet of Things (IoT). The edge-computing scheme can be regarded as a feasible solution to reduce energy consumption and enhance the computing capabilities for the Wireless Body Area Network (WBAN). For an edge-computing-assisted intelligent telemedicine system, a two-layer network architecture composed of WBAN and Edge-Computing Network (ECN) was considered in this paper. Moreover, the age of information (AoI) was adopted to describe the time cost for the TDMA transmission mechanism in WBAN. According to the theoretical analysis, the strategy for resource allocation and data offloading in edge-computing-assisted intelligent telemedicine systems can be expressed as a system utility function optimizing problem. To maximize the system utility, an incentive mechanism based on contract theory (CT) was considered to motivate edge servers (ESs) to participate in system cooperation. To minimize the system cost, a cooperative game was developed to address the slot allocation in WBAN, while a bilateral matching game was utilized to optimize the data offloading problem in ECN. Simulation results have verified the effectiveness of the strategy proposed in terms of the system utility. [ABSTRACT FROM AUTHOR]

An optimal method for resource allocation based on contract theory is proposed to improve energy utilization. In heterogeneous networks (HetNets), distributed heterogeneous network architectures are designed to balance different computing capacities, and MEC server gains are designed based on the amount of allocated computing tasks. An optimal function based on contract theory is developed to optimize the revenue gain of MEC servers while considering constraints such as service caching, computation offloading, and the number of resources allocated. As the objective function is a complex problem, it is solved utilizing equivalent transformations and variations of the reduced constraints. A greedy algorithm is applied to solve the optimal function. A comparative experiment on resource allocation is conducted, and energy utilization parameters are calculated to compare the effectiveness of the proposed algorithm and the main algorithm. The results show that the proposed incentive mechanism has a significant advantage in improving the utility of the MEC server. [ABSTRACT FROM AUTHOR]

Virtualization is a core 5G network technology which helps telecom companies significantly reduce capital expenditure and operating expenses by deploying multiple services on the same hardware infrastructure. However, providing QoS-guaranteed services for multi-tenants poses a significant challenge due to multi-tenant service diversity. Network slicing has been proposed as a means of addressing this problem by isolating computing and communication resources for the different tenants of different services. However, optimizing the allocation of the network and computation resources across multiple network slices is a critical but extremely difficult problem. Accordingly, this study proposes two heuristic algorithms, namely Minimum Cost Resource Allocation (MCRA) and Fast Latency Decrease Resource Allocation (FLDRA), to perform dynamic path routing and resource allocation for multi-tenant network slices in a two-tier architecture. The simulation results show that both algorithms significantly outperform the Upper-tier First with Latency-bounded Overprovisioning Prevention (UFLOP) algorithm proposed in previous work. Furthermore, the MCRA algorithm achieves a higher resource utilization than the FLDRA algorithm. [ABSTRACT FROM AUTHOR]

The growing number of connected objects has allowed the development of new applications in different areas. In addition, the technologies that support these applications, such as cloud and fog computing, face challenges in providing the necessary resources to process information for different applications due to the highly dynamic nature of these networks and the many heterogeneous devices involved. This article reviews the existing literature on one of these challenges: resource allocation in the fog–cloud continuum, including approaches that consider different strategies and network characteristics. We also discuss the factors influencing resource allocation decisions, such as energy consumption, latency, monetary cost, or network usage. Finally, we identify the open research challenges and highlight potential future directions. This survey article aims to serve as a valuable reference for researchers and practitioners interested in the field of edge computing and resource allocation. [ABSTRACT FROM AUTHOR]

Network slicing is considered a key feature of 5G and beyond cellular systems. It opens the door for new business models of mobile operators, enables new services, reduces costs with advanced infrastructure-sharing techniques, and improves heterogeneous traffic service. With slicing, the operators can tailor the network resources to the requirements of specific verticals, applications, and corresponding traffic types. To satisfy the heterogeneous quality of service (QoS) requirements of various slices, efficient virtualization and resource allocation algorithms are required. Such algorithms are especially crucial for the radio access network (RAN) because of the spectrum scarcity. This article develops DeSlice, a novel architecture for RAN slicing. DeSlice enables efficient real-time slicing algorithms that satisfy heterogeneous QoS requirements of the slices and improve the quality of experience for their end users. The article illustrates the advantages of DeSlice by considering the problem of the joint service of cloud VR, video, and web traffic. It develops the algorithms using DeSlice architecture and application-to-network communication. With simulations, it shows that, together, the architecture and the algorithms allow greatly improving the QoE for these traffics significantly. [ABSTRACT FROM AUTHOR]

Wireless cellular networks have become increasingly important in providing data access to cellular users via a grid of cells. Many applications are considered to read data from smart meters for potable water, gas, or electricity. This paper proposes a novel algorithm to assign paired channels for intelligent metering through wireless connectivity, which is particularly relevant due to the commercial advantages that a virtual operator currently provides. The algorithm considers the behavior of secondary spectrum channels assigned to smart metering in a cellular network. It explores spectrum reuse in a virtual mobile operator to optimize dynamic channel assignment. The proposed algorithm exploits the white holes in the cognitive radio spectrum and considers the coexistence of different uplink channels, resulting in improved efficiency and reliability for smart metering. The work also defines the average user transmission throughput and total smart meter cell throughput as metrics to measure performance, providing insights into the effects of the chosen values on the overall performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this study, we consider the combination of clustering and resource allocation based on game theory in ultra-dense networks that consist of multiple macrocells using massive multiple-input multiple-output and a vast number of randomly distributed drones serving as small-cell base stations. In particular, to mitigate the intercell interference, we propose a coalition game for clustering small cells, with the utility function being the ratio of signal to interference. Then, the optimization problem of resource allocation is divided into two subproblems: subchannel allocation and power allocation. We use the Hungarian method, which is efficient for solving binary optimization problems, to assign the subchannels to users in each cluster of small cells. Additionally, a centralized algorithm with low computational complexity and a distributed algorithm based on the Stackelberg game are provided to maximize the network energy efficiency (EE). The numerical results demonstrate that the game-based method outperforms the centralized method in terms of execution time in small cells and is better than traditional clustering in terms of EE. [ABSTRACT FROM AUTHOR]

With the rapid development of the 5G power Internet of Things (IoT), new power systems have higher requirements for data transmission rates, latency, reliability, and energy efficiency. Specifically, the hybrid service of enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC) has brought new challenges to the differentiated service of the 5G power IoT. To solve the above problems, this paper first constructs a power IoT model based on NOMA for the mixed service of URLLC and eMBB. Considering the shortage of resource utilization in eMBB and URLLC hybrid power service scenarios, the problem of maximizing system throughput through joint channel selection and power allocation is proposed. The channel selection algorithm based on matching as well as the power allocation algorithm based on water injection are developed to tackle the problem. Both theoretical analysis and experimental simulation verify that our method has superior performance in system throughput and spectrum efficiency. [ABSTRACT FROM AUTHOR]

Due to the characteristics of global coverage, on-demand access, and large capacity, the low earth orbit (LEO) satellite communication (SatCom) has become one promising technology to support the Internet-of-Things (IoT). However, due to the scarcity of satellite spectrum and the high cost of designing satellites, it is difficult to launch a dedicated satellite for IoT communications. To facilitate IoT communications over LEO SatCom, in this paper, we propose the cognitive LEO satellite system, where the IoT users act as the secondary user to access the legacy LEO satellites and cognitively use the spectrum of the legacy LEO users. Due to the flexibility of code division multiple access (CDMA) in multiple access and the wide use of CDMA in LEO SatCom, we apply CDMA to support cognitive satellite IoT communications. For the cognitive LEO satellite system, we are interested in the achievable rate analysis and resource allocation. Specifically, considering the randomness of spreading codes, we use the random matrix theory to analyze the asymptotic signal-to-interference-plus-noise ratios (SINRs) and accordingly obtain the achievable rates for both legacy and IoT systems. The power of the legacy and IoT transmissions at the receiver are jointly allocated to maximize the sum rate of the IoT transmission subject to the legacy satellite system performance requirement and the maximum received power constraints. We prove that the sum rate of the IoT users is quasi-concave over the satellite terminal receive power, based on which the optimal receive powers for these two systems are derived. Finally, the resource allocation scheme proposed in this paper has been verified by extensive simulations. [ABSTRACT FROM AUTHOR]

Due to the unpredictable presence of Non-Cognitive Users (NCUs) in the time and frequency domains, the number of available channels (i.e., channels where no NCUs exist) and corresponding channel indices per Cognitive User (CU) may differ. In this paper, we propose a heuristic channel allocation method referred to as Enhanced Multi-Round Resource Allocation (EMRRA), which employs the asymmetry of available channels in existing MRRA to randomly allocate a CU to a channel in each round. EMRRA is designed to enhance the overall spectral efficiency and fairness of channel allocation. To do this, the available channel with the lowest redundancy is primarily selected upon allocating a channel to a CU. In addition, when there are multiple CUs with the same allocation priority, the CU with the smallest number of available channels is chosen. We execute extensive simulations in order to investigate the effect of the asymmetry of available channels on CUs and compare the performance of EMRRA to that of MRRA. As a result, in addition to the asymmetry of available channels, it is confirmed that most of the channels are simultaneously available to multiple CUs. Furthermore, EMRRA outperforms MRRA in terms of the channel allocation rate, fairness, and drop rate and has a slightly higher collision rate. In particular, EMRRA can remarkably reduce the drop rate compared to MRRA. [ABSTRACT FROM AUTHOR]

The rapid development of the Internet of Things (IoT) has led to computational offloading at the edge; this is a promising paradigm for achieving intelligence everywhere. As offloading can lead to more traffic in cellular networks, cache technology is used to alleviate the channel burden. For example, a deep neural network (DNN)-based inference task requires a computation service that involves running libraries and parameters. Thus, caching the service package is necessary for repeatedly running DNN-based inference tasks. On the other hand, as the DNN parameters are usually trained in distribution, IoT devices need to fetch up-to-date parameters for inference task execution. In this work, we consider the joint optimization of computation offloading, service caching, and the AoI metric. We formulate a problem to minimize the weighted sum of the average completion delay, energy consumption, and allocated bandwidth. Then, we propose the AoI-aware service caching-assisted offloading framework (ASCO) to solve it, which consists of the method of Lagrange multipliers with the KKT condition-based offloading module (LMKO), the Lyapunov optimization-based learning and update control module (LLUC), and the Kuhn–Munkres (KM) algorithm-based channel-division fetching module (KCDF). The simulation results demonstrate that our ASCO framework achieves superior performance in regard to time overhead, energy consumption, and allocated bandwidth. It is verified that our ASCO framework not only benefits the individual task but also the global bandwidth allocation. [ABSTRACT FROM AUTHOR]

With the advent of Software Defined Network (SDN) and Network Functions Virtualization (NFV), network operators can offer Service Function Chain (SFC) flexibly to accommodate the diverse network function (NF) requirements of their users. However, deploying SFCs efficiently on the underlying network in response to dynamic SFC requests poses significant challenges and complexities. This paper proposes a dynamic SFC deployment and readjustment method based on deep Q network (DQN) and M Shortest Path Algorithm (MQDR) to address this problem. We develop a model of the dynamic deployment and readjustment of the SFC problem on the basis of the NFV/SFC network to maximize the request acceptance rate. We transform the problem into a Markov Decision Process (MDP) and further apply Reinforcement Learning (RL) to achieve this goal. In our proposed method (MQDR), we employ two agents that dynamically deploy and readjust SFCs collaboratively to enhance the service request acceptance rate. We reduce the action space for dynamic deployment by applying the M Shortest Path Algorithm (MSPA) and decrease the action space for readjustment from two dimensions to one. By reducing the action space, we decrease the training difficulty and improve the actual training effect of our proposed algorithm. The simulation experiments show that MDQR improves the request acceptance rate by approximately 25% compared with the original DQN algorithm and 9.3% compared with the Load Balancing Shortest Path (LBSP) algorithm. [ABSTRACT FROM AUTHOR]

The enhanced proliferation of connected entities needs a deployment of innovative technologies for the next generation wireless networks. One of the critical concerns, however, is the spectrum scarcity, due to the unprecedented broadcast penetration rate nowadays. Based on this, visible light communication (VLC) has recently emerged as a viable solution to secure high-speed communications. VLC, a high data rate communication technology, has proven its stature as a promising complementary to its radio frequency (RF) counterpart. VLC is a cost-effective, energy-efficient, and secure technology that exploits the current infrastructure, specifically within indoor and underwater environments. Yet, despite their appealing capabilities, VLC systems face several limitations which constraint their potentials such as LED's limited bandwidth, dimming, flickering, line-of-sight (LOS) requirement, impact of harsh weather conditions, noise, interference, shadowing, transceiver alignment, signal decoding complexity, and mobility issue. Consequently, non-orthogonal multiple access (NOMA) has been considered an effective technique to circumvent these shortcomings. The NOMA scheme has emerged as a revolutionary paradigm to address the shortcomings of VLC systems. The potentials of NOMA are to increase the number of users, system's capacity, massive connectivity, and enhance the spectrum and energy efficiency in future communication scenarios. Motivated by this, the presented study offers an overview of NOMA-based VLC systems. This article provides a broad scope of existing research activities of NOMA-based VLC systems. This article aims to provide firsthand knowledge of the prominence of NOMA and VLC and surveys several NOMA-enabled VLC systems. We briefly highlight the potential and capabilities of NOMA-based VLC systems. In addition, we outline the integration of such systems with several emerging technologies such as intelligent reflecting surfaces (IRS), orthogonal frequency division multiplexing (OFDM), multiple-input and multiple-output (MIMO) and unmanned aerial vehicles (UAVs). Furthermore, we focus on NOMA-based hybrid RF/VLC networks and discuss the role of machine learning (ML) tools and physical layer security (PLS) in this domain. In addition, this study also highlights diverse and significant technical hindrances prevailing in NOMA-based VLC systems. We highlight future research directions, along with provided insights that are envisioned to be helpful towards the effective practical deployment of such systems. In a nutshell, this review highlights the existing and ongoing research activities for NOMA-based VLC systems, which will provide sufficient guidelines for research communities working in this domain and it will pave the way for successful deployment of these systems. [ABSTRACT FROM AUTHOR]

Non-Orthogonal Multiple Access (NOMA) has become a promising evolution with the emergence of fifth-generation (5G) and Beyond-5G (B5G) rollouts. The potentials of NOMA are to increase the number of users, the system's capacity, massive connectivity, and enhance the spectrum and energy efficiency in future communication scenarios. However, the practical deployment of NOMA is hindered by the inflexibility caused by the offline design paradigm and non-unified signal processing approaches of different NOMA schemes. The recent innovations and breakthroughs in deep learning (DL) methods have paved the way to adequately address these challenges. The DL-based NOMA can break these fundamental limits of conventional NOMA in several aspects, including throughput, bit-error-rate (BER), low latency, task scheduling, resource allocation, user pairing and other better performance characteristics. This article aims to provide firsthand knowledge of the prominence of NOMA and DL and surveys several DL-enabled NOMA systems. This study emphasizes Successive Interference Cancellation (SIC), Channel State Information (CSI), impulse noise (IN), channel estimation, power allocation, resource allocation, user fairness and transceiver design, and a few other parameters as key performance indicators of NOMA systems. In addition, we outline the integration of DL-based NOMA with several emerging technologies such as intelligent reflecting surfaces (IRS), mobile edge computing (MEC), simultaneous wireless and information power transfer (SWIPT), Orthogonal Frequency Division Multiplexing (OFDM), and multiple-input and multiple-output (MIMO). This study also highlights diverse, significant technical hindrances in DL-based NOMA systems. Finally, we identify some future research directions to shed light on paramount developments needed in existing systems as a probable to invigorate further contributions for DL-based NOMA system. [ABSTRACT FROM AUTHOR]

Given the advantage of LoRaWAN private networks, multiple types of services have been implemented by users in one LoRaWAN system to realize various smart applications. With an increasing number of applications, LoRaWAN suffers from multi-service coexistence challenges due to limited channel resources, uncoordinated network configuration, and scalability issues. The most effective solution is establishing a reasonable resource allocation scheme. However, existing approaches are not applicable for LoRaWAN with multiple services with different criticalities. Therefore, we propose a priority-based resource allocation (PB-RA) scheme to coordinate multi-service networks. In this paper, LoRaWAN application services are classified into three main categories, including safety, control, and monitoring. Considering the different criticalities of these services, the proposed PB-RA scheme assigns spreading factors (SFs) to end devices on the basis of the highest priority parameter, which decreases the average packet loss rate (PLR) and improves throughput. Moreover, a harmonization index, namely HDex, based on IEEE 2668 standard is first defined to comprehensively and quantitively evaluate the coordination ability in terms of key quality of service (QoS) performance (i.e., PLR, latency and throughput). Furthermore, Genetic Algorithm (GA)-based optimization is formulated to obtain the optimal service criticality parameters which maximize the average HDex of the network and contribute to a larger capacity of end devices while maintaining the HDex threshold for each service. Simulations and experimental results show that the proposed PB-RA scheme can achieve the HDex score of 3 for each service type at 150 end devices, which improves the capacity by 50% compared to the conventional adaptive data rate (ADR) scheme. [ABSTRACT FROM AUTHOR]

The rapid development of mobile communication services in recent years has resulted in a scarcity of spectrum resources. This paper addresses the problem of multi-dimensional resource allocation in cognitive radio systems. Deep reinforcement learning (DRL) combines deep learning and reinforcement learning to enable agents to solve complex problems. In this study, we propose a training approach based on DRL to design a strategy for secondary users in the communication system to share the spectrum and control their transmission power. The neural networks are constructed using the Deep Q-Network and Deep Recurrent Q-Network structures. The results of the conducted simulation experiments demonstrate that the proposed method can effectively improve the user's reward and reduce collisions. In terms of reward, the proposed method outperforms opportunistic multichannel ALOHA by about 10% and about 30% for the single SU scenario and the multi-SU scenario, respectively. Furthermore, we explore the complexity of the algorithm and the influence of parameters in the DRL algorithm on the training. [ABSTRACT FROM AUTHOR]

In the process of using the Distributed Radar Network Localization System (DRNLS) further to improve the survivability of a carrier platform, the random characteristics of the system's Aperture Resource Allocation (ARA) and Radar Cross Section (RCS) are often not fully considered. However, the random characteristics of the system's ARA and RCS will affect the power resource allocation of the DRNLS to a certain extent, and the allocation result is an essential factor determining the performance of the DRNLS's Low Probability of Intercept (LPI). Therefore, a DRNLS still has some limitations in practical application. In order to solve this problem, a joint allocation scheme of aperture and power for the DRNLS based on LPI optimization (JA scheme) is proposed. In the JA scheme, the fuzzy random Chance Constrained Programmin model for radar antenna aperture resource management (RAARM-FRCCP model) can minimize the number of elements under the given pattern parameters. The random Chance Constrained Programmin model for minimizing Schleher Intercept Factor (MSIF-RCCP model) built on this basis can be used to achieve DRNLS optimal control of LPI performance on the premise of ensuring system tracking performance requirements. The results show that when RCS has some randomness, its corresponding uniform power distribution result is not necessarily the optimal scheme. Under the condition of meeting the same tracking performance, the required number of elements and power will be reduced to a certain extent compared with the number of elements in the whole array and the power corresponding to the uniform distribution. The lower the confidence level is, the more times the threshold is allowed to pass, and the lower the power is, so that the DRNLS can have better LPI performance. [ABSTRACT FROM AUTHOR]

With the emergence of more and more computing-intensive and latency-sensitive applications, insufficient computing power and energy of user devices has become a common phenomenon. Mobile edge computing (MEC) is an effective solution to this phenomenon. MEC improves task execution efficiency by offloading some tasks to edge servers for execution. In this paper, we consider a device-to-device technology (D2D)-enabled MEC network communication model, and study the subtask offloading strategy and the transmitting power allocation strategy of users. The objective function is to minimize the weighted sum of the average completion delay and average energy consumption of users, which is a mixed integer nonlinear problem. We first propose an enhanced particle swarm optimization algorithm (EPSO) to optimize the transmit power allocation strategy. Then, we utilize the Genetic Algorithm (GA) to optimize the subtask offloading strategy. Finally, we propose an alternate optimization algorithm (EPSO-GA) to jointly optimize the transmit power allocation strategy and the subtask offloading strategy. The simulation results show that the EPSO-GA outperforms other comparative algorithms in terms of the average completion delay, average energy consumption, and average cost. In addition, no matter how the weight coefficients of delay and energy consumption change, the average cost of the EPSO-GA is the least. [ABSTRACT FROM AUTHOR]

In 5G/B5G communication systems, network slicing is utilized to tackle the problem of the allocation of network resources for diverse services with changing demands. We proposed an algorithm that prioritizes the characteristic requirements of two different services and tackles the problem of allocation and scheduling of resources in the hybrid services system with eMBB and URLLC. Firstly, the resource allocation and scheduling are modeled, subject to the rate and delay constraints of both services. Secondly, the purpose of adopting a dueling deep Q network (Dueling DQN) is to approach the formulated non-convex optimization problem innovatively, in which a resource scheduling mechanism and the ϵ -greedy strategy were utilized to select the optimal resource allocation action. Moreover, the reward-clipping mechanism is introduced to enhance the training stability of Dueling DQN. Meanwhile, we choose a suitable bandwidth allocation resolution to increase flexibility in resource allocation. Finally, the simulations indicate that the proposed Dueling DQN algorithm has excellent performance in terms of quality of experience (QoE), spectrum efficiency (SE) and network utility, and the scheduling mechanism makes the performance much more stable. In contrast with Q-learning, DQN as well as Double DQN, the proposed algorithm based on Dueling DQN improves the network utility by 11%, 8% and 2%, respectively. [ABSTRACT FROM AUTHOR]

The internet of things, a collection of diversified distributed nodes, implies a varying choice of activities ranging from sleep monitoring and tracking of activities, to more complex activities such as data analytics and management. With an increase in scale comes even greater complexities, leading to significant challenges such as excess energy dissipation, which can lead to a decrease in IoT devices' lifespan. Internet of things' (IoT) multiple variable activities and ample data management greatly influence devices' lifespan, making resource optimisation a necessity. Existing methods with respect to aspects of resource management and optimisation are limited in their concern of devices energy dissipation. This paper therefore proposes a decentralised approach, which contains an amalgamation of efficient clustering techniques, edge computing paradigms, and a hybrid algorithm, targeted at curbing resource optimisation problems and life span issues associated with IoT devices. The decentralised topology aimed at the resource optimisation of IoT places equal importance on resource allocation and resource scheduling, as opposed to existing methods, by incorporating aspects of the static (round robin), dynamic (resource-based), and clustering (particle swarm optimisation) algorithms, to provide a solid foundation for an optimised and secure IoT. The simulation constructs five test-case scenarios and uses performance indicators to evaluate the effects the proposed model has on resource optimisation in IoT. The simulation results indicate the superiority of the PSOR2B to the ant colony, the current centralised optimisation approach, LEACH, and C-LBCA. [ABSTRACT FROM AUTHOR]

In recent years, the development of smart cities has accelerated. There are several issues to handle in smart cities, one of the most important of which is efficient resource allocation. For the modeling of smart cities, multi-agent systems (MASs) can be used. In this paper, an efficient approach is proposed for resource allocation in smart cities based on the multi-agent credit assignment problem (MCA) and bankruptcy game. To this end, the resource allocation problem is mapped to MCA and the bankruptcy game. To solve this problem, first, a task start threshold (TST) constraint is introduced. The MCA turns into a bankruptcy problem upon introducing such a constraint. Therefore, based on the concept of bankruptcy, three methods of TS-Only, TS + MAS, and TS + ExAg are presented to solve the MCA. In addition, this work introduces a multi-score problem (MSP) in which a different reward is offered for solving each part of the problem, and we used it in our experiments to examine the proposed methods. The proposed approach is evaluated based on the learning rate, confidence, expertness, efficiency, certainty, and correctness parameters. The results reveal the better performance of the proposed approach compared to the existing methods in five parameters. [ABSTRACT FROM AUTHOR]