Abstract
RPL (routing protocol for low-power and lossy networks) is an important candidate routing algorithm for low-power and lossy network (LLN) scenarios. To solve the problems of using a single routing metric or no clearly weighting distribution theory of additive composition routing metric in existing RPL algorithms, this paper creates a novel RPL algorithm according to a chaotic genetic algorithm (RPL-CGA). First of all, we propose a composition metric which simultaneously evaluates packet queue length in a buffer, end-to-end delay, residual energy ratio of node, number of hops, and expected transmission count (ETX). Meanwhile, we propose using a chaotic genetic algorithm to determine the weighting distribution of every routing metric in the composition metric to fully evaluate candidate parents (neighbors). Then, according to the evaluation results of candidate parents, we put forward a new holistic objective function and a new method for calculating the rank values of nodes which are used to select the optimized node as the preferred parent (the next hop). Finally, theoretical analysis and a series of experimental consequences indicate that RPL-CGA is significantly superior to the typical existing relevant routing algorithms in the aspect of average end-to-end delay, average success rate, etc.
Highlights
Low-power and lossy networks (LLNs) [1,2], composed from a few dozen to thousands of nodes, are a kind of communication network which can support the following three kinds of communication modes: (1) point-to-point; (2) point-to-multipoint; (3) multipoint-to-point.The nodes and their interconnected links in low-power and lossy network (LLN) are constrained
An IPv6 routing protocol for low-power and lossy networks (RPL) [3,4,5,6], proposed by Internet Engineering Task Force (IETF), is known as a dedicated routing algorithm being utilized for LLNs
A novel algorithm of RPL based on a chaotic genetic algorithm (RPL-CGA) is proposed
Summary
Low-power and lossy networks (LLNs) [1,2], composed from a few dozen to thousands of nodes, are a kind of communication network which can support the following three kinds of communication modes: (1) point-to-point (traffic flow between two nodes); (2) point-to-multipoint (traffic flow from a node to multiple nodes); (3) multipoint-to-point (traffic flow from multiple nodes to a central node) The nodes and their interconnected links in LLN are constrained. RPL [3,7], standardized by IETF, is a source routing protocol It can support widespread applications such as NAN (Neighbor Area Networks) and HAN (Home Area Networks) in smart applications such as NAN (Neighbor Area Networks) and HAN (Home Area Networks) in smart grids [8,9], wireless sensor networks, etc. DODAG which is a directed acyclic graph that each edge is oriented toward and terminating at root. can effectively prevent routingprevent loop problems, can be established according to ICMPv6 control can effectively routing loopand problems, and can be established according to ICMPv6 messages and objective
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
