This document summarizes and compares several existing broadcasting protocols for vehicular ad hoc networks (VANETs). It discusses the need for reliable broadcasting in VANETs to support safety applications. Simple flooding is not effective due to collisions in dense areas. The document reviews probabilistic, counter-based, distance-based, and location-based broadcasting schemes. It also discusses neighbor knowledge methods. None of the existing schemes are optimal for all situations. The document aims to propose a new intelligent broadcasting technique for emergency messages in VANETs to improve message reception reliability and availability.
GLOBAL FRONTRUNNER ROUTING ALGORITHM (GFRA) FOR V2V COMMUNICATION IN VANETS cscpconf
VANET (Vehicular Ad hoc NETwork) is the emerging research area that making the phrase
“Network on Wheel” true. In this new age network the basic WLAN (IEEE 802.11) standard is
used. As the necessity of such network increases the implementation challenges are being taken
into account. They are broadcasting, routing, priority scheduling and security and privacy. In
this paper the routing is considered as the research factor. A proposal for routing with
frequently changing topology to avoid disconnection of network on road and for the routing
among overlapping networks in flyovers with multiple ramps and stack to avoid wrong
messaging is given.
EFFICIENT BROADCASTING MECHANISMS FOR DATA DISSEMINATION IN VEHICULAR AD HOC ...ijmnct
Broadcasting is the process of sending a message from one node to all other nodes in an ad hoc network. It
is a fundamental operation for communication in ad hoc networks as it allows for the update of network
information, route discovery and other operations as well. In this paper, we review the pros and cons of
different broadcasting methods in VANET. Also, the broadcast storm problem and broadcast suppression
techniques for broadcasting in Vehicular Ad hoc Networks (VANET) are discussed, because blindly
broadcasting the packets cause several problems that affect the quality of service in VANET. In order to
avoid broadcast storm problem this paper provides a survey of some of the existing broadcast suppression
techniques in vehicular environment
Design Approach for Vehicle To Vehicle (V2V) Dissemination of Messages in Veh...IJERA Editor
Designing a protocol structure which contains the control system, VANET device and the type of communication message structures which will implement the message packets for v2v or v2I infrastructure . The different message packets contain the information required to transfer from one node to another in vehicular network for communication. Design various algorithm required for Control, Alert and Infotainment messages. Time stamping lowering data rate efficient packet delivery and proper communication of required messages. Implementation of proposed algorithms and comparison of them with existing algorithms and study of different factors affecting the working of theses algorithms. Analysis of proposed design approach and improvements in results if required.
ISSUES AND CHALLENGES IN BROADCAST STORM SUPPRESSION ALGORITHMS OF VEHICULAR ...ieijjournal
Vehicular Ad-Hoc Networks (VANETs) are the networks of vehicles which are characterized with high mobility and dynamic changing topology. Most of the communication interchanges in VANETs take place in broadcasting mode, which is supposed to be the simplest way to disseminate (spread) emergency
messages all over the vehicular network. This broadcasting technique assures the optimal delivery of emergency messages all over the VANET. However, it also results in unwanted flooding of messages which causes severe contention and collisions in VANETs leading to Broadcast Storm Problem (BSP) and in turn affects the overall performance of VANETs. A Multitude of research work have proposed Broadcast Storm
Suppression Algorithms (BSSA) to control this Broadcast Storm. These mechanisms tried to control BSP by either reducing the number of rebroadcasting/ relaying nodes or by identifying the best relay node. The suppression mechanisms help to overcome BSP to certain extent, still there is need to still reduce the number of rebroadcasting nodes in existing mechanisms and also to identify the best possible rebroadcasting node.
V2V communication systems communicates with the approaching vehicle and avoids the accident by alerting the driver and often it drives away the vehicle if the driver fails to stop it. V2I communication system communicates with the server in the road and reduces the traffic taking place in the road.
A Broadcasting Scheme for Message Dissemination in VANETIJERA Editor
Vehicular Ad hoc Networks [VANET] is one of the fastest emerging technologies for research as there are many issues and challenges to be addressed by the researchers before the technology becomes commercialized. Vehicular communication systems developed largely by the growing interest in intelligent transportation systems [ITS]. Cooperative driving can improve safety and efficiency by enabling vehicles to exchange emergency messages to each other in the neighborhood and to assist driver in making proper decision to avoid vehicle collisions and congestion. Broadcast transmission is usually used for disseminating safety related information among vehicles. Message Broadcast over wireless networks poses many challenges due to link unreliability, hidden terminal, message redundancy, and broadcast storm, etc., which greatly degrade the network performance. In most of the emergency situations, there is less time to make a handshake with other nodes in the networks, as the emergency message is to be delivered fast and efficient. Broadcasting information is usually very costly and without limiting techniques this will result in serious data redundancy, contention and collisions. This work focuses on Broadcasting Scheme for Message Dissemination.
GLOBAL FRONTRUNNER ROUTING ALGORITHM (GFRA) FOR V2V COMMUNICATION IN VANETS cscpconf
VANET (Vehicular Ad hoc NETwork) is the emerging research area that making the phrase
“Network on Wheel” true. In this new age network the basic WLAN (IEEE 802.11) standard is
used. As the necessity of such network increases the implementation challenges are being taken
into account. They are broadcasting, routing, priority scheduling and security and privacy. In
this paper the routing is considered as the research factor. A proposal for routing with
frequently changing topology to avoid disconnection of network on road and for the routing
among overlapping networks in flyovers with multiple ramps and stack to avoid wrong
messaging is given.
EFFICIENT BROADCASTING MECHANISMS FOR DATA DISSEMINATION IN VEHICULAR AD HOC ...ijmnct
Broadcasting is the process of sending a message from one node to all other nodes in an ad hoc network. It
is a fundamental operation for communication in ad hoc networks as it allows for the update of network
information, route discovery and other operations as well. In this paper, we review the pros and cons of
different broadcasting methods in VANET. Also, the broadcast storm problem and broadcast suppression
techniques for broadcasting in Vehicular Ad hoc Networks (VANET) are discussed, because blindly
broadcasting the packets cause several problems that affect the quality of service in VANET. In order to
avoid broadcast storm problem this paper provides a survey of some of the existing broadcast suppression
techniques in vehicular environment
Design Approach for Vehicle To Vehicle (V2V) Dissemination of Messages in Veh...IJERA Editor
Designing a protocol structure which contains the control system, VANET device and the type of communication message structures which will implement the message packets for v2v or v2I infrastructure . The different message packets contain the information required to transfer from one node to another in vehicular network for communication. Design various algorithm required for Control, Alert and Infotainment messages. Time stamping lowering data rate efficient packet delivery and proper communication of required messages. Implementation of proposed algorithms and comparison of them with existing algorithms and study of different factors affecting the working of theses algorithms. Analysis of proposed design approach and improvements in results if required.
ISSUES AND CHALLENGES IN BROADCAST STORM SUPPRESSION ALGORITHMS OF VEHICULAR ...ieijjournal
Vehicular Ad-Hoc Networks (VANETs) are the networks of vehicles which are characterized with high mobility and dynamic changing topology. Most of the communication interchanges in VANETs take place in broadcasting mode, which is supposed to be the simplest way to disseminate (spread) emergency
messages all over the vehicular network. This broadcasting technique assures the optimal delivery of emergency messages all over the VANET. However, it also results in unwanted flooding of messages which causes severe contention and collisions in VANETs leading to Broadcast Storm Problem (BSP) and in turn affects the overall performance of VANETs. A Multitude of research work have proposed Broadcast Storm
Suppression Algorithms (BSSA) to control this Broadcast Storm. These mechanisms tried to control BSP by either reducing the number of rebroadcasting/ relaying nodes or by identifying the best relay node. The suppression mechanisms help to overcome BSP to certain extent, still there is need to still reduce the number of rebroadcasting nodes in existing mechanisms and also to identify the best possible rebroadcasting node.
V2V communication systems communicates with the approaching vehicle and avoids the accident by alerting the driver and often it drives away the vehicle if the driver fails to stop it. V2I communication system communicates with the server in the road and reduces the traffic taking place in the road.
A Broadcasting Scheme for Message Dissemination in VANETIJERA Editor
Vehicular Ad hoc Networks [VANET] is one of the fastest emerging technologies for research as there are many issues and challenges to be addressed by the researchers before the technology becomes commercialized. Vehicular communication systems developed largely by the growing interest in intelligent transportation systems [ITS]. Cooperative driving can improve safety and efficiency by enabling vehicles to exchange emergency messages to each other in the neighborhood and to assist driver in making proper decision to avoid vehicle collisions and congestion. Broadcast transmission is usually used for disseminating safety related information among vehicles. Message Broadcast over wireless networks poses many challenges due to link unreliability, hidden terminal, message redundancy, and broadcast storm, etc., which greatly degrade the network performance. In most of the emergency situations, there is less time to make a handshake with other nodes in the networks, as the emergency message is to be delivered fast and efficient. Broadcasting information is usually very costly and without limiting techniques this will result in serious data redundancy, contention and collisions. This work focuses on Broadcasting Scheme for Message Dissemination.
A CELLULAR BONDING AND ADAPTIVE LOAD BALANCING BASED MULTI-SIM GATEWAY FOR MO...pijans
As it is well known, the QoS(quality of service) provided by mobile Internet access point devices is far from
the QoS level offered by the common ADSL modem-router due to several reasons: in fact, mobile Internet
access networks are not designed to support real-time data traffic because of several drawbacks
concerning the wireless medium such as resource sharing, traffic congestion, radio link coverage etc.,
which impact directly such parameters as delay, jitter, and packet loss rate that are strictly connected to
the quality of user experience. The main scope of the present paper is to introduce a dual USIM HSPA
gateway for ad hoc and sensors networks thanks to which it will be possible to guarantee a QoS suitable
for a series of network-centric application such as real-time communications and monitoring, video
surveillance, real-time sensor networks, telemedicine, vehicular and mobile sensor networks and so on. The
main idea is to exploit multiple radio access networks in order to enhance the available end-to-end
bandwidth and the perceived quality of experience. The scope has been reached by combining multiple
radio access with dynamic load balancing and the VPN (virtual private network) bond technique.
Abstract: VANET (vehicular ad-hoc network) is a classification of MANET in which vehicles act as mobile node and provides a different approach to Intelligent transport System (ITS). VANET is an emerging area for Intelligent Transportation System (ITS) which can result in increased traffic safety, collision warning through exchange of messages through wireless media. Efficient routing protocols are required for efficient communication among vehicles. In the given paper, we surveyed various VANETs protocols like GPRS, GPRS-MV & GPSR. We compare our proposed protocols via NS-2 based simulations and show the performance of different protocols.
Reduce Handover Delay Using the HSBCC Based Buffer Over Flow In Wimax Networkinventionjournals
In wireless networks to improve the competence for event account. Due to the in complete transmission size of nodes, a single path often cannot meet the condition of data transmission. Consequently, multipath show is needed. However, not every path originate by multipath routing algorithms maybe appropriate for conveying image, because a extended routing pathway with a long end to end show delay may not satisfied the time constraint. Furthermore, each data stream includes two kinds of material data handover. We have coming a novel explicit rate-based congestion control method, for supportive requests hand over process. Handover Streaming based Congestion Control (HSBCC), a new adaptive media handover streaming congestion organization in which the assembly packet broadcast rate is adjusted rendering to the active bandwidth share of the connection. They prepare not maintain or continually inform their route tables with the newest route in network. If a node requirements to send a pack to another node then this protocol explorations for the route in an on-demand method and begins the joining in order to communicate and receive the packet. The route detection usually happens by flooding the route application packets throughout the network. It makes sense to simply disregard a packet loss due to random frequency errors than to multiplicatively reduction the current transport rate and it is more suitable to periodically investigation the network during interruption period for a prompt retrieval than to slow down and exponentially increase the retransmission timer.
Understanding Vehicular Ad-hoc Networks and Use of Greedy Routing Protocolijsrd.com
Vehicular Ad Hoc Networks (VANET) belong to a subclass of Mobile ad hoc networks . VANET provides a distinguished approach for Intelligent Transport System (ITS). VANET has become an active area of research and development since it has tremendous potential to improve vehicle and road safety, traffic efficiency, and convenience as well as comfort to both drivers and passengers. In this paper we discuss the characteristics and architecture of VANET. Further we provide an overview of Greedy Perimeter Stateless Routing Protocol. Efficient routing protocols are essential for smart ITS.
A QoS Based MAC Protocol For Wireless Ad-hoc NetworkIJNSA Journal
Multimedia communication over wireless Ad-hoc networks has become the driving technology for many of the important applications, experiencing dramatic market growth and promising revolutionary experiences in personal communication, gaming, entertainment, military, security, environment monitoring, and more. The advances in wireless communications and growth of real-time applications have necessitated the development of wireless networks that can support high Quality of Service (QoS) and power control. A node in an ad hoc network is normally battery operated which poses a huge constraint on the power consumption of such a node. Hence, designing a power efficient MAC protocol for ad hoc wireless networks is a major challenge. In this paper, we propose a CDMA based power controlled medium access protocol for mobile and ad hoc network (MNA). The protocol conserves power and provides QoS guarantees for multimedia traffics. In that network one of the fundamental challenger in MANETs is how to increase the overall network throughputs well as reading the delay while maintaining how energy consumption for packet processing in communication. simulation results shows that the performance of the protocol with increase in traffic while QoS is better in terms of Energy consumption, throughput, & communication delay than existing protocol.
Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Networkpaperpublications3
Abstract: Vehicular ad hoc networks (VANETs) can provide scalable and cost-effective solutions for applications such as traffic safety, dynamic route planning, and context-aware advertisement using short-range wireless communication. To function properly, these applications require efficient routing protocols. However, existing mobile ad hoc network routing and forwarding approaches have limited performance in VANETs. This dissertation shows that routing protocols which account for VANET-specific characteristics in their designs, such as position and mobility of Vehicle, can provide good performance for a large spectrum of applications.
Increased vehicular traffic demands smart vehicles which can interact with each other and roadside infrastructure to prevent accidents. Vehicular Ad-hoc Network (VANET) provides this flexibility to the vehicles. In this desertion we initially analyze the performance of AODV and OLSR, and further we improve the performance of AODV by selecting the node on the basis of trust value of the successive nodes, we also reduce the neighbor hood expiry time and correspondingly update the route table of AODV, with this purposed approach we would be able to reduce the end-to-end delay of AODV sufficiently also the performance of AODV increase in terms of Throughput and packet delivery ratio.Keywords: VANET, AODV, ROUTING, ROUT TABLE.
Title: Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Network
Author: Dalbir Singh, Amit Jain (Asst. Prof.)
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
A Secure Payment Scheme with Low Communication and Processing Overhead for Mu...Editor IJMTER
In this proposed work a trust-based routing protocol is developed to route messages through the
highly trusted nodes to minimize the probability of dropping the messages. Thus improve the network
performance in terms of throughput and packet delivery ratio. The proposed design contains a novel secure
reactive routing protocol for Mobile ad hoc networks (MANETs), called TRIUMF (Trust-Based Routing
Protocol with controlled degree of Selfishness for Securing MANET against Packet Dropping Attack). In the
proposed protocol trust among nodes is represented by trust value, which consists of cooperation score, direct
trust and indirect trust. The proposed trust routing allows controlled degree of selfishness to give an incentive to
the selfish nodes to declare its selfishness behavior to its neighbor nodes, which reduce the searching time of
misbehaving nodes to search for the malicious nodes only. In the proposed routing protocol two node-disjoint
routes between the source and destination nodes are selected based on their path trust values, one marked as
primary and the other as secondary. In this work both DLL-ACK and end- to-end TCP-ACK as monitoring
tools to monitor the behavior of routing path nodes: if the data packet successfully transmitted, then the path
nodes trust value are updated positively; otherwise, if a malicious behavior is detected then the path searching
tool starts to identify the malicious nodes and isolate them from the routing path and the network. Finally this
scheme reduces the searching time of malicious nodes, and the routing protocol avoids the isolated misbehaving
node from sharing in all future routes, which improves the overall network throughput.
Secure Multicast Communication using Behavioural Measurement Technique in MANET Editor Jacotech
In MANET communication between two mobile nodes are carried out by routing protocol. In MANET each mobile node can directly communicate with other mobile node if both mobile nodes are within transmission range. Otherwise the nodes present in between have to forward the packets for them on network. dynamic and cooperative nature of ad hoc networks presents substantial challenges in securing and detecting attacks in these networks. In this paper we proposed a novel Intrusion Detection and Prevention Scheme (IDPS) for protecting network against Blackhole attack. During the attack, a malicious node captures the data after the positive reply of route existence. Routing in Ad hoc networks has been a challenging task ever since the wireless networks came into existence. In multicasting the sender and communicated with multiple receivers. The routing misbehavior in multicast ODMRP is secured by proposed scheme. The proposed IDPS scheme first to detect the malicious nodes and after that block the activities of malicious nodes. The performance of proposed scheme is evaluated through performance metrics that shows the attacker routing misbehavior and proposed security scheme is provides secure and
vigorous performance in presence blackhole attacker.
Effective Road Model for Congestion Control in VANETSijwmn
Congestion on the roads is a key problem to deal with, which wastes valuable time.. Due to high mobility
rate and relative speed link failure occur very often. VANET is used to tackle the problem of congestion,
and make decisions well in advance to avoid traffic congestion. In this paper we proposed a solution to
detect and control the traffic congestion by using of both (V2V) and (V2I), as a result the drivers become
aware of the location of congestion as well as way to avoid getting stuck in congestion. The congestion is
detected by analyzing the data obtained by vehicular communication and road side units to avoid the
traffic. Our proposition system is competent of detecting and controlling traffic congestion in real-time.
V2V and V2I communication network is used to receive and send the messages. We simulate the result by
using Congestion Detection and Control Algorithm (CDCA), and show that this is one effective way to
control congestion. The Proposed methodology ensures reliable and timely delivery of messages to know
about congestion and avoid it.
Network parameters impact on dynamic transmission power control in vehicular ...ijngnjournal
the throughput of the wireless vehicular network and decrease the delay of the message communication
between vehicular nodes on the highway. Whenever an event occurs on the highway, the reliability
of the communication in the vehicular network becomes so vital so that event created messages should
reach to all the moving network nodes. It becomes necessary that there should be no interference from
outside of the network and all the neighbor nodes should lie in the transmission range of the
reference vehicular node. Transmission range is directly proportional to the transmission power the
moving node. If the transmission power will be high, the interference increases that can cause higher
delay in message reception at receiver end, hence the performance of the network decreased. In this
paper, it is analyzed that how transmission power can be controlled by considering other different
parameter of the network such as; density, distance between moving nodes, different types of messages
dissemination with their priority, selection of an antenna also affects on the transmission power. The
dynamic control of transmission power in VANET serves also for the optimization of the resources
where it needs, can be decreased and increased depending on the circumstances of the network.
Different applications and events of different types also cause changes in transmission power to enhance
the reachability. The analysis in this paper is comprised of density, distance with single hop and multi
hop message broadcasting based dynamic transmission power control as well as antenna selection and
applications based. Some summarized tables are produced according to the respective parameters of
the vehicular network. At the end some valuable observations are made and discussed in detail. This
paper concludes with a grand summary of all the protocols discussed in it.
Definitive broadcasting in vehicular ad hoc networks is the key to success for various services and applications on an intelligent transportation system. Many trusted broadcasting protocols have been proposed but none of them has been evaluated in realistic scenario. In this paper, we discuss these reliable broadcasting protocols on VANET. Basic mechanism in broadcasting, and also we are providing collective research of Broadcasting protocols in vanet in that some real time protocols with their pros cons we have studied.
Definitive broadcasting in vehicular ad hoc networks is the key to success for various services and applications on an intelligent transportation system. Many trusted broadcasting protocols have been proposed but none of them has been evaluated in realistic scenario. In this paper, we discuss these reliable broadcasting protocols on VANET. Basic mechanism in broadcasting, and also we are providing collective research of Broadcasting protocols in vanet in that some real time protocols with their pros cons we have studied.
SIMULATION & VANET: TOWARDS A NEW RELIABLE AND OPTIMAL DATA DISSEMINATION MODELpijans
Ad hoc networks was developed in the 2000s, they was highly used in dynamic environment, particularly
for inter- vehicular communication (VANETs : Vehicular Ad hoc Networks).
Since that time, many researches and developments process was dedicated to VANET networks. These were
motivated by the current vehicular industry trend that is leading to a new transport system generation
based on the use of new communication technologies in order to provide many services to passengers, the
fact that improves the driving and travel’s experience.
These systems require traffic information sharing and dissemination, such as the alert message emitting,
that be exchanged for drivers protection on the road. Sharing such information between vehicles helps to
anticipate potentially dangerous situations, as well as planning better routes during congestion situations.
The current paper attempts to model and simulate VANET Networks, aiming to analyze and evaluate
security information dissemination approaches and mechanisms used in this type of networks in several
exchanges conditions. The second objective is to identify their limitations and suggest a new improved
approach. This study was conducted as part of our research project entitled “Simulation & VANETs”,
where we justify and validate our approach using modeling and simulation techniques and tools used in
this domain.
Towards a new approach of data dissemination in vanets networkscsandit
In the 2000s, ad hoc networks was developed and highly used in dynamic environment,
particularly for inter- vehicular communication (VANETs : Vehicular Ad hoc Networks).
Since that time, many researches and developments process was dedicated to VANET networks.
This was motivated by the current vehicular industry trend that is leading to a new transport
system generation based on the use of new communication technologies in order to provide
many services to passengers, the fact that improves the driving and travel’s experience.
These systems require traffic information sharing and dissemination the example as the case
alert message emitting allowing the driver to minimize driving risks. Sharing such information
between vehicles helps to anticipate potentially dangerous situations, as well as planning better
routes during congestion situations.
In this context, we are trying in this paper to model and simulate VANET Networks in order to
analyze and evaluate security information dissemination approaches and mechanisms used in
this type of networks in several exchanges conditions.This in order to identify their limitations
and suggest a new improved approach. This study was conducted as part of our research
project entitled “Simulation & VANETs”, where we justify and validate our approach using
modeling and simulation techniques and tools used in this domain.
TOWARDS A NEW APPROACH OF DATA DISSEMINATION IN VANETS NETWORKScscpconf
In the 2000s, ad hoc networks was developed and highly used in dynamic environment, particularly for inter- vehicular communication (VANETs : Vehicular Ad hoc Networks). Since that time, many researches and developments process was dedicated to VANET networks. This was motivated by the current vehicular industry trend that is leading to a new transport system generation based on the use of new communication technologies in order to provide many services to passengers, the fact that improves the driving and travel’s experience. These systems require traffic information sharing and dissemination the example as the case alert message emitting allowing the driver to minimize driving risks. Sharing such information between vehicles helps to anticipate potentially dangerous situations, as well as planning better routes during congestion situations. In this context, we are trying in this paper to model and simulate VANET Networks in order to analyze and evaluate security information dissemination approaches and mechanisms used in this type of networks in several exchanges conditions.This in order to identify their limitations and suggest a new improved approach. This study was conducted as part of our research project entitled “Simulation & VANETs”, where we justify and validate our approach using modeling and simulation techniques and tools used in this domain.
GLOBAL FRONTRUNNER ROUTING ALGORITHM (GFRA) FOR V2V COMMUNICATION IN VANETS cscpconf
VANET (Vehicular Ad hoc NETwork) is the emerging research area that making the phrase
“Network on Wheel” true. In this new age network the basic WLAN (IEEE 802.11) standard is
used. As the necessity of such network increases the implementation challenges are being taken
into account. They are broadcasting, routing, priority scheduling and security and privacy. In
this paper the routing is considered as the research factor. A proposal for routing with
frequently changing topology to avoid disconnection of network on road and for the routing among overlapping networks in flyovers with multiple ramps and stack to avoid wrong messaging is given.
A CELLULAR BONDING AND ADAPTIVE LOAD BALANCING BASED MULTI-SIM GATEWAY FOR MO...pijans
As it is well known, the QoS(quality of service) provided by mobile Internet access point devices is far from
the QoS level offered by the common ADSL modem-router due to several reasons: in fact, mobile Internet
access networks are not designed to support real-time data traffic because of several drawbacks
concerning the wireless medium such as resource sharing, traffic congestion, radio link coverage etc.,
which impact directly such parameters as delay, jitter, and packet loss rate that are strictly connected to
the quality of user experience. The main scope of the present paper is to introduce a dual USIM HSPA
gateway for ad hoc and sensors networks thanks to which it will be possible to guarantee a QoS suitable
for a series of network-centric application such as real-time communications and monitoring, video
surveillance, real-time sensor networks, telemedicine, vehicular and mobile sensor networks and so on. The
main idea is to exploit multiple radio access networks in order to enhance the available end-to-end
bandwidth and the perceived quality of experience. The scope has been reached by combining multiple
radio access with dynamic load balancing and the VPN (virtual private network) bond technique.
Abstract: VANET (vehicular ad-hoc network) is a classification of MANET in which vehicles act as mobile node and provides a different approach to Intelligent transport System (ITS). VANET is an emerging area for Intelligent Transportation System (ITS) which can result in increased traffic safety, collision warning through exchange of messages through wireless media. Efficient routing protocols are required for efficient communication among vehicles. In the given paper, we surveyed various VANETs protocols like GPRS, GPRS-MV & GPSR. We compare our proposed protocols via NS-2 based simulations and show the performance of different protocols.
Reduce Handover Delay Using the HSBCC Based Buffer Over Flow In Wimax Networkinventionjournals
In wireless networks to improve the competence for event account. Due to the in complete transmission size of nodes, a single path often cannot meet the condition of data transmission. Consequently, multipath show is needed. However, not every path originate by multipath routing algorithms maybe appropriate for conveying image, because a extended routing pathway with a long end to end show delay may not satisfied the time constraint. Furthermore, each data stream includes two kinds of material data handover. We have coming a novel explicit rate-based congestion control method, for supportive requests hand over process. Handover Streaming based Congestion Control (HSBCC), a new adaptive media handover streaming congestion organization in which the assembly packet broadcast rate is adjusted rendering to the active bandwidth share of the connection. They prepare not maintain or continually inform their route tables with the newest route in network. If a node requirements to send a pack to another node then this protocol explorations for the route in an on-demand method and begins the joining in order to communicate and receive the packet. The route detection usually happens by flooding the route application packets throughout the network. It makes sense to simply disregard a packet loss due to random frequency errors than to multiplicatively reduction the current transport rate and it is more suitable to periodically investigation the network during interruption period for a prompt retrieval than to slow down and exponentially increase the retransmission timer.
Understanding Vehicular Ad-hoc Networks and Use of Greedy Routing Protocolijsrd.com
Vehicular Ad Hoc Networks (VANET) belong to a subclass of Mobile ad hoc networks . VANET provides a distinguished approach for Intelligent Transport System (ITS). VANET has become an active area of research and development since it has tremendous potential to improve vehicle and road safety, traffic efficiency, and convenience as well as comfort to both drivers and passengers. In this paper we discuss the characteristics and architecture of VANET. Further we provide an overview of Greedy Perimeter Stateless Routing Protocol. Efficient routing protocols are essential for smart ITS.
A QoS Based MAC Protocol For Wireless Ad-hoc NetworkIJNSA Journal
Multimedia communication over wireless Ad-hoc networks has become the driving technology for many of the important applications, experiencing dramatic market growth and promising revolutionary experiences in personal communication, gaming, entertainment, military, security, environment monitoring, and more. The advances in wireless communications and growth of real-time applications have necessitated the development of wireless networks that can support high Quality of Service (QoS) and power control. A node in an ad hoc network is normally battery operated which poses a huge constraint on the power consumption of such a node. Hence, designing a power efficient MAC protocol for ad hoc wireless networks is a major challenge. In this paper, we propose a CDMA based power controlled medium access protocol for mobile and ad hoc network (MNA). The protocol conserves power and provides QoS guarantees for multimedia traffics. In that network one of the fundamental challenger in MANETs is how to increase the overall network throughputs well as reading the delay while maintaining how energy consumption for packet processing in communication. simulation results shows that the performance of the protocol with increase in traffic while QoS is better in terms of Energy consumption, throughput, & communication delay than existing protocol.
Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Networkpaperpublications3
Abstract: Vehicular ad hoc networks (VANETs) can provide scalable and cost-effective solutions for applications such as traffic safety, dynamic route planning, and context-aware advertisement using short-range wireless communication. To function properly, these applications require efficient routing protocols. However, existing mobile ad hoc network routing and forwarding approaches have limited performance in VANETs. This dissertation shows that routing protocols which account for VANET-specific characteristics in their designs, such as position and mobility of Vehicle, can provide good performance for a large spectrum of applications.
Increased vehicular traffic demands smart vehicles which can interact with each other and roadside infrastructure to prevent accidents. Vehicular Ad-hoc Network (VANET) provides this flexibility to the vehicles. In this desertion we initially analyze the performance of AODV and OLSR, and further we improve the performance of AODV by selecting the node on the basis of trust value of the successive nodes, we also reduce the neighbor hood expiry time and correspondingly update the route table of AODV, with this purposed approach we would be able to reduce the end-to-end delay of AODV sufficiently also the performance of AODV increase in terms of Throughput and packet delivery ratio.Keywords: VANET, AODV, ROUTING, ROUT TABLE.
Title: Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Network
Author: Dalbir Singh, Amit Jain (Asst. Prof.)
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
A Secure Payment Scheme with Low Communication and Processing Overhead for Mu...Editor IJMTER
In this proposed work a trust-based routing protocol is developed to route messages through the
highly trusted nodes to minimize the probability of dropping the messages. Thus improve the network
performance in terms of throughput and packet delivery ratio. The proposed design contains a novel secure
reactive routing protocol for Mobile ad hoc networks (MANETs), called TRIUMF (Trust-Based Routing
Protocol with controlled degree of Selfishness for Securing MANET against Packet Dropping Attack). In the
proposed protocol trust among nodes is represented by trust value, which consists of cooperation score, direct
trust and indirect trust. The proposed trust routing allows controlled degree of selfishness to give an incentive to
the selfish nodes to declare its selfishness behavior to its neighbor nodes, which reduce the searching time of
misbehaving nodes to search for the malicious nodes only. In the proposed routing protocol two node-disjoint
routes between the source and destination nodes are selected based on their path trust values, one marked as
primary and the other as secondary. In this work both DLL-ACK and end- to-end TCP-ACK as monitoring
tools to monitor the behavior of routing path nodes: if the data packet successfully transmitted, then the path
nodes trust value are updated positively; otherwise, if a malicious behavior is detected then the path searching
tool starts to identify the malicious nodes and isolate them from the routing path and the network. Finally this
scheme reduces the searching time of malicious nodes, and the routing protocol avoids the isolated misbehaving
node from sharing in all future routes, which improves the overall network throughput.
Secure Multicast Communication using Behavioural Measurement Technique in MANET Editor Jacotech
In MANET communication between two mobile nodes are carried out by routing protocol. In MANET each mobile node can directly communicate with other mobile node if both mobile nodes are within transmission range. Otherwise the nodes present in between have to forward the packets for them on network. dynamic and cooperative nature of ad hoc networks presents substantial challenges in securing and detecting attacks in these networks. In this paper we proposed a novel Intrusion Detection and Prevention Scheme (IDPS) for protecting network against Blackhole attack. During the attack, a malicious node captures the data after the positive reply of route existence. Routing in Ad hoc networks has been a challenging task ever since the wireless networks came into existence. In multicasting the sender and communicated with multiple receivers. The routing misbehavior in multicast ODMRP is secured by proposed scheme. The proposed IDPS scheme first to detect the malicious nodes and after that block the activities of malicious nodes. The performance of proposed scheme is evaluated through performance metrics that shows the attacker routing misbehavior and proposed security scheme is provides secure and
vigorous performance in presence blackhole attacker.
Effective Road Model for Congestion Control in VANETSijwmn
Congestion on the roads is a key problem to deal with, which wastes valuable time.. Due to high mobility
rate and relative speed link failure occur very often. VANET is used to tackle the problem of congestion,
and make decisions well in advance to avoid traffic congestion. In this paper we proposed a solution to
detect and control the traffic congestion by using of both (V2V) and (V2I), as a result the drivers become
aware of the location of congestion as well as way to avoid getting stuck in congestion. The congestion is
detected by analyzing the data obtained by vehicular communication and road side units to avoid the
traffic. Our proposition system is competent of detecting and controlling traffic congestion in real-time.
V2V and V2I communication network is used to receive and send the messages. We simulate the result by
using Congestion Detection and Control Algorithm (CDCA), and show that this is one effective way to
control congestion. The Proposed methodology ensures reliable and timely delivery of messages to know
about congestion and avoid it.
Network parameters impact on dynamic transmission power control in vehicular ...ijngnjournal
the throughput of the wireless vehicular network and decrease the delay of the message communication
between vehicular nodes on the highway. Whenever an event occurs on the highway, the reliability
of the communication in the vehicular network becomes so vital so that event created messages should
reach to all the moving network nodes. It becomes necessary that there should be no interference from
outside of the network and all the neighbor nodes should lie in the transmission range of the
reference vehicular node. Transmission range is directly proportional to the transmission power the
moving node. If the transmission power will be high, the interference increases that can cause higher
delay in message reception at receiver end, hence the performance of the network decreased. In this
paper, it is analyzed that how transmission power can be controlled by considering other different
parameter of the network such as; density, distance between moving nodes, different types of messages
dissemination with their priority, selection of an antenna also affects on the transmission power. The
dynamic control of transmission power in VANET serves also for the optimization of the resources
where it needs, can be decreased and increased depending on the circumstances of the network.
Different applications and events of different types also cause changes in transmission power to enhance
the reachability. The analysis in this paper is comprised of density, distance with single hop and multi
hop message broadcasting based dynamic transmission power control as well as antenna selection and
applications based. Some summarized tables are produced according to the respective parameters of
the vehicular network. At the end some valuable observations are made and discussed in detail. This
paper concludes with a grand summary of all the protocols discussed in it.
Definitive broadcasting in vehicular ad hoc networks is the key to success for various services and applications on an intelligent transportation system. Many trusted broadcasting protocols have been proposed but none of them has been evaluated in realistic scenario. In this paper, we discuss these reliable broadcasting protocols on VANET. Basic mechanism in broadcasting, and also we are providing collective research of Broadcasting protocols in vanet in that some real time protocols with their pros cons we have studied.
Definitive broadcasting in vehicular ad hoc networks is the key to success for various services and applications on an intelligent transportation system. Many trusted broadcasting protocols have been proposed but none of them has been evaluated in realistic scenario. In this paper, we discuss these reliable broadcasting protocols on VANET. Basic mechanism in broadcasting, and also we are providing collective research of Broadcasting protocols in vanet in that some real time protocols with their pros cons we have studied.
SIMULATION & VANET: TOWARDS A NEW RELIABLE AND OPTIMAL DATA DISSEMINATION MODELpijans
Ad hoc networks was developed in the 2000s, they was highly used in dynamic environment, particularly
for inter- vehicular communication (VANETs : Vehicular Ad hoc Networks).
Since that time, many researches and developments process was dedicated to VANET networks. These were
motivated by the current vehicular industry trend that is leading to a new transport system generation
based on the use of new communication technologies in order to provide many services to passengers, the
fact that improves the driving and travel’s experience.
These systems require traffic information sharing and dissemination, such as the alert message emitting,
that be exchanged for drivers protection on the road. Sharing such information between vehicles helps to
anticipate potentially dangerous situations, as well as planning better routes during congestion situations.
The current paper attempts to model and simulate VANET Networks, aiming to analyze and evaluate
security information dissemination approaches and mechanisms used in this type of networks in several
exchanges conditions. The second objective is to identify their limitations and suggest a new improved
approach. This study was conducted as part of our research project entitled “Simulation & VANETs”,
where we justify and validate our approach using modeling and simulation techniques and tools used in
this domain.
Towards a new approach of data dissemination in vanets networkscsandit
In the 2000s, ad hoc networks was developed and highly used in dynamic environment,
particularly for inter- vehicular communication (VANETs : Vehicular Ad hoc Networks).
Since that time, many researches and developments process was dedicated to VANET networks.
This was motivated by the current vehicular industry trend that is leading to a new transport
system generation based on the use of new communication technologies in order to provide
many services to passengers, the fact that improves the driving and travel’s experience.
These systems require traffic information sharing and dissemination the example as the case
alert message emitting allowing the driver to minimize driving risks. Sharing such information
between vehicles helps to anticipate potentially dangerous situations, as well as planning better
routes during congestion situations.
In this context, we are trying in this paper to model and simulate VANET Networks in order to
analyze and evaluate security information dissemination approaches and mechanisms used in
this type of networks in several exchanges conditions.This in order to identify their limitations
and suggest a new improved approach. This study was conducted as part of our research
project entitled “Simulation & VANETs”, where we justify and validate our approach using
modeling and simulation techniques and tools used in this domain.
TOWARDS A NEW APPROACH OF DATA DISSEMINATION IN VANETS NETWORKScscpconf
In the 2000s, ad hoc networks was developed and highly used in dynamic environment, particularly for inter- vehicular communication (VANETs : Vehicular Ad hoc Networks). Since that time, many researches and developments process was dedicated to VANET networks. This was motivated by the current vehicular industry trend that is leading to a new transport system generation based on the use of new communication technologies in order to provide many services to passengers, the fact that improves the driving and travel’s experience. These systems require traffic information sharing and dissemination the example as the case alert message emitting allowing the driver to minimize driving risks. Sharing such information between vehicles helps to anticipate potentially dangerous situations, as well as planning better routes during congestion situations. In this context, we are trying in this paper to model and simulate VANET Networks in order to analyze and evaluate security information dissemination approaches and mechanisms used in this type of networks in several exchanges conditions.This in order to identify their limitations and suggest a new improved approach. This study was conducted as part of our research project entitled “Simulation & VANETs”, where we justify and validate our approach using modeling and simulation techniques and tools used in this domain.
GLOBAL FRONTRUNNER ROUTING ALGORITHM (GFRA) FOR V2V COMMUNICATION IN VANETS cscpconf
VANET (Vehicular Ad hoc NETwork) is the emerging research area that making the phrase
“Network on Wheel” true. In this new age network the basic WLAN (IEEE 802.11) standard is
used. As the necessity of such network increases the implementation challenges are being taken
into account. They are broadcasting, routing, priority scheduling and security and privacy. In
this paper the routing is considered as the research factor. A proposal for routing with
frequently changing topology to avoid disconnection of network on road and for the routing among overlapping networks in flyovers with multiple ramps and stack to avoid wrong messaging is given.
A Study of Sybil and Temporal Attacks in Vehicular Ad Hoc Networks: Types, Ch...Editor IJCATR
In recent years, the number of automobiles on the road has increased tremendously. Due to high density and mobility of vehicles,
possible threats and road accidents are increasing. Wireless communication allows sending safety and other critical information. Due to this
inherent wireless characteristic and periodic exchange of safety packets, Vehicular Ad-hoc Network (VANET) is vulnerable to number of
security threats like Sybil attack or temporal attack. In this paper, a detailed discussion has been done on both the type of attacks. With the
help of already published works, some approaches have also been studied which have proved to be of significance in detection of these
attacks.
In vehicular ad hoc network (VANETs), the applications mainly focused on the road challenging subclass of Mobile Ad-hoc Network, which empowers smart transmission among vehicles and between vehicles and roadside frameworks. It is an optimistic methodology for the Intelligent Transport System (ITS). There are numerous difficulties to be tended while utilizing VANET. It is flexible and has a high dynamic topology and flexibility which makes the conventional MANET protocols unacceptable for VANET. Trust is a principal element which is used to create a trustful environment to improve the security in vehicular networks. Trust can be calculated by observing the human behavior which creates a trusted communicating environment. In this paper, we define the architecture of VANET, then the communication establishment and various challenges. Some trust models had been defined in this paper to enforce honest information sharing between communicating nodes. Trust establishment is compulsory among communicating vehicles to build a secure messages exchange and reliability.
International Journal of Computational Engineering Research (IJCER) ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
Challenging Issues in VANET Network and its Routing Algorithms-An Analysisidescitation
Vehicular Ad hoc Network (VANET), a rapidly
deployed wireless network, is a subclass of mobile ad hoc
networks (MANET) that uses multi-hop routing to provide
network connectivity among vehicles (V2V) or vehicle to road-
side equipments (V2R). VANETs have received increasing
research attention in recent years because of its vast
applications like safety, comfort and entertainment. Variations
with time in network topology impose new challenges for
routing protocols in such networks as traditional routing
protocols are not suitable for VANETs. This work is an attempt
to figure out the challenges in VANET comprehensively in
conjunction with the recommended routing protocols by
comparing the existing routing protocols with respect to
existing challenges.
Master-Slave Clustering Technique for High Density Traffic in Urban VANET Sce...rifat1tasnim
Moving vehicle is never free of traffic congestion especially in the cities. Every day commuters wastes hours in travelling just because of traffic congestion. This has led to the emergence of vehicular management which will be beneficial for Road Transport department to control and manage the traffic flow on congested roads. Thus to support above idea we have Vehicular Ad-Hoc Network, or VANET technology that turns every participating car into a node, allowing cars to connect with each other and in turn create a network. There are wealthy numbers of approaches were highlighted to solve several thriving challenges of VANET. Clustering technique in vehicle is one of them which made a great impact on VANET. But it fails to fulfill a crucial requirement. Several protocols wanted to build a cluster in low density traffic where the numbers of vehicles are less with respect to transmission range & there is a less chance of broadcast storming which is not a practical scenario. So that cluster formation in high density traffic has arisen as an issue where there is a great possibility to broadcast storm. This paper suggests a “Priority Based Master-Slave Cluster Formation Process” in high density traffic for an urban scenario using “fidelity” metric. With the help of this metric it will be easier to find high density traffic & form priority based Master-Slave dynamically by reducing broadcast storm problem.
In this paper CHP function runs on the vehicular environment which carried out to select a vehicle as Master. In this Ad-hoc wireless environment a dataset is assumed which create a proper environment & generate a graph. Graph results can be analyzed to have the highest one selects as a Master. Thus for the final result, real aspects of vehicular traffic is very essential and scenarios play a very crucial role.
Technical Review on Different Applications, Challenges and Security in VANETPallavi Agarwal
Vehicular ad-hoc networks (VANETs) technology has turned out as a vital research field throughout the most recent couple of years. VANETs are the likely an impacting way to deal with giving security of driver and different applications for the activity conditions and additionally travelers. Being dynamic in nature, it created the network, according to the condition and requirement of the users and provides consistent communication between the vehicles. Due to its excessive advantages, it is highly susceptible to numerous attacks and security in VANET should be taken into consideration. This paper presented the security issues such as authenticity, integrity, availability, confidentiality, anonymity and non-repudiation to provide the secure communication between Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I). Numerous research works have been done to recover the performance and security of this network. The fundamental point of this paper is the several security challenges and the applications of VANETs.
Issues and Challenges in Broadcast Storm Suppression Algorithms of Vehicular ...ieijjournal1
Vehicular Ad-Hoc Networks (VANETs) are the networks of vehicles which are characterized with high
mobility and dynamic changing topology. Most of the communication interchanges in VANETs take place in broadcasting mode, which is supposed to be the simplest way to disseminate (spread) emergency messages all over the vehicular network. This broadcasting technique assures the optimal delivery of emergency messages all over the VANET. However, it also results in unwanted flooding of messages which causes severe contention and collisions in VANETs leading to Broadcast Storm Problem (BSP) and in turn affects the overall performance of VANETs. A Multitude of research work have proposed Broadcast Storm Suppression Algorithms (BSSA) to control this Broadcast Storm. These mechanisms tried to control BSP by either reducing the number of rebroadcasting/ relaying nodes or by identifying the best relay node. The suppression mechanisms help to overcome BSP to certain extent, still there is need to still reduce the number of rebroadcasting nodes in existing mechanisms and also to identify the best possible rebroadcasting node. This would help to mitigate BSP completely and efficiently. This paper presents comparative analysis of various prominent BSSA in order to identify the underlying issues and challenges in controlling BSP completely. The outcome of this paper would provide the requirements for developing an efficient BSSA overcoming the identified issues and challenges.
An Analytical Review of the Algorithms Controlling Congestion in Vehicular Ne...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
VEHICULAR AD HOC AND SENSOR NETWORKS; PRINCIPLES AND CHALLENGES ijasuc
The rapid increase of vehicular traffic and congestion on the highways began hampering the safe and
efficient movement of traffic. Consequently, year by year, we see the ascending rate of car accidents and
casualties in most of the countries. Therefore, exploiting the new technologies, e.g. wireless sensor networks,
is required as a solution of reduction of these saddening and reprehensible statistics. This has motivated us to
propose a novel and comprehensive system to utilize Wireless Sensor Networks for vehicular networks. We
coin the vehicular network employing wireless Sensor networks as Vehicular Ad Hoc and Sensor Network, or
VASNET in short. The proposed VASNET is particularly for highway traffic .VASNET is a self-organizing Ad
Hoc and sensor network comprised of a large number of sensor nodes. In VASNET there are two kinds of
sensor nodes, some are embedded on the vehicles-vehicular nodes- and others are deployed in predetermined
distances besides the highway road, known as Road Side Sensor nodes (RSS). The vehicular nodes are used to
sense the velocity of the vehicle for instance. We can have some Base Stations (BS) such as Police Traffic
Station, Firefighting Group and Rescue Team. The base stations may be stationary or mobile. VASNET
provides capability of wireless communication between vehicular nodes and stationary nodes, to increase
safety and comfort for vehicles on the highway roads. In this paper we explain main fundamentals and
challenges of VASNET.
VANET Clustering for Protected and Steady Network
Mukesh Bathre1, Alok Sahelay2
Abstract— Vehicular on demand ad-hoc network (VANET) is understood as a necessary issue of good Transportation systems. The key advantage of VANET communication is looked in dynamic protection systems, that objective to improve security of travelers by exchanging caution messages between vehicles. Alternative applications and private services also are allowed so as to lower management expenses and to market VANET exploitation. To effectively established VANET, security is one amongst key challenges that has got to be tackled. Another vital concern is measurability could be a serious issue for a network designer a way to maintain stable communication and services in VANET. Extraordinarily dynamic atmosphere of VANETs looks it troublesome. This paper introduced an automatic reliability management method for VANETs that uses machine learning to categories nodes as malicious. Cluster creation is one effective method for the measurability drawback. Here conjointly given associate entropy-based WCA (EWCA) cluster maintained method which may handle the steady of the automobile network.
1. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
DOI: 10.5121/ijci.2015.4301 1
SCRUTINY OF BROADCASTING PROTOCOLS IN
VANET
Rohini Nere and Prof Uma Nagaraj
Department of Computer Engineering, MIT Academy of Engineering, Alandi, Pune
ABSTRACT
Definitive broadcasting in vehicular ad hoc networks is the key to success for various services and
applications on an intelligent transportation system. Many trusted broadcasting protocols have been
proposed but none of them has been evaluated in realistic scenario. In this paper, we discuss these reliable
broadcasting protocols on VANET. Basic mechanism in broadcasting, and also we are providing collective
research of Broadcasting protocols in vanet in that some real time protocols with their pros cons we have
studied.
KEYWORDS
Vanet, broadcasting protocols, flooding, DSR, UMB, AODV, MDDV.
1. INTRODUCTION
There are several broadcasting protocols proposed on Vehicular Adhoc Network. But as of now
none of them has been successfully evaluated. Hence, authors of this paper have done analytic
research of the broadcasting protocols for vehicular Adhoc Network.
2. NEED OF BROADCASTING IN VANET
A conventional approach for broadcasting is simple flooding. As soon as node receive broadcast
message receiving node rebroadcasts the message immediately. This approach can provide very
high rate of data distribution. It is also simple as it does not require neighbour’s information.
However, it does not execute well in dense and sparse areas. Particularly, in condensed area such
as traffic jam during rush hours, the simple flooding is responsible for high collision, leading to
low reliability with a lot of dispensable broadcast messages. This problem is also been applicable
for route request (RREQ) mechanism of AODV on the Vehicular AdHOc Network environment.
In sporadic area such as highways during night time, vehicles move fast and possibly have no
neighbour in their transmission range. The effortless flooding in such disconnected network is
useless as there is no neighbour being able to receive and convey the message VANET safety
mechanism depend on interchanging the safety information among vehicles i.e. car to car (C2C
communication) or between Vehicle to infrastructure i.e. car to infrastructure.(C2I
Communication) using the control channel, as you can see in figure 1.
2. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
2
Figure 1: Basic idea of VANET.
VANET as comfort communication can be made by two means: Periodic Safety Message (in this
paper we refer them as Beacon) and Event Driven Message (refereed as Emergency Message
here), both messages share only one control channel. The Beacon messages are messages about
status of sender vehicle. Status information includes position, speed, heading towards, etc., about
sender. Beacons provide resent or latest information of the sender vehicle to the all present
vehicles in the network which will help them to know the position of the current network and
anticipate the movement of vehicles. Beacons are sent antagonistically to neighbouring vehicles
10 messages each second. Emergency Messages are messages sent by a vehicle who defect a
potential dangerous situation on the road, this information should be dispersed to alarm or worn
other vehicles about a feasible danger that could affect the incoming vehicles. VANET is a high
mobile or volatile network where the nodes are keep changing their position and they are moving
in speeds, which means that this vehicles may be get influence, even if these vehicles are very far
from the danger, they will reach near to danger very soon, in this case fraction of seconds will be
very important to avoid the danger [6, and 7].
In VANET Emergency messages are delivered in broadcasting way. Purpose behind this is all the
vehicle within the communication range of the sender should receive the message. Message
barely reaches a 1000m (which is in fact the range of DSRC communication) and is the coverage
area of sender and it is not enough as due to fading effects and attenuation. Critical information
should receive by vehicles which are out of senders range. By using this information they can
avoid the danger. In short distances the prospect of message reception i.e. percentage of message
reception can reach 99% and as we move forward it decreases up to 20% at half of the
communication range (Moreno, 2004). Therefore, there is requirement of a method to rise the
emergency message reception with great reliability and availability. Due to the high movement of
vehicles, the dispersal of nodes with in the network changes swiftly and unpredictably that
wireless links modify and clear up commonly and randomly. Therefore, broadcasting of messages
in VANETs plays a pivotal rule in almost every application and requires novel solutions that are
different from any other form of Ad-Hoc networks. Broadcasting of the messages in VANETs is
an open investigation challenge and needs some efforts to reach an optimum solution.
The requirements for broadcasting are great accuracy, dependability and also great distribution
speed by means of undersized latency not only in single-hop but also in multi-hop
communication.
3. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
3
Problems associated with regular broadcasting algorithms are the high possibility of collision in
the broadcasted messages and the absence of feedback and the hidden node problem. In our paper
we are proposing a new intelligent broadcasting technique which is used in emergency message in
Vehicular AdHoc Network and is aimed in rising of the acknowledgement of important message.
In section II and section III we are simply collecting all possible information about research done
in broadcasting protocols. In that section II is dedicated to schemes of existing broadcasting
protocols. And section III is describing some real time examples of broadcasting protocols with
their pros and cons.
3. BASIC BROADCASTING SCHEMES COMPARISON
A variety of broadcasting schemes exist such as simple flooding, probability based approaches,
area based approaches etc., In this section we will concisely discuss all the broadcast schemes and
their pros and cons. Flooding is a simple broadcast technique for communication. Vehicles send
information to other vehicle and this process continues until all vehicles get same information. It
works fine in sparse network but in dense network it produces collision, contention and redundant
information. Flooding is pretty simple to practise and also flooding could be expensive as far as
network performance is concerned, and one of the main problems that rise in flooding is
“Broadcast Storm Problem”. Figure 2 is showing difficulty with flooding vehicle in yellow colour
first send message .Which is again come back after some interval from different user’s repetition
of message take place which results into wastage of bandwidth.
Figure 2. Broadcast storm problem
Probabilistic scheme reduces the collision, contention and redundant messages in dense network
as it broadcast the messages with some fixed probability. However in the scattered network, all of
the vehicles are unable to receive the same packets with small probability. When the possibility is
increased then it mechanisms similar to flooding. Therefore, it performs wisely in condensed
network in comparison to scattered network. Counter based technique is used to analyse the
redundant messages. We use counter to record the dispensable message. Whenever the redundant
i.e. dispensable message is received, we increment the counter by one. We distinguish the counter
with certain threshold value if it is less than it we forward the packet otherwise the packet is
discarded. The Scheme based on Distance, it evaluates the space between the vehicles and its
neighbours. Then it compares the distance with threshold. If the distance is greater than threshold
it forward the packet otherwise it ignore the message. The Scheme based on Location, it firstly
computes the coverage area by making use of sender location. If the coverage area is shorter than
a threshold value, then the vehicle will overlook the packet. Or else that packet would be
broadcasted. Neighbour knowledge method is a technique which keeps the table which comprises
4. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
4
of the data for vehicles which are nearby. A vehicle uses this information to decide whether to
forward the message onward or deny it. All vehicles share hello packets with their neighbours to
get current information. That information is being stored in their table for further usage. This
method completely depends on the exchange of hello packet. If the intermission is little then
Contention and collision can happen, whereas the huge intermission worsens the network
performance because of motion.
Correlation of various broadcasting protocols is being presented below in table. We have done
analysis on the protocols on the basis of different criterions viz. are, collision, competition,
congestion, performance, accuracy, reliability. And not any of the previously existing schemes is
perfect for the entire situations .In sparse or scattered network, plain flooding could behave
properly whereas the probabilistic can work well in condensed network.
Table 1. Comparison between protocols.
3.1 Probe of Broadcasting Protocols in Vanet
Basic mechanisms in which consist of three main modules. There are favoured node selection
algorithm, beaconing and waiting timeout calculation. The preferred node selection (node
picking) algorithm which can make the difference to efficiency and overhead of the protocol. If
the protocol picks the exact vehicle, some of the vehicles in the similar road sector would be able
to accept the broadcasted message in every single phase of rebroadcasting. The waiting timeout
calculation is the chief mechanism to circumvent broadcasting collision for reliable (consistent)
broadcasting protocol, nevertheless waiting timeout could raise a lot of retard. We also found that
the waiting timeout of some protocols is the reason of broadcast storm problem. The last module
is beaconing which is the solution to redeem neighbour nodes’ information. Even though it is
beneficial, it is able to spend the inadequate wireless network resource, which origins problem of
broadcasting storm which then diminish consistency and efficiency of protocols. Then we
5. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
5
compare the reliable broadcast protocols on the basis of reliability (dependability), speed and
overhead of data scattering by imitation.
In the reference no [8], a street-based broadcast scheme is proposed by authors in that scheme
vehicle employs neighbours’ information by exchanging hello messages among vehicles, A
warning message is broadcasted to all neighbours when any probable danger is detected. As a
forwarder the farthest vehicle is selected. This selection will be depending on the information
gained from the hello message, if the forwarder which is preselected, receives the message, it will
broadcast it again.
In a case of high mobile highly volatile network like VANET Depending on just one forwarder is
not good option always. Moreover, we are not dependant on beacon signals to intensification of
the information. They anticipated using hello message, which creates a chance to raise the
channel load. The waiting time for long the receiver delays previous to rebroadcasting of the
message acknowledged by the sender is the contention period. And these schemes are anticipated
by many of the researchers [10], [12], [9], [13], [11], [14].
Authors of [9] have projected the Link based Distribution Multi hop Broadcasting (LDMB),
which has same potential forwarders and receivers. Every forwarder calculates and delays for
period of contention, and when the period of contention overs then the forwarder would start
rebroadcasting of the message, this conception is being used for the further research.
Authors of [11], [12] have proposed forwarding strategy based on position by broadcasting the
emergency message, and selecting the best forwarder available. All vehicles which receive that
message are potential forwarders. So as to choose the node which will forward the message, every
receiver would allocate the contention window (waiting time); the size of window will be the
lowest for node which is furthest whereas largest size of window for the node which is nearby i.e.,
priority for the node which is furthest to be the succeeding forwarder will be given by this
protocol.
The last two protocols have the problem, which is each of the receivers of message will calculate
the contention window period and will pause for making the rebroadcast though the vehicles
which are nearby the sender would do, and making the whole network vehicles active for every
received message.
In [13], authors have proposed a protocol known as Emergency Message Dissemination Vehicle
(EMDV), by allowing the furthest vehicle inside the range of transmission for making the
rebroadcast of message.
Because the position is always changing, choosing a forwarder vehicle is not suitable in VANET
also receiving vehicle might turn out of range at time when a message is being sent. That means
the message receiver is not able to receive it due to the channel problems such as denial of service
or jam, as seen in Fig.3.
Authors of [10] have projected that the message receivers would choose arbitrary waiting periods
and will also acknowledge for avoiding retransmission by the nodes which are nearby the initial
sender.
The delay for rebroadcasting is being caused by acknowledgment scheme. Authors of [14] have
projected the protocol named Contention (waiting time) Based Forwarding (CBF) in which a
6. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
6
packet in the form of a broadcasting message is being sent by a vehicle to every neighbour of it.
On reception of the packet, forwarding the packet will be contended for by neighbouring vehicle.
The node with the highest progress to the target would be having the least waiting period also
rebroadcasting of the message would be firstly done by it. If other nodes accept the rebroadcast
message, they will stop their conflict and will delete the previously received message. This
protocol is chiefly offered for forwarding the intervallic safety message (Beacons).
This protocol has an issue that it needs technique for management of waiting time or contention
period to every adjacent vehicle, also there is possibility of missing the rebroadcast of a different
vehicle by the nearest vehicle to the sender. So that vehicle would be rebroadcasting the message
.This is known as hidden node problem. Also this is responsible for broadcasting storm problem.
Figure 3.Sender using EMDV
Researchers of [15] have projected that the receivers located at farther distances from the sender
would rebroadcast the message by the choice of smaller contention times, as seen in equation.
Authors of [7] have projected a protocol named as Contention(waiting time) Based Broadcasting
(CBB) protocol so as to raise the reception of emergency message also to raise the performance,
broadcasting is being done in multi-hop manner, prior the sending of original messages, these
multi-hop forwarders would be choose. Contention based broadcasting is verified to accomplish
supremacy over the as Emergency Message Dissemination Vehicle protocol because it selects
many forwarders for rebroadcasting the messages and by this emergency message can defeat the
pre chosen forwarder failure.
The standards of picking the forwarders are based on the growth and also based on the
localization segment, as seen in fig 4, in which every vehicle positioned in final non-vacant
segment become the potential forwarders.
7. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
7
Figure 4. Emergency message Sending and transmission range
Another way to rebroadcast the message is to splits the network into segments proposed in [16,
17, and 18].
The authors of [16] have projected Urban Multi–hop broadcast (UMB) and that increases the
message growth, and evading hidden node,problems of broadcasting storm and dependability. It
gives the responsibility of furthering and recognising the broadcast packets to only one vehicle.
This is being done by separating the road lot inside the communication range into segments and
selecting the vehicle in the furthermost non-vacant section without any information of previous
topology. Broadcast control packet is being transmitted by source node, named as RTB (Request
to Broadcast),and it holds the location of the source and location of the segment size. On
reception of the Request To Broadcast packets, the nodes calculate the space amongst the receiver
and sender. After that nodes transfers a channel congestion signal known as black burst, which
contains numerous time–spaces equivalent to their distance from the source (in number of
segments).Farther the distance, lengthier is the black–burst. Each and every node tranfers its
congestion signal, when different black-burst is not there in the channel then it results in
determining it as the furthest node. A Clear–to–Broadcast (CTB) control packet is returned by
node, containing its identifier (ID), to the source.
In [17] authors have projected a protocol which has the similar purpose as that of Urban Multi-
hop Broadcast by making use of a diverse technique. Upon the reception of RTB message, each
vehicle should decide its segment and set a random back-off time. Every node is having its unique
waiting time.Meaning, if that segment is having the size of contention window of four Time
slot,then vehicles which are lying in the farthest segment have to arbitrarily decide a back-off
time which lies in between zero time slot and three. The subsequent next segments’ vehicles
selects the value in between four ansd seven Timeslots.The vehicles which are closer to the
sender; they have to wait for longest period of time.
Vehicles will be decreasing their times of backing off by 1 in every Time Slot(Ts). When they are
hearing the physical channel. When a Vehicle obtains a suitable Clear To Broadcast packet,when
it is listening,the vehicle would be exiting the time phase of contention. And would hear the
transmitting broadcast signals. In contrast, suppose a node comes to an end of its back off
timer,the node would transfer the Clear-To-Broadcast signal and would be rebroadcasting the
incoming broadcasts.
In [20 ]researcher has categorised the message in priority message in which structure of the
emergency message is as shown in fig 5 in which 3 inputs, viz. are Forwarder candidate ID (ie.,
8. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
8
Cid), Minimum Boundary and Maximum Boundary,they are supplementary to assist the receiver
vehicle in deciding which action should be taken after acceptance of any emergency information
or message.
Figure 5.Message Format
Where Send ID : sender id, Cd : Message Code, TS : Time Stamp, MID : Message ID, Dt : Data
sent, Cnid : Forwarder Candidate ID, MinBt : Minimum Boundary, MaxBt : Maximum
Boundary.
4. SOME REAL TIME EXAMPLES OF BROADCASTING
PROTOCOLS.
4.1 Edge-Aware Epidemic Protocol (EAEP):
Each of vehicles has its unique knowledge which is piggybacked for broadcasting. By this
solution, EDGE AWARE EPIDEMIC PROTOCOL operates without beaconing. Upon reception
of any recent rebroadcasting information, Edge aware epidemic protocol makes use of number of
transmission beginning front nodes and back nodes in amount of time to calculate the probability
for making decision whether nodes will rebroadcast the message or not. Using this methodology,
the boundary of every communication would be the favoured region for rebroadcasting the
message. Although, the intermittent connectivity problem is not being solved by Edge aware
epidemic protocol. Particularly, a node will be unknown about if it has overlooked or passed any
messages or else its neighbours also have missed some messages it has. EDGE AWARE
EPIDEMIC PROTOCOL does better than the simple flooding where as reliability and overhead is
concerned. Though, it present time-consuming speed of data dissemination. It needs at least 30
seconds for delivering a broadcast message.
4.2 Preferred Group Broadcast (PGB)
PREFRERED GROUP BRODCAST is not a dependable broadcasting protocol. But the protocol
is resolution to prevent broadcast storm problem. Every node in PREFRERED GROUP
BRODCAST would sense signal strength from broadcasting by neighbour. The signal strength is
being used for waiting timeout calculation. Shorter waiting timeout will be set by nodes in the
edge of circulated broadcast. Rebroadcasting of the message is being done by the node which is
having shortest timeout. PREFRERED GROUP BRODCAST can decrease numbers of RREQ
broadcasting. But a problem on low density area still exists.
4.3 AckPBSM
AckPBSM is a modified version of PBSM, which is the parameter less broadcast in static to
highly mobile ad-hoc networks. This protocol functions by using periodic beacons, which
replaces information amongst nodes. In each vehicle cluster, the nodes at either the head or tail
would place minimum waiting timeout. The nodes which are lying in Connected Dominating Set
are known as gateway nodes. Rest of the nodes which do not lie in Connected Dominating Set
Send ID Cd TS M ID Dt Cnid MinBt MaxBt
9. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
9
would place higher waiting timeout. If all of their neighbours received the messages, the nodes
will not perform any rebroadcast. For accurate operation high frequent beacon is needed by this
protocol. For solving the problem of intermittent connectivity, broadcasting message
acknowledgement is being piggybacked in beacons periodically. Therefore, nodes are able to
rebroadcast when their neighbours do not get broadcast messages. It is reported in that AckPBSM
outperforms PBSM and DVCAST in terms of reliability and overhead..
4.4 Density-Aware Reliable Broadcasting Protocol (DECA)
It does not require position knowledge. DECA employs only local density information of 1-hop
neighbours obtained by beaconing. Before broadcasting, the node selects one neighbour which
has the greatest local density information for being the next rebroadcasting node. And other nodes
will randomly set their waiting timeout. If they don’t hear anyone rebroadcasting the message
before the timeout expiration, they will rebroadcast the message. Also, recognition of the arrived
broadcast messages is incorporated into periodic beacons. So as the node can find out its
neighbours, who have not yet received the message. The advantage of Density-Aware Reliable
Broadcasting Protocol is that, it does not need location knowledge to operate so it is more flexible
to suit any operating environment.
4.5 Position-Aware Reliable Broadcasting Protocol (POCA)
It uses adaptive beacon to get neighbours’ position and velocity. When nodes want to broadcast
the messages, they will select neighbours in preferred distance to rebroadcast the message. That
chosen distance is selected on the basis of distance among nodes and selector. The selected node
will rebroadcast the message instantaneously. In case those selected nodes do not rebroadcast the
message, other nodes which are having set waiting timeout since they received message will do
this task instead. The waiting timeout is being calculated depending on the distance between node
and precursor node. So the node which is closest to selected node will rebroadcast the messages.
Position-Aware Reliable Protocol also piggybacks the message attribute to beacon to hold
connectivity. Hence a node in the same road section will be rebroadcasting the messages to
neighbours.
4.6 BROADCOMM
BROADCOMM is projected on the structure that is being utilized in highway network. The
highway is being divided into fundamental cells which shift along the vehicles. There is two level
of hierarchy for the nodes which are in the highway. All the nodes which are in a cell are included
in first level. In each of the virtual cell, some of the nodes signify the subsequent level, which are
accountable for managing messages within its cell. And forwarding the communication to or from
neighbouring cell reflectors.
• Pros
Outperforms better for simple highway structure which is containing smaller number of
nodes.
• Cons
Position information is fully dependent on formation of cells.
4.7 SECURE RING BROADCASTING (SRB)
10. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
10
The Secure Ring Broadcasting [5] categorizes the nodes in 3 clusters on the basis of receiving
power. That is, Inner Node, Outer node and Secure Ring node. Inner Nodes are those nodes which
are nearer to sender. Outer Nodes are the nodes which are farther from sender. Whereas, Secure
Ring nodes are those which are at desirable distance from sending node.
• Pros
To get the more stable routes, minimize number of retransmission messages.
• Cons
Control packet overhead is high.
4.8 Parameterless Broadcasting In Static Mobile Wireless Ad Hoc(PBSM).
In PBSM [26], the nodes don’t need information of their neighbour. for removing disused
broadcasting PBSM uses CDS as well as neighbour exclusion model. The list of neighbouring
vehicles which is R and NR is preserved by every vehicle. Which further assists to identify
neighbours which have previously received packet as well as which have not.. When timeout
occurs then rebroadcast the packet.
• Pros - It is regardless vehicle position, velocity and direction.
• Cons -Control Packet overhead is high.
4.9 DISTRIBUTED VEHICULAR BROADCAST PROTOCOL (DV-CAST).
Distributed vehicular broadcast protocol is being projected on the connectivity. As merely
connected, finely connected and entirely disconnected neighbours which partition vehicles in 3
groups. Whenever region is well connected persistence scheme is used. When region is sparsely
connected vehicles are able to instantly rebroadcast along vehicles which are travelling in the
same direction subsequent to reception of the broadcast message. When region is totally
disconnected vehicles stock up the broadcast message in anticipation of another vehicle come into
transmission range. When time is terminated then remove the packets.
• Pros
With using flag variable check whether that packet is redundant or not.
• Cons
- Control overhead is high.
- End to end data transfer delay is also high.
4.10 Urban Multihop Broadcast Protocol(UMB)
Urban Multihop Broadcasting protocol [28] is projected to decipher collision and problems of
hidden node throughout message transmission in multi hop broadcast. In urban multihop
broadcast sender selects the extreme node in broadcast direction so as to forward the packet. It
achieves well in higher packet loads & vehicle traffic density.
• Pros
-Overcomes the Packet collision and hidden node problem.
-Successfully performs at vehicle traffic densities scenarios and higher packet loads.
• Cons
-Waste Bandwidth
11. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
11
4.11 Vector Based Tracing Detection(V-TRADE).
V-TRADE is a broadcasting protocol which is based on GPS System, and which categorizes, the
neighbours into various groups (forwarding). Just a minute subset of vehicles is chosen for every
group for the purpose of rebroadcasting.
• Pros
-Bandwidth utilization is improved.
• Cons
-To select the next forwarding node in every hop routing overheads occur.
4.12 Neighbourhood awareness broadcasting protocols
In neighbourhood awareness approach, beacon messages are being exchanged to collect necessary
information about vehicles in certain neighbourhood (Tonguz et al., 2007; Hao et al., 2008;
Sebastian et al., 2010; Peksen and Acarman, 2012. The information or statistics about the vehicle
for example position, velocity, ID. Every vehicle would preserve a list of all of its neighbours
along entire data which is essential to select next relay computations. Every protocol which uses
the above technique is recognised as not being effective where bandwidth is concerned. As
general beacon message present a substantial overhead to the network. Follows are examples of
such protocols.
4.13 Media Access Control Protocol (MAC).
Media Access Control protocol goals in avoiding the extended suspension by letting the furthest
away node to be the subsequent relay. Path which lies under the transmission range is distributed
in 7 segments. The message is being sent by the sender beside by its location in the header. The
positions will be compared by receiver nodes with the position of sender to compute receiver
nodes direction with respect to the sender. Merely the nodes which are in the area surrounded by
the direction of packet are permitted to partake in the succeeding relay choice. Every contributor
node will verify its individual list of neighbour to decide which one lays inside the periphery area.
Every contributor node will match its individual segment number with the segments which are in
neighbourhood so as to elect whether it is in the segment from which the sender is farthest. The
farthest segment from the senders’ nodes will be selected as the next relay. If the farthest segment
has more than single node, then, each node would be allotted a back off time which is
proportionate to the speed of node. However, the elected relay is transmitting the packets; rest of
the nodes in the outermost division would carry the message and will work as backup nodes.
When transmission comes to the end, backup nodes would verify to match the message or
information which is there in its individual buffer which they have acknowledged from the relay.
Suppose the message is matched, the nodes would terminate the transmission procedure.
Simulation calculates packet response ratio, hop delay and average overhead, for dissimilar node
thickness with diverse size of packets. Whereas hop delay and response ratio mark practical
values, quantity of the overhead actually rises with traffic. Any other protocol have not been
compared with results of other proto cols.
.
4.14 Reception Estimation Alarm Routing (REAR) protocol (Hao et al., 2008)
The probability of reception is used as next reception selection criteria by the protocol, so REAR
does not relay the node that provides the largest progress on distance. The receipt probability is
maximized which in turn extends the coverage distance and also maintains the quick propagation.
By the means of beaconing, neighbours list containing size and position information is
12. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
12
maintained by each node. The alarm message including message propagation direction and
neighbourhood list of the sender is broadcasted by the sender, only the nodes in propagation
direction can participate in the relay node selection, its reception probability is calculated by
participant nodes, each node will wait for a contention delay that is inversely proportional to its
probability of reception. The node with the shortest contention delay will be elected as a relay and
the message is sent further in the network. For more information on the probability of reception
calculation refer to Hao et al. (2008). high reliability is shown in Simulation evaluation of this
protocol while its performance is affected by its latency delay.
5. CONCLUSION
In this paper we have analysis various broadcasting algorithms from various research papers. We
can conclude that all broadcasting algorism are considering message transmission as main motive.
But while considering this they all are unintentionally neglecting the fact. That is broadcasting
improves folding and due to that performance of the system degrades. And one more thing among
all this broadcasting protocols no one is providing any security or any technique to reduce
accidents happing at the intersection. So our emphasis for future work is to use broadcasting
technique for reducing accident at road intersection.
REFERENCES
[1] Ghassan Samara, R Sures, Wafaa AH Al-Salihy "Security Issues and Challenges of Vehicular Ad Hoc
Networks (VANET)", 4th International Conference on New Trends in Information Science and
Service Science (NISS), 2010, 393-398.
[2] Ghassan Samara, R Sures, Wafaa AH Al-Salihy "Security Analysis of Vehicular Ad Hoc Nerworks
(VANET)", Second International Conference on Network Applications Protocols and Services
(NETAPPS), 2010, 55-60.
[3] Who, W. H. (2011), World Health Organization,
http://www.who.int/roadsafety/decade_of_action/plan/en/index.html, visited on 30 Apr., 2014.
[4] M Raya, D. J., P Papadimitratos, I Aad, JP Hubaux (2006), Certificate Revocation in Vehicular
Network. Laboratory for computer Communications and Applications (LCA) School of Computer and
Communication Science, EPFL, Switzerland.
[5] Worldometers (2011), real time world statistics, www.worldometers.info, visited on 30 Apr., 2014.
[6] Ghassan Samara, WAHA Alsalihy, S Ramadass, "Increase Emergency Message Reception in
VANET", Journal of Applied Sciences, 2011, Volume 11, Pages 2606-2612.
[7] Ghassan Samara, Sureswaran Ramadass , Wafaa Alsalihy, ” Increasing Network Visibility Using
Coded Repitition Beacon Piggybacking”, World Applied Sciences Journal (WASJ), Volume 13,
Number 1, pp. 100 - 108, 2011.
[8] Ching-Yi, Y. & Shou-Chih, L. (2010) Street Broadcast with Smart Relay for Emergency Messages in
VANET. 24th International Conference on Advanced Information Networking and Applications
Workshops (WAINA), 323-328, IEEE.
[9] Qiong, Y. & Lianfeng, S. (2010) A Multi-Hop Broadcast scheme for propagation of emergency
messages in VANET. 12th IEEE International Conference on Communication Technology (ICCT),
1072-1075, IEEE.
[10] Biswas, S., Tatchikou, R., Dion, F. (2006), Vehicle-to-vehicle wireless communication protocol for
enhancing highway traffic safety, IEEE Communication Magazine, 44, 74-82, IEEE.
[11] Torrent-Moreno, M. (2007), Inter-vehicle communications: assessing information dissemination
under safety constraints, 4th Annual Conference on Wireless on Demand Network Systems and
Services, WONS '07, 59 – 64, IEEE.
[12] Torrent-Moreno, M., Mittag, P. & Hartenstein, J., Santi, H. (2009), Vehicle-to-Vehicle
Communication: Fair transmit power control for safety-critical information. Transactions on
Vehicular Technology, 58, 3684-3703, IEEE
13. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 3, June 2015
13
[13] Torrent-Moreno, M. (2007), Inter-Vehicle Communication: Achieving Safety in a Distributed
Wireless Environment-Challenges, Systems and Protocols, (Ph.D Paper), Universitatsverlag
Karlsruhe, ISBN: 978-3-86644-175-0.
[14] Füßler, H., Kasemann, M., Widmer, J., Mauve, M. & Hartenstein, H. (2003), Contention-based
forwarding for mobile ad hoc networks, Ad Hoc Networks, 1 (2003), 351-369.
[15] Briesemeister, L., Schafers, L., Hommel, G. (2000), Disseminating messages among highly mobile
hosts based on inter-vehicle communication, IEEE Intelligent Vehicles Symposium, IV 2000, 522 -
527, IEEE.
[16] Korkmaz, G., Ekici, E., Özgüner, F. & Özgüner, Ü. (2004), Urban multi-hop broadcast protocol for
inter-vehicle communication systems, first ACM international workshop on Vehicular ad hoc
network, ACM.
[17] Fasolo, E., Zanella, A., Zorzi, M. (2006), An effective broadcast scheme for alert message
propagation in vehicular ad hoc networks, IEEE Int. Conf. on Communications ICC'06,( 3960 –
3965), IEEE.
[18] Zorzi, M. & Rao, R. R. (2003), Geographic random forwarding (GeRaF) for ad hoc and sensor
networks: energy and latency performance, IEEE transactions on Mobile Computing, (349-365) ,
IEEE.
[19] IEEE (2005), White Paper: DSRC technology and the DSRC Industry consortium (DIC) prototype
team.
[20] Intelligent Emergency Message Broadcasting in VANET Using PSO.
AUTHORS
Mrs Rohini Nere [AhireMe Appear Be computer Completed her Be From S.S.V.P.S.Coe
dhue Now she is student in Mit Aoe Alandi Pune Doing her me project in Vanet In
Computer Department S.V.P.S.Coe dhue
Prof .Mrs Uma Nagaraj [Phd] Apper Me cmputer Head of the Computer department in
Mit Aoe Alandi Pune Doing her Phd Research in Vanet