Enhancing Security-Problem-Based Deep Learning in Mobile Edge Computing

Author:

Zheng Xiao1,Li Mingchu2,Shah Syed Bilal Hussain3,Do Dinh-Thuan4,Chen Yuanfang5,Mavromoustakis Constandinos X.6,Mastorakis George7,Pallis Evangelos8

Affiliation:

1. School of Computer Science and Technology, Shandong University of Technology, Zibo, China

2. School of Computer Science and Technology, Shandong University of Technology, China and School of Software, Dalian University of Technology, Dalian, Kaifaqu, China

3. School of Computer Science and Technology, Shandong University of Technology, China and School of Computing and Mathematics, Manchester Metropolitan University, Metropolitan, Manchester, UK

4. Department of Computer Science and Information Engineering, Asia University, Taichung, Taiwan

5. Zhejiang University, Zhejiang, Hangzhou, China

6. Department of Computer Science, Mobile Systems Laboratory (MoSys Lab), University of Nicosia and University of Nicosia Research Foundation, Nicosia, Cyprus

7. Department of Management Science and Technology, Hellenic Mediterranean University, Crete, Greece

8. Department of Electrical and Computer Engineering, Hellenic Mediterranean University, Heraklion, Greece

Abstract

The implementation of a variety of complex and energy-intensive mobile applications by resource-limited mobile devices (MDs) is a huge challenge. Fortunately, mobile edge computing (MEC) as a new computing paragon can offer rich resources to perform all or part of the MD’s task, which greatly reduces the energy consumption of the MD and improves the quality of service (QoS) for applications. However, offloading tasks to the edge server is vulnerable to attacks such as tampering and snooping, resulting in a deep learning (DL) security feature developed by major cloud service providers. An effective security strategy method to minimize ongoing attacks in the MEC setting is proposed. The algorithm is based on the synthetic principle of a special set of strategies, and it can quickly construct suboptimal solutions even if the number of targets achieves hundreds of millions. In addition, for a given structure and a given number of patrollers, the upper bound of the protection level can be obtained, and the lower bound required for a given protection level can also be inferred. These bounds apply to universal strategies. By comparing with the previous three basic experiments, it can be proved that our algorithm is better than the previous ones in terms of security and running time.

Funder

National Nature Science Foundation of China

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Reference38 articles.

1. Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder

2. Extending Algorithms for Mobile Robot Patrolling in the Presence of Adversaries to More Realistic Settings

3. Nicola Basilico, Nicola Gatti, and Federico Villa. 2010. Asynchronous multi-robot patrolling against intrusions in arbitrary topologies. In 24th AAAI Conference on Artificial Intelligence.

4. A Security Game Model for Remote Software Protection

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3