PERFORMANCE REVIEW OF DATA DISSEMINATION PROTOCOLS FOR VEHICULAR ADHOC NETWORK SCENARIO

P.SARAVANAN1 DR.ARUNKUMAR THANGAVELU2

ABSTRACT: Vehicular Ad-Hoc Network (VANET) is the emerging research area which implements Wireless and Mobile Ad-Hoc Networks concepts to promote Intelligent Transportation System. For safety and convenience applications it collects the data like road conditions, Traffic conditions, warning messages, parking information etc., and shares with other vehicle nodes. The challenge of high mobility and frequent disconnections of vehicle nodes leads researchers to focus on data dissemination protocol designs. The best protocol aims to disseminate data about any type of event in the network, in time with limited bandwidth and low latency. In this paper we presented the factors affecting the efficient data dissemination, the comparative analysis of existing data dissemination protocols. I. INTRODUCTION Vehicular Ad hoc NETtworks (VANETs) is the most popular research topic among wireless communication researchers and scientist and have been featured to be useful in providing road safety and also various commercial applications [1], [2]. According to the World Health Organizations Global Status report on road safety, which is the broad assessment of the status of road safety in 178 countries, over 1.2 million people die each year on the worlds roads, and between 20 and 50 million suffer non-fatal injuries. In most regions of the world this epidemic of road traffic injuries is still increasing. 90% of deaths on the worlds roads occur in low and middle-income countries (21.5 and 19.5 per lakh of population, respectively) though they have just 48% of all registered vehicles It also addresses that more people die in road accidents in India than anywhere else in the world. It is said that at least 13 people are injured every hour in India due to road accidents.[3]. Hence research activities have shown keen interest to Intelligent Transport System (ITS) at various levels of areas. The main objective of the VANET is to provide safety and traffic management. Vehicles can notify other vehicles about hazardous road conditions, traffic jamming, or rapid stops. In 1999, the Federal Communication Commission allocated a frequency spectrum for Inter Vehicle Communication (IVC) and Roadside unit-Vehicle Communication (RVC). In 2003, Dedicated Short Range Communications (DSRC) service, which uses the 5.850 to 5.925 GHz bandwidth (75 MHz), was established for Intelligent Transport System [4]. Study in [5] has demonstrated that communications among vehicles can exploit the short-range IEEE 802.11 based radio interface technology. Number of research has been done on VANET communication. The congestion issues for emergency warning [1], Medium access control (MAC) issues [1], [6],[7], slot-reservation MAC protocols [3],[4], transportation safety issues [2], [8], the real-time video streaming between vehicles[11], and data dissemination protocols [9],[10],[34],[35],[36] are the broaden areas on VANET where emerging research challenges are identified.

Figure 1. VANET Communication This paper attempts to compare the performance of existing data dissemination protocols, the factors affecting the performance of data dissemination with their relevant performance metrics to providing real research platform among VANET surfer. The remainder of this paper is organized as follows. Section II describes the applications of VANET. In section III we identified the various factors affecting the performance and the performance metrics of VANET. Sections IV and V review the existing data dissemination protocols. Section VI concludes the paper.

II. VANETs APPLICATIONS

VANET can be used for number of potential applications with highly dissimilar requirements. These applications are classified into three major classes 1. Safety applications. 2. Convenience oriented applications. 3. Commercial oriented applications.

1. Safety applications.
Road situation analysis for driver assistance and safety warning is an interdisciplinary attempt involving many research fields, for instance in computer science, automobile engineering, cognitive science, and psychology. Safety application senses the road and the vehicles always and emergency message like highway/rail collision, forward obstacle detection, left/right turning, road condition etc [12],[13],[14] are informed to driver and RSU for immediate reaction. As per [15] The Vehicular Safety applications are classified as Emergency Electronic Brake Lights (EEBL): Warns of sudden braking of vehicles in the forward path. Forward Collision Warning (FCW): Warns of impending rear-end collision with forward vehicle. Blind Spot Warning (BSW)/Lane Change Warning (LCW): Warns during a lane-change attempt if there is another vehicle moving the same direction in the blind spot. Intersection Movement Assist (IMA): Warns when it is not safe to enter intersection. Do Not Pass Warning (DNP): Warns when oncoming vehicle poses collision threat if a lane change is attempted. Control Loss Warning (CLW): Self-generated warning when vehicle loses control. Other vehicles will be warned depending on the threat.

