Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

Master thesis on Vehicular Ad hoc Networks (VANET)

800 views

Published on

The increasing demand for wireless devices and wireless communication tends to research on self-organizing, self-healing networks without the interference of any pre-established or centralized infrastructure/authority [2]. The networks with the absence of any pre-established or centralized authority are known as Ad hoc networks [4]. Ad hoc Networks are the kind of wireless networks that uses multi-hop radio relay.There are many comparative studies and surveys that compare various ad hoc routing in VANET environment. The simulations performed in these comparative studies are very basic do not incorporate with a large number of nodes in real Vehicular Ad hoc Network environment. The main aim of our dissertation work is to firstly investigate the reactive and proactive routeing protocols than examine the performance of selected reactive routing protocols i.e. Destination Sequence Distance Vector Routing (DSDV), Ad hoc On-Demand Distance Vector (AODV), Optimized Link State Routing (OLSR) and Dynamic Source Routing (DSR)by taking three performance metrics like network load, throughput and end-to-end delay with varying number of mobile nodes or vehicle node densityOPNET: Optimized Network Engineering Tool (OPNET) is a commercial network simulator environment used for simulations of both wired and wireless networks [20]. Several different OPNET versions have been released over the last few years; the latest version of OPNET is the OPNET 16.0. At present OPNET is licensed under Riverbed technologies. It allows the user to design and study the network communication devices, protocols, individual applications and also simulate the performance of routing protocol. It supports many wireless technologies and standards such as, IEEE 802.11, IEEE 802.15.1, IEEE 802.16, IEEE 802.20 and satellite networks. OPNET IT Guru Academic Edition is available for free to the academic research and teaching community.

Published in: Engineering
  • Nice !! Download 100 % Free Ebooks, PPts, Study Notes, Novels, etc @ https://www.ThesisScientist.com
       Reply 
    Are you sure you want to  Yes  No
    Your message goes here

