Cooperative Jamming Secure Scheme for IWNs Random Mobile Users Aided by Edge Computing Intelligent Node Selection

Author(s):  
Tengyue Zhang ◽  
Hong Wen ◽  
Jie Tang ◽  
Huanhuan Song ◽  
Feiyi Xie
Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 594 ◽  
Author(s):  
Tri Nguyen ◽  
Tien-Dung Nguyen ◽  
Van Nguyen ◽  
Xuan-Qui Pham ◽  
Eui-Nam Huh

By bringing the computation and storage resources close proximity to the mobile network edge, mobile edge computing (MEC) is a key enabling technology for satisfying the Internet of Vehicles (IoV) infotainment applications’ requirements, e.g., video streaming service (VSA). However, the explosive growth of mobile video traffic brings challenges for video streaming providers (VSPs). One known issue is that a huge traffic burden on the vehicular network leads to increasing VSP costs for providing VSA to mobile users (i.e., autonomous vehicles). To address this issue, an efficient resource sharing scheme between underutilized vehicular resources is a promising solution to reduce the cost of serving VSA in the vehicular network. Therefore, we propose a new VSA model based on the lower cost of obtaining data from vehicles and then minimize the VSP’s cost. By using existing data resources from nearby vehicles, our proposal can reduce the cost of providing video service to mobile users. Specifically, we formulate our problem as mixed integer nonlinear programming (MINP) in order to calculate the total payment of the VSP. In addition, we introduce an incentive mechanism to encourage users to rent its resources. Our solution represents a strategy to optimize the VSP serving cost under the quality of service (QoS) requirements. Simulation results demonstrate that our proposed mechanism is possible to achieve up to 21% and 11% cost-savings in terms of the request arrival rate and vehicle speed, in comparison with other existing schemes, respectively.


2019 ◽  
Vol 11 (9) ◽  
pp. 184
Author(s):  
Wenming Zhang ◽  
Yiwen Zhang ◽  
Qilin Wu ◽  
Kai Peng

In mobile edge computing, a set of edge servers is geographically deployed near the mobile users such that accessible computing capacities and services can be provided to users with low latency. Due to user’s mobility, one fundamental and critical problem in mobile edge computing is how to select edge servers for many mobile users so that the total waiting time is minimized. In this paper, we propose a multi-user waiting time computation model about composite services and show the resource contention of the edge server among mobile users. Then, we introduce a novel and optimal Multi-user Edge server Selection method based on Particle swarm optimization (MESP) in mobile edge computing, which selects edge servers for mobile uses in advance within polynomial time. Extensive simulations on a real-world data-trace show that the MESP algorithm can effectively reduce the total waiting time compared with traditional approaches.


2019 ◽  
Vol 9 (11) ◽  
pp. 2308 ◽  
Author(s):  
Juyong Lee ◽  
Daeyoub Kim ◽  
Jihoon Lee

Recently, new mobile applications and services have appeared thanks to the rapid development of mobile devices and mobile network technology. Cloud computing has played an important role over the past decades, providing powerful computing capabilities and high-capacity storage space to efficiently deliver these mobile services to mobile users. Nevertheless, existing cloud computing delegates computing to a cloud server located at a relatively long distance, resulting in significant delays due to additional time to return processing results from a cloud server. These unnecessary delays are inconvenient for mobile users because they are not suitable for applications that require a real-time service environment. To cope with these problems, a new computing concept called Multi-Access Edge Computing (MEC) has emerged. Instead of sending all requests to the central cloud to handle mobile users’ requests, the MEC brings computing power and storage resources to the edge of the mobile network. It enables the mobile user device to run the real-time applications that are sensitive to latency to meet the strict requirements. However, there is a lack of research on the efficient utilization of computing resources and mobility support when mobile users move in the MEC environment. In this paper, we propose the MEC-based mobility management scheme that arranges MEC server (MECS) as the concept of Zone so that mobile users can continue to receive content and use server resources efficiently even when they move. The results show that the proposed scheme reduce the average service delay compared to the existing MEC scheme. In addition, the proposed scheme outperforms the existing MEC scheme because mobile users can continuously receive services, even when they move frequently.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Binbin Huang ◽  
Yuanyuan Xiang ◽  
Dongjin Yu ◽  
Jiaojiao Wang ◽  
Zhongjin Li ◽  
...  