representative VANET applications and analyze their requirements through use-cases. Automatic toll fee collection: The toll collection [17] is yet another application for vehicle toll collection at the toll booths without stopping the vehicles. Automatic Dialing: An European project, eCall, aims at providing this automatic call service by 2009 using existing cellular infrastructure [18]. E-Access: A number of applications aim to entertain passengers who spend a very long period in transit. FleetNet [19] that provides Internet access, as well as communication between passengers in cars in the same vicinity, allowing them to play games.

III. VANETS PERFORMANCE FACTORS AND PARAMETERS

A.UNIQUE CHARACTERISTICS OF VANET Though VANETs could be treated as a subgroup of Mobile Ad Hoc Networks (MANETs) and a component of ITS systems, it is still necessary to consider VANETs as a distinct research field, especially in the light of security provisioning. The unique characteristics of VANETs include [20] (i). Dynamic topology: The participating nodes in VANET are the vehicles. The speed and the path of these nodes always vary time to time which creates a highly dynamic topology. If we assume two vehicles moving away from each other with a speed of 25 m/sec and transmission range is about 250 m, then the link between these two vehicles will available only 5 seconds and immediately new topology will be created. (ii). Communication Environment: The mobility model highly varies from highways to that of city environment. Highway mobility model is simple and predictable due to one-dimensional model. But for city mobility model, street structure, variable node density, presence of buildings and trees that behave as obstacles to even small distance communication make the model application that very complex and difficult. The node prediction design and routing algorithm also be adapted for these changes. (iii). Mobility Modeling: A mobility model, node position prediction, predefined roadways model and vehicle speed are very important for effective network design. Since VANET has highly dynamic topology the knowledge of its positions and their movements is poor and it is very difficult to predict keeping in view the pattern of movement of each vehicle. (iv). No longer connectivity: Generally, for regular data transmission the nodes needed another link with nearby node to maintain seamless connectivity for longer communication. But in VANET frequent disruption of network connectivity will occur. For the above example the connectivity is only for 5 seconds.

2. Convenience oriented applications.

Driver Assistance : Dramatic change of direction, current locality, and information about potential hazards are some of the drivers assistance applications addressed in [16] which can give more time to react and avoid accidents. The authors in [23] also proved that the proposed Intelligent Driver Assistance System (I-DAS) can address Adaptive Cruise Control, Lane Departure Warning, Parking assistance, Collision Avoidance System, Driver drowsiness detection, Automotive Night vision applications. Weather information: Weather information can be updated / requested by an application via DSRC. Parking Availability Notification (PAN): PAN information helps to find the availability of space in parking lot in a certain geographical area as per the weather conditions. Mapping Service : For the convenience of the vehicle, highway and urban area maps are available which avoid the traffic jam and accident.

3. Commercial oriented applications

They will provide the driver with the entertainment and services as web access, streaming audio and video. Below we identify the most

