BlinkToSCoAP: An end-to-end security framework for the Internet of Things

Author(s):  
Giulio Peretti ◽  
Vishwas Lakkundi ◽  
Michele Zorzi
2021 ◽  
Vol 58 ◽  
pp. 102772
Author(s):  
André Lizardo ◽  
Raul Barbosa ◽  
Samuel Neves ◽  
Jaime Correia ◽  
Filipe Araujo

2015 ◽  
Vol 9 (16) ◽  
pp. 3083-3094 ◽  
Author(s):  
Xin Huang ◽  
Paul Craig ◽  
Hangyu Lin ◽  
Zheng Yan

2017 ◽  
Vol 9 (3) ◽  
pp. 27 ◽  
Author(s):  
Xiruo Liu ◽  
Meiyuan Zhao ◽  
Sugang Li ◽  
Feixiong Zhang ◽  
Wade Trappe

2013 ◽  
Vol 671-674 ◽  
pp. 3223-3226 ◽  
Author(s):  
Ning Hong

This paper proposed a security framework for the internet of things based on Public Key Infrastructure (PKI) which aims to answer these questions that how to solve the security problem in the internet of things between the client operation and service operation. It illustrates the model by presenting a modified security framework for a variety of applications than traditional PKI framework. Our aim is to show the new security framework in the internet of things that the traditional internet network does not have.


2019 ◽  
Vol 11 (11) ◽  
pp. 233
Author(s):  
Zou ◽  
Zhang ◽  
Yi

In order to improve the network layer of the Internet of things to improve transmission reliability, save time delay and energy consumption, the Internet of things cooperative communication and intelligent agent technology were studied in this paper. In cooperative communication, a new cooperative communication algorithm KCN (k-cooperative node), and a reliability prediction model are proposed. The k value is determined by the end-to-end reliability. After k cooperative nodes are selected, other nodes enter dormancy. In aggregate traffic allocation, game theory is used to model the traffic equilibrium and end-to-end delay optimization scenarios. In practice, the optimal duty cycle can be calculated, which makes some cooperative nodes enter an idle state to save energy. Under the premise of guaranteeing end-to-end delay, it is shown that the reliability of the proposed KCN algorithm is better than that of the other existing routing protocols. In the aspect of intelligent agent, a directional source grouping algorithm D-MIP is proposed. This algorithm studies the routing problem of multi-agent parallel access to multiple source nodes. A directed source packet multi-agent routing planning algorithm is proposed. The iterative algorithm of each source node is limited to a sector, and the optimal intelligent agent route is obtained by selecting an appropriate angle. Compared with other algorithms, it is shown through a lot of simulated results that energy consumption and time delay has been saved by the proposed D-MIP algorithm.


Sign in / Sign up

Export Citation Format

Share Document