RPL using MBCO based Efficient Parent Selection for Coverage based Dynamic Trickle Techniques

  • B.Bharathi Kannan, Dr.R.Viswanathan

Abstract

The routing protocol for networks and low energy networks (RPL) act a fundamental part in the
structure of the Internet of Things. RPL follows the manual algorithm and selects the original node
based on the distance. The alphabet codes determines destination oriented directed acyclic graph
(DODAG). When blocking the transmission, network coverage and imbalance problems are not
resolved with the irregular distribution of the nodes. In adding, the DODAG project relies only on a
routing scale to determine reliable and energy efficient routing paths. This study proposes the
energy-saving RPL (E-RPL) protocol, which comprises of MBCO-based multi-factor optimization for
parental selection and a dynamic, maintenance-based algorithm for creating low-power DODAGs
without a leveling grid. Coverage and routing of reliable data. MBCO considers the expected
transmission number (ETX) and the classification value as components of pheromones, residual
energy and children as guiding factors. To balance the opposite ETX factors, scores, response times
and energy consumption, e-RPL uses the relationship of parent-child as a pheromone fumigation
factor. In addition, a weight-based algorithm is used to join the evaporation factors of pheromones,
heuristics and pheromones in an objective function. To create the perfect DODAG architecture with
low routing costs, Coronal e-RPL offers a single chapter and dynamically determines the density of
nodules and the number of broadcast messages associated with coverage. Finally, we evaluate the
presentation of e-RPL using the Cooja emulator. E-RPL reaches 90% of the radius coefficient and
costs 0.532 MJ when using a topology of 30 knots.

Published
2020-05-20
How to Cite
B.Bharathi Kannan, Dr.R.Viswanathan. (2020). RPL using MBCO based Efficient Parent Selection for Coverage based Dynamic Trickle Techniques. International Journal of Advanced Science and Technology, 29(7), 2998-3011. Retrieved from http://sersc.org/journals/index.php/IJAST/article/view/18213
Section
Articles