Such problems can be deal with road-side deployment of relay nodes. (v). Time-sensitive data exchange: Most safety related applications require data packet transmission in a timely manner. Thus, any security schemes cannot harm the network performance of VANETs. (vi). Anonymous addressee: Most applications in VANETs require identification of the vehicles in a certain region, instead of the specific vehicles. This may help protect node privacy in VANETs. (vii).Onboard sensors interaction: This sensors helps in providing node location and their movement nature that are used for effective communication link and routing purposes. B. FACTORS AFFECTING PERFORMANCE Robust message dissemination is one of the challenging tasks which are indispensable for various VANET applications. Here we listed out the Factors affecting the performance of VANET [21] 1. Network size: Network size refers to the number of source destination pairs engaged in data transfer. For example, among 100 nodes, 15 source nodes and 15 destination nodes (i.e. 30 nodes in total) will be engaged in data transfer. However, during this data transfer process, all of the 100 nodes (including the above 30 nodes) will operate in the background for providing necessary support (i.e. routing/forwarding) to the ongoing communication process in the network. 2. Node pause time: Pause time refers to the rest time of the node or the time between changes in direction and/or speed. A node begins by staying in one location for a certain period of time called pause time and once this time expires, the node chooses a random destination. 3. Node speed: Node speed refers to the average speed with which nodes move in the simulation area. 4. Network connectivity: Network connectivity is a critical metric for the planning, design, and evaluation of ad hoc networks. The Percentage network connectivity indicates the probability of finding an source destination path between any two nodes in the network for a given network density and level of node mobility. 5. Average Hop Count: The average hop count is the time averaged hop count of a mobile path for an source destination session, averaged over all the source destination sessions. The minimum hop paths determined under the urban mobility model are relatively more stable (i.e., have a larger route lifetime) compared to the minimum hop paths determined under the other three mobility models. [22]. 6. Routing protocol: A routing protocol plays an important role for the overall performance of mobile adhoc networks. Experimental results in [23] shows that DSR is best suited for small and low mobility

networks. Despite its aggressive behavior towards mobility DSR also performs well in large networks with high node mobility AODV perform better for medium sized networks under high traffic loads. TORA performs better under high traffic loads for medium and large sized networks. C. PERFORMANCE METRICS To study the performance of various data dissemination protocols, we identified various suitable performance metrics. In general, the following metrics are suitable to evaluate the effect of the efficient data dissemination protocols for VANET: 1. Delivery time: defines how soon the message can be delivered to the intended receiver. 2. Packet Delivery Ratio (PDR): Packet delivery ratio is the ratio of the number of packet received by the destination to the number of packet sent by the sender. It may affect by different crucial factor such as packet size, group size, action range and mobility of nodes. The robust message transmission is defined as the 100% packet delivery. Here 100% delivery means receiver receive all the packets send by sender node before time period expires. The time of the packet delivery for various VANET applications is defined in [24]. 3. Bandwidth: In VANET, bandwidth utilization is more as compare to other wireless network due to high mobility in nodes. In [25], author estimated the bandwidth consumption from the interference range of the nodes. The utilization of bandwidth estimation has a tremendous impact on system performance. In both, under-estimated and overestimated systems performance decreases due to inaccurate estimation. 4. Packet overhead: includes both the control and data packet overhead. 5. Data Latency: Data Latency means time duration between issuing a message from sender until it is received by receiver vehicles. An important parameter to be considered in sending and receiving a data packet is transmission time delay, through which the throughput rate can be calculated. In order to calculate transmission time delay, the following steps are utilized. Bit-Rate = Data Size/ Transmission Time Delay Transmission Time Delay=Data Size/Bit-Rate Data size = User Data + Header Authors in [26], stress on finding the routing path that has maximum link reliability and a link delay less than an embarrassed bound. IV. PERFORMANCE REVIEW OF DATA DISSEMINATION PROTOCOLS

Data dissemination is the art of transporting messages

