Pc-RPL

Abstract

We present PC-RPL, a transmission power-controlled IPv6 routing protocol for low-power and lossy wireless networks that significantly improves the end-to-end packet delivery performance under heavy traffic compared to the standard RPL. We show through actual design, implementation, and experiments that a multihop wireless network can achieve better throughput and routing stability when transmission power and routing topology are "jointly and adaptively" controlled. Our experiments show that the predominant "fixed and uniform" transmission power strategy with "link quality and hop distance"-based routing topology construction (i.e., RPL) loses significant bandwidth due to hidden terminal and load imbalance problems. We design an adaptive and distributed control mechanism for transmission power and routing topology, named PC-RPL, on top of the standard RPL routing protocol for hidden terminal mitigation and load balancing. We implement PC-RPL on real embedded devices and evaluate its performance on a 49-node multihop testbed. PC-RPL reduces total end-to-end packet losses by approximately sevenfold without increasing hop distance compared to RPL with the highest transmission power, resulting in 17% improvement in aggregate bandwidth and 64% improvement for the worst-case node by successfully alleviating both hidden terminal and load imbalance problems.

Static to dynamic transition of RPL protocol from IoT to IoV in static and mobile environments

“…The IETF ROLL working group presented such convention then, RPL [5][6]. RPL protocol permits code changes to manage network traffic [7], energy utilization [8], and so on. A few explorers [9][10] show techniques to extemporise network proficiency utilising RPL protocol for IoT networks [11].…”

Detecting the RPL Version Number Attack in IoT Networks using Deep Learning Models

“…Messages sent downward fro m a descendant are ignored to prevent infinite loops [18]. In addition, nodes may often only switch their parents if doing so would increase their ran k [18] .…”

“…Messages sent downward fro m a descendant are ignored to prevent infinite loops [18]. In addition, nodes may often only switch their parents if doing so would increase their ran k [18] . Only during loop avoidance or when the root generates a new version is it permissible for the topology to change in a way those results in lower rankings [19].…”