The Swarm Based Routing Algorithms - 1441 Words

BIOINSPIRED SWARM BASED ROUTING ALGORITHMS IN VANETs Arshpreet Kaur*, Er. Navroz Kaur Kahlon** *(Computer Engineering Department, UCOE, Punjabi University, Patiala) ** (Asst. Prof. Computer Engineering Department, Punjabi University, Patiala) (Email: *arshrai90@gmail.com, **Kahlon.navroz3@gmail.com) Abstract-Vehicular Ad-hoc Networks (VANETs) play main role in the design and development of the Intelligent Transportation Systems (ITS) who improves the road safety and transportation productivity. VANETs include two communication types i.e. Vehicle-to-Vehicle (V2V) and Vehicle-to-Roadside (V2R) communications. One of the most important challenges of this kind of network are the timely, safely and reliable dissemination of messages between vehicular nodes which permits the drivers to take appropriate decisions to improve the road safety. There are many routing protocols for VANETs which can support the reliability and safety for routing. These protocols undergo the several limitations including complexity, lack of scalability, end-to-end delay, routing overheads, etc. To remove these limitations, various bio-inspired methodologies have been proposed for routing among vehicular nodes in an optimized way. Here in this paper, various bio-inspired routing algorithms for the VANET are di scussed. 1. INTRODUCTION A Vehicular Ad-hoc Networks (VANET) are considered as a specific type of Mobile Ad-hoc Network (MANET) which contains the of a set of mobile nodes (Vehicles)Show MoreRelatedField Programmable Gate Array ( Fpgas )1639 Words   |  7 PagesABSTRACT: Placements of logical blocks in FPGA use many optimization algorithms in heuristic manner. Main objective is to provide minimization in wire length during the task placement inside Reconfigurable FPGAs, which will decrease the area, power and delay and increase the speed of execution. Optimization algorithms are applied in the Benchmark circuits and the results are compared. Due to the technological advancement, density of the devices increases so that necessitates improvement in minimizationRead MoreEnergy Efficient Cluster Formation Techniques1717 Words   |  7 Pagesarchitectures, protocols, algorithms and applications have been proposed and implemented for energy efficiency. The efficiency of these networks is highly dependent on routing protocols which directly affecting the network life-time. Cluster formation in sensor network is one of the most popular technique for reducing the energy consumption and expand the lifetime of the sensor network. There are various cluster form ation techniques used in wireless sensor network. In which, Particle Swarm Optimization (PSO)Read MoreThe Development Of Artificial Intelligence1450 Words   |  6 Pagesrecent years, there has been a growing interest in algorithms inspired by the observation of natural phenomena. We can see that all the algorithms are good replacements as method to solve complex computational problems. Various heuristic approaches have been adopted by researches including genetic algorithm (Holland 1975), simulated annealing (Kirkpatrick et al. 1983), immune system (Farmer et al. 1986), ant system (Dorigo et al. 1996) and particle swarm optimization (Kennedy and Eberhart 1995; KennedyRead MoreThe Costly Damage of Flooding1184 Words   |  5 Pagesenvironmental and water resources management. Flood routing, a basis for flood forecasting, is the process of determining progressively the timing and shape of a flood wave at successive points along a river reach. Approaches for flood routing have been based either on hydraulic (process approach) or hydrologic (conceptual or system approach). Hydrologic stream routing is based on the storage concept, and conversely, hydraulic channel routing is based on the principles of mass and momentum conservationRead MoreWireless Sensor Networks ( Wsns )3385 Words   |  14 Pagesmulti-population search algorithm based on the Particle Swarm Optimiz ation (PSO). The goal of this algorithm is to search for sensor network layouts that maximize both the coverage and lifetime of the network. Unlike traditional PSO, our algorithm assignes a swarm to each sensor in the network and a global network topology is used to evaluate the fitness of each particle. We hypothesize that the suggested method will improve over the single population search algorithms that are often applied toRead MorePEGASIS Research Papers1103 Words   |  5 Pagesjust when the detected characteristic is in the range of interest. J. Zhao et al [9] in this thesis, proposed SOP (Self- organizing protocol) protocol which incorporates cluster architecture of LEACH with multihop routing to diminish transmission vitality. In numerous WSN multi-hop routing is received. This makes a node that needs to transmit data to a goal node discover one or numerous intermediate nodes. The correspondence happens among every one of the nodes until the point when the data packetsRead MoreEssay On A Wsn-Driven Service Discovery Techniques995 Words   |  4 Pageshoc networks In [49], introduced a MANET based technique that is controlled by discoveries of deployed WSNs. This technique is used to locate regions of need, discover the appropriate resources to face these needs and specify the more suitable of these resources for the issue under the process. The presented technique which is adopted for the purpose of searching and allocating the best available rescue resource for the encountered status is based on service discovery concepts. The simulationRead MoreThe Optimization Problems Of Swarm Intelligence1418 Words   |  6 Pagesoptimization problems such as Travelling Salesman Problem, Minimum Spanning Tree Problem, Vehicle Routing Problem etc. aims at finding an optimal object from a finite set of objects. Brute force methods which include exhaustive search are not feasible for such problems. In recent years many new and interesting methods are applied for the solution of such problems. These methods such as genetic algorithms (GA), Simulated A nnealing, Tabu Search, and Neural Networks are inspired from physical and biologicalRead MoreM2M Communication System for Networked Robots with Low Memory Footprint1753 Words   |  7 Pagesnumber of nodes therefore the use of proactive routing is not preferred as it requires regular updating of routing tables. Moreover, for dynamic networks where node topology is not fixed and new nodes are added frequently as well as existing nodes can lose connection with the network, updating of routing table may result in high consumption of computation and memory. To overcome such a problem the use of Gossip algorithm is preferred. Gossip algorithms [20] are randomized methods designed to transmitRead MoreEnergy Efficient Clustering Of Wireless Sensor Networks2688 Words   |  11 Pagesas well as algorithms and applications have been determined and implemented. The efï ¬ ciency of these wireless sensor networks is as much as dependent on routing protocol directly affecting the network li fe and in wireless sensor network every sensor has a limited transmission range of every sensor node to obtain the sensing data. Due to this limitation of wireless sensor network Clustering of node is most popular techniques preferred in routing operations. In this paper, cluster based energy efï ¬ cient