ARG-RPL: Arrangement Graph-, Region-Based Routing Protocol for Internet of Things

Internet of Things, is an innovative technology which allows the connection of physical things with the digital world through the use of heterogeneous networks and communication technologies. The Routing Protocol for low power and Lossy networks (RPL) is standardized as a routing protocol for LLNs. However, more and more of experimental results demonstrate that RPL performs poorly in throughput and adaptability to network dynamics. In this study, we applied properties of arrangement graphs to design a newly structured routing protocol, extension of RPL, named as Arrangement Graph based Adaptive routing protocol ARG-RPL that enhances the supports of high throughput, adaptivity and mobility for RPL without any modification or assumption on the OFs. In such protocol, the IDs between the two adjacent nodes differ only one digit and thus, self configuration and self optimization in LLNs networks are easy while keeping the low maintenance cost. Distributed algorithms have been developed, consisting of two stages: initialization stage and reactive routing discovery stage. We implement ARG-RPL on the Contiki operating system, and construct extensive evaluation using a large-scale simulations on Cooja. Analysis of experimental results show that the establishment of the system and the routing processing could achieve better performance than those obtained in the RPL and ER-RPL.