13 May 2024 in IEEE Transactions on Mobile Computing
In the traditional cellular-based mobile edge computing (MEC), users at the edge of the cell are prone to suffer severe inter-cell interference and signal attenuation, leading to low throughput even transmission interruptions. Such edge effect severely obstructs offloading of tasks to MEC servers. To address this issue, we propose user-centric mobile edge computing (UCMEC), a novel MEC architecture integrating user-centric transmission, which can ensure high throughput and reliable communication for task offloading. Then, we formulate an long-term delay minimization problem by jointly optimizing task offloading, power allocation, and computing resource allocation in UCMEC. To solve the intractable problem, we propose two decentralized joint optimization schemes based on multi-agent deep reinforcement learning (MADRL) and convex optimization, which consider both cooperation and non-cooperation among network nodes. Simulation results demonstrate that the proposed schemes in UCMEC can significantly improve the uplink transmission rate by at least 176.99% and reduce the long-term average total delay by at least 16.36% compared to traditional cellular-based MEC.
5 January 2024 in IEEE Transactions on Wireless Communications
In this paper, fundamentals and performance tradeoffs of next-generation ultra-reliable and low-latency communication (xURLLC) are investigated from the perspective of stochastic network calculus (SNC). An xURLLC-enabled massive MU-MIMO system model has been developed to accommodate xURLLC features. By leveraging and promoting SNC, we provide a quantitative statistical quality of service (QoS) provisioning analysis and derive the closed-form expression of upper-bounded statistical delay violation probability (UB-SDVP). Based on the proposed theoretical framework, we formulate the UB-SDVP minimization problem, which is first degenerated into a one-dimensional integer-search problem by deriving the minimum error probability (EP) detector, and then efficiently solved by the integer-form Golden-Section search algorithm. Moreover, two novel concepts, EP-based effective capacity (EP-EC) and EP-based energy efficiency (EP-EE), have been defined to characterize the tail distributions and performance tradeoffs for xURLLC. Subsequently, we formulate the EP-EC and EP-EE maximization problems, and the EP-EC maximization problem is proven to be equivalent to the UB-SDVP minimization problem, while the EP-EE maximization problem is solved with a low-complexity outer-descent inner-search collaborative algorithm. Extensive simulations demonstrate that the proposed framework can reduce computational complexity compared to reference schemes and provide various tradeoffs and optimization performance of xURLLC concerning UB-SDVP, EP, EP-EC, and EP-EE.
18 June 2024 in IEEE Transactions on Wireless Communications
Inter-user interference and pilot contamination are the major obstacles limiting the performance of cell-free massive multiple-input multiple-output (CF mMIMO)-aided ultra-reliable low-latency communication (URLLC) systems. In this paper, user grouping is utilized to address these issues, by allocating users to groups based on frequency band division, preventing interference among users within different groups, and eliminating pilot contamination between different groups. We consider an uplink CF mMIMO-aided URLLC system with user grouping and derive the lower bound for the ergodic rate. Due to the limited blocklength of each group necessitating pilot reuse, a weight sum rate (WSR) maximum problem is formulated by jointly optimizing user grouping, pilot assignment, and power control. We propose a user grouping scheme based on graph theory, where iteratively searching for specific negative loops in the weighted directed graph can approach the optimal user grouping matrix. As the user grouping matrix updates at each iteration, we update the pilot assignment matrix based on graph theory and employ logarithmic function approximation and fractional programming for power control updates. Numerous numerical results demonstrate the effectiveness of user grouping, and the proposed algorithm improves WSR by 25% compared to the non-grouping algorithm, while outperforming other benchmark algorithms.
9 February 2024 in IEEE Transactions on Vehicular Technology
Internet of Video Things (IoVT) brings much higher requirements on the transmission and computing capabilities of wireless networks than the traditional Internet of Things (IoT). Non-orthogonal multiple access (NOMA) and mobile edge computing (MEC) have been considered as two promising technologies to satisfy these requirements. However, successive interference cancellation (SIC) and grouping operations in NOMA as well as delay-sensitive IoVT video tasks with different priorities make it challenging to achieve optimal performance in NOMA-assisted IoVT with MEC. To address this issue, we formulate a joint optimization problem where both NOMA operations and MEC offloading are involved, to minimize the weighted average total delay. To tackle such an intractable problem, we proposed a graph theory-based optimization framework, then decompose and transform the problem into finding negative loops in the weighted directed graph. Specifically, we design a priority-based SIC decoding mechanism and propose convex optimization-based power allocation and computing resource allocation algorithms to calculate the adjacency matrix. Then, two negative loop searching algorithms are adopted to obtain the device association and grouping strategies. Simulation results demonstrate that compared with existing algorithms, the proposed algorithm reduces the weighted average total delay by up to 92.43% as well as improves the transmission rate of IoVT devices by up to 79.1%.
10 October 2023 in IEEE Transactions on Mobile Computing
Edge service caching can effectively reduce the delay or bandwidth overhead for acquiring and initializing applications. To address single-base station (BS) transmission limitation and serious edge effect in traditional cellular-based edge service caching networks, in this paper, we proposed a novel user-centric edge service caching framework where each user is jointly provided with edge caching and wireless transmission services by a specific BS cluster instead of a single BS. To minimize the long-term average delay under the constraint of the caching cost, a mixed integer non-linear programming (MINLP) problem is formulated by jointly optimizing the BS clustering and service caching decisions. To tackle the problem, we propose JO-CDSD, an efficiently joint optimization algorithm based on Lyapunov optimization and generalized benders decomposition (GBD). In particular, the long-term optimization problem can be transformed into a primal problem and a master problem in each time slot that is much simpler to solve. The near-optimal clustering and caching strategy can be obtained through solving the primal and master problem alternately. Extensive simulations show that the proposed joint optimization algorithm outperforms other algorithms and can effectively reduce the long-term delay and caching cost.
16 June 2025 in IEEE Transactions on Wireless Communications
Industry 5.0 and beyond networks have driven the emergence of numerous mission-critical services exemplified by neXt-generation ultra-reliable low-latency communication (xURLLC). To guarantee low-latency requirements, xURLLC heavily relies on short-blocklength packets with sporadic arrival traffic. As a disruptive multi-access technique, rate-splitting multiple access (RSMA) has emerged as a promising avenue to enhance the quality of service (QoS) and flexibly manage interference for xURLLC. In this paper, we study an innovative RSMA-assisted uplink xURLLC industrial internet-of-things (IIoT) (RSMA-xURLLC-IIoT) network, which takes into account imperfect CSI and finite blocklength (FBL) regimes. We develop a novel theoretical framework leveraging stochastic network calculus (SNC) aimed at revealing insights into statistical QoS provisioning (SQP). Building upon this framework, we formulate the SQP-driven short-packet size maximization and transmit power minimization problems, aiming to guarantee the SQP performance to delay, decoding, and reliability while maximizing the short-packet size and minimizing the transmit power, respectively. By exploiting Monte-Carlo methods, we have thoroughly validated the reliability of the developed theoretical framework. Moreover, through extensive comparison analysis with state-of-the-art multi-access techniques, including non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA), we have demonstrated the superior performance gains achieved by the proposed network.