scholarly journals Content popularity prediction for cache-enabled wireless B5G networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Shiwei Lai ◽  
Rui Zhao ◽  
Yulin Wang ◽  
Fusheng Zhu ◽  
Junjuan Xia
Keyword(s):  
Relay Selection ◽  
Base Station ◽  
Mobile Edge Computing ◽  
Prediction Problem ◽  
Hit Rate ◽  
Content Popularity ◽  
Multiple Relays ◽  
Simulation Results ◽  
Popularity Prediction ◽  
Edge Networks

AbstractIn this paper, we study the cache prediction problem for mobile edge networks where there exist one base station (BS) and multiple relays. For the proposed mobile edge computing (MEC) network, we propose a cache prediction framework to solve the problem of contents prediction and caching based on neural networks and relay selection, by exploiting users’ history request data and channels between the relays and users. The proposed framework is then trained to learn users’ preferences by using the users’ history requested data, and several caching policies are proposed based on the channel conditions. The cache hit rate and latency are used to measure the performance of the proposed framework. Simulation results demonstrate the effectiveness of the proposed framework, which can maximize the cache hit rate and meanwhile minimize the latency for the considered MEC networks.

scholarly journals A Range-Division User Relay Selection Scheme and Performance Analysis in NOMA-based Cooperative Opportunistic Multicast Systems

Electronics ◽  
2019 ◽  
Vol 8 (5) ◽  
pp. 544 ◽  
Author(s):  
Yufang Zhang ◽  
Xiaoxiang Wang ◽  
Dongyu Wang ◽  
Qiang Zhao ◽  
Yibo Zhang
Keyword(s):  
Relay Selection ◽  
Multiple Access ◽  
Base Station ◽  
Selection Scheme ◽  
Selection Ratio ◽  
Coverage Ratio ◽  
Group Cooperation ◽  
Simulation Results ◽  
And Performance ◽  
Multicast Scheme

The original user relay (UR) selection scheme of non-orthogonal multiple access-based cooperative opportunistic multicast scheme, which realizes inter-group cooperation between two multicast groups, ignores the distribution trend of candidate UR in the cell and adopts fixed efficient relay selection range (ERSR) to select UR. It results in high UR selection ratio. Then the coverage efficiency, defined as the ratio of successfully received users to URs, is low. To tackle this problem, a range-division user relay (RDUR) selection scheme is proposed in this paper. Firstly, it divides the circular coverage range of base station into several continuous annular areas (AAs). Secondly, different ERSRs are assigned to unsuccessfully received users in different AAs. Under different ERSR assignments, the performances of UR selection ratio and coverage ratio are analyzed. Lastly, the radius set of ERSR that optimizes system coverage efficiency is used to perform UR selection. From simulation results, with different radius sets, analytical results of UR selection ratio and coverage ratio match well with their simulated ones. It is proved that ERSR allocation affects UR selection ratio and coverage ratio. With RDUR scheme, coverage efficiency increases by at least 14% and capacity efficiency has also been improved.

Enhanced Power Allocation and Relay Selection Scheme in Two-Way Relaying Cognitive Radio Networks

2013 ◽  
Vol 397-400 ◽  
pp. 1979-1983
Author(s):  
Dong Chen ◽  
Xiang Li ◽  
Li Ping Su ◽  
Jin Liang
Keyword(s):  
Cognitive Radio ◽  
Power Allocation ◽  
Cognitive Radio Networks ◽  
Relay Selection ◽  
Radio Networks ◽  
System Throughput ◽  
Selection Scheme ◽  
Multiple User ◽  
Multiple Relays ◽  
Simulation Results

This paper addresses the enhanced power allocation (PA) and relay selection scheme (RS) in two-way relaying cognitive radio networks consisting of multiple user-pairs and multiple relays. In order to reduce the computational complexity for practical scenario, we propose a branch and bound based (BnB-based) power allocation and relay selection scheme and a greedy power allocation and relay selection scheme to maximize the system throughput. Simulation results show that the proposed BnB-based PA and RS scheme can achieve better tradeoff of system throughput and complexity.

