Decentralized Link Failure Prevention Routing (DLFPR) Algorithm for Efficient Internet of Things

Abstract

This work implements a Decentralized Links Failure Prevention (DLFP) routing algorithm to promote enhanced and efficient Internet of Things (IoT). The work increases the mobility as well as an opportunity for loss of IoT node meeting links due to both mobility and blockers/interferers. The proposed algorithm overcomes loss issues as well as works in dynamically allocating alternate route from other IoT nodes available in near and selecting for efficient route in the network. When the link fails, bandwidth is reduced and coverage area problems for packets sending from source to destination is managed. The proposed algorithm works with light-weight wireless mesh based route handling techniques. In such case, reduced link failure, removal of route discovery latency, communication cost and control overheads, energy consumptions and network life time are to be handled with care. To address these issues, the proposed algorithm enhances the Packet Delivery Ratio (PDR) as well as transmission packet efficiently received through destination node. The ability of Dynamic Alternate Routing (DAR) to relay node handling capabilities and to improve the communication link availability of IoT nodes has ultimately increased the PDR. Simulation work was done using Network Simulator 3 (NS3) and the results show that the performance is better when compared with existing Dynamic Source Routing (DSR) and Energy Efficient Delay Tolerant Routing (EEDTR) algorithm.

Fuzzy Reputation Based Trust Mechanism for Mitigating Attacks in MANET

“…Then, a trust-based scheme named Fr AODV was proposed for securing AODV routing protocol in MANET based on the utilization of the friendship mechanism. A detailed analysis on QoS parameters [20][21][22][23][24][25][26][27][28][29][30][31][32][33] has been carried out and recent works [34][35][36][37][38][39][40][41][42][43][44] have been studied. The nodes estimated the routing paths based on the selected features such as node reputation and identity information before transmitting the data through the estimated paths.…”