arXiv subjects

Xuefang Nie

Publications and source records attributed to Xuefang Nie.

4 recordsLinked to original sources

arXiv2024

Secure Collaborative Computation Offloading and Resource Allocation in Cache-Assisted Ultra-Dense IoT Networks With Multi-Slope Channels

Cache-assisted ultra-dense mobile edge computing (MEC) networks are a promising solution for meeting the increasing demands of numerous Internet-of-Things mobile devices (IMDs). To address the complex interferences caused by small base stations (SBSs) deployed densely in such networks, this paper explores the combination of orthogonal frequency division multiple access (OFDMA), non-orthogonal multiple access (NOMA), and base station (BS) clustering. Additionally, security measures are introduced to protect IMDs' tasks offloaded to BSs from potential eavesdropping and malicious attacks. As for such a network framework, a computation offloading scheme is proposed to minimize IMDs' energy consumption while considering constraints such as delay, power, computing resources, and security costs, optimizing channel selections, task execution decisions, device associations, power controls, security service assignments, and computing resource allocations. To solve the formulated problem efficiently, we develop a further improved hierarchical adaptive search (FIHAS) algorithm, giving some insights into its parallel implementation, computation complexity, and convergence. Simulation results demonstrate that the proposed algorithms can achieve lower total energy consumption and delay compared to other algorithms when strict latency and cost constraints are imposed.

cs.IT↗

arXiv2023

Secure and Multi-Step Computation Offloading and Resource Allocation in Ultra-Dense Multi-Task NOMA-Enabled IoT Networks

Ultra-dense networks are widely regarded as a promising solution to explosively growing applications of Internet-of-Things (IoT) mobile devices (IMDs). However, complicated and severe interferences need to be tackled properly in such networks. To this end, both orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) are utilized at first. Then, in order to attain a goal of green and secure computation offloading, under the proportional allocation of computational resources and the constraints of latency and security cost, joint device association, channel selection, security service assignment, power control and computation offloading are done for minimizing the overall energy consumed by all IMDs. It is noteworthy that multi-step computation offloading is concentrated to balance the network loads and utilize computing resources fully. Since the finally formulated problem is in a nonlinear mixed-integer form, it may be very difficult to find its closed-form solution. To solve it, an improved whale optimization algorithm (IWOA) is designed. As for this algorithm, the convergence, computational complexity and parallel implementation are analyzed in detail. Simulation results show that the designed algorithm may achieve lower energy consumption than other existing algorithms under the constraints of latency and security cost.

cs.IT↗

arXiv2022

Mobile Device Association and Resource Allocation in Small-Cell IoT Networks with Mobile Edge Computing and Caching

To meet the need of computation-sensitive (CS) and high-rate (HR) communications, the framework of mobile edge computing and caching has been widely regarded as a promising solution. When such a framework is implemented in small-cell IoT (Internet of Tings) networks, it is a key and open topic how to assign mobile edge computing and caching servers to mobile devices (MDs) with CS and HR communications. Since these servers are integrated into small base stations (BSs), the assignment of them refers to not only the BS selection (i.e., MD association), but also the selection of computing and caching modes. To mitigate the network interference and thus enhance the system performance, some highly-effective resource partitioning mechanisms are introduced for access and backhaul links firstly. After that a problem with minimizing the sum of MDs' weighted delays is formulated to attain a goal of joint MD association and resource allocation under limited resources. Considering that the MD association and resource allocation parameters are coupling in such a formulated problem, we develop an alternating optimization algorithm according to the coalitional game and convex optimization theorems. To ensure that the designed algorithm begins from a feasible initial solution, we develop an initiation algorithm according to the conventional best channel association, which is used for comparison and the input of coalition game in the simulation. Simulation results show that the algorithm designed for minimizing the sum of MDs' weighted delays may achieve a better performance than the initiation (best channel association) algorithm in general.

cs.IT↗

arXiv2021

Joint Device Association, Resource Allocation and Computation Offloading in Ultra-Dense Multi-Device and Multi-Task IoT Networks

With the emergence of more and more applications of Internet-of-Things (IoT) mobile devices (IMDs), a contradiction between mobile energy demand and limited battery capacity becomes increasingly prominent. In addition, in ultra-dense IoT networks, the ultra-densely deployed small base stations (SBSs) will consume a large amount of energy. To reduce the network-wide energy consumption and extend the standby time of IMDs and SBSs, under the proportional computation resource allocation and devices' latency constraints, we jointly perform the device association, computation offloading and resource allocation to minimize the network-wide energy consumption for ultra-dense multi-device and multi-task IoT networks. To further balance the network loads and fully utilize the computation resources, we take account of multi-step computation offloading. Considering that the finally formulated problem is in a nonlinear and mixed-integer form, we utilize the hierarchical adaptive search (HAS) algorithm to find its solution. Then, we give the convergence, computation complexity and parallel implementation analyses for such an algorithm. By comparing with other algorithms, we can easily find that such an algorithm can greatly reduce the network-wide energy consumption under devices' latency constraints.

cs.IT↗