Intelligent Centralized and Distributed Secure Edge Computing for Internet of Things Applications

A special issue of Applied Sciences (ISSN 2076-3417). This special issue belongs to the section "Computing and Artificial Intelligence".

Deadline for manuscript submissions: closed (30 June 2020) | Viewed by 35997

Special Issue Editor


E-Mail Website
Guest Editor
Department of Smart Information and Telecommunication Engineering, Sangmyung University, Cheonan-si, Republic of Korea
Interests: wireless networks; future internet; mobile-oriented information-centric networking; virtual reality (VR) streaming; mobile edge computing (MEC); network security; secure M2M; software-defined networking
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

At present, the patterns of application services, networks, and computing are changing very rapidly. First, the rapid improvement of networks and end-systems has led to changes in services from simple applications to a variety of intelligent multimedia applications. Second, improved ubiquitous interoperability and convergence technologies have led to changes in networks, from cellular- and Wi-Fi-based networks to heterogeneous networks including all-IP, device-to-device, ad-hoc, sensor networks, and Internet of Things (IoT). Lastly, new software-defined radio, resource virtualization, and network security technologies have led to user-oriented computing platforms. With these changes, secure edge computing (EC) has become an active research area. Further, various smart IoT services such as networked game, smart healthcare, home automation, virtual reality (VR) multimedia, and artificial intelligent (AI) robots are becoming efficient. For the best provision of smart IoT services with secure edge computing environments, efficient and intelligent centralized and distributed computing algorithms should be developed.

This Special Issue “Intelligent Centralized and Distributed Secure Edge Computing for Internet of Things Applications” aims (i) to reflect recent developments in intelligent distributed and centralized controls and algorithms for secure edge computing-based IoT services and (ii) to identify critical issues and propose new guidelines that enable the development of future IoT services.

Submissions are expected to focus on both the theoretical aspects and the algorithm and application development of the centralized and distributed secure edge computing. New ideas proposing disruptive approaches are also welcome.
Topics of interest include but are not limited to the following areas:

  • Standardization of secure edge computing architectures for IoT;
  • Middleware for IoT computations and service management;
  • Applications and architectures of content-centric computing or context-aware secure edge computing for IoT;
  • Intelligent cache management for secure edge computing for IoT;
  • Intelligent information and control synchronization for IoT;
  • Security architecture for IoT;
  • Computing architectures, frameworks, platforms, and protocols for IoT;
  • Resource and energy management in secure edge computing for IoT;
  • Spectral efficiency and energy efficiency management for IoT;
  • Machine learning for secure edge computing for IoT;
  • Optimization, control, and automation in secure edge computing for IoT;
  • Low-latency communication and networking in secure edge computing for IoT.

We hope this Special Issue works as a roadmap for all developers and users of the centralized and distributed secure edge computing platform.

Prof. Dr. Jihoon Lee
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Applied Sciences is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Intelligent and secure edge computing
  • Context-aware computing
  • Content-centric computing
  • Resource optimization
  • Blockchain
  • Security
  • Artificial intelligence
  • Machine learning
  • Multi-agent systems
  • Intelligent IoT