to number of intended recipients based on different situations. Many protocols have been proposed with interesting approaches for data dissemination in VANET. Starting with Flooding, data dissemination process met dramatic development like push-pull technique, carryforward technique, based on swarming[34], cluster based[35], opportunistic [10], Vehicle assisted [36] and so on. We have taken a set of protocols which are most interesting and expected to impact the data dissemination field in great level. A. CONTENT BASED PROTOCOLS: The main objective of this ContentBased dissemination protocol [27] is to design a protocol which should be able to disseminate different types of events (an accident, an emergency braking, an available parking slot, etc.) with minimum bandwidth utilization by limiting the exchange of messages in the inter-vehicle network. It supports different dissemination modes, as follows and maintains a suitable dynamic area. (i) An accident has to be diffused only to the vehicles driving in its direction. (ii) An emergency braking, like the accident, has to be diffused to the vehicles driving in a certain direction. (iii) An available parking slot should be transmitted to all close vehicles, whatever their direction, as it may interest them. The approach was with Encounter Probability (EP), which represents the probability that a vehicle meets a certain event. It is calculated as EP =1 / (*d + *t + *g + *c + 1) Where , , , and are penalty coefficients with values 0. They are used to balance the relative importance of the d, t, g, and c values. In practical cases, it holds that + + + > 0; otherwise, the EP would always be 1. If the EP of an event for a certain vehicle is high, then the event could be considered particularly relevant for the vehicle because it is likely that the vehicle will encounter that event. Based on this idea, each vehicle could decide dynamically if it should rediffuse the information about an event received or not. This also guarantees that the information about an event is maintained close enough to be relevant during the dissemination phase. Implementation has been done using Vehicular Event Sharing with a mobile Peer-to-peer Architecture (VESPA) system and values are extracted using OPNET[28] network simulator. Experiments are repeated for 10 times average values are taken into account. The result shows this approach strongly limits the number of messages exchanged, providing better results than traditional flooding and periodic flooding. It is also able to keep in the network the information about an event until the event becomes irrelevant. It is generic, not only applicable to a

specific vehicular application, and could be deployed into any vehicular network as long as a few attributes. B. BUFFER BASED ALGORITHMS: In Bloom Filter based Buffering Data Dissemination (BFBD) algorithm [29], the authors proposes BFBD with Mobility Induced Redundant Transmission (MIRT) by using decayed bloom filter as the structure to record the data dissemination history and handles the intermittent connectivity designed buffering mechanism. Bloom Filter [30] is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. It composes of two parts: (i) A bit array with bits (ii) K hash functions: h1(m), h2(m) hK(m), each hash function maps an element to an index value within the range [1, ] The basic concept of BFBD Algorithm is (i) A decayed bloom filter is used to record the history of data dissemination. (ii) Local buffering of packets is adopted to cope with intermittent connectivity. (iii) Local buffering of bloom filter is used to avoid MIRT. The algorithm uses local buffer whose element is a 4tuple <dd_src, dd_seq, packet, bloom_filter>. When a node n receives a packet p it first checks whether there are neighbors within the destination region. If none of its neighbors are within the destination region, the node simply drops the received packet. Otherwise, it checks whether all its neighbors are contained by the merged bloom filter, which represents the dissemination history. If all its neighbors have been covered by the dissemination history, it buffers the packet and does not forward for this time. As long as there are non-covered neighbors, the packet is forwarded immediately. The simulation environment is NS2 and VanetMobiSim is used mobility trace analysis. In terms of reliability, dissemination efficiency and delay it has been proved that the performance of BFBD is superior over contrastive algorithms. C. AGENT BASED PROTOCOLS: The authors of [31] proposed a model by using cognitive agent concept for realizing intelligent information dissemination. They showed that using software agents including static cognitive and mobile agents, vehicles autonomously collect, classify and disseminate critical information. The proposed agent framework for critical information gathering and dissemination is based on push-pull concept. For critical events, proposed scheme takes appropriate decisions as and when required. Using push approach, the critical events (accidents, heavy rain, fog etc.) are detected and using pull approach, the non-critical applications (like road conditions, vehicle

speed, etc.) can be detected. This logic proves that efficient bandwidth utilization is achieved. The cognitive agent model uses the following procedural steps: (i) Generate VANET in given road length by placing vehicles uniformly. (ii) Maintain a data structure at each vehicle to store information as specified by scheme. (iii) Apply mobility to nodes. (iv) Generate cognitive agency. (v) Compute performance of system. The simulation environment is NS2 and the performance metrics evaluated are Bandwidth utilized, Packet delivery ratio, Push latency, Push/Pull decision latency. The result shows that as the number of vehicles increase, the bandwidth utilization increases linearly and it remains constant if VANET has constant number of vehicles on the road. Also it shows as the number of sensors increase, Push/Pull decision latency increases linearly and remains constant for large number of sensors. D. CODING BASED ALGORITHMS In DDRC [32] the authors presented a novel scheme based on rateless codes for collaborative content distribution from road side units to vehicular networks. Here the vehicles on the road can be divided into two groups (i) Collectors: These are the vehicles that are approaching toward a specific RSU. (ii) Carriers: These are the vehicles that have been successful in decoding a specific RSUs message. When a message arrives at an RSU, the RSU packetizes the message into smaller data packets. These packets are then encoded into a set of slightly bigger size using the described rateless encoding scheme. Then the RSU broadcasts the set of encoded packets. The collector collects the encoded packets and carries the packet towards the next RSU. Collector vehicles switch to become carrier after they pass an RSU.

