In this paper, we propose RECOUP, a reliable group communication routing protocol for IoT networks. RECOUP efficiently uses a low-overhead cluster-based multicast routing technique on top of the RPL protocol. RECOUP increases the probability of message delivery to the intended destination(s), irrespective of the network size and faults (such as broken links or non-responsive nodes), and in the presence of misbehaving nodes.We show that the cluster-based routing mechanism of RECOUP remains robust in presence of various topology (i.e., rank and sybil) and data communication (i.e., blackhole, wormhole, and jamming) attacks targeting the IoT networking infrastructure.An implementation of RECOUP is realized in Contiki. Our results show the effectiveness of RECOUP over state-of-art protocols concerning packet delivery ratio to 25 , end-to-end delay down to 100 ms, low radio transmissions required for per packet delivery to 6 mJ, and most importantly, it improves the robustness and scalability of data communication process in thewhole network.
As RPL or an extension of RPL are the most used routing protocols in IoT networks. We now briefly discuss the security challenges that these protocols might face during the routing process. Authors in @cite_1 propose a sinkhole attack mitigation method that integrates rank authentication with parent fail-over. The proposal uses DIO message along with the one way hash function technique for rank authentication. The root node generates hash value by selecting random numbers, and broadcast these values through DIO messages. When the root node again broadcast the initially selected random number securely then intermediate nodes can verify its parent rank using the intermediate hops number. @cite_5 authors propose a Merkle tree authentication based solution which can be used to prevent wormhole attack on RPL protocol. In this proposal, the RPL tree is formed in the reverse direction by using the node ID and public key which are used to calculate the hash values. After the Merkle tree formation, the authentication for any node starts from the root node and if any intermediate node fails to authenticate, a possible wormhole is detected.
@cite_5 @cite_1
1999949961 2088079708 2793682771 2524874630
Smart metering application has received a lot of attention from the research community lately. Usually, LLN based network runs on RPL protocol which constructs a DAG structure for its normal operation. In this paper, we devise a wormhole attack scenario in such a network. Furthermore, we propose a Merkle tree based authentication protocol which runs on the notion of constructing a tree of hashed security information. We evaluated the approach by formulating the wormhole problem as graph theoretic problem and have shown the effectiveness of the proposed Merkle tree based approach for authenticating communications. Furthermore, we perform simulations in NS 2 to observe the network performance by adopting Merkle tree based to prevent from disrupting the links and observed boost in throughput, reduction in jitter and end to end delay. In the end, we have taken the step towards optimizing the performance of the algorithm by proposing an effective tree traversal algorithm which works on the notion of electing nodes as root in a large scale network from where a Merkle tree will be originated this will assist in managing the authentication in a huge sized network broken down into many trees avoiding wormhole attacks in the network. RPL (IPv6 Routing Protocol for Low Power and Lossy networks) is a routing protocol recently standardized by the IETF. RPL has been designed to operate in energy-constrained networks with thousands of nodes, and therefore it is one of the most promising candidate routing protocols for Advanced Metering Infrastructure (AMI) networks. In this paper a performance evaluation of RPL is presented. An extensive study of the protocol is carried out with particular focus on Trickle, the algorithm adopted to control routing update distribution across the network. The performance of the protocol is analyzed considering different Trickle parameters in order to capture their impact on route formation and node power consumption. Results highlight that the nondeterministic nature of Trickle can lead to sub-optimal route formation especially when high message suppression is per-formed. In order to mitigate this issue, an enhanced version of the protocol, namely Trickle-F, is proposed in order to guarantee fair broadcast suppression. Trickle-F is demonstrated to be effective in obtaining more efficient routes with the same power consumption of the original version. Low power and lossy networks (LLNs) are rapidly emerging as an important part of ubiquitous computing, and serving as a major building block for the communication infrastructure in the presence of Internet-of-Things (IoT). Routing protocol for low power and lossy networks (RPL) is a novel routing protocol standardized to enable the integration of resources-constrained devices into the Internet. However, due to the shared radio medium, the lack of physical protection and security requirements of inherent routing protocol, low power and lossy networks are admittedly threatened by diverse Denial-of-Service (DoS) attacks that primarily disrupt network protocols and interfere with on-going communications. In this paper, we propose a monitor-based approach, called CMD, to mitigate forwarding misbehaviors in LLNs running with RPL, where single or multiple malicious nodes randomly or strategically drop any incoming Data packet. The basic idea of the CMD is that each node monitors the forwarding behaviors of the preferred parent node to observe the packet loss rate, compares the observation result with the collected packet loss rate from one-hop neighbor nodes, and detects the forwarding misbehaviors of the preferred parent node. We evaluate the proposed scheme through extensive simulation experiments using OMNeT++ and compare its performance with the original RPL protocol and the existing two-step detection scheme. The simulation results show that the proposed scheme can not only improve the detection rate and packet delivery ratio (PDR) but also can reduce the energy consumption and isolation latency. Given the scalability of the advanced metering infrastructure (AMI) networks, maintenance and access of certificate revocation lists (CRLs) pose new challenges. It is inefficient to create one large CRL for all the smart meters (SMs) or create a customized CRL for each SM since too many CRLs will be required. In order to tackle the scalability of the AMI network, we divide the network into clusters of SMs, but there is a tradeoff between the overhead at the certificate authority (CA) and the overhead at the clusters. We use Bloom filters to reduce the size of the CRLs in order to alleviate this tradeoff by increasing the clusters’ size with acceptable overhead. However, since Bloom filters suffer from false positives, there is a need to handle this problem so that SMs will not discard important messages due to falsely identifying the certificate of a sender as invalid. To this end, we propose two certificate revocation schemes that can identify and nullify the false positives. While the first scheme requires contacting the gateway to resolve them, the second scheme requires the CA additionally distribute the list of certificates that trigger false positives. Using mathematical models, we have demonstrated that the probability of contacting the gateway in the first scheme and the overhead of the second scheme can be very low by properly designing the Bloom filters. In order to assess the scalability and validate the mathematical formulas, we have implemented the proposed schemes using Visual C. The results indicate that our schemes are much more scalable than the conventional CRL and the mathematical and simulation results are almost identical. Moreover, we simulated the distribution of the CRLs in a wireless mesh-based AMI network using ns-3 network simulator and assessed its distribution overhead.