Search

The smart home is a crucial embodiment of the internet of things (IoT), which can facilitate users to access smart home services anytime and anywhere. Due to the limited resources of cloud computing, it cannot meet users' real-time needs. Therefore, edge computing emerges as the times require, providing users with better real-time access and storage. The application of edge computing in the smart home environment can enable users to enjoy smart home services. However, users and smart devices communicate through public channels, and malicious attackers may intercept information transmitted through public channels, resulting in user privacy disclosure. Therefore, it is a critical issue to protect the secure communication between users and smart devices in the smart home environment. Furthermore, authentication protocols in smart home environments also have some security challenges. In this paper, we propose an anonymous authentication protocol that applies edge computing to the smart home environment to protect communication security between entities. To protect the security of smart devices, we embed physical unclonable functions (PUF) into each smart device. Real-or-random model, informal security analysis, and ProVerif are adopted to verify the security of our protocol. Finally, we compare our protocol with existing protocols regarding security and performance. The comparison results demonstrate that our protocol has higher security and slightly better performance. [ABSTRACT FROM AUTHOR]

One of the core features of Intelligent Edge Computing (IEC) is real-time decision making, therefore low delay is more important for IC design under IEC architecture. And in very large scale integration routing, wirelength is one of the most important indexes affecting the final delay of the IC design. Therefore, this paper introduces the X-routing with more potential for wirelength optimization and the Steiner Minimum Tree (SMT), which is the best routing model in multi-terminal nets. Then, based on Particle Swarm Optimization (PSO) technique which has the strong global optimization ability in Soft Computing, an effective Two-Stage X-routing Steiner minimum tree construction algorithm is proposed. The proposed algorithm is divided into two stages: social learning discrete PSO searching and wirelength reduction. In the first stage, two excellent strategies are proposed to maintain a good balance between exploration and exploitation capabilities of the PSO technique: (1) Chaotic decreasing inertia weight combined with mutation operator is set to enhance the exploration capability. (2) A new social learning approach combined with crossover operator is designed to ensure the diverse evolution of the swarm while maintaining the exploitation capability. In the second stage, a strategy based on local topology optimization is proposed to further reduce the length of X-routing Steiner tree. Experiments show that the proposed algorithm can achieve the best wirelength optimization and has a strong stability, especially for large-scale SMT problem, so as to better satisfy the demand of low delay of IC design under IEC architecture. [Display omitted] • Better satisfying the high-performance requirement for IC design under IEC. • Being divided into two stages to obtain routing scheme with shortest wirelength. • Presenting a novel Social Learning DPSO method for SMT problem. • Being validated with benchmark circuit suite. [ABSTRACT FROM AUTHOR]

Aiming at the problems of cold start, gray sheep and sparsity of the traditional collaborative filtering recommendation system, this paper proposes a cross-platform dynamic goods recommendation system based on reinforcement learning and edge computing. First of all, this system models the current friendship relationship networks and potential friendship relationship networks, it also constructs two layers preference prediction models. Then, we consider the frequent change characteristic of social networks and shopping platforms, we design a dynamic reinforcement learning method and edge computing to learn the minimized entropy loss error. Finally, we finish the validation experiments based on the real datasets, the results show the proposed system realizes better link prediction accuracy, and using our proposed system can obtain an obvious increase in the accuracy compared to the existing of collaborative filtering recommendation systems. [ABSTRACT FROM AUTHOR]

This paper carries out the mechanism analysis of non-inertial particle swarm optimization. It is a modified algorithm based on a new kinetic equation which is applied to the prediction of non-stationary time series for the internet of things in the edge computing. In order to avoid premature convergence and accelerate convergence rate, different from standard particle swarm optimization, the modified algorithm uses a new kinetic equation to lead particles motion direction, besides generalized opposition-based learning (GOBL) and adaptive elite mutation (AEM) strategies. The work presents the second order standardized recurrence equation for the new kinetic equation whose corresponding characteristic equations can be analyzed via the difference functions to obtain the boundaries of coefficients and its convergence region. Besides, GOBL and AEM strategies are also analyzed to boost global and local convergence of the algorithm as an interpretation. It is illustrated that performance analysis of the algorithm with two well-known test functions. The good performance is further validated from application in edge computing. [ABSTRACT FROM AUTHOR]