The presented models capture the effect of various parameters in the network and provide guidelines on choosing the parameters to maximize the performance metrics. This approach guarantees robustness at the infrastructure level and addresses some of the observed issues such as link instability and packet losses The proposed scheme can seamlessly handle both sparse and dense scenarios. E. PRIORITY BASED PROTOCOLS In [33] the authors proposed Priority based InterVehicle communication in VANET using IEEE 802.11e standard to provide differential service to different priority safety messages in a VANET with the following characteristics: (i) All vehicles move fast, thus, it can cause high bit error rates. (ii) All vehicles move in the same direction, following the road topology. (iii) The safety messages to be communicated have a few hundred bytes and have different priorities They attempted transmission of messages repetitively which is based on the priority of a message. To increase the probability of a successful transmission for high priority messages, a high priority message is transmitted more times than a lower priority one. Each priority level of safety messages is mapped to a different traffic class. IEEE 802.11e in VANETs with different message priorities is adapted. Priority Pri(1) Pri(2) Pri(3) Pri(4) Examples Air bag sensor Vehicle body sensor Possibility of Thermal sensor accident Hard break Warning Surface condition Blind crossing Road work General Traffic report Weather condition Parking area Table 1: Priority based messages. Type of Message Accident

Figure.2 DDRC Model This paper introduced Decoding Distance and Deployment Capacity for performance evaluation and provided analytical models to explore them. The performances of the systems are simulated with NS-2 network simulator.

This supported MAC protocol, fully compatible with both IEEE 802.11 and IEEE 802.11e standards. Simulation study have been done using OPNET modeler [28] and the performance was investigated as functions of number of repetitions, number of vehicles, percentage of priority-1 vehicles and packet size. The result shows that the proposed approach leads to high normalized throughput and low transmission delay even when the number of vehicles is high and the traffic load is heavy. V.COMPARATIVE ANALYSIS The following table summarizes the features of various data dissemination protocols. It shows the

approach for dissemination, the performance metrics used evaluation, the simulation platform used for evaluation. Table:2 Comparative analysis of dissemination protocols for VANET scenario

Protocol
ContentBased dissemination protocol [27] Bloom Filter based Buffering Data Dissemination (BFBD) algorithm [29], Agent based Intelligent information dissemination [31]

Approach
Encounter Probability Mobility Induced Redundant Transmission (MIRT) with Bloom Filter Software agents with Push/pull approach

Performance Metrics used

Bandwidth

Simulation
VESPA & OPNET NS2 and VanetMobiSim

Results
Limits the bandwidth utilization The performance of BFBD is superior over contrastive algorithms.

Suitable for
Any type VANET application Reliability sensitive data dissemination

Reliability, Efficiency & Delay.

Bandwidth, & latency

NS2

Best bandwidth utilization & latency based on number of vehicles & sensors respectively Minimize the packet losses and maximize the performance metrics High normalized throughput and low transmission delay

Using Rateless Codes-DDRC [32]

Collector/Carrier with rateless code Safety messages with different priorities and Repetition

Data delivery Ratio

NS2

Vanet to autonomously collect, classify and disseminate critical information. Both sparse and dense scenarios.

Priority based [33]

Throughput & Delay

OPNET

Any type VANET application

