Most existing content caching designs require accurate estimation of content popularity, which can be challenging in the dynamic mobile network environment. Moreover, emerging hierarchical network architecture enables us to enhance the content caching performance by opportunistically exploiting both cloud-centric and edge-centric caching. In this paper, we propose a hybrid content caching design that does not require the knowledge of content popularity. Specifically, our design optimizes the content caching locations, which can be original content servers, central cloud units (CUs) and base stations (BSs) where the design objective is to support as high average requested content data rates as possible subject to the finite service latency. We fulfill this design by employing the Lyapunov optimization approach to tackle an NP-hard caching control problem with the tight coupling between CU caching and BS caching control decisions. Toward this end, we propose algorithms in three specific caching scenarios by exploiting the submodularity property of the sum-weight objective function and the hierarchical caching structure. Moreover, we prove the proposed algorithms can achieve finite content service delay for all arrival rates within the constant fraction of capacity region using Lyapunov optimization technique. Furthermore, we propose practical and heuristic CU/BS caching algorithms to address a general caching scenario by inheriting the design rationale of the aforementioned performance-guaranteed algorithms. Trace-driven simulation demonstrates that our proposed hybrid CU/BS caching algorithms outperform the general popularity based caching algorithm and the independent caching algorithm in terms of average end-to-end service latency and backhaul/fronthaul load reduction ratios.
2 December 2021 in IEEE Internet of Things Journal
For 5G and 6G communications, satellites are drawing great attention for global coverage extension and 3-D mobility enhancement. With advancements of satellite hardware, functional satellites are expected to be applied for 6G Internet of Things (IoT) services. In particular, because IoT service has a relatively low computational burden, it is more feasible for satellite edge computing (SatEC) with limited power, making IoT supportable SatEC one of the economically feasible applications for future satellite networks. In this article, an architecture of IoT supportable SatEC is analyzed, and the corresponding network slice scheduling is proposed. First, a multiobjective optimization problem for IoT supportable SatEC is formulated with respect to latency, computational power, and transmission power attenuation. The problem is solved for the satellite offloading rate and altitude by using a heuristic algorithm in low time complexity with time-varying satellite constellation topology and various service requirements for simulations. Next, to analyze the expandability of the SatEC IoT network, a sliced SatEC IoT scheduling problem is formulated in the normalized weighted sum of latency, computational power, and transmission power attenuation. Scheduling rules are proposed to prioritize various applications with the results of the scheduling problem and with the proper SatEC offloading rates predefined in the Pareto optimality of the satellite edge multiobjective Tabu search (SE-MOTS). Finally, efficient satellite constellations are determined by comparing low-Earth orbit (LEO) and very LEO (VLEO) satellite networks, in terms of proper satellite altitudes and offloading strategies for IoT supportable SatEC. Based on simulation results, a scheduling rule for sliced satellite network and a proper offloading strategy of different slices are proposed, and an appropriate altitude of the satellite network for sliced SatEC is discussed.
12 October 2017 in IEEE Transactions on Vehicular Technology
Mobile code offloading (MCO) is a technology that offloads computing tasks from mobile devices to remote servers managed by code offload service providers (CSPs). Nowadays, it is recommended that the remote servers be placed on the edge of the network to support modern applications, e.g., aug- mented reality, which demand stringent and ultra-low latency or high bandwidth. To date, previous studies have independently addressed code offloading policy in mobile devices and pric- ing/server provisioning policies in CSP; moreover, the system models for both user-side and CSP-side have not adequately reflected their practical aspects. This paper designs a practical model for the both sides and takes account of them in an inte- grated MCO framework simultaneously. By leveraging Lyapunov drift-plus-penalty technique, we propose code offloading, local CPU clock frequency, and network interface selection policies for mobile users, and propose MCO service pricing and server provisioning policies for CSP in each of a competition scenario and a cooperation scenario. (i) In the competition scenario, we propose a Com-UC algorithm for mobile users and a Com- PC algorithm for CSP with the aim to minimize each cost for each given delay constraint. (ii) In the cooperation scenario, we propose a Coo-JC algorithm with the aim to minimize their sum cost for both mobile users and CSP. Via trace-driven simulations, we demonstrate that Com-UC saves at most 71% of its cost and Com-PC attains 82% profit gain for the same delay compared to existing algorithms; moreover, the cooperation between mobile users and CSP additionally reduces costs and delays.
24 September 2024 in IEEE Transactions on Services Computing
Recently, applications using artificial intelligence (AI) technique in mobile devices such as augmented reality have been extensively pervasive. The hardware specifications of mobile devices, dynamic service demands, stochastic network states, and characteristics of DNN (Deep Neural Network) models affect the quality of experience (QoE) of such applications. In this paper, we propose CutEdge , that leverages a virtual queue-based Lyapunov optimization framework to jointly optimize DNN model partitioning between a mobile device and a mobile edge computing (MEC) server and processing/networking resources in a mobile device with respect to internal/external system dynamics. Specifically, CutEdge makes decisions of (i) the partition point of DNN model between the mobile device and MEC server, (ii) GPU clock frequency, and (iii) transmission rates in a mobile device, simultaneously. Then, we theoretically show the optimal trade-off curves among energy consumption, throughput, and end-to-end latency yielded by CutEdge where such QoE metrics have not been jointly addressed in the previous studies. Moreover, we show the impact of joint optimization of three control parameters on the performances via real trace-driven simulations. Finally, we show the superiority of CutEdge over the existing algorithms by experiment on top of implemented testbed using an embedded AI device and an MEC server.
24 February 2023 in IEEE Vehicular Technology Magazine
For beyond-5G and 6G communications, the satellite-terrestrial integrated network (STIN) is expected to provide diverse services with global coverage. The first step in implementing a successful STIN is to make the satellite network capable of functioning seamlessly with its terrestrial counterpart. However, as satellites rotate around Earth at very high speeds and are connected over very long wireless links, it is almost impossible to use terrestrial schemes without modification.
14 December 2021 in IEEE Transactions on Aerospace and Electronic Systems
As the advanced satellite network can provide extremely diverse data to various types of users, it is of vital importance to achieve data security using encryption over satellite channels. However, since the avalanche effect makes encryption techniques vulnerable to bit errors in the wireless channel, a more powerful encryption technique is required for data confidentiality. In addition, an efficient method for exchanging encryption keys between receivers and transmitters should be capable of managing a large scale of satellites in the network. In this article, we propose a novel superencryption method of joint encryption and channel coding, cipher feedback-advanced encryption standard (CFB-AES)-TURBO, which combines AES in the upper layer and turbo coding as bulk encryption in the physical layer. Because we introduce turbo coding in the CFB mode with AES for each block, our scheme can accomplish dual goals of data protection and bit error correction. We select an encryption block size to maximize throughput based on channel conditions and the security level required for a user, and present a key exchanging solution. We derive processing time gains and analyze computational complexity of the CFB-AES-TURBO. The bit error rate performance improvement with about 12-dB coding gain is achieved. We also enhance the security performance by $10^{15 000}$ times and provide indistinguishability. Finally, we analyze the total expected latency, suggest the minimum key refresh time of geostationary Earth orbit satellites.