Ffa-Context Aware Energy Efficient Routing Using Fast Reactive and Adaptive Algorithm

Abstract

A vital issue of routing is how to efficiently strengthen energy consumption of the whole network and to avoid the energy-hole which leads to node failure or node death; this scenario makes the network to work improperly and leads to network death, Here we proves our hypothesis with linearity between routing and linear principles. Our proposed work effectively utilizes the adaption of Optimized particle swarm algorithm (Fast Reactive and fast adaptive algorithm) in order to solve the routing problem in wireless sensor networks to avoid the energy hole. Our approach effectively defines the node leader based on energy level and path optimization for node traversing using particle swarm which effectively utilizes the solution for problem in linearity into routing problem. Our algorithm FFA redefines the particle swarm rules which are reliable in routing strategies and adapts to the working principle. The optimization in our algorithm is to balance energy level and to withstand for its context. This study proves the accuracy using our algorithm respectively by theoretical survey and analysis with simulated results.

Straight Line Routing on Next Hop Graph in Wireless Sensor Networks

“…WSN consist of large numbers (hundreds or thousands) of wirelessly connected heterogeneous sensor nodes that are spatially scattered across a large field of interest (Kavitha Rani and Kannan, 2013) and the process continuous with data gathering from several sensors to monitor events. (Park and Corson, 1997;Rao et al, 2003) In this study, we proposed a robust methodology to exchange data packets with less energy consumption and with high processing of data exchange, a new hybrid algorithm has been developed and built for data routing.…”

Decision Support System for Open Vehicle Routing With Transhipments and Stopovers

“…Laporte and Osman (1995) provided extensive literature reviews of research representing significant contributions to the field of vehicle routing. Other researches related to VRP can be found in (Taillard, 1993;Golden et al, 1998;Mitrovic-Minic and Laporte, 2006;Pisinger and Ropkem, 2007;Rani and Kannan, 2014).…”