VI. CONCLUSION As per the analysis, most of the protocols concentrate to increase bandwidth utilization and data delivery ratio. NS2 network simulator is the best simulation environment along with some tracing tools. The selection of data dissemination techniques depends on the type of application, Road environment, Vehicle condition and type of data to be disseminated. In Future, we planned to design a best data dissemination protocol to improve quality of service parameters in tremendous way. [1] X. Yang, J. Liu, F. Zhao, and N. Vaidya, A vehicle-to-vehicle communication protocol for cooperative collision warning, Proc. Int. Conf. MobiQuitous, Aug. 2004, pp. 114123. J. Yin, T. Eibatt, G. Yeung, B. Ryu, S. Habermas, H. Krishnan, and T. Talty, Performance evaluation of safety applications over DSRC vehicular ad hoc networks, in Proc. VANET, Oct. 2004, pp. 19. World Health Organization, Department of Violence & Injury Prevention & Disability (VIP), Global status report on road safety-Time for action, 2009, ISBN 978 92 4 156384 0.

[4]

Spring, (2007) Status of Project IEEE 802.11p, Http://grouper.ieee.org/groups/802/11/Reports /tg p_update.htm [Cited on: Sept. 2007], (2007). K. D. Wong, K. Tepe, W. Chen, M.Gerla, Inter vehicular communication, IEEE Wireless Communications, vol. 13, issue no. 5, October 2006. R. Verdone, Multi-hop R-Aloha for inter-vehicle communication at millimeter waves, IEEE Trans. Veh. Technol., vol. 46, no. 4, pp. 9921005, Nov. 1997. M. Lott, R. Halmann, E. Schulz, andM. Radimirsch, Medium access and radio resource management for ad hoc networks based on UTRA TDD, in Proc. ACM MobihocPoster, 2001, pp. 7686.

1[5]
[6]

[7]

[2]

[8] Q. Xu, T. Mark, J. Ko, and R. Sengupta, Vehicleto-vehicle safety messaging in DSRC, in Proc. VANET, Oct. 2004, pp. 1928. [9] G. Korkmaz, E. Ekici, F. Ozguner, and U. Ozguner, Urban multi-hop broadcast protocol for intervehicle communication systems, in Proc. VANET, Oct. 2004, pp. 7685.

[3]

[10] B. Xu, A. Ouksel, and O. Woflson, Opportunistic resource exchange in inter-vehicle ad hoc networks, in Proc. IEEE Int. Conf. MDM, 2004, pp. 412. [11] S. Ghandeharizadeh, S. Kapadia, and B. Krishnamachari, PAVAN: A policy framework for content availability in vehicular ad-hoc networks, in Proc. VANET, Oct. 2004, pp. 5765. application-oriented VANET, National Institute of Standards and Technology. Apr 2009: http://w3.antd.nist.gov/pubs/Yi-Paper7.pdf.

[22] Natarajan Meghanathan, A Simulation Study on the Impact of Mobility Models on the Network Connectivity, Hop Count and Lifetime of Routes for Ad hoc Networks. Informatica (Slovenia), 2010: 207~221 [23] Lol, Wilford Gibson, An investigation of the impact of routing protocols on MANETs using simulation modeling, 2008, http://aut.researchgateway.ac.nz /handle / 10292/718 [24] H. Dajing, J. Shengming and R. Jianqiang, A Link Availability Prediction Model for Wireless Ad Hoc Networks, International Workshop on Wireless Networks and Mobile Computing, Taipei, Taiwan, April 2000, pp 7-11. [25] Chenn-Jung Huang, Yi-Ta Chuang, You-Jia Chen, Dian-Xiu Yang, I-Fan Chen, QoS-aware roadside base station assisted routing in vehicular networks, The Engineering Applications of Artificial Intelligence, NY, USA, Dec. 2009, pp. 1292-1301. [26] Antonios Skordylis, Niki Trogoni Delay-bounded routing in vehicular ad-hoc networks, in the 9th ACM international symposium on Mobile ad hoc networking and computing, ACM, New York, USA 2006, pp: 108 - 119. [27] N. Cenerario, T. Delot and S. Ilarri, "A ContentBased Dissemination Protocol for VANETs: Exploiting the Encounter Probability", IEEE Transactions on Intelligent Transportation Systems, ISSN 1524-9050, 12(3): 771--782, IEEE Computer Society, September 2011. [28] OPNET Technologies, Inc., OPNET Modeler v11.5, http://www.opnet.com. [29] Tong Zhao, Zhongyi Liu, Wei Yan and Xiaoming Li, BFBD, A Bloom Filter based Buffering Data Dissemination Algorithm for Vehicular Ad hoc Networks, The 8th Annual IEEE Consumer Communications and Networking Conference Special Session Information Dissemination in Vehicular Networks, 2011, DOI: 978-1-4244-87905/11, pp 477-481. [30] B.H. Bloom. Space/Time Tradeoffs in Hash Coding with Allowable Errors, in Communications of the ACM, Vol.13, No.7, p422, 1970. [31] M. S. Kakkasageri1 and S. S. Manvi, Intelligent information dissemination in vehicular ad hoc networks, International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.2, No.1, March 2011, pp 112-123. [32] M. Sardari, F. Hendessi, and F. Fekri, "DDRC: Data Dissemination in Vehicular Networks Using Rateless Codes", presented at J. Inf. Sci. Eng., 2010, pp.867-881.