Master thesis on Vehicular Ad hoc Networks (VANET)

  1. 1. For more Https://www.ThesisScientist.com Chapter 1 INTRODUCTION OF VANET 1.1 Introduction: The increasing demand of wireless devices and wireless communication tends to research on self organizing, self healing networks without the interference of any pre-established or centralised infrastructure/authority [2]. The networks with the absence of any pre-established or centralised authority are known as Ad hoc networks [4]. Ad hoc Networks are the kind of wireless networks that uses multi hop radio relay. Figure 1.1: Working structure of VANET Vehicular Ad hoc Networks (VANET) is the subtype of Mobile Ad Hoc Networks (MANETs) [4]. It is the most developed technology that confers Intelligent Transportation System (ITS) in wireless communication among road side equipment (RSUs) to vehicles and vehicles to vehicles (V2V) according to IEEE 802.11p standard. VANET provides broad range of security and non security applications. Security application provides security to the passengers such as lane change warning, collision detection etc. It also provides commercial and comfort applications to the road users such as video exchanging, audio exchanging, electronic payments, weather information, route guidance, electronic toll collect, mobile E-commerce etc. Figure 1.1[1] shows the overall working structure of Vehicular Ad hoc Network (VANET).
  2. 2. For more Https://www.ThesisScientist.com 1.2 VANET Overview: VANET can be applied for large vicinity of security and non security purposes, permit for value added services like traffic management , location based services to finding the fuel station, travel lodge, restaurants and commercial applications such as providing path to the internet. vehicular ad hoc network have grown out of the need to support the growing number of wireless products or instances that can now be used in vehicles. Mobile telephones, PDAs(personal digital assistants), laptops are some wireless products of instances. VANET is an advance class of MANET (Mobile Ad-hoc Network). It manages a network in which vehicles are acting nodes and applied as mobile nodes to make an infrastructure-less ad-hoc network. It makes the communication network between Inter-Vehicle (V2V), Vehicle-to-Roadside (V2R) and Inter- Roadside [1]. Vehicular Ad-hoc Network (VANET) is a novel developed kind of Mobile Ad- hoc Network (MANET), where travelling nodes are vehicles like cars, buses, autos etc. 1.2.1 VANET Architecture: Vehicular Ad hoc Network (VANET) architecture [5] exists of the different types of domains such as ad hoc, in-vehicles and infrastructure domains and many components such as application unit(AU), on-board unit(OBU), and road-side unit(RSU). The figure 1.2[14] shows the all domains and components of VANET. In-Vehicle Domain: In-vehicle domain consists of one or more than one applications units (AUs) and one On-Board Unit (OBU) that inhabits inside a vehicle [19]. Applications Units (AUs) is an in-vehicle existence, more than one AUs can be plugged in with a one OBU and share the wireless resources and OBU processing. An On-Board Unit (OBU) is used for providing the vehicle-to-vehicle (V2V) communication and vehicle-to-infrastructure (V2I) communication. An OBU is fitted with a sole network device based on IEEE 802.11p radio technology; basically network device is used for sending, receiving and forwarding the security and non security messages in the ad hoc domain . Ad hoc Domain: Ad hoc VANET domain composed of vehicles or nodes that equipped with On-Board Unit (OBUs) and road-side units (RSUs), that forming the VANET[19]
  3. 3. For more Https://www.ThesisScientist.com Figure 1.2: VANET System Architecture. A road side unit (RSU) is a physical device placed at fixed positions like shopping complexes, colleges, road highways, hospitals etc. An RSU is fitted with at least a network device based on IEEE 802.11p standard [30]. On-Board Units (OBUs) form a mobile ad hoc network (MANET) that allows communications between the vehicles without the need of centralised coordination . Two vehicles directly communicate via On-Board Units (OBUs) if wireless connectivity exists among them otherwise multi-hop communications are used to forward data. Infrastructure Domain: This type of domain consists of wireless Hot-Spots (HS) and road side units(RSU) that the vehicles reach for comfort based applications [18, 29]..In case that neither road side units(RSUs) nor Hot-Spots (HS) provide internet access, OBUs can also use communication abilities of several radio networks or technologies such as GPRS if they are unified in the On-Board Unit (OBU), in particular for non-securable applications. Application Units (AUs): This is an inter vehicle existence, more than one AUs can be plugged in with a one OBU and share the OBU processing [29]. Examples of Application Units (AUs) are : safety applications devices like hazard-warning and a navigation system with communication capabilities. More than one Application Units can be plugged in with a one On- Board Unit (OBU) and share the On-Board Units (OBUs) processing . An Application Unit (AU)
  4. 4. For more Https://www.ThesisScientist.com communicates merely via the On-Board Unit (OBU), which handles all networking and mobility functions on the Application Unit (AU) behalf. The distinction between Aus and OBU is: On- Board Unit (OBU) is only logical and an Application Unit (AU) can be physically co-located with an OBU [29]. On-Board Units (OBUs): This is used for vehicle to vehicle (V2V) communications and vehicle to infrastructure(V2I) or road side unit (RSU) communications [29]. An On- Board unit also provides communication services to the application units. It also forwards data on behalf of other On-Board Units (OBUs) in the ad hoc domain. An On-Board Unit (OBU) is fitted with at least a one network device of IEEE 802.11p standard. This network device is responsible for receiving, sending and forwarding securable and non securable messages in the ad-hoc domain. The main procedures of On-Board Unit (OBU) includes reliable message transfer, geographical ad hoc routing, network congestion control, data security, wireless internet access and others. Road-Side Units (RSUs): This is a physical device located at fixed positions along roads or highways, or at dedicated locations such as shopping complexes, petrol pumps, parking places, hospitals, schools, colleges, complexes, restaurants etc [19, 29]. A RSU is equipped with at least one network device based on IEEE 802.11p. The main function of RSU is to provide the inter- network connectivity to the OBUs. An overview of the functions performed by RSU is given below. 1. Extending the broadcasting range of an ad hoc network by means of re-distribution of information to other OBUs and cooperating with other RSUs in distributing securable or comfortable information. 2. Running securable applications, such as for vehicle-to-infrastructure warning like low bridge warning, work-zone warning and act as information source. 3. Providing internet network connectivity to all OBUs for accessing comfortable, securable and non securable applications.
  5. 5. For more Https://www.ThesisScientist.com Figure 1.3: RSU extends communication range FIGURE 1.4: RSU ACTS AS INFORMATION SOURCE Figure 1.5: RSU PROVIDING INTERNET ACCESS
  6. 6. For more Https://www.ThesisScientist.com 1.3 VANET APPLICATIONS Communication between the vehicles has led to the development of a number of applications and provides a wide range of information to vehicular drivers and travellers. This has increased the road safety and comfort of the passengers. Applications can be classified into two, on the basis of their purpose. A. Comfort Application It is also called Entertaining application. These are non-safety applications, aiming at improving the comfort level of drivers and travellers. Convenience application mainly deals in traffic management with a goal to enhance traffic efficiency by boosting the degree of convenience for drivers. The Convenience applications can be classified as: 1. Route Diversions: Route and trip planning can be made in case of road congestions. 2. Electronic Toll Collection: Payment of the toll can be done electronically through a Toll Collection Point. A Toll collection Point shall be able to read the OBU of the vehicle. OBUs work via GPS and the on-board odometer or techograph as a back-up to determine how far the Lorries have travelled by reference to a digital map and GSM to authorize the payment of the toll via a wireless link. TOLL application is beneficial not only to drivers but also to toll operators. 3. Parking Availability: Notifications regarding the availability of parking in the metropolitan cities helps to find the availability of slots in parking lots in a certain geographical area. 4. Active Prediction: It anticipates the upcoming topography of the road, which is expected to optimize fuel usage by adjusting the cruising speed before starting a descent or an ascent. Secondly, the driver is also assisted . B. Safety Application
  7. 7. For more Https://www.ThesisScientist.com These applications focus on improving road safety and in avoiding accidents by using the wireless connection between the vehicles or between vehicles and infrastructure. 1. Vulnerable Individual Protection: It includes services like audio message for blind person. 2. On Coming Traffic Warning: It helps the driver about overtaking maneuvers, by provide information about in-coming traffic. 3. Traffic Signal Violation: RSU broadcast messages to warn vehicles about violation in traffic signal. 4. Public Safety: Public safety applications are required if an accident has been physically reported. It alerts the vehicles so that they can give a way to the emergency vehicle. 5. Electronic Brake Warning: It informs the driver that sudden braking is performed by a preceding vehicle. 6. Post Crash Notification: Vehicle involved in accident alerts other approaching vehicles by broadcasting warning messages. 7. Intersection Violation Warning: This Intersection violation warning application warns drivers when they are going to pass over a red light. 1.4 Motivation Traffic security is a major challenge granted by the major players in the automotive industry and by many governments. Traffic delays continue to increase and wasting many hours . Apart from traffic security and efficiency, features like entertainment, payment services, internet access and information updates can be unified into vehicles to improve passenger convenience. Normally a driver, has incomplete information about road conditions, speed and location of vehicles around them, and is forced to make decisions like breaking and lane changing without the benefit of whole data. Real time communication between vehicles and vehicles to RSU can improve traffic efficiency and security [7]. For example, if a vehicle needs to slow down due to an accident ahead, it will broadcast warning messages to neighbouring vehicles. The vehicles behind it will thus be warned before they actually see the accident, helping the drivers react faster. In another , if vehicles can broadcast traffic congestion information to other vehicles in its broadcast range, it
  8. 8. For more Https://www.ThesisScientist.com can help variant vehicles catching the information to chose optional or alternate routes and avoid traffic congestion. Vehicular Ad hoc Networks (VANETs), subclass of mobile ad hoc networks (MANET) , were developed with a view to enable real-time communication between mobile nodes (vehicles or road side infrastructure) over wireless links, primarily with a view to enable traffic security and efficiency. The communication between two or more nodes in a Vehicular Ad hoc Networks (VANET) faces many unique challenges [8]. This is especially true for safety-critical applications like lane change, pre-crash sensing, collision avoidance etc. Factors like traffic density, high vehicle speeds, low signal latencies, total message size etc. induce challenges that makes conventional wireless technologies and protocols unsuitable for Vehicular Ad hoc Networks (VANETs).Apart from the performance challenges, there are many security issues unique to VANET like authenticating message sender, verifying validity of message data, providing node privacy with non-repudiation, certificate revocation, availability etc. All these performance and security requirements contribute to make VANET securable applications. 1.5. Problem Statement: There are many comparative studies and surveys that compare and improve AODV routing protocol by many ways. This thesis has proposed a different approach to modify AODV and compare its performance by many ways. • To implement AODV with GA • To increase the output by increasing the throughput, packet delivery ratio. • To decrease the Packet loss. • To decrease the end-to-end delay. Genetic algorithm (GA) is a subclass of evolutionary algorithms (EA) which generate solutions to optimization problems using techniques inspired by natural evolution such as selection, crossover and mutation. The genetic algorithmic rules evaluate every chromosome to fitness number n and then perform crossover and mutation to find optimal path. 1.6. Aims and objectives:
  9. 9. For more Https://www.ThesisScientist.com  This thesis presents a new dynamic and adaptive G-AODV routing protocol for VANETs inspired by the genetic algorithm in combination with network delay analysis. Genetic Algorithms have been thoroughly investigated in the past for problems such as the Travelling Salesman problem and even the routing problem in communication networks. • The proposed G-AODV is compared with another ad hoc routing protocol such as Ad hoc On-Demand Distance Vector (AODV) by evaluating the throughput, End-to-End delay in both algorithms. The aim of this comparison study is to improve the performance of AODV routing protocol by using Genetic algorithm when a link or a node fails. The modification of the protocol is based on the improvement of the mechanism that generates the loss of packets. The loss of packets may happen in many cases. Some solutions have been proposed to make AODV protocol more robust against retransmission of packets here number of packets received to the number of packet send is more so overall throughput is increase. 1.7 Organization of Thesis In this section describes brief insights on the dissertation work by showing the organization of the other Chapters. There are six chapters presented in this dissertation report that are describes as follows: Chapter 2: This chapter describes a detail explanation of different types of routing protocol, a detailed study of AODV protocol and genetic algorithm. Chapter 3: This chapter describes a detailed comparative study of various ad hoc routing protocols and VANET applications. It also describes the state of the art. Chapter 4: This chapter describes the working, algorithm of the proposed work and its flowchart in detailed with an example. Chapter 5: This chapter describes the conclusion and future work of this dissertation study.
  10. 10. For more Https://www.ThesisScientist.com Chapter 2 LITERATURE REVIEW 2.1 State of the Art In recent years, various researchers have examined and compare various ad-hoc Routing Protocols taking into consideration different performance metrics while basis for performance evaluation. In this section describes the literature review of various research papers and journals related to Vehicular Ad hoc Networks (VANET). Ameur et al. [27]: In this paper authors present a systematic comparative study of three routing protocols: DSDV, AOMDV and AODV in low, high and middle density regions. In their work, authors was developed a road traffic scenario with taking 50 vehicle as low density ,100 for middle density and 150 for high density region respectively. For the simulation purpose, authors used NS-2.34 network simulator in LINUX platform and VanetMobiSim simulator for generated road topology for simulations purposes. After the simulation result, authors conclude that in low density region AODV and AOMDV score almost same range of packet delivery ratio whereas DSDV packet delivery ratio was situated in between in range of 60-80.In the middle density region the graph shows that AODV and AOMDV have packet delivery ratio lies between 90 to 100 ranges, whereas DSDV packet delivery ratio is in range of 60-80. And in high density region the graph shows the AODV and AOMDV score same packer delivery ratio in range of 90-100, whereas DSDV packet delivery ratio was degrades to 20-3 Amit N. Thakare et al. [10]: In this paper authors analyzed the performance of AODV and DSR routing protocols using ns-2 simulator with Random Waypoint mobility model. After arriving simulation results they resolve that packet loss of DSR is higher as equated to AODV and ratio of packet received was higher for AODV as compared to the DSR routing protocol.
  11. 11. For more Https://www.ThesisScientist.com Artimy et al. [18]: in this paper authors try to make best use of DSRC channels by proposing a cluster based multi channel communication scheme. In this scheme authors assumed that each vehicles is equipped with two DSRC transceiver that can work on two different channel simultaneously. In their work they divide time in to periods that can be repeated every T millisecond. And each period is further divide into sub periods for exchange data. Davesh et al. [12]: In this paper authors analyzed the performance of AODV and DSR routing protocols using ns2 simulator with changing number of nodes. After getting simulation results they conclude that AODV shows very high packet delivery ratio in 40 mobile nodes, simply substantially decreases if the simulation node increases. DSR express less end to end delay as equated to the AODV. Finally they concluded that AODV performs best because it allow for almost identical result in all assumption and DSR suits for lower scalability networks in which mobile nodes move at moderate speed. Fan li. et al. [15]: Here authors provides a comprehensive and comparative survey that dealing with all issues related to Vehicular Ad hoc Networks like its wireless access technologies and standards, its characteristics , challenges ,security issues, its applications and various simulators. In their work, authors present comprehensive and comparative study that focuses on the issues surrounding VANET and its applications that help to tackle the all issues related to the VANET. In this paper authors also briefly described the several network simulators like NS-2, MOVE, Trans, VanetMobiSim, GloMoSim, NCTUns and QualNet. Goel A. et al. [22]: In this paper authors investigate methods on how to propagate safety related messages to accidental areas. They outline a scenario, in which an accident happened on a city highway then how a safety message is propagated within one mile of the accidental area, for telling to the other vehicles to slow down and take alternative route. Gupta P. et al. [16]: In this paper authors compared and analyzed the performance of AODV and DSR routing protocols using default random direction point mobility model. For performance evaluation of considered protocols they used ns-2 simulator with varying pause time. After arriving simulation results they conclude that DSR outperformed AODV in delay and throughput on little number of nodes with lower load and mobility while AODV performed
  12. 12. For more Https://www.ThesisScientist.com better than DSR on big number of nodes with higher load and mobility. They also found that DSR has low throughput and delay since of aggressive use of caching and stale routes. Jerome Haerri et al. [3]: Here, authors evaluate and improve the performance of the AODV and OLSR routing protocols under two topical and realistic mobility models for VANET. In their work for the performance evaluation authors used the OMNET++ simulator .In this paper authors design a convoy scenario that contains several parameters like 400km*400km simulation area, 60 seconds simulating time, 500m communication range, 1440B packet size, 27m inter vehicle distance and UDP transport protocol .The main objective of this function is improves the communication performance of routing protocols by increasing the density around the receiver. In their work authors also analyse the properties of the two mobility models in high density urban fields. Finally after the simulation result authors conclude that the performance of AODV is better than OLSR and OLSR routing protocol appear more affected by the density than AODV, the reason behind is that proactive routing protocol maintains the full network topology while reactive routing protocol create routes when they need. Jorjeta G. et al. [32]: In this paper authors discussed several security related issues of mobile ad hoc networks. In their work, authors described the black hole attack in mobile ad hoc networks and proposed a feasible solution for it. Authors used the Global Mobile Simulator in this proposed solution and found to achieve the required reliability and security with minimal overhead and delay. In their work, authors used several performances metrics like routing overhead, packet delivery ratio, average end to end delay to evaluate the performance of AODV. To evaluate the packet delivery ratio authors take several parameters such as25 number of nodes, 5Minutes simulation time and 800m by 800m simulation area. Thus, in recent years, several researchers have analyzed and compare various ad-hoc Routing Protocols accepting into consideration different performance metrics as basis for performance evaluation. They have used different simulators and simulation models as the same. In the next section describes a conclusion of this chapter. Kamble et al. [26]: Here Authors, proposed an AODV-R routing protocol that is improved version of AODV routing protocol. In their work to achieve these objective authors developed a link reliability model based on the vehicular velocity distribution on highways. In this papers
  13. 13. For more Https://www.ThesisScientist.com authors applying a hybrid approach combining both macroscopic and microscopic traffic flow models is highway mobility model and also applying the link reliability model to improve the performance of the current routing protocols in VANETs and incorporated vehicular reliability model into the AODV routing protocol to create a new protocol named as AODV-R routing. Authors compare both AODV and AODV-R. In their work for the performance comparison and evaluation authors was taking four performance metrics such as Average packet delivery ratio, link failures, and average end to end delay. After the simulation result authors found that AODV- R shows higher average end to end values than AODV and route establishment in AODV-R takes longer than that in AODV because of the processing of multiple routing request and replies. Manvi S. et al. [17]: In this paper authors analyse performance of two routing protocols AODV and OLSR by using OPNET Modeler 14.5.In their work ,authors create a network scenario of 40 nodes with the comparison of network load media access delay and throughput to examine the AODV and OLSR routing protocols with simulation parameters like 600*600 m campus area , 40 nodes and 20 minutes simulation time .According to the authors simulation result OLSR routing protocol shows low media access delay and low network load in comparison of AODV , with the overall performance OLSR is better than AODV but it is not necessary that OLSR is always better than AODV. Monika et al. [6]: In this paper authors analyzed the performance of AODV and DSR routing protocols for Vehicular Ad-hoc network with and without RSU (Road Side Unit). For performance evaluation of conceive protocols they used Estimate Simulator. After getting simulation results they conclude that throughput was highest for AODV as compared to DSR with varying number of nodes so AODV performed better than DSR. They also determined that in presence of RSU whole performance of network was better as compared to absence of RSUs. N.UMAPATHI et.al.[34]:Swarm Intelligence Based Dynamic Source Routing as Improved Quality of Service. The OPNET simulation tool is used to evaluate the performance. When a source node forwards a packet to a destination, it appears into its route cache to see if it already has destination route. When it locates an unexpired way to the destinations, it uses it to forward
  14. 14. For more Https://www.ThesisScientist.com the packet. If the node lacks such a way, then way discovery is initiated by broadcasting a route request. After simulation results shows that the improved performance of routing in the network. Nzouonta J. et al. [23]: In this paper authors proposed a Road based vehicular traffic (RBVT) routing which is a class of VANET routing protocols for the city based environments. In this work ,authors described a road based vehicular traffic (RBVT) routing protocol that uses real time vehicular traffic information to create road based paths between endpoints. And also authors outline how to improve the end to end performance for the high contention areas by using the distributed mechanism. Prabha R et. Al.[36]: Here, authors evaluate an improved multipath MANET routing using link estimation and swarm intelligence. For the performance evaluation author can take OPNET as an simulation tool. It can be observed that link quality plays a very important role for obtaining better QOS in multipath routing protocols. Routing being nondeterministic polynomial (NP) hard, various meta-heuristic-based routing algorithms have also been proposed in literature using swarm intelligence meta heuristic. Popular meta-heuristic algorithms including genetic algorithm and particle swarm optimization (PSO) have shown to have drawbacks when the solution to be found is multimodal. Simulation results indicate its better performances compared to other methods. Reza Fotohi et. Al.[37]:Here in this paper author Improvement over AODV Routing Protocol by Limiting Visited Hop Count mechanism. For the performance evaluation author can take NS- 2 as an simulation tool.In this paper, an improved AODV routing protocol for mobile ad-hoc networks. The work was accomplished by limited TTL (Time to Live) of RREP packet that the route reply (RREP) packet of AODV is modified to limited TTL information of nodes, and evaluated the four performance measures (i.e. PDR, throughput, good put and jitter with different number of nodes). Then the performance of our work with regular AODV in one scenario with 20 to 80 nodes. After Simulation results author shows that the improved AODV protocol provides better delivery ratio throughput and jitter over the normal AODV routing protocol the proposed technique improve 20% of overall performance. SangeetaKurundkaret. Al.[35]:Here, authors evaluate the Mobile Ad-hoc Network (MANETs) are self-configurtion network of mobile nodes connected by wireless links. Self-configurability and fast deployment feature of the MANET makes it most attractive choice for users. Routing in
  15. 15. For more Https://www.ThesisScientist.com such networks is a key issue which decides network performance. Ad Hoc On-Demand Distance Vector (AODV) one of the widely used reactive routing algorithms. Energy consumption and delay are the main concern for a number of researchers. Some of the battery powered nodes drain out faster than others. Simulation results are observed for wireless network scenarios with variation of node mobility, pause time, network area and packet sent rate. So finally authors conclude that NS-2 simulator is used to compare performances of AODV and I-AODV. Shastri A. et al. [14]: Here authors, reveals the performance analysis of reactive routing protocols AODV, AOMDV and DSR. In their work, authors performed comparison with proactive routing protocol DSDV. In this paper authors used NS-2.34 simulation tool for simulation purpose with taking various parameters such as 200 second simulation time, 1000*1000 m simulation area and 100 bytes packet size, by using performance metrics such as packet delivery ratio, average packet loss ratio and average end to end delay of packets are investigated on the basis of vehicle velocity and vehicle density. According to the authors simulation result, DSDV routing protocol shows the worst packet delivery ratio and AOMDV and AODV have highest average end to end delays. Sun Xi. et al. [4]: Here, authors evaluate the performance of AODV, ADV and DSR routing protocols by taking some performance metrics such as packer drop ratio, throughput. In their work, authors to use an open source simulator tool namely NCTUns-6.0.In this paper, authors using three different mobility patterns for three Indian Metros cities: Kolkata, Chennai and Mumbai. After the simulation result authors conclude that almost same performance of ADV and AODV routing protocol for all different city scenarios, and DSR have less overhead than ADV and AODV so DSR is not suitable for highly dynamic network. Uma mani et al. [8]: Here authors examined the performance of AODV, DSR, and OLSR routing protocol with different nodes density and the number of data traffic sources in order to shows their advantages and limitations in the context of Vehicular Ad hoc Networks. In their work, authors considered two propagation models, the first one is the Two Ray Groungand second one is the adaption model. The first one assumes an unobstructed flat environment and second one takes into account the terrain characteristics and define three terrain categories. For the simulation purpose authors used Territories’ Mobile mobility model and NS-2.23 network
  16. 16. For more Https://www.ThesisScientist.com simulator. After the simulation result authors conclude that AODV routing protocol shows higher end to end values. Vidhale et al. [2]: Here, authors evaluate the MANET routing protocols in VANET environment by using different mobility models available in VanetMobiSim. In their work, authors using different simulation parameters such as number of nodes, packet size, simulation area and performance metrics, average end to end delay, normalized routing load. After the simulation result authors conclude that DSR has better packet delivery fraction (PDF) and lesser routing overload than others. But in the case of end to end delay AOMDV protocol performed better than others. Also it shows that reactive routing protocols performance degrading in space graph model. So finally authors conclude that AOMDV is more appropriate than DSR in VANET. Wang S. et al. [24]: Here, authors proposed a hybrid media access technique for cluster based vehicular networks ,this technique is based on the scheduled based approach such as TDMA for intra cluster based communications and management , and contention based approach for the inter cluster based communications and management. In this scheme authors used a control channel for delivering the safety and non safety application related messages to the nearby clusters. ZuhongFeng et.Al.[33]:Here in this paper author improved routing protocol Ad-AODV Based on AODV. For the performance evaluation author can take NS-2 as an simulation tool. AODV routing protocol only pays attention to the path that is the shortest without taking the energy and load of the nodes. After simulation results, the Ad-AODV routing protocol improves the efficiency of Ad Hoc network, and the packet delivery ratio, lowers the average end-to-end delay and reduces the routing load. The packet delivery ratio of Ad-AODV and AODV in the different residence time of the different number of nodes. The delivery rate of Ad-AODV is an average of 2.4% higher than AODV. In the case of the simulation of forty nodes, the delivery rate of Ad- AODV is an average of 1.5% higher than AODV.
  17. 17. For more Https://www.ThesisScientist.com CHAPTER 3 BACKGROUND 3.1 GENETIC ALGORITHM GA is a search technique that depends on the natural selection and genetics principles and which determines a optimal solution for even a hard issue.  Genetic algorithms are normally a family of computational models which are motivated by the biological evolution. These algorithms encode a powerful solution to a particular problem on a simple chromosome i.e. data structure and use genetic operators to these structures so as to preserve severe information.  Genetic algorithms are usually viewed as a function optimizer.  Genetic algorithms can be used to a broad range of problems.  For solving the issue by genetic algorithm the first step is to generate the chromosomes population (random). Then these chromosomes are estimated in such a manner that the chromosome which shows a better solution for the problem will be provided more opportunities than the poorer solution.  The genetic algorithms are part of the evolutionary algorithms family, which are computational models, motivated in the Nature.
  18. 18. For more Https://www.ThesisScientist.com GAs are more reliable as compared to other most search techniques because they need only information related to the quality of the solution created by every parameter set (objective function values) and not like other optimization techniques which needs derivative information, or worse yet, entire knowledge of the parameters and problem structure[9].There are some difference between GA’s and other optimization/conventional searching algorithms [14] . They are briefly explained as follows 1) GAs work with a coding of the parameter set, not the parameters themselves. Thus GAs can easily manage the discrete or integer variables. 2) GAs search within a points population, not a single point. Thus GAs can offer a globally optimal solution. 3) GAs employ only objective function information, not derivatives or other auxiliary knowledge. Thus GAs can manage the non-continuous, non-smooth and non-differentiable functions which are actually available in a practical optimization issue. 4) GAs employ probabilistic transition rules, not deterministic rules, Although GAs appear to be a good mechanism to solve optimization issue, sometimes the solution achieved from GAs is only a near global optimal solution. 3.2 BASIC FEATURES OF GA GA is a sub division of artificial intelligence.  AI (Artificial intelligence) is a computer science branch by which researchers implement an intelligent computer system that has intelligence same as human being.  GA comes in the category of search algorithms that are based on computer and are random in nature. These algorithms are obtained from the natural theory of “survival of the fittest” being specified by Darwin.  The mechanization of intelligent nature is a pre concern of this branch.  GA is also appropriate for complicated problems.  It generates the best of the best solutions. The aim of GA is to increase the candidate solutions payoff in the population against an objective function from problem domain. The scheme for the GA is to repeatedly use surrogates
  19. 19. For more Https://www.ThesisScientist.com for the mutation and recombination genetic processes on the population of candidate solutions, where the objective function used to a decoded representation of a candidate governs the probabilistic contributions a provided candidate solution can build the subsequent generation of candidate solutions. 3.3 HISTORY OF GENETIC ALGORITHM John Holland is assumed as the father of Genetic Algorithm. He discovered it in the early 1970's.and after that he and his students contribute much to the growth of this field. Holland research was not concentrated on domain and optimization specific practical problem but was on the adaptation concept as viewed in nature [6] and [7]. Other significant contributions were performed by Frantz in 1972 who inquired what were known as Genetic Algorithm for Search and in 1971 Holstein inquired genetic plans for adaptive control and function optimization. Several people involved biologists, are amazed that life at the level of complexity that we realize could have emerged in the relatively short time proposed by the fossil record [20]. Several human inventions were motivated by the natural selection. Genetic algorithm is one of them. The main concept of this is the fittest survival or in other words it is called natural selection. As evidently in nature the individual that has better chances for survival will survive for a larger period of time. This in turn offers a better chance to create offspring with its genetic material. In other words They can say that the fittest candidate will survive and unfit will not. This force of nature is as known natural selection and on this principle GA operates for solving optimization problems. 3.4BASICTERMINOLOGYofGA Before beginning a discussion on Genetic Algorithms, it is essential to be familiar with some basic terminology which will be used throughout this tutorial.  Population − It is a subset of all the possible (encoded) solutions to the given problem. The population for a GA is analogous to the population for human beings except that instead of human beings, we have Candidate Solutions representing human beings.  Chromosomes − A chromosome is one such solution to the given problem.  Gene − A gene is one element position of a chromosome.  Allele − It is the value a gene takes for a particular chromosome.
  20. 20. For more Https://www.ThesisScientist.com  Genotype − Genotype is the population in the computation space. In the computation space, the solutions are represented in a way which can be easily understood and manipulated using a computing system.  Phenotype − Phenotype is the population in the actual real world solution space in which solutions are represented in a way they are represented in real world situations.  Decoding and Encoding − For simple problems, the phenotype and genotype spaces are the same. However, in most of the cases, the phenotype and genotype spaces are different. Decoding is a process of transforming a solution from the genotype to the phenotype space, while encoding is a process of transforming from the phenotype to genotype space. Decoding should be fast as it is carried out repeatedly in a GA during the fitness value . Figure 3.1: represent structure of Gene, Genome, Chromosome  Fitness Function − A fitness function simply defined is a function which takes the solution as input and produces the suitability of the solution as the output. In some cases, the fitness function and the objective function may be the same, while in others it might be different based on the problem. 
  21. 21. For more Https://www.ThesisScientist.com Figure 3.2: structure of Fitness Computation  Genetic Operators − These alter the genetic composition of the offspring. These include crossover, mutation, selection, etc. 3.5 OPERATORS OF GA GA begins with random creation of initial population and then the selection, crossover and mutation operations are conducted until best population is determined. Gas are practical and simple algorithm and easy to be implemented in power system. In other words, considering an initial random population generated and measured, genetic evolution happens by means of three basic genetic operators [22]. 1) Parent selection. 2) Crossover. 3) Mutation. The descriptions of these genetic operators are provided below [23]: 1. Parent Selection/Selection Strategy: The selection of parents to generate successive generations plays a significant role in the GA. This permits the fitter individuals to be chosen more usually to reproduce. There is a no. of selection techniques introduced in the literature [24]. In this technique, n individuals are copied from the population randomly and the best of the n is introduced into population for further genetic processing. This process is repeated until the mating pool is filled.
  22. 22. For more Https://www.ThesisScientist.com TournamentSelection In K-Way tournament selection, It select K individuals from the population at random and select the best out of these to become a parent. The same process is repeated for selecting the next parent. Tournament Selection is also extremely popular in literature as it can even work with negative fitness values. Figure 3.3: Tournament Selection Scheme 2. Crossover: Crossover is a significant operator of the GA. The primary aim of crossover is to reorganize the information of two different individuals and create a new one. It is a structured, yet randomized method of exchanging formation between strings. It encourages the exploration of new fields in search space. Cross swapping operator is used on the chosen individuals. Here, two different cross sites of parent chromosomes are selected randomly. The cross over operation is finished by exchanging the middle substring between strings.
  23. 23. For more Https://www.ThesisScientist.com Figure 3.4: working of Crossover 3. Mutation: Mutation consists of securing the procedure of reproduction and crossover efficiently without much loss of the potentially helpful genetic material. Mutation is by itself a random walk through the string space and offers for occasional interference in the crossover operation by introducing one or more genetic elements during reproduction. This operation assures diversity in the genetic strings over large period of time and prevents stagnation in the emergence of optimal individuals. Bit wise mutation changes 1 to 0 and vice-versa. The above specified operations of selection, crossover and mutation are repeated until the best individual is detected. Figure 3.5: Working of Mutation 3.6 BASIC STRUCTUREofGA The basic structure of a GA is as follows −
  24. 24. For more Https://www.ThesisScientist.com Figure 3.6: Flow Chart of Genetic Algorithm 3.6.1 ALGORITHM A simple genetic algorithm of above discussion is provided as follow: 1. Create a population of binary string randomly 2. Compute the fitness for every string in the population 3. Generate offspring strings through reproduction, crossover and mutation operation. 4. Measure the new strings and compute the fitness for every string (chromosome). 5. If the search objective is fulfilled, or an allowable generation is achieved, return the best chromosome as the solution; else go to step 3. FLOWCHART Figure 3.7 (a) Starting phase of Genetic Algorithm
  25. 25. For more Https://www.ThesisScientist.com Fig 3.7(b): Flowchart of Simple Genetic Algorithm The FF (fitness function) evaluation and genetic evolution take part in an iterative process, which finishes when a maximum no. of generations is arrived, as illustrated in Fig.3.7.
  26. 26. For more Https://www.ThesisScientist.com Figure 3.8 cost estimation in GA
  27. 27. For more Https://www.ThesisScientist.com Figure 3.9 crossover and mutation in GA
  28. 28. For more Https://www.ThesisScientist.com Figure 3.10 Fitness function estimation in GA 3.7 ADVANTAGES OF GENETIC ALGORITHM Genetic algorithms differ from traditional search and optimization methods by some significant points:  Genetic algorithms search parallel from a population of points. Therefore, it has the ability to avoid being trapped in local optimal solution like traditional methods, which search from a single point.  Genetic algorithms use probabilistic selection rules, not deterministic ones.  Genetic algorithms work on the Chromosome, which is encoded version of potential solutions’ parameters, rather the parameters themselves.  Genetic algorithms use fitness score, which is obtained from objective functions, without other derivative or auxiliary information  Genetic algorithms can be employed for a wide variety of optimization problems. They perform very well for large scale optimization problems which may be very difficult or impossible to solve by other traditional methods.
  29. 29. For more Https://www.ThesisScientist.com 3.8 VANET Routing Protocols Routing is a mechanism to establish and to select a specific path in order to send data from source to destination [14, 16]. There are various routing algorithm designed for ad-hoc networks. Classification of various VANET routing protocols can be divided in two broad categories: proactive or Table Driven Routing Protocols (DSDV, OLSR, FSR) and reactive or On-demand routing protocols (AODV, DSR, TORA) that shown in figure 3.11. In the next section describes a detail overview of various reactive routing protocols (AODV, DSR). Figure 3.11 VANET Routing Protocols 3.9 Reactive/On Demand Routing Protocols Reactive routing protocols were designed to reduce the overheads by maintaining information for active routes at each node [8]. This means that each node determined and maintained routes only when it requires sending data to a particular destination. It using two main mechanisms for route establishment: Route discovery and Route maintenance [17, 25]. Route discovery mechanism uses two messages: Route Request (RREQ) and Route Reply (RREP).
  30. 30. For more Https://www.ThesisScientist.com Figure 3.12: Route Request Propagation in Reactive Routing Protocols The basic approach is when a node needs to send a message to a particular destination, it broadcasts the RREQ message in the network that shown in figure 3.12 When RREQ message found a destination node then destination node send a RREP message to source node that shown in figure 3.13. Figure 3.13: Route Reply Propagation in Reactive Routing Protocols Ad hoc On Demand Distance Vector (AODV): Ad hoc On Demand Distance Vector (AODV) is a pure reactive routing protocol which is capable of both unicasting and multicasting. In Ad hoc On Demand Distance Vector (AODV), like all reactive protocols, it works on demand basis when it is required by the nodes within the network [8, 14]. When source node has to send some data to destination node then initially it propagates Route Request (RREQ) message which is forwarded by intermediate nodes until destination is reached. A route reply message is unicasted back to the source node if the receiver is either the node using the requested address, or it has a valid route to the requested address that is shown is figure 3.14.
  31. 31. For more Https://www.ThesisScientist.com (a) (b) Figure 3.14: AODV Route Discovery Process. (a) Propagation of the RREQ. (b) Path of the RREP to the source. Working of Ad Hoc On Demand Distance Vector Routing (AODV): In this type of routing [14, 16] allows the communication between two nodes via intermediated nodes, if those two nodes are not within the range of each other. To establish a route between source to the destination, AODV using route discovery phase, along which Route Request message (RREQ) messages are broadcasted to all its neighbouring nodes. This phase makes sure that these routes do not forms any loops and find only the shortest possible route to the destination node. It also uses destination sequence number for each route entry, which ensures the loop free route, this is the one of the main benefit of AODV routing protocol. For example if two different sources send two different requests to a same destination node, then a requesting node selects the one with greatest sequence number. In the route discovery phase several control messages are defined in AODV that are defined as follows. a) RREQ (Route Request): When any node wants to communicate with other node then it broadcast route request message (RREQ) to its neighbouring nodes [14, 16]. This message is forwarded by all intermediate nodes until destination is reached. The route request messages (RREQ) contains the some information such as RREQ id or broadcast id, source and destination IP address, source and destination sequence number and a counter. b) RREP (Route Reply): When any intermediate nodes received Route Request (RREQ) message then it unicast the route reply message (RREP) to source node either it is valid destination or it has path to destination and reverse path is constructed between source and destination [14, 16]. Each route reply message (RREP) packet consist of some information such as hop count, destination sequence number, source and destination IP address.
  32. 32. For more Https://www.ThesisScientist.com c) RERR (Route Error): Whenever there is any link failure arises in the routing process then route error message (RERR) is used for link failure notifications. The route error message (RERR) consist of some information such as Unreachable Destination node IP Address, Unreachable Destination node Sequence Number. Routing in AODV: There are various mechanisms which are followed in AODV routing approach: a) AODV Route Discovery phase: To establish a route between source node to the destination node, AODV using route discovery phase, along which the Route Request message (RREQ) messages are broadcasted to all its neighbouring nodes [14]. This phase makes sure that these routes do not forms any loops and find only the shortest possible path to the destination node. It also uses destination sequence number for each route entry that ensures the loop free route, this is the one of the main benefit of AODV routing protocol. For example if two different sources sends two different request to a same destination node, then a destination node selects only that node having largest sequence number. In the route discovery phase several control messages are defined in AODV protocol. b) AODV Route Table Management: In AODV, Routing table management is required to avoid those entities of nodes that do not exist or having invalid route from source to destination. The need for routing table management is important to make communication loop free. It consists of following characteristics to maintain the route table for each node. • Destination IP address • Total number of hops to the destination • Destination sequence numbers • Number of active neighbours • Route expiration time c) AODV Route Maintenance: In AODV, when any node in the network detects that a route is not valid anymore for communication it delete all the related entries from the routing table .And it sends the Route reply message (RREP) to all current active neighbouring nodes to inform that the route is not valid anymore for communication purpose. Dynamic Source Routing Protocol (DSR)
  33. 33. For more Https://www.ThesisScientist.com Dynamic Source Routing is a reactive routing protocol that is based on the concept of source routing [8, 16]. Source routing means source has the complete knowledge of entire route to the destination before transmitting data. In DSR each node maintains a route cache where it records all possible learned routes. It using two main mechanisms: Route discovery and Route maintenance. Route Discovery: Whenever a source node wants to send a data packet to destination node in the network, it first looks in its Route Cache to find a valid hop sequence to the destination [1]. Figure 3.15: Route Request Propagation in DSR If such a route exists, the source node attaches to the packet header the complete route to the destination and forwards the packet to the next node. The next node checks the packet header and forwards the packet to the next node. The process terminates when the packet reaches the destination. If the source node cannot find a valid hop sequence to the destination in its Route Cache then it initiates a route discovery process [17]. In route discovery process a route request (RREQ) message is broadcasts to all its neighbouring nodes, adding a unique request ID to each request to prevent
  34. 34. For more Https://www.ThesisScientist.com Figure 3.16: Route Reply Propagation in DSR  Figure 3.15 shows the RREQ message propagation in the network. And figure 3.16 shows the propagation of RREP message that carries the entire hop sequence. a) Route Maintenance: Route Maintenance is done by the propagation of route error message (RERR). Whenever any active node sees or detects the link failure, it propagates the route error message to its upstream neighbours along the reverse path till it reaches the source node. To verify the correct operation of the router links, HELLO messages and acknowledgement messages can be used. 3.10 Classification of the VANET Applications: The applications of Vehicular Ad hoc Networks (VANET) are classified into three major groups: 1)comfort oriented applications 2) convenience-oriented applications and 3)safety oriented applications [11]. Safety oriented related applications look for the increasing security of passengers by exchanging relevant information through vehicle-to-infrastructure and vehicle-to-vehicle. And comfort and convenience applications improve passenger’s comfort and traffic efficiency. 3.10.1 Safety-Oriented Applications: These types of applications help the driver to avoid potential dangers through the exchange of information among vehicles. They are the important applications because they serve to avoid accidents [11]. Figure 3.17: Safety Applications provided by VANET They can take control of the vehicle in case of hazardous conditions, as in the case of the automatic braking and only send warning/emergency messages to drivers. Some safety oriented application shown in Table 3.1[11]. Table 3.1: Examples of Safety-Oriented Applications
  35. 35. For more Https://www.ThesisScientist.com Name Description Intersection violation warning Intersection violation warns drivers when they are going to pass over a traffic red light . On-coming traffic warning It assists the driver during over taking manoeuvres Electronic brake warning It alerts to the driver that a preceding vehicle has performed a emergent braking. Vehicle stability warning It reports drivers that they should activate the vehicle stability control system. Post-crash notification A vehicle involved in an accident sends warning /emergency messages in broadcast to approaching vehicles. Traffic signal violation warning A roadside unit (RSU) sends messages in broadcast to warn drivers of potential violations of traffic signals. Lane change warning It assists drivers to perform a safe lane change 3.10.2 Convenience-Oriented Applications: These types of applications improve the efficiency of the roads and to save drivers time . Various Convenience oriented application shown in Table 3.2[11]. Some examples of Convenience Oriented Applications in VANET as shown in table 3.2. Table 3.2: Examples of Convenience-Oriented Applications Name Description Intersection management Vehicle to vehicle and Vehicle to RSU communications allow a better intersections management Limited access and detour warning A roadside unit (RSU) sends information in broadcast about limited access network areas or detours. Electronic toll collection A vehicle founds unicast communication with a toll gate road side unit( RSU) and pays the toll without stopping vehicle. Parking availability notification A vehicle asks to a roadside unit (RSU) for a list of available parking areas or parking spaces, and the roadside unit (RSU) sends the list to the vehicle. Congested road notification A vehicle in a congested road forwards information to other vehicles.
  36. 36. For more Https://www.ThesisScientist.com Figure 3.18: Convenience Oriented Application Provided by VANET 3.10.3 Commercial-Oriented Applications: These types of applications serve to make the travelling more comfortable for example, by means of the internet connection. Few Commercial oriented application shown in Table 3.3[11]. Table 3.3: Examples of Commercial-Oriented Applications Name Description Remote diagnosis The vehicle driver can start a wireless connection with the dealer to upload the vehicle diagnostics information to identify the possible problems. Media or map download A vehicle can start a wireless connection with the hot-spot network and home network to download multimedia contents and location map. Service announcement Restaurants and other businesses can use a roadside unit(RSU) to send promotional messages to the drivers that are in their communication range.

×