Optimizing RPL performance based on the selection of best route between child and root node using E-MHOF method

Ahmed R. Zarzoor


IETF has proposed the routing protocol for low power and lossy networks (RPL) for IOT as view as light weight routing protocol. In RPL, the objective function (OF) is used to select the best route between child and root node. Several researches have been conducted in order to, enhance OF according to number parameters such as number of hops, remaining energy and expected number of transmissions (ETX), without a consideration to other challenges such as congestion node problem and latency. So, to overcome these challenges a new technique called “Enhance-Minimum Rank with Hysteresis Objective Function (MHOF)” is proposed in this paper, to select the ideal path between the child and root node. The technique is consisted of three layers: parent selection layer in which parent is selected based on three parameters (ETX, RSSI and nodes’ residual energy), path selection layer in which the best route is chosen according to the minimum of (average ETX value) and maximum of (average remaining energy value) of all nodes in the selected route. The last layer is child node minimization, which utilized to solve the congestion node energy problem by using two parameters (RSSI reference and threshold value). The proposed method has been implemented and evaluated by using Cooja simulator software. The simulation results have shown that selected path with E-MHOF is increased the network lifetime and reduced latency in comparison with MHOF.


expected number of transmissions (ETX); internet of thinks (IoTs); minimum rank with hysteresis objective function (MHOF); objective function (OF); routing protocol for low power and lossy networks (RPL);

Full Text:


DOI: http://doi.org/10.11591/ijece.v11i1.pp224-231

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

International Journal of Electrical and Computer Engineering (IJECE)
p-ISSN 2088-8708, e-ISSN 2722-2578