1[12] Qian, Yi, Nader Moayeri. Design secure and

2[13] H. Wu, R. Fujimoto, R. Guensler, M. Hunter,

"MDDV: A Mobility-Centric Data Dissemination Algorithm for Vehicular Networks," in 1st ACM workshop on vehicular ad hoc networks, Oct. 2004, pp. 47 56.

3[14]

Saravanan Kannan, Arunkumar Thangavelu, RameshBabu Kalivaradhan, An Intelligent Driver Assistance System (I-DAS) for Vehicle Safety Modelling using ontology Approach International Journal Of UbiComp (IJU), Vol.1, No.3, July 2010 pp 15-29

[15] Hannes Hartenstein, Kenneth P Laberteaux VANET: Vehicular Applications and InterNetworking Technologies A John Wiley and Sons, Ltd, Publication, 2010, ISBN 9780470740569 (H/B) pp 9-14

4[16]

F. Dtzer, F. Kohlmayer, T. Kosch, M. Strassberger Secure Communication for Intersection Assistance, in Proc of the 2nd International Workshop on Intelligent Transportation, Hamburg, Germany, March 15-16, 2005. Parikh, Cooperative Collision Warning Using Dedicated Short Range Wireless Communications, 3rd ACM International Workshop on VANETs, Los Angeles, California, USA, 2006.

5[17] T. ElBatt, S. Goel, G. Holland, H. Krishnan, J.

[18] eSafety Forum," http://www.escope.info/. [19] W. Franz, H. Hartenstein, and M. Mauve, Eds., Inter-Vehicle-Communications Based on Ad Hoc Networking Principles-The Fleet Net Project. Karlshue, Germany: Universitatverlag Karlsuhe,November 2005. [20] Z. Li, Z. Wang, and C. Chigan, Security of Vehicular Ad Hoc Networks in Intelligent Transportation Systems, in Wireless Technologies for Intelligent Transportation Systems, Nova Science Publishers, 2009 [21] Dmitri D perkins, Herman D Hughes and Charles B Owen Factors affecting the performance of the adhoc networks 0-7803-7400-2/02, 2002 IEEE

[33] C. Suthaputchakun and A. Ganz, "Priority Based Inter-Vehicle Communication in Vehicular Ad-Hoc Networks using IEEE 802.11e", in Proc. VTC Spring, 2007, pp.2595-2599. [34] A. Nandan, S. Das, G. Pau, M.Y. Sanadidi, M. Gerla, "CarTorrent: A Swarming Protocol for Vehicular networks", IEEE INFOCOM, Miami, Florida, March 2005 [35] J. Nzouonta, C. Borcea, "STEID: A Protocol for Emergency Information Dissemination in Vehicular Networks", Report, Department of Computer Science, New Jersey Institute of Technology, 2006 [36] J. Zhao and G. Cao, VADD: Vehicle-assisted data delivery in vehicular ad hoc networks, IEEE Transaction Vehicular Technology, Vol. 57, No. 3, pp. 19101922, May 2008.