Mobility-Aware Energy-Efficient Parent Selection Algorithm for Low Power and Lossy Networks

• Published in: IEEE internet of things journal Vol. 6; no. 2; pp. 2593 - 2601
• Main Authors: Murali, Sarumathi, Jamalipour, Abbas
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.04.2019; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Energy consumption; Energy management; Euclidean geometry; Internet of Things; Internet of Things (IoT); IP (Internet Protocol); Linear programming; Measurement; Network topology; Networks; Nodes; objective function (OF); parent selection process; Power management; Routing; routing protocol for low-power and lossy networks (RPL); Routing protocols; Signal strength; Topology; Trickle Timer
• ISSN: 2327-4662; 2327-4662
• DOI: 10.1109/JIOT.2018.2872443

IPv6 routing protocol for low-power and lossy networks (RPL) is a standardized routing protocol for the energy-constrained networks in the Internet of Things networks. Nowadays, many real-time applications demand mobility support among the nodes in RPL with a wide range of speed. But, supporting mobility in RPL becomes a critically challenging issue because the devices are resource constrained and the communication links are lossy to establish a stable network. Moreover, control packet overhead increases rapidly over mobility, which in turn drains out energy and affects the overall lifetime of the network. In this paper, we propose a mobility-aware energy efficient parent selection algorithm that supports random mobility of the nodes in RPL and chooses the best parent from the preferred parent list based on the metrics, namely, expected transmission count, expected lifetime, received signal strength indicator, and Euclidean distance (<inline-formula> <tex-math notation="LaTeX">{d} _{ij} </tex-math></inline-formula>) between the mobile node and the parent node under selection. We also propose a dynamic trickle algorithm for Trickle Timer to solve long listen only period and allocates timer dynamically based on the random set of neighbor nodes under mobility. Specifically, this paper analyzes the performance of the proposed algorithm against previous algorithms, namely, original RPL, corona-RPL, enhanced trickle, reverse Trickle Timer mechanism, and mobility-enhanced RPL in terms of packet delivery ratio, energy consumption, and average end-to-end delay under different scenarios.