619 research outputs found
Recommended from our members
Modeling and analyzing device-to-device content distribution in cellular networks
Device-to-device (D2D) communication is a promising approach to optimize the utilization of air interface resources in 5G networks, since it allows decentralized proximity-based communication. To obtain caching gains through D2D, mobile nodes must possess content that other mobiles want. Thus, devising intelligent cache placement techniques are essential for D2D. The goal of this dissertation is to provide randomized spatial models for content distribution in cellular networks by capturing the locality of the content, and additionally, to provide dynamic content placement algorithms exploiting the node configurations.
First, a randomized content caching scheme for D2D networks in the cellular context is proposed. Modeling the locations of the devices as a homogeneous Poisson Point Process (PPP), the probability of successful content delivery in the presence of interference and noise is derived. With some idealized modeling aspects, i.e., given that (i) only a fraction of users to be randomly scheduled at a given time, and (ii) the request distribution does not change over time, it has been shown that the performance of caching can be optimized by smoothing out the request distribution, where the smoothness of the caching distribution is mainly determined by the path loss exponent, and holds under Rayleigh, Ricean and Nakagami fading models.
Second, to take the randomized caching model a step further, a spatially correlated content caching scenario is contemplated. Inspired by the MateĢrn hard-core point process of type II, which is a first-order pairwise interaction model, D2D nodes caching the same file are never closer to each other than the exclusion radius. The exclusion radius plays the role of a substitute for caching probability. The optimal exclusion radii that maximize the hit probability can be determined by using the request distribution and cache memory size. Unlike independent content placement, which is oblivious to the geographic locations of the nodes, the new strategy can be effective for proximity-based communication even when the cache size is small.
Third, an auction-aided MateĢrn carrier sense multiple access (CSMA) policy that considers the joint analysis of scheduling and caching is studied. The auction scheme is distributed. Given a cache configuration, i.e., the set of cached files in each user at a given snapshot, each D2D receiver determines the value of its request, by bidding on the set of potential transmitters in its communication range. The values of the receiver bids are reported to the potential transmitter, which computes the cumulated sum of these variables taken on all users in its cell. The potential transmitter then reports the value of the bid sum to other potential transmitters in its contention range. Given the accumulated bids of all potential transmitters, the contention range and the medium access probability, a fraction of the potential transmitters are jointly scheduled, determined by the auction policy, in order to optimize the throughput. Later, a Gibbs sampling-based cache update strategy is proposed to iteratively optimize the hit rate by taking the scheduling scheme into account.
In this dissertation, a variety of distributed algorithms for D2D content caching are proposed. Our results indicate that the geographic locality and the network parameters have a significant role in determining and optimizing the placement strategy. Exploiting the user interactions and spatial diversity, and incentivizing cooperation among D2D nodes are crucial in realizing the full potential of caching. Furthermore, from a network point of view, the scheduling and the caching phases are closely linked to each other. Hence, understanding the interaction between these two phases helps develop novel dynamic caching strategies capturing the temporal and spatial locality of the demand.Electrical and Computer Engineerin
Unleashing the Power of Edge-Cloud Generative AI in Mobile Networks: A Survey of AIGC Services
Artificial Intelligence-Generated Content (AIGC) is an automated method for
generating, manipulating, and modifying valuable and diverse data using AI
algorithms creatively. This survey paper focuses on the deployment of AIGC
applications, e.g., ChatGPT and Dall-E, at mobile edge networks, namely mobile
AIGC networks, that provide personalized and customized AIGC services in real
time while maintaining user privacy. We begin by introducing the background and
fundamentals of generative models and the lifecycle of AIGC services at mobile
AIGC networks, which includes data collection, training, finetuning, inference,
and product management. We then discuss the collaborative cloud-edge-mobile
infrastructure and technologies required to support AIGC services and enable
users to access AIGC at mobile edge networks. Furthermore, we explore
AIGCdriven creative applications and use cases for mobile AIGC networks.
Additionally, we discuss the implementation, security, and privacy challenges
of deploying mobile AIGC networks. Finally, we highlight some future research
directions and open issues for the full realization of mobile AIGC networks
Resource Allocation and Mode Selection in 5G Networks Based on Energy Efficient Game Theory Approach
With the advent of next-generation cellular networks, energy efficiency is becoming increasingly important. To tackle this issue, this paper investigates energy efficiency in D2D-enabled heterogeneous cellular networks. Boosting the longterm energy efficiency of wireless 5G communication networks is being explored through mode selection and resource allocation. The study proposed a three-stage process for energy-efficient mode selection and resource allocation. The process starts with cellular users who switch to D2D emitting a beacon and cellular users within close proximity reacting to it. A proposed auction mechanism will be enacted inside the group in the second state ( in this paper, the group size will be four). Next, each cellular user was classified according to SINR values, distance, and battery life, so that they could dynamically transition between standard cellular mode and D2D mode. For stage three, direct-hop hybrid D2D communication, we developed a TAMM double auction game model that efficiently splits resources. To identify the true bidders in our game model, we compute the median and mode values of the ASK and BID values received by both seller and buyer cellular users. A simulation study shows that the proposed method is energy-efficient in a heterogeneous network enabled by D2D
Two Time-Scale Caching Placement and User Association in Dynamic Cellular Networks
With the rapid growth of data traffic in cellular networks, edge caching has become an emerging technology for traffic offloading. We investigate the caching placement and content delivery in cache-enabling cellular networks. To cope with the time-varying content popularity and user location in practical scenarios, we formulate a long-term joint dynamic optimization problem of caching placement and user association for minimizing the content delivery delay which considers both content transmission delay and content update delay. To solve this challenging problem, we decompose the optimization problem into two sub-problems, the user association sub-problem in a short time scale and the caching placement in a long time scale. Specifically, we propose a low complexity user association algorithm for a given caching placement in the short time scale. Then we develop a deep deterministic policy gradient based caching placement algorithm which involves the short time-scale user association decisions in the long time scale. Finally, we propose a joint user association and caching placement algorithm to obtain a sub-optimal solution for the proposed problem. We illustrate the convergence and performance of the proposed algorithm by simulation results. Simulation results show that compared with the benchmark algorithms, the proposed algorithm reduces the long-term content delivery delay in dynamic networks effectively
- ā¦