Scalability Analysis of Privacy Enabled IPv6 Addressing Protocol for Duty Cycled 6LoWPAN

: The privacy enabled IPv6 addressing mechanism ensures the privacy of node's identification in the communication messages. It makes adversaries difficult to track nodes and link any activities with the node's IP or the MAC address. Scalability of the privacy enabled IPv6 addressing scheme for 6LoWPAN may be affected due to underlying MAC layer mechanisms. Hence, this study aims to explore such impact. Addressing scheme is implemented in Contiki operating system which uses duty cycling at the MAC layer along with CSMA channel access mechanism. ContikiMAC and CXMAC are widely used duty cycling protocols in Contiki. An analytical study is presented in this paper, which analyses the IPv6 address configuration delay with ContikiMAC and CXMAC. Simulation is performed to corroborate the presented analytical model. The address configuration latency limits the scalability of the network. Hence, this paper studies the impact of duty cycling of the nodes on the address configuration latency and estimates the size of a single hop PAN. It is observed that ContikiMAC duty cycling protocol can achieve better performance compared to CXMAC protocol in terms of address configuration latency. In order to make up for the delay due to duty cycling, network can be divided into multiple PANs of smaller size where addressing process runs simultaneously.

Towards a New Algorithm to Optimize IPv6 Neighbor Discovery Security for Small Objects Networks

In order to verify the uniqueness of link-local or unicast addresses, nodes must perform a Duplicate Address Detection process before using them. However, this process is subject to many attacks and the security is willing to be the most important issues in Small Object Networks with IPv6. In this paper, we developed a new algorithm to optimize the security in IPv6-DAD process; this method is based on SHA-512 to verify the identity of the Neighbor Discovery messages transmitted in the link local. First, before sending the NS message, the new node uses the function SHA-512 to hash to the target address and use the last 64 bits in a new field and then encrypt the result with its private key. When receiving the secure message, the existing nodes decrypt it. Our algorithm is going to secure the DAD process by using a digital signature. Overall, this algorithm showed a significant effect in terms of the Address Configuration Success Probability (ACSP).