12 April 2022 in IEEE Transactions on Vehicular Technology
Device-to-device (D2D) communications have significant advantages such as short range and low energy consumption. Caching at mobile user devices by leveraging D2D communications relieves the heavy load on backhaul links and enhances users’ quality of service. Therefore, in a cache-enabled clustered D2D network, we analyze the probability of successful transmission and propose a jointly optimizing bandwidth partitioning and caching policy strategy to solve the average energy consumption minimization problem. To simultaneously have the clustered and bounded characteristics of D2D communication in real hotspots areas, we use Matérn cluster process (MCP) to model the cache-enabled clustered D2D network. For a given D2D receiver (DR), we derive the successful transmission probability of getting its requested content. Moreover, leveraging the analysis of successful transmission probability, a joint bandwidth partitioning and caching policy optimization problem is formulated to reduce average energy consumption. Considering the complexity of directly solving the optimization problem, two sub-problems are decoupled and solved iteratively. The optimized solutions of bandwidth partitioning and caching policy sub-problems are obtained by taking the derivative and adaptive mutation particle swarm optimization (AMPSO) algorithm, respectively. The simulations show the influence of the related parameters on system performance and illustrate that the strategy to jointly optimize bandwidth partitioning and caching policy can significantly reduce energy consumption.
14 November 2024 in IEEE Internet of Things Journal
With the rapid development and widespread deployment of Internet of Things devices, existing networks face significant challenges in meeting the demands of emerging large-scale applications. In this article, we propose a novel paradigm to address these challenges by decomposing large applications/services into lightweight microservices (MSs) distributed among small base stations (SBSs), each responsible for specific functions. Upon receiving a service request, a macro base station (MBS) invokes a series of SBSs that cache the required MSs to execute the associated computational tasks. The computed results are then returned to the MBS, which integrates and delivers the final result to the user. Under this framework, we investigate the joint problem of MS caching, computation task assignment, and computing resource allocation, aiming to minimize the total energy consumption. Various practical constraints, such as users’ latency requirements, and the limited caching and computing resources of SBSs are taken into account. To facilitate the analysis, we transform the original minimization problem into an equivalent problem focusing on MS computation task assignment and computing resource allocation, which remains NP-hard. To tackle this challenge efficiently, we devise a two-stage method. In the first stage, we derive a closed-form expression for the computing resource allocation policy based on the MS computation task assignment. Subsequently, we introduce a two-side swapping oriented approach to explore an improved MS computation task assignment strategy. In addition, we propose the use of exhaustive and simulated annealing algorithms to approach the optimal and near-optimal solutions, respectively. Extensive simulation results demonstrate that our proposed algorithm achieves close-to-optimal performance and outperforms benchmark schemes significantly.
28 February 2021 in IET Communications
Caching popular contents at base stations (BSs) can effectively avoid redundant data traffic and improve backhaul capacity. Techniques such as multicast (MC) and non‐orthogonal multiple access (NOMA) can significantly improve spectral efficiency by delivering popular contents to multiple users using a single channel. Therefore, we propose a cooperative transmission scheme of MC and NOMA in cache‐enabled wireless cellular networks. First, we derive the probability mass function (PMF) of the number of channels in the MC mode as well as the joint PMF of the number of channels and number of NOMA users in the NOMA mode. Second, we analyse the successful transmission probabilities of the two modes by utilising tools from stochastic geometry. Finally, with the derived probabilities using the two modes, we obtain the total successful transmission probability based on probability theory. The quasi‐closed form expression of the successful transmission probability is obtained in a special case, where the noise is neglected, and the path‐loss exponent is set to be four. Simulation results validate the accuracy of the analysis and demonstrate the performance gain due to the proposed cooperative transmission scheme of MC and NOMA.