Mobile edge computing as a novel computing paradigm brings remote cloud resource to the edge servers nearby mobile users. Within one-hop communication range of mobile users, a number of edge servers equipped with enormous computation and storage resources are deployed. Mobile users can offload their partial or all computation tasks of a workflow application to the edge servers, thereby significantly reducing the completion time of the workflow application. However, due to the open nature of mobile edge computing environment, these tasks, offloaded to the edge servers, are susceptible to be intentionally overheard or tampered by malicious attackers. In addition, the edge computing environment is dynamical and time-variant, which results in the fact that the existing quasistatic workflow application scheduling scheme cannot be applied to the workflow scheduling problem in dynamical mobile edge computing with malicious attacks. To address these two problems, this paper formulates the workflow scheduling problem with risk probability constraint in the dynamic edge computing environment with malicious attacks to be a Markov Decision Process (MDP). To solve this problem, this paper designs a reinforcement learning-based security-aware workflow scheduling (SAWS) scheme. To demonstrate the effectiveness of our proposed SAWS scheme, this paper compares SAWS with MSAWS, AWM, Greedy, and HEFT baseline algorithms in terms of different performance parameters including risk probability, security service, and risk coefficient. The extensive experiments results show that, compared with the four baseline algorithms in workflows of different scales, the SAWS strategy can achieve better execution efficiency while satisfying the risk probability constraints.


Author(s):  
Hao Xu ◽  
Ke Li ◽  
Jianfeng Cheng ◽  
Bo Jiang ◽  
Huai Yu

AbstractMobile edge computing can provide short-range cloud computing capability for the mobile users, which is considered to be a promising technology in 5G communication. The mobile users offload some computing tasks to the edge server through the wireless backhaul link, which can reduce the energy consumption and the time latency. Meanwhile, due to the open characteristics of the wireless channel, the offloading tasks through the backhaul link may face the risk of eavesdropping. Therefore, the secure transmission based on physical layer security for the offloading tasks to the edge server is considered. The optimization problem of minimizing the energy consumption for the vehicular stations (VSs) in mobile edge computing-assisted high-speed railway communication system is studied in this paper. The energy consumption of the mobile users is generated by executing the local computing task and by transmitting the partial offloading task to the edge server. In this paper, a novel joint iterative optimization algorithm is proposed. By jointly optimizing the task scheduling, the task offloading and the transmission power, the energy consumption of all VSs is minimized under the constraint of the time latency. Numerical simulation results verify the effectiveness of the proposed algorithm.


Author(s):  
Haowei Lin ◽  
Xiaolong Xu ◽  
Juan Zhao ◽  
Xinheng Wang

Abstract The multi-access edge computing (MEC) has higher computing power and lower latency than user equipment and remote cloud computing, enabling the continuing emergence of new types of services and mobile application. However, the movement of users could induce service migration or interruption in the MEC network. Especially for highly mobile users, they accelerate the frequency of services’ migration and handover, impacting on the stability of the total MEC network. In this paper, we propose a hierarchical multi-access edge computing architecture, setting up the infrastructure for dynamic service migration in the ultra-dense MEC networks. Moreover, we propose a new mechanism for users with high mobility in the ultra-dense MEC network, efficiently arranging service migrations for users with high-mobility and ordinary users together. Then, we propose an algorithm for evaluating migrated services to contribute to choose the suitable MEC servers for migrated services. The results show that the proposed mechanism can efficiently arrange service migrations and more quickly restore the services even in the blockage. On the other hand, the proposed algorithm is able to make a supplement to the existing algorithms for selecting MEC servers because it can better reflect the capability of migrated services.


Author(s):  
Amin Ebrahimzadeh ◽  
Martin Maier

Next generation optical access networks have to cope with the contradiction between the intense computation and ultra-low latency requirements of the immersive applications and limited resources of smart mobile devices. In this chapter, after presenting a brief overview of the related work on multi-access edge computing (MEC), the authors explore the potential of full and partial decentralization of computation by leveraging mobile end-user equipment in an MEC-enabled FiWi-enhanced LTE-A HetNet, by designing a two-tier hierarchical MEC-enabled FiWi-enhanced HetNet-based architecture for computation offloading, which leverages both local (i.e., on-device) and nonlocal (i.e., MEC/cloud-assisted) computing resources to achieve low response time and energy consumption for mobile users. They also propose a simple yet efficient task offloading mechanism to achieve an improved quality of experience (QoE) for mobile users.


Sign in / Sign up

Export Citation Format

Share Document