Secure routing in IoT networks with SISLOF

In this paper, we propose a modification of the RPL routing protocol by introducing the SISLOF Objective Function ensuring that only motes that share a suitable key can join the RPL routing table. This will ensure that all IoT network motes connect in a secure method. SISLOF uses the concept of key pre-distribution proposed by Eschenauer and Gligor in the context of the Internet of Things. First, we discuss related work that provide evidence that the key pre-distribution scheme in the context of the IoT with default RPL metrics fails to achieve the full network connectivity using the same ring size, however full time connectivity can be achieved but with a great cost in term of the large rings sizes. We introduce the SISLOF Objective Function and explain the modification it does to the RPL messages (DIO and DAO). We finally show the performance of the key pre-distribution in the context of the Internet of Things when SISLOF is used as the Objective Function of the RPL routing protocol

Key pre distribution in the context of IoT: the RPL new objective function SISLO

The purpose of this thesis is to develop a novel objective function that ensures secure links between all nodes in an Internet of Things network when using the Routing Protocol for Low-Power and Lossy Networks (RPL) and only allow nodes in the network that share a key to join the network. We propose the Shared Identifier Secure Link Objective Function (SISLOF) to allow only nodes that share a key to join the network and therefore ensuring that all links between the nodes in the network are secure. SISLOF will look at a route that includes all nodes in the network and if a node shares a key with more than one node, it will then choose the node that has a shorter pathway to the root. We evaluate the overhead of the security keys on the Internet of Things nodes and the routing metrics by measuring the overhead when using first ETX and OF0 objective functions when using either the probabilistic scheme or the deterministic scheme. We then identified that the use of ETX or OF0 with both schemes is not appropriate because of the large overhead it adds on the devices and the link. We show that both ETX and OF0 add a large overhead and they are not suitable to be used with the security schemes. The secure objective function was needed as the existing objective functions add a large overhead on the Internet of Things devices when using two different key distribution schemes to distribute and provide keys between nodes and to create a link. We develop an objective function that only adds nodes that share a key to the routing table without the overhead cost the other objective functions added. We also identify that the probabilistic key distribution scheme outperforms the deterministic key distribution scheme for all objective functions. The significance of this study is that it has identified the need for an objective function that incorporates the security key distributions for the Routing Protocol for Low-Power and Lossy Networks (RPL) in the Internet of Things networks and the Shared Identifier Secure Link Objective Function (SISLOF) was developed to solve this problem

On the performance of key pre-distribution for RPL-based IoT Networks

A core ingredient of the the Internet of Things (IoT) is the use of deeply embedded resource constrained devices, often connected to the Internet over Low Power and Lossy Networks. These constraints compounded by the need for unsupervised operation within an untrusted environment create considerable challenges for the secure operation of these systems. In this paper, we propose a novel method to secure an edge IoT network using the concept of key pre-distribution proposed by Eschenauer and Gligor in the context of distributed sensor networks. First, we investigate the performance of the unmodified algorithm in the Internet of Things setting and then analyse the results with a view to determine its performance and thus its suitability in this context. Specifically, we investigate how ring size influences performance in order to determine the required ring size that guarantees full connectivity of the network. We then proceed to propose a novel RPL objective function and associated metrics that ensure that any node that joins the network can establish secure communication with Internet destinations. , N., , H., , Th., , Th., , A., , P