Published Papers (10 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

17 pages, 1192 KiB  
Article
DDNB—Doubly Decentralized Network Blockchain Architecture for Application Services
by Youhwan Seol, Jaehong Ahn, Sehyun Park, Mookeun Ji, Heungseok Chae, Jiheon Yi and Jeongyeup Paek
Appl. Sci. 2020, 10(15), 5212; https://0-doi-org.brum.beds.ac.uk/10.3390/app10155212 - 29 Jul 2020
Cited by 1 | Viewed by 4521
Abstract
Decentralization and immutability characteristics of blockchain technology has attracted numerous blockchain-based systems and applications to be proposed. However, technical shortcomings such as low transaction speed, complexity, scalability, and vulnerability to certain attacks have been identified, making it challenging to use the technology on [...] Read more.
Decentralization and immutability characteristics of blockchain technology has attracted numerous blockchain-based systems and applications to be proposed. However, technical shortcomings such as low transaction speed, complexity, scalability, and vulnerability to certain attacks have been identified, making it challenging to use the technology on general consumer applications and services. To address the problem, we propose a new application service platform architecture called DDNB (Doubly Decentralized Network Blockchain). DDNB divides the system into multiple layers in order to take advantage of permissioned blockchain for its processing speed and security, while allowing permissionless open use of the system to application developers. To allow any node to freely participate in application services, DDNB adopts a novel periodic node self-verification process and query chaining mechanism to authenticate newly joining nodes and validate transactions effectively and efficiently. The proposed architecture is evaluated in terms of its processing speed and security on a real proof-of-concept prototype system. Full article
Show Figures

Figure 1

14 pages, 1614 KiB  
Article
Mobile Personal Multi-Access Edge Computing Architecture Composed of Individual User Devices
by Juyong Lee, Jeong-Weon Kim and Jihoon Lee
Appl. Sci. 2020, 10(13), 4643; https://0-doi-org.brum.beds.ac.uk/10.3390/app10134643 - 05 Jul 2020
Cited by 14 | Viewed by 2693
Abstract
The Multi-Access Edge Computing (MEC) paradigm provides a promising solution to solve the resource-insufficiency problem in user mobile devices by offloading computation-intensive and delay-sensitive computing services to nearby edge nodes. However, there is a lack of research on the efficient task offloading and [...] Read more.
The Multi-Access Edge Computing (MEC) paradigm provides a promising solution to solve the resource-insufficiency problem in user mobile devices by offloading computation-intensive and delay-sensitive computing services to nearby edge nodes. However, there is a lack of research on the efficient task offloading and mobility support when mobile users frequently move in the MEC environment. In this paper, we propose the mobile personal MEC architecture that utilizes a user’s mobile device as an MEC server (MECS) so that mobile users can receive fast response and continuous service delivery. The results show that the proposed scheme reduces the average service delay and provides efficient task offloading compared to the existing MEC scheme. In addition, the proposed scheme outperforms the existing MEC scheme because the existing mobile user devices are used as MECS, enabling low-latency service and continuous service delivery, even as the mobile user requests and task sizes increase. Full article
Show Figures

Figure 1

9 pages, 3114 KiB  
Article
Miniaturized PIFA for 5G Communication Networks
by Eugene Rhee
Appl. Sci. 2020, 10(4), 1326; https://0-doi-org.brum.beds.ac.uk/10.3390/app10041326 - 15 Feb 2020
Cited by 4 | Viewed by 3067
Abstract
This paper designed a miniaturized Planar Inverted-F Antenna for 5G communication networks, including Long-Term Evolution Advanced mobile communication services. By showing the radiation pattern, voltage standing wave ratio, and antenna gain of the designed Planar Inverted-F Antenna, this paper evaluates its performance. To [...] Read more.
This paper designed a miniaturized Planar Inverted-F Antenna for 5G communication networks, including Long-Term Evolution Advanced mobile communication services. By showing the radiation pattern, voltage standing wave ratio, and antenna gain of the designed Planar Inverted-F Antenna, this paper evaluates its performance. To show the key characteristics of the Planar Inverted-F Antenna, this paper modeled and simulated it with various variances. Moreover, the real Planar Inverted-F Antenna was fabricated and measurements were done to validate the simulated characteristics of the internal antenna. Full article
Show Figures

Figure 1

10 pages, 2228 KiB  
Article
An NDN Cache Management for MEC
by DaeYoub Kim and Jihoon Lee
Appl. Sci. 2020, 10(3), 896; https://0-doi-org.brum.beds.ac.uk/10.3390/app10030896 - 29 Jan 2020
Cited by 5 | Viewed by 2667
Abstract
To enhance network performance, the named data networking architecture (NDN) caches data-packets in the network nodes on a downstream network path. Then it uses such cached requested data-packets to respond to new request-packets. Hence, a cache management scheme (CMS) is the essential point [...] Read more.
To enhance network performance, the named data networking architecture (NDN) caches data-packets in the network nodes on a downstream network path. Then it uses such cached requested data-packets to respond to new request-packets. Hence, a cache management scheme (CMS) is the essential point of NDN. CMS generally considers two main factors. One is a short response time and the other is storage efficiency. To rapidly respond to requests, CMS generally tries to cache data-packets near users as much as possible. To efficiently manage storage, it uses the popularity of the data. That is, proportionally to the popularity of the data, it increases the number of nodes caching data-packets and manages the lifetime of caches. However, few data objects are as popular as many users globally enjoy in the real world. Hence, if the assumptions about content- usage are practically changed, CMS can waste cache storage and not significantly improve network efficiency. We show that many caches have expired and are not used at all. To improve such inefficiency of CMS, this paper propose to simultaneously apply two cache decision factors, the expected frequency of a cache hit and the popularity of data. That is, it proposes to gradually cache transmitted data in nodes in which their expected cache-usage frequency is relatively high. To show the effectiveness of our proposal, we implement LdC (a limited domain cache policy) and evaluate the performance of LdC. The evaluation result shows that it can enhance the cache-storage efficiency by up to 65% compared with existing CMS without degrading the network efficiency. Full article
Show Figures

Figure 1

14 pages, 842 KiB  
Article
Distributed and Localized Hub-Based Hierarchical Information Transmission Control in Large-Scale Wireless Cloud Networks
by Wonjong Noh
Appl. Sci. 2019, 9(24), 5283; https://0-doi-org.brum.beds.ac.uk/10.3390/app9245283 - 04 Dec 2019
Viewed by 1620
Abstract
This paper proposes a virtual infrastructure-based hierarchical information transmission scheme consisting of two phases, macroscopic transmission and local transmission controls. The macroscopic transmission control builds a hub-node-based virtual infrastructure and then finds the optimal hub route that satisfies the stochastic end-to-end delay constraint. [...] Read more.
This paper proposes a virtual infrastructure-based hierarchical information transmission scheme consisting of two phases, macroscopic transmission and local transmission controls. The macroscopic transmission control builds a hub-node-based virtual infrastructure and then finds the optimal hub route that satisfies the stochastic end-to-end delay constraint. Each node determines whether it belongs to a hub node by itself in a distributed manner. The local transmission control builds a robust local path between hub nodes by using the synchronized redundancy concept; this minimizes the effects of transmission failure by reducing the control traffic overhead and time to reconfigure transmission paths without rediscovery of the transmission path from the source node. Simulations confirmed that, as the network size increased, the performance of the proposed transmission scheme increased in terms of packet delivery ratio and control packet overhead. The scheme can be applied to mobile ad hoc cloud computing systems based on self-organizing vehicular networks or drone networks as a key control. Full article
Show Figures

Figure 1

33 pages, 2007 KiB  
Article
A Connected and Autonomous Vehicle Reference Architecture for Attack Surface Analysis
by Carsten Maple, Matthew Bradbury, Anh Tuan Le and Kevin Ghirardello
Appl. Sci. 2019, 9(23), 5101; https://0-doi-org.brum.beds.ac.uk/10.3390/app9235101 - 25 Nov 2019
Cited by 30 | Viewed by 9346
Abstract
Connected autonomous vehicles (CAVs) will be deployed over the next decade with autonomous functionalities supported by new sensing and communication capabilities. Such functionality exposes CAVs to new attacks that current vehicles will not face. To ensure the safety and security of CAVs, it [...] Read more.
Connected autonomous vehicles (CAVs) will be deployed over the next decade with autonomous functionalities supported by new sensing and communication capabilities. Such functionality exposes CAVs to new attacks that current vehicles will not face. To ensure the safety and security of CAVs, it is important to be able to identify the ways in which the system could be attacked and to build defences against these attacks. One possible approach is to use reference architectures to perform an attack surface analysis. Existing research has developed a variety of reference architectures but none for the specific purpose of attack surface analysis. Existing approaches are either too simple for sufficiently detailed modelling or require too many details to be specified to easily analyse a CAV’s attack surface. Therefore, we propose a reference architecture using a hybrid Functional-Communication viewpoint for attack surface analysis of CAVs, including the Devices, Edge and Cloud systems CAVs interact with. Using two case studies, we demonstrate how attack trees can be used to understand the attack surface of CAV systems. Full article
Show Figures

Figure 1

21 pages, 1790 KiB  
Article
Utility-Centric Service Provisioning in Multi-Access Edge Computing
by Xuan-Qui Pham, Tien-Dung Nguyen, VanDung Nguyen and Eui-Nam Huh
Appl. Sci. 2019, 9(18), 3776; https://0-doi-org.brum.beds.ac.uk/10.3390/app9183776 - 09 Sep 2019
Cited by 1 | Viewed by 3207
Abstract
Recently, multi-access edge computing (MEC) is a promising paradigm to offer resource-intensive and latency-sensitive services for IoT devices by pushing computing functionalities away from the core cloud to the edge of networks. Most existing research has focused on effectively improving the use of [...] Read more.
Recently, multi-access edge computing (MEC) is a promising paradigm to offer resource-intensive and latency-sensitive services for IoT devices by pushing computing functionalities away from the core cloud to the edge of networks. Most existing research has focused on effectively improving the use of computing resources for computation offloading while neglecting non-trivial amounts of data, which need to be pre-stored to enable service execution (e.g., virtual/augmented reality, video analytics, etc.). In this paper, we, therefore, investigate service provisioning in MEC consisting of two sub-problems: (i) service placement determining services to be placed in each MEC node under its storage capacity constraint, and (ii) request scheduling determining where to schedule each request considering network delay and computation limitation of each MEC node. The main objective is proposed to ensure the quality of experience (QoE) of users, which is also yet to be studied extensively. A utility function modeling user perception of service latency is used to evaluate QoE. We formulate the problem of service provisioning in MEC as an Integer Nonlinear Programming (INLP), aiming at maximizing the total utility of all users. We then propose a Nested-Genetic Algorithm (Nested-GA) consisting of two genetic algorithms, each of whom solves a sub-problem regarding service placement or request scheduling decisions. Finally, simulation results demonstrate that our proposal outperforms conventional methods in terms of the total utility and achieves close-to-optimal solutions. Full article
Show Figures

Figure 1

17 pages, 1119 KiB  
Article
A Statistical Performance Analysis of Named Data Ultra Dense Networks
by Muhammad Atif Ur Rehman, Donghak Kim, Kyungmee Choi, Rehmat Ullah and Byung Seo Kim
Appl. Sci. 2019, 9(18), 3714; https://0-doi-org.brum.beds.ac.uk/10.3390/app9183714 - 06 Sep 2019
Cited by 3 | Viewed by 2839
Abstract
Named data networking (NDN) is a novel communication paradigm that employs names rather than references to the location of the content. It exploits in-network caching among different nodes in a network to provide the fast delivery of content. Thus, it reduces the backhaul [...] Read more.
Named data networking (NDN) is a novel communication paradigm that employs names rather than references to the location of the content. It exploits in-network caching among different nodes in a network to provide the fast delivery of content. Thus, it reduces the backhaul traffic on the original producer and also eliminates the need for a stable connection between the source (consumer) and destination (producer). However, a bottleneck or congestion may still occur in very crowded areas, such as shopping malls, concerts, or stadiums, where thousands of users are requesting information from a device that resides at the edge of the network. This paper provides an analysis of content delivery in terms of the interest satisfaction rate (ISR) in ultra-dense network traffic situations and presents a final and an adequate statistical model based on multiple linear regression (MLR) to enhance ISR. A four-way factorial design was used to generate the dataset by performing simulations in ndnSIM. The results show that there is no significant interaction between four predictors: number of nodes (NN), number of interests (NI) per second, router bandwidth (RB), and router delay (RD). Moreover, the NI has a negative effect, and log(RB) has a positive effect on the ISR. The NN less than 10 has a significantly higher effect on the ISR compared with other nodes’ densities. Full article
Show Figures

Figure 1

24 pages, 3303 KiB  
Article
Multi-Objective Service Placement Scheme Based on Fuzzy-AHP System for Distributed Cloud Computing
by A-Young Son and Eui-Nam Huh
Appl. Sci. 2019, 9(17), 3550; https://0-doi-org.brum.beds.ac.uk/10.3390/app9173550 - 29 Aug 2019
Cited by 9 | Viewed by 2257
Abstract
With the rapid increase in the development of the cloud data centers, it is expected that massive data will be generated, which will decrease service response time for the cloud data centers. To improve the service response time, distributed cloud computing has been [...] Read more.
With the rapid increase in the development of the cloud data centers, it is expected that massive data will be generated, which will decrease service response time for the cloud data centers. To improve the service response time, distributed cloud computing has been designed and researched for placement and migration from mobile devices close to edge servers that have secure resource computing. However, most of the related studies did not provide sufficient service efficiency for multi-objective factors such as energy efficiency, resource efficiency, and performance improvement. In addition, most of the existing approaches did not consider various metrics. Thus, to maximize energy efficiency, maximize performance, and reduce costs, we consider multi-metric factors by combining decision methods, according to user requirements. In order to satisfy the user’s requirements based on service, we propose an efficient service placement system named fuzzy- analytical hierarchical process and then analyze the metric that enables the decision and selection of a machine in the distributed cloud environment. Lastly, using different placement schemes, we demonstrate the performance of the proposed scheme. Full article
Show Figures

Figure 1

18 pages, 711 KiB  
Article
On Sharing an FIB Table in Named Data Networking
by Ju Hyoung Mun and Hyesook Lim
Appl. Sci. 2019, 9(15), 3178; https://0-doi-org.brum.beds.ac.uk/10.3390/app9153178 - 05 Aug 2019
Cited by 8 | Viewed by 2906
Abstract
As a new networking paradigm, Named Data Networking (NDN) technology focuses on contents, and content names are used as identifiers for forwarding and routing, as opposed to IP addresses in the current Internet. NDN routers forward packets by looking up a Forwarding Information [...] Read more.
As a new networking paradigm, Named Data Networking (NDN) technology focuses on contents, and content names are used as identifiers for forwarding and routing, as opposed to IP addresses in the current Internet. NDN routers forward packets by looking up a Forwarding Information Base (FIB), each entry of which has a name prefix and output faces. An FIB should have the information to forward Interest packets for any contents. Hence, the size of an FIB would be excessively large in NDN routers, and the traffic for building an FIB would be significant. In order to reduce the traffic associated with building an FIB table and memory requirement for storing an FIB table, this paper proposes a new efficient method which combines the routing of network connectivity and the building of a forwarding engine using Bloom filters. We propose to share the summary of an FIB using a Bloom filter rather than to advertise each name prefix. The forwarding engine of the proposed scheme is a combination of Bloom filters, and hence the memory requirement of the forwarding can be much smaller than the regular FIB. Simulation results using ndnSIM under real network topologies show that the proposed method can achieve nearly the same performance as the conventional link state algorithm with 6–8% of the traffic for distributing the connectivity information and 5–9% of the memory consumption. Full article
Show Figures

Graphical abstract

Back to TopTop