Base station assisted relay selection in device-to-device communications

2020 ◽  
Vol 33 (1) ◽  
pp. 22
Author(s):  
Ushik Shrestha Khwakhali ◽  
Prapun Suksompong ◽  
Steven Gordon
Keyword(s):  
Relay Selection ◽  
Base Station ◽  
Device To Device

scholarly journals Dynamic Task Migration Combining Energy Efficiency and Load Balancing Optimization in Three-Tier UAV-Enabled Mobile Edge Computing System

Electronics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 190
Author(s):  
Wu Ouyang ◽  
Zhigang Chen ◽  
Jia Wu ◽  
Genghua Yu ◽  
Heng Zhang
Keyword(s):  
Energy Consumption ◽  
Load Balancing ◽  
Markov Decision Process ◽  
Decision Process ◽  
Base Station ◽  
Edge Computing ◽  
Mobile Edge Computing ◽  
Task Migration ◽  
Migration Strategy ◽  
Markov Decision

As transportation becomes more convenient and efficient, users move faster and faster. When a user leaves the service range of the original edge server, the original edge server needs to migrate the tasks offloaded by the user to other edge servers. An effective task migration strategy needs to fully consider the location of users, the load status of edge servers, and energy consumption, which make designing an effective task migration strategy a challenge. In this paper, we innovatively proposed a mobile edge computing (MEC) system architecture consisting of multiple smart mobile devices (SMDs), multiple unmanned aerial vehicle (UAV), and a base station (BS). Moreover, we establish the model of the Markov decision process with unknown rewards (MDPUR) based on the traditional Markov decision process (MDP), which comprehensively considers the three aspects of the migration distance, the residual energy status of the UAVs, and the load status of the UAVs. Based on the MDPUR model, we propose a advantage-based value iteration (ABVI) algorithm to obtain the effective task migration strategy, which can help the UAV group to achieve load balancing and reduce the total energy consumption of the UAV group under the premise of ensuring user service quality. Finally, the results of simulation experiments show that the ABVI algorithm is effective. In particular, the ABVI algorithm has better performance than the traditional value iterative algorithm. And in a dynamic environment, the ABVI algorithm is also very robust.

scholarly journals Latency optimization for D2D-enabled parallel mobile edge computing in cellular networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yan Cai ◽  
Liang Ran ◽  
Jun Zhang ◽  
Hongbo Zhu
Keyword(s):  
Cellular Networks ◽  
Optimal Solution ◽  
Vital Role ◽  
Base Stations ◽  
Low Latency ◽  
Mobile Edge Computing ◽  
System Delay ◽  
Simulation Results ◽  
And Task ◽  
Parallel Communication

AbstractEdge offloading, including offloading to edge base stations (BS) via cellular links and to idle mobile users (MUs) via device-to-device (D2D) links, has played a vital role in achieving ultra-low latency characteristics in 5G wireless networks. This paper studies an offloading method of parallel communication and computation to minimize the delay in multi-user systems. Three different scenarios are explored, i.e., full offloading, partial offloading, and D2D-enabled partial offloading. In the full offloading scenario, we find a serving order for the MUs. Then, we jointly optimize the serving order and task segment in the partial offloading scenario. For the D2D-enabled partial offloading scenario, we decompose the problem into two subproblems and then find the sub-optimal solution based on the results of the two subproblems. Finally, the simulation results demonstrate that the offloading method of parallel communication and computing can significantly reduce the system delay, and the D2D-enabled partial offloading can further reduce the latency.

scholarly journals Content Popularity Prediction Towards Location-Aware Mobile Edge Caching

