Abstract

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.

Full Text
Paper version not known

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 call

Disclaimer: 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.