Main Reference PaperA Novel RPL Algorithm Based on Chaotic Genetic Algorithm, 2018. [Contiki-Cooja Simulator]
  • Cao, Yanan, and Muqing Wu.

Author Name(s):
  • Cao, Yanan, and Muqing Wu.

  • 10.3390/s18113647

DOI:
  • 10.3390/s18113647

  • Internet of Things (IoT)

Research Area:
  • Internet of Things (IoT)

  • 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

Abstract:
  • 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

  • Operating System : Ubuntu 12.04 LTS 64bit

  • Simulator: Cooja, Instant Contiki-3.0 and Vmware Player 12.5.6

  • Language: C

Software Tools & Technologies
  • Operating System : Ubuntu 12.04 LTS 64bit

  • Simulator: Cooja, Instant Contiki-3.0 and Vmware Player 12.5.6

  • Language: C

  • M.E / M.Tech/ MS / Ph.D.- Customized according to the client requirements.

Project Recommended For
  • M.E / M.Tech/ MS / Ph.D.- Customized according to the client requirements.

  • No Readymade Projects-project delivery Depending on the complexity of the project and requirements.

Order To Delivery
  • No Readymade Projects-project delivery Depending on the complexity of the project and requirements.

Professional Ethics: We S-Logix would appreciate the students those who willingly contribute with atleast a line of thinking of their own while preparing the project with us. It is advised that the project given by us be considered only as a model project and be applied with confidence to contribute your own ideas through our expert guidance and enrich your knowledge.

Leave Comment

Your email address will not be published. Required fields are marked *

clear formSubmit