2019 ◽  
Vol 21 (4) ◽  
pp. 915-929 ◽  
Author(s):  
Peng Yang ◽  
Ning Zhang ◽  
Shan Zhang ◽  
Li Yu ◽  
Junshan Zhang ◽  
...  
Keyword(s):  
Location Aware ◽  
Content Popularity ◽  
Popularity Prediction ◽  
Edge Caching

scholarly journals Massive MIMO: Achievable Energy Efficiency for 5G systems with Multi-user Environment

2019 ◽  
Vol 8 (2) ◽  
pp. 6527-6534
Keyword(s):  
Energy Efficiency ◽  
Power Consumption ◽  
Path Loss ◽  
Antenna System ◽  
Base Station ◽  
Small Cells ◽  
Limiting Factors ◽  
Improve Energy Efficiency ◽  
User Terminal ◽  
Simulation Results

Massive Multi-Input and Multi-Output (MIMO) antenna system potentially provides a promising solution to improve energy efficiency (EE) for 5G wireless systems. The aim of this paper is to enhance EE and its limiting factors are explored. The maximum EE of 48 Mbit/Joule was achieved with 15 user terminal (UT)s. This problem is related to the uplink spectral efficiency with upper bound for future wireless networks. The maximal EE is obtained by optimizing a number of base station (BS) antennas, pilot reuse factor, and BSs density. We presented a power consumption model by deriving Shannon capacity calculations with closed-form expressions. The simulation result highlights the EE maximization with optimizing variables of circuit power consumption, hardware impairments, and path-loss exponent. Small cells achieve high EE and saturate to a constant value with BSs density. The MRC scheme achieves maximum EE of 36 Mbit/Joule with 12 UTs. The simulation results show that peak EE is obtained by deploying massive BS antennas, where the interference and pilot contamination are mitigated by coherent processing. The simulation results were implemented by using MATLAB 2018b.

scholarly journals Game-based cache allocation strategy for ICN slicing

2021 ◽  
Vol 336 ◽  
pp. 05030
Author(s):  
Liping Ge ◽  
Jinhe Zhou
Keyword(s):  
Equilibrium Solution ◽  
Base Station ◽  
Virtual Network ◽  
Game Model ◽  
Allocation Strategy ◽  
Newton Iterative Method ◽  
Content Acquisition ◽  
Simulation Results ◽  
Cache Allocation ◽  
Cooperative Game Model

To reduce the delay of content acquisition, this paper proposes a game-based cache allocation strategy in the Information-Centric Network (ICN) slice. The cache resource allocation of different mobile virtual network operators (MVNOs) is modeled as a non-cooperative game model. The Newton iterative method is used to solve this problem, and the cache space allocated by the base station for each MVNO is obtained. Finally, the Nash equilibrium solution is obtained. Simulation results show that the proposed algorithm can reduce the delay.

scholarly journals SoftPSN: Software-Defined Resource Slicing for Low-Latency Reliable Public Safety Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Anteneh A. Gebremariam ◽  
Muhammad Usman ◽  
Riccardo Bassoli ◽  
Fabrizio Granelli
Keyword(s):  
Public Safety ◽  
First Responders ◽  
Base Station ◽  
Low Latency ◽  
Radio Resource ◽  
Life Saving ◽  
Before And After ◽  
Simulation Results ◽  
Emergency Scenarios ◽  
Safety Applications

Achieving the low-latency constraints of public safety applications during disaster could be life-saving. In the context of public safety scenarios, in this paper, we propose an efficient radio resource slicing algorithm that enables first responders to deliver their life-saving activities effectively. We used the tool of stochastic geometry to model the base station distribution before and after a disaster. In addition, under this umbrella, we also proposed an example of public safety scenario, ultrareliable low-latency file sharing, via in-band device-to-device (D2D) communication. The example scenario is implemented in NS-3. The simulation results show that radio resource slicing and prioritization of first responders resources can ensure ultrareliable low-latency communication (URLLC) in emergency scenarios.

Sign in / Sign up

Export Citation Format

Share Document