Mobile edge computing is of particular interest to Internet of Things (IoT), where inexpensive simple devices can get complex tasks offloaded to and processed at powerful infrastructure. Scheduling is challenging due to stochastic task arrivals and wireless channels, congested air interface, and more prominently, prohibitive feedbacks from thousands of devices. In this paper, we generate asymptotically optimal schedules tolerant to out-of-date network knowledge, thereby relieving stringent requirements on feedbacks. A perturbed Lyapunov function is designed to stochastically maximize a network utility balancing throughput and fairness. A knapsack problem is solved per slot for the optimal schedule, provided up-to-date knowledge on the data and energy backlogs of all devices. The knapsack problem is relaxed to accommodate out-of-date network states. Encapsulating the optimal schedule under up-to-date network knowledge, the solution under partial out-of-date knowledge preserves asymptotic optimality, and allows devices to self-nominate for feedback. Corroborated by simulations, our approach is able to dramatically reduce feedbacks at no cost of optimality. The number of devices that need to feed back is reduced to less than 60 out of a total of 5000 IoT devices.

This article proposes a novel framework of resource allocation in multi-cell intelligent reflecting surface (IRS) aided non-orthogonal multiple access (NOMA) networks, where an IRS is deployed to enhance the wireless service. The problem of joint user association, subchannel assignment, power allocation, phase shifts design, and decoding order determination is formulated for maximizing the achievable sum rate. The challenging mixed-integer non-linear problem is decomposed into an optimization subproblem (P1) with continuous variables and a matching subproblem (P2) with integer variables. In an effort to tackle the non-convex optimization problem (P1), iterative algorithms are proposed for allocating transmission power, designing reflection matrix, and determining decoding order by invoking relaxation methods such as convex upper bound substitution, successive convex approximation, and semidefinite relaxation. In terms of the combinational problem (P2), swap matching-based algorithms are developed for achieving a two-sided exchange-stable state among users, BSs and subchannels. Numerical results demonstrate that: i) the sum rate of multi-cell NOMA networks is capable of being increased by 35% with the aid of the IRS; ii) the proposed algorithms for multi-cell IRS-aided NOMA networks can enjoy 22% higher energy efficiency than conventional NOMA counterparts; iii) the trade-off between spectrum efficiency and coverage area can be tuned by judiciously selecting the location of the IRS.

Task admission is critical to delay-sensitive applications in mobile edge computing, but technically challenging due to its combinatorial mixed nature and consequently limited scalability. We propose an asymptotically optimal task admission approach which is able to guarantee task delays and achieve (1 – ∊)-approximation of the computationally prohibitive maximum energy saving at a time-complexity linearly scaling with devices. ∊ is linear to the quantization interval of energy. The key idea is to transform the mixed integer programming of task admission to an integer programming (IP) problem with the optimal substructure by pre-admitting resource-restrained devices. Another important aspect is a new quantized dynamic programming algorithm which we develop to exploit the optimal substructure and solve the IP. The quantization interval of energy is optimized to achieve an [O(∊);O(1/∊)]-tradeoff between the optimality loss and time-complexity of the algorithm. Simulations show that our approach is able to dramatically enhance the scalability of task admission at a marginal cost of extra energy, as compared to the optimal branch and bound method, and can be efficiently implemented for online programming.

In this paper, we propose a two-layer framework to learn the optimal handover (HO) controllers in possibly large-scale wireless systems supporting mobile Internet-of-Things (IoT) users or traditional cellular users, where the user mobility patterns could be heterogeneous. In particular, our proposed framework first partitions the user equipments (UEs) with different mobility patterns into clusters, where the mobility patterns are similar in the same cluster. Then, within each cluster, an asynchronous multi-user deep reinforcement learning scheme is developed to control the HO processes across the UEs in each cluster, in the goal of lowering the HO rate while ensuring certain system throughput. In this scheme, we use a deep neural network (DNN) as an HO controller learned by each UE via reinforcement learning in a collaborative fashion. Moreover, we use supervised learning in initializing the DNN controller before the execution of reinforcement learning to exploit what we already know with traditional HO schemes and to mitigate the negative effects of random exploration at the initial stage. Furthermore, we show that the adopted global-parameter-based asynchronous framework enables us to train faster with more UEs, which could nicely address the scalability issue to support large systems. Finally, simulation results demonstrate that the proposed framework can achieve better performance than the state-of-art on-line schemes, in terms of HO rates.

With the rapid development of Internet of Things (IoT), the digital twin is emerging as one of the most promising technologies to connect physical components with digital space for better optimization of physical systems. However, the limited wireless resource and security concerns impede the deployment of the digital twin in IoT. In this article, we exploit blockchain to propose a new digital twin edge networks framework for enabling flexible and secure digital twin construction. We first develop cooperative federated learning through an access point (AP) to help resource-limited smart devices in constructing digital twin at the network edges belonging to different mobile network operators (MNOs). Then, we propose a model update chain by leveraging directed acyclic graph (DAG) blockchain to secure both local model updates and global model updates. In order to incentivize the APs to help in local models training for resource-limited smart devices and also encourage the APs to contribute resource in local model update verification, we design an iterative double auction-based joint cooperative federated learning and local model update verification scheme. The optimal unified time for cooperative federated learning and local model update verification is solved to maximize social welfare. Numerical results illustrate that the proposed scheme is efficient in digital twin construction.

This article integrates nonorthogonal multiple access (NOMA) and over-the-air federated learning (AirFL) into a unified framework using one simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS). The STAR-RIS plays an important role in adjusting the decoding order of hybrid users for efficient interference mitigation and omnidirectional coverage extension. To capture the impact of nonideal wireless channels on AirFL, a closed-form expression for the optimality gap (also known as the convergence upper bound) between the actual loss and the optimal loss is derived. This analysis reveals that the learning performance is significantly affected by the active and passive beamforming schemes, as well as wireless noise. Furthermore, when the learning rate diminishes as the training proceeds, the optimality gap is explicitly shown to converge with a linear rate. To accelerate convergence while satisfying quality-of-service requirements, a mixed-integer nonlinear programming (MINLP) problem is formulated by jointly designing the transmit power at users and the configuration mode of STAR-RIS. Next, a trust-region-based successive convex approximation method and a penalty-based semidefinite relaxation approach are proposed to handle the decoupled nonconvex subproblems iteratively. An alternating optimization algorithm is then developed to find a suboptimal solution for the original MINLP problem. Extensive simulation results show that: 1) the proposed framework can efficiently support NOMA and AirFL users via concurrent uplink communications; 2) our algorithms achieve a faster convergence rate on independent and identically distributed (IID) and non-IID settings compared to the existing baselines; and 3) both the spectrum efficiency and learning performance are significantly improved with the aid of the well-tuned STAR-RIS.