Ch.Vijaya Durga et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 5, Issue No.

2, 301 - 309

An Efficient Protocol for Intelligent Transportation in Vehicular Adhoc Networks

Lecturer Department of ECE V.R. Siddhartha Engineering College, Vijayawada, A.P vijayadurga20@gmail.com

Ch.Vijaya Durga

Lecturer Department of ECE V.R. Siddhartha Engineering College, Vijayawada, A.P anithasneha6@gmail.com

A.Anitha

Dr.K.Sri Rama Krishna

Professor and Head of ECE Department of ECE V.R. Siddhartha Engineering College, Vijayawada, A.P srk_kalva@yahoo.com

IJ
I. INTRODUCTION
ISSN: 2230-7818

Abstract: Numerous local incidents occur on road networks daily, many of which may lead to congestion and safety hazards. If vehicles can be provided with information about such incidents or traffic conditions in advance, the quality of driving can be improved significantly in terms of time, distance, and safety. Vehicular Ad Hoc Networks (VANETs) have newly emerged as an effective network tool for dissemination of warning messages among the vehicles in the network about potential obstacles on the road ahead. Various Approaches of data dissemination in vehicular network can be used to inform vehicles about dynamic road traffic condition so that a safe and efficient transportation system can be achieved. However, type of VANET applications and inherent VANET characteristics such as different network density, fast movement of vehicles make data dissemination quite challenging. In this article we focus on highway scenarios, and present the design and implementation of a new distributed vehicular multihop broadcast protocol, which can operate in all traffic regimes, including extreme scenarios such as dense and sparse traffic regimes. DV-CAST is a distributed broadcast protocol that relies only on local topology information for handling broadcast messages in VANETs. It is shown that the performance of the proposed DV-CAST protocol in terms of reliability, efficiency, and scalability is excellent. The platform used for simulating the protocol is NS-2 simulator.

Keywords: Routing, Vehicular Adhoc Network, NS2

Accidents and traffic jams generate a tremendous waste of time and fuel. If the vehicles are provided with timely and dynamic information related to road traffic conditions, any unexpected events or accidents, the safety and efficiency of the transportation system can be improved with respect to time, distance, fuel consumption. VANETs are ad hoc network established among vehicles which are equipped with communication facilities. The equipped vehicles are able to communicate over the 5.9 GHz frequency band via a Dedicated Short Range Communication (DSRC) based device.

DSRC with a range of up to 1000m allows highspeed communications between vehicles. These vehicles are like a network nodes so that each node can act as the source of data, destination for data and a network router. Vehicular Ad Hoc Networks (VANET) is an effective tool for improving road Safety through propagation of warning messages among the vehicles in the network about potential obstacles on the road ahead. Data dissemination among vehicles depends on the type of assumed network architecture. In the existence of infrastructures or road side units, two data dissemination approaches are assumed: pus -based and pull-based. In the push-based approach, data is disseminated to anyone and suitable for popular data. Due to the distinct features of VANETs, different problems have been tackled by the researchers. A main part of research works has focused on designing routing algorithms. Since the wireless nodes in a VANET, i.e., vehicles are faster than nodes in a usual MANET, and the mobility patterns of vehicles are confined to road maps and thus more predictable, routing algorithms proposed for MANETs are not necessarily suitable for VANETs. Applications developed for vehicular ad hoc networks (VANETs) have very specific and clear goals such as providing intelligent and safe transport systems. Emergency warning for public safety is one application that is highly time-critical and requires an intelligent broadcast mechanism to distribute warning messages. In order to design a broadcast protocol for VANETs, one must consider two major problems: The broadcast storm problem, which occurs when multiple nodes attempt to transmit at the same time, thereby causing several packet collisions and extra delay at the medium access control (MAC) layer. The disconnected network problem, which occurs when the number of nodes in the area to help disseminate the broadcast message is not sufficient. Although both problems, especially the broadcast storm problem, are well-known in the

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES

Page 301

Ch.Vijaya Durga et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 5, Issue No. 2, 301 - 309

II. VANET PROTOCOLS

The design of efficient routing protocols for VANETs is challenging task due to the high node mobility and the movement constraints of mobile modes. VANETs, as one category of inter-vehicle communication (IVC) networks, are characterized by rapid topology changes and frequent fragmentation. Different protocols are designed for vehicular networks to eliminate the routing problems. Flooding [1] is the first broadcast protocol. In flooding mechanism all types of data is broadcasted to neighbours. Whenever another vehicle receives a broadcast message, it stores and immediately forwards it by rebroadcast. A blind flooding may result excessive redundancy, contention, and collision. These may lead to lower reachability (to the potential receiving hosts) and longer latency (for the broadcast to complete). We thus refer to this scenario the broadcast storm problem. In [3], various threshold-based techniques were proposed by Tseng et al., e.g., the counterbased, distance-based, and location-based schemes. Depending on the scheme considered, a node receiving the broadcast packet compares the predetermined threshold value with its local information, e.g., the number of duplicate packets received, the relative distance between itself and the sender, or the additional area that can be

IJ
ISSN: 2230-7818

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES
B. DSR

mobile ad hoc network (MANET) research community, so far each problem has been treated separately most of the proposed algorithms were developed to either cope with the broadcast storm problem or handle the disconnected network problem. A good routing protocol targeting safety in VANETs, however, must be able to deal with these two extreme cases in a seamless manner. Hence, the goal of this work is to design a distributed broadcast protocol, which can both mitigate the broadcast storm and maintain network connectivity in disconnected networks. A good routing protocol targeting safety in VANETs, however, must be able to deal with these two extreme cases in a seamless manner. Hence, the goal of this work is to design a distributed broadcast protocol that can both mitigate the broadcast storm and maintain network connectivity in disconnected networks. In this article we present a detailed implementation of the Distributed Vehicular Broad-CAST (DV-CAST) protocol. Unlike other existing protocols, which solve either the broadcast storm or disconnected network problem, DVCAST can handle both problems simultaneously while incurring only a small amount of additional overhead. The proposed protocol utilizes local topology information (i.e., a list of one-hop neighbours) as the main criterion to determine how to handle the rebroadcast of the message.

covered if it rebroadcasts the message. The

criteria to adaptively adjust the thresholds according to the number of neighbors were also presented by Ni et al. in [17]. The results show that, with the aid of a positioning device such as the GPS, the location-based scheme seems to offer the best performance in terms of the packet penetration rate and the link load. A. AODV The reactive routing protocol which eliminates broad storm problem is Ad-Hoc OnDemand Distance Vector (AODV) routing protocol which builds on the DSDV algorithm. The AODV is an improvement on DSDV because it typically minimizes the number of required broadcasts by creating routes on an on-demand basis, as opposed to maintaining a complete list of routes as in the DSDV algorithm. The authors of AODV classify it as a pure on-demand route acquisition system, as nodes that are not on a selected path do not maintain routing information or participate in routing table exchanges. When a source node wants to send a message to some destination node and does not already have a valid route to that destination, it initiates a path discovery process to locate the other node. It broadcasts a route request (RREQ) packet to its neighbours, which then forward the request to their neighbours, and so on, until either the destination or an intermediate node with a "fresh enough" route to the destination. AODV uses destination sequence numbers to ensure that all routes are loop-free and contain the most recent route information. Each node maintains its own sequence number, as well as a broadcast ID. The broadcast ID is incremented for every RREQ the node initiates, and together with the node's IP address. Routing protocols developed for ad hoc wireless networks use broadcast transmission to either discover a route or disseminate information. More specifically, reactive routing protocols have to flood the network with a route request (RREQ) message in order to find an optimal route to the destination. However, the conventional broadcast mechanism may lead to the so-called broadcast storm Problem. The AODV Protocol eliminates broad storm problem using weighted persistence scheme. The Packets are rebroadcasted with the probabilistic approach. The number of rebroadcasts are reduced therefore broad cast success rate is increased.

The Dynamic Source Routing (DSR) protocol is an on-demand routing protocol that is based on the concept of source routing. Mobile nodes are required to maintain route caches that

Page 302

Ch.Vijaya Durga et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 5, Issue No. 2, 301 - 309

C. SADV

SADV, which is a static-node assisted adaptive data dissemination protocol for vehicular networks. It is Different from other VANET protocols. It focuses on data delivery in large-scale and dynamic VANETs under low vehicle densities, where VADD experiences dramatic performance degradation in the packet-delivery delay, the contributions of this protocol are Deploying static nodes at intersections, which enables packets to be stored at an intersection until the optimal path (the path with the minimum expected data delivery delay to the destination) is available. The simulation shows that the proposed static-node assisted routing protocol can dramatically improve the packet-delivery performance compared with the previous protocols. Better estimate the delay of forwarding packets along each road, the static nodes are designed to be able to measure the packet-forwarding delay and propagate the link delay information. Therefore, the routing decision in each static node can adapt to the changing vehicle densities. Also use a multipath routing algorithm, which can further decrease the packet-delivery delay without an exponential increase in the protocol overhead. The SADV protocol mainly focuses on low vehicle

IJ
ISSN: 2230-7818

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES
1. Dense Traffic Regime

contain the source routes of which the mobile is aware. Entries in the route cache are continually updated as new routes are learned. The protocol consists of two major phases: (a) route discovery, and (b) route maintenance. When a mobile node has a packet to send to some destination, it first consults its route cache to determine whether it already has a route to the destination. If it has an unexpired route to the destination, it will use this route to send the packet. On the other hand, if the node does not have such a route, it initiates route discovery by broadcasting a route request packet. This route request message contains the address of the destination, along with the source node's address and a unique identification number. Each node receiving the packet checks whether it knows of a route to the destination. If it does not, it adds its own address to the route record of the packet and then forwards the packet along its outgoing links. To limit the number of route requests propagated on the outgoing links of a node, a mobile only forwards the route request if the request has not yet been seen by the mobile and if the mobile's address has not already appeared in the route record. A route reply is generated when either the route request reaches the destination itself, or when it reaches an intermediate node that contains in its route cache an unexpired route to the destination. The DSR protocol eliminates the disconnected network problem that occurred in sparse traffic regimes.

densities i.e. in sparse regime So that it eliminates disconnected network problem. III. DV-CAST PROTOCOL To the best of our knowledge, however, there is no prior study that can handle both the disconnected network and broadcast storm problems in a seamless manner via a distributed routing protocol for highway VANET scenarios. Our work fills this gap by designing a fully distributed new VANET broadcast protocol known as DV-CAST. Unlike existing studies, the proposed DV-CAST protocol can suppress the broadcast storm in a dense VANET environment in addition to routing in a sparsely connected VANET. The algorithm relies only on GPS information of the one-hop neighbors and does not require any centralized node or maps. The motivation for using the local topology information in our framework is to minimize the additional network overhead and keep the complexity of the protocol to a minimum. A. Different Traffic regimes in VANET

The previous research has identified two extreme regimes of operation in VANETs: dense traffic and sparse traffic. In order to design a good broadcast routing protocol that is robust enough to operate in any type of vehicular traffic conditions, it is important to understand the characteristics of these two regimes. In the following, we give a brief overview of these regimes based on our previous work [4, 9].

When the traffic density is above a certain value, one of the most serious problems is the choking of the shared medium by an excessive number of the same safety broadcast message by several consecutive cars. Because of the shared wireless medium, blindly broadcasting the packets may lead to frequent contention and collisions in transmission among neighboring nodes. This problem is sometimes referred to as broadcast storm problem [3]. While multiple solutions exist to alleviate the broadcast storm problem in a usual MANET environment [36], only a few solutions exist for resolving this issue in the VANET context [1, 7, and 8]. In [1], we (i) explore how serious the broadcast storm is in VANET using a case Study for a four-lane highway scenario; and (ii) propose three light-weight broadcast techniques; i.e., weighted p-persistence, slotted 1-persistence, and slotted p persistence, which can provide 100% reachability in a well-connected network and up to approximately 70% reduction in the broadcast redundancy and packet loss ratio on a wellconnected vehicular network. The proposed

Page 303

Ch.Vijaya Durga et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 5, Issue No. 2, 301 - 309

2. Sparse Traffic Regime

The other extreme scenario, which is very troublesome for conventional routing protocols. In this case there are very few vehicles on the road. For instance, the traffic density might be so low at certain times of the day (e.g., late night or early morning) that multihop relaying from a source (the car trying to broadcast) to cars coming from behind might not be plausible because the target node might be out of the sources transmission range. To make the situation worse, there might be no cars within the transmission range of the source in the opposite lane either. Under such circumstances, routing and broadcasting becomes a challenging task. While several routing techniques address the sparsely connected nature of mobile wireless network, (e.g., epidemic routing [2], single-copy [1], multi-copy Spray and Wait [5]), there are only a few studies that considered a VANET topology [68]. In this paper, we propose to cope with such extreme cases via the so-called store-carry forward mechanism. Our results show that depending on the sparsity of vehicles or the market penetration rate of cars using Dedicated Short Range Communication (DSRC) technology, the network re-healing time, which captures the delay that incurs in delivering messages between disconnected vehicles, can vary from a few seconds to several minutes. This suggests that, for vehicular safety applications, a new ad hoc routing protocol will be needed as conventional ad hoc routing

IJ
ISSN: 2230-7818

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES
C. Design Principle

schemes are distributed and rely on GPS information (or received signal strength when the vehicle cannot receive GPS signal), but do not require any other prior knowledge about network topology. Specifically there are three distance based Schemes: i) Weighted p-Persistence scheme ii) Slotted 1-Persistence scheme iii) p-Persistence scheme The basic broadcast techniques follow either a 1-persistence or a p-persistence rule. Despite the excessive overhead, most routing protocols designed for multi-hop ad hoc wireless networks follow the brute-force 1 persistence flooding rule which requires that all nodes rebroadcast the packet with probability 1 because of the low complexity and high packet penetration rate. Gossip-based approach, on the other hand, follows the p-persistence rule which requires that each node re-forwards with a pre-determined probability p. This approach is sometimes referred to as probabilistic flooding [9]. The slotted ppersistence scheme can substantially reduce the packet loss ratio at the expense of a slight increase in total delay and reduced penetration rate.

B. Design Goal

A broadcast protocol for vehicular ad hoc wireless networks should be reliable, robust, and bandwidth efficient. More specifically, the protocol should be able to distribute broadcast information to all intended recipients of the message. In addition, it should be robust against all possible traffic conditions, e.g., light traffic, moderate traffic, traffic jam. Last but not least, it should incur low overhead especially when operating in a traffic jam condition. In designing DV-CAST protocol, the following assumptions were made. First, we assume that the infrastructure is not available in the network considered. This is a reasonable assumption as we envision that it would take years to utilize such infrastructures as automotive and telecommunication industries have to cooperate. To enable communication in VANET, we assume that each vehicle, which has a Global Positioning System (GPS) and a wireless communication device, periodically sends out beacon messages (hello messages) to its neighbors at a default frequency of 1 Hz. While periodic beaconing is an aggressive approach which is clearly not bandwidth efficient, it is a necessary mechanism for many safety applications in VANET. We, finally, assume that not every vehicle is a member of a specific VANET due to the market penetration factor, i.e., not every vehicle has a wireless communication device.

We propose to use a per-hop routing based approach which uses only local connectivity information (1-hop neighbor topology) to make a routing decision. The motivation for using local connectivity in the broadcast protocol design is to ensure the maximum reachability of the broadcast message. In addition, other safety applications also

protocols such as DSR or AODV will not work with such long re-healing times. For both sparse and dense traffic scenarios, all vehicles operating in these two extreme regimes observe the same local topology, which also reflects the real global topology. However, it is possible that both of these two traffic conditions may coexist in the same network; for example, traffic is normally congested at a merging section on the highway, but flows smoothly beyond the merging point. Hence, it is possible that in such cases, not every vehicle sees the same local topology; some may have very few neighbors while some have many neighbors. In this case some vehicles will have to apply the broadcast suppression algorithm while others will have to store-carry-forward the message in order to preserve the network connectivity.

Page 304

Ch.Vijaya Durga et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 5, Issue No. 2, 301 - 309

Vehicles may be able to cooperatively exchange the topology information in order to estimate the traffic density. However, this

approach may incur high overhead and

IJ
1. Protocol Parameters
ISSN: 2230-7818

consume a lot of bandwidth. Therefore, using global topology information might not be appropriate if smart infrastructure is not available.

Global topology information may be collected and disseminated by the existing infrastructure, e.g., Road Side Units (RSU), smart traffic lights, smart traffic cam, etc. However, deployment of these infrastructure units may not be possible since communications in VANET can take place anywhere, on any road or highway, so the area of interest in VANET could be quite large. In addition, what is more important for the protocol is the effective traffic density which is the density of the vehicles that are equipped with wireless communication devices; therefore, the traffic density as detected by these infrastructure units may not be helpful.

In particular, each vehicle should be able to determine the three pieces of information that are the main input parameters to the DV-CAST protocol: Destination flag (DFlg), which determines whether a car is the intended recipient of the message Message direction connectivity (MDC), which determines whether a car is the last vehicle in the group/cluster (or whether there is any next-hop neighbor moving in the same direction that will be responsible for reforwarding the message). Opposite direction connectivity (ODC), which determines whether a car is connected to at least

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES

3. Neighbour Detection Mechanism

The most essential module in DV-CAST is the neighbor detection mechanism, as the routing action taken by the protocol depends mainly on the local connectivity information. Upon receiving the hello or data packet from the neighbor, each vehicle has to compare its GPS information against the neighbours GPS Information and determine whether the neighbor is moving in the same direction or in the opposite direction. In addition, neighbors moving in the same direction must also be further categorized into leading vehicle or following with such long re-healing times. This article addresses the detailed implementation of the distributed store-carry-forward mechanism, while [3] introduces only the concept of the mechanism. D. Broadcast Suppression Algorithm A mobile node performs a broadcast suppression when it is in a dense traffic regime with at least one neighbor in the broadcast direction. In [12] we explore how serious the broadcast storm is in VANETs using a case study for a four-lane highway scenario and propose three lightweight broadcast techniques (i.e., weighted ppersistence, slotted 1-persistence, and slotted ppersistence), which can provide 100 percent reachability in a well connected network and up to approximately 70 percent reduction in the broadcast redundancy and packet loss ratio in a well connected vehicular network. The proposed

rely on these beaconing messages; therefore, the local connectivity is already a given piece of information which the routing protocol can utilize. We claim that the local topology information is sufficient for proper handling of the broadcast packet. Other information such as global topology (traffic volume/ density, or a more comprehensive n-hop neighbors topology, where n > 1) may be useful for designing a hierarchical protocol. For example, one possible approach is to use the available global information to identify which of the three traffic regimes one is operating in and then augment that with local information that can be obtained via broadcasting periodic hello messages. The coarse information could, in principle, reduce/eliminate the use of periodic hello messages in the dense traffic regime, thus saving bandwidth. However, this approach may not be practical in the early deployment period due to the following reasons:

one vehicle in the opposite direction? Although additional information such as a neighbours local topology might also help to improve the performance of the protocol, obtaining such information also implies an increase in network overhead. Hence, we claim that these three flags provide the necessary knowledge about the local topology information, which is sufficient for DVCAST to determine how to handle the broadcast packets and achieve acceptable performance. 2. Routing Rules In order to handle the broadcast message properly, we propose that each vehicle follows two basic routing rules: i) If DFlg is set to 1, vehicle should ignore any duplicate broadcast or follow the diagram in Figure 5 if the message is received for the first time. ii) If DFlg is set to 0, vehicle is a relay node and should follow the routing diagram. Depending on the level of the local connectivity that the vehicle experiences, we propose three different courses of action that the vehicle should follow in order to properly handle the broadcast packet.

Page 305

Ch.Vijaya Durga et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 5, Issue No. 2, 301 - 309

schemes are distributed and rely on GPS information, but do not require any other prior knowledge about network topology. In this article we propose to use the weighted p-persistence scheme introduced in [12] in the final design of the protocol to handle the broadcast storm problem. E. Store-carry-forward Technique In a sparse network we propose to cope with such an extreme situation via the so-called store carry forward mechanism [3]. Our previous results show that depending on the sparsity of vehicles or the market penetration rate of cars using dedicated short range communication (DSRC) technology [17], the network delay incurred in delivering messages between disconnected vehicles via the store-carry-forward mechanism can vary from a few seconds to several minutes. This suggests that a new ad hoc routing protocol will be needed as conventional ad hoc routing protocols such as Dynamic Source Routing (DSR) or Ad Hoc On-Demand Distance Vector Routing (AODV) will not work with such long re-healing times. This article addresses the detailed implementation of the distributed store-carry-forward mechanism, while [3] introduces only the concept of the mechanism. In the following section we describe in detail the implementation of DV-CAST, which consists of these key routing components. IV. KEY ROUTING COMPONENTS

A key component of DV-CAST is the neighbor detection mechanism, which provides the protocol with local topology information? To simplify the problem, we focus on a highway topology with traffic travelling in two opposite directions. Let us consider a typical scenario where a source vehicle or a roadside unit (RSU) broadcasts a warning message to approaching vehicles. In general, the message would be beneficial to vehicles following the source vehicle or vehicles moving toward the RSU, while the message will most likely be irrelevant to vehicles moving in the opposite direction. For this work, we assume that the broadcast application can specify the Region of Interest (ROI) or the broadcast region where the intended recipients of the message are located. This ROI information will be tagged along with the routing message and will also be used along with the one hop neighbor information in order to determine how the message should be handled.

receiving the broadcast message, a vehicle in this regime should apply one of the broadcast suppression techniques previously presented in [12]. For example, if the slotted 1-persistence scheme is employed, each vehicle in this neighbourhood will use the relative distance information calculated by using the sources information available in the packet header to determine the necessary back off time, which is typically less than 100 ms. If the vehicle does not hear any rebroadcast of the same packet during this back off period, it should rebroadcast the packet when this back off timer expires. However, if it overhears the rebroadcast from its neighbor, it should cancel the pending rebroadcast and go back to the IDLE state. Observe that information regarding neighboring vehicles in the opposite direction is not relevant in this case. In particular, vehicles that are in a well connected neighbourhood assume that they are operating in a dense traffic regime, regardless of the actual global traffic condition. That is, a vehicle whose MDC flag is 1 will behave as if it is in a dense traffic regime, and it will apply the broadcast suppression algorithm regardless of the global traffic condition, which may be dense or sparse. It is expected that all vehicles will be in a well connected neighbourhood during rush hours, while only a fraction of vehicles will be in a well connected neighbourhood under normal or light traffic conditions. According to Fig. 1, each vehicle in Group 1, except for A which is the last vehicle in the group/cluster (MDC = 0), upon receiving the broadcast message from S, will have the following flags <MDC = 1, ODC = 1/0, DFlg = 1> (ODC can either be 1 or 0). Vehicles in group 3 except for B will also have similar flags, <MDC = 1, ODC=1/0, DFlg = 0>. Each vehicle from both groups except for A and B will apply the broadcast suppression algorithm presented in [2]. B. Sparsely-Connected Neighbourhood A vehicle is operating in a sparse traffic regime if it is the last node in a cluster. Furthermore, a vehicle in this regime is said to be in a sparsely connected neighbourhood if there is at least one neighbor in the opposite direction as in the case of vehicles A and B in Fig. 3b and 3c. The parameters for these vehicles should be set to <MDC = 0, ODC = 1, DFlg = 0/1>. Upon receiving the broadcast message, these vehicles can immediately rebroadcast. However, if the vehicle is moving in the same direction as the source, as in the case of vehicle A whose DFlg is set to 1, it can go back to an IDLE state after the rebroadcast. On the other hand, a vehicle whose DFlg is 0, as in the case of vehicle B, has to make a transition to the WAIT II state where it waits until the packet timer expires or it can rebroadcast the packet back in the

IJ
A. Well-Connected-Neighbourhood
ISSN: 2230-7818

A vehicle is said to be in a well connected neighbourhood if it has at least one neighbor in the message forwarding direction (MDC = 1). Upon

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES

Page 306

Ch.Vijaya Durga et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 5, Issue No. 2, 301 - 309

original message forwarding direction. Similar to the previous case, vehicles in a sparsely connected neighbourhood assume that they are operating in a sparse traffic regime regardless of the actual global traffic condition. In order to get a better understanding of how to handle the broadcast packet in this case, below we use the two scenarios shown in Fig.2 and 3 as an example.

Fig.1 <MDC=1, ODC=1, DFlg=1>

the vehicle remains in the region of interest. Hence, the packet expiration time is typically on the order of several seconds to a few minutes. After the rebroadcast, if B comes into contact with vehicles in Group 2, B will rebroadcast and go into the WAIT II state again. This time, however, B will have to wait for an implicit acknowledgment that this is the rebroadcast of the message with greater hop count and go into the IDLE state.1 However, if the gap between group 1 and group 2 is very large, B will likely be out of the broadcast region (ROI) and drop the packet before it reaches group 2. Vehicles A and B will rebroadcast and go into the WAIT II state. Since group 3 is connected to both group 1 & 2, both A and B will hear a rebroadcast with greater hop count and will make a transition into the IDLE state. C. Totally Disconnected Neighbourhood

Fig.2 <MDC=0, ODC=1, DFlg=1>

Fig.3 <MDC=0, ODC=1, DFlg=1>

IJ
ISSN: 2230-7818

Fig.4 <MDC=0, ODC=0, DFlg=1>

Vehicles A and B are neighbors, and may receive the broadcast from S at the same or different times. Since A is aware of the presence of B, it will simply rebroadcast and make a transition to the IDLE state. On the other hand, the status of B will be <MDC = 0, ODC = 1, DFlg = 0>, so it will have to immediately rebroadcast. After the rebroadcast, it transits to the WAIT-II state and holds on to the message until it detects a new neighbor vehicle in the opposite direction or the packet timer expires. The packet expiration time is a very important parameter for a relay node whose DFlg is set to 0, as it is the maximum time a relay node has to hold on to the message. The value used for this parameter depends on many factors, such as the maximum time the relay node is willing to store the packet, the message lifetime, or the expected time

A vehicle operating in a sparse traffic regime is said to be in a totally disconnected neighbourhood if it has no neighbor in the message forwarding direction and is not connected to anybody in the opposite direction (i.e., MDC = ODC = 0). In this case the disconnected vehicle, vehicle A in Fig. 4 should hold on to the broad- cast message until it can delegate the broadcast responsibility to a vehicle in the opposite direction or to a more suitable vehicle moving in the same direction, but no longer than the packet expiration time. According to Fig. 4 A is disconnected from group 3 and group 2. The flags should be set to <MDC = 0, ODC = 0, DFlg = 1>. For this scenario, A will have to go to the WAIT I state and wait for the hello packet from vehicles in group 3 or a vehicle in group 2 who may have caught up with group 1 while A is in the WAIT I state. Once B moves into As range, the ODC flag of A will be changed to 1, and A will immediately rebroadcast. Vehicle B, according to Fig. 3d, may or may not have heard the broadcast message when it receives the rebroadcast from A. However, since DFlg of B is 0, it will always help to relay the message. Therefore, when B receives the broadcast message from A it will have the following flags; <MDC = 0, ODC = 1, DFlg = 0>. Note that it is likely that vehicles in a dense traffic regime will only be in a well connected neighbourhood, and every vehicle will have to use the broadcast suppression mechanism. On the other hand, most vehicles in a sparse traffic regime will be in either a sparsely connected or totally disconnected neighbourhoods. so they will have to resort to the store-carryforward mechanism. However, vehicles operating in a normal traffic regime may be in any of these three neighbourhoods, so each vehicle in this traffic regime can take any of the three different actions to handle the broadcast packet.

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES

Page 307

Ch.Vijaya Durga et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 5, Issue No. 2, 301 - 309

V. NETWORK PERFORMANCE The network performance of the novel DVCAST protocol under various traffic conditions (i.e., heavy vehicle traffic condition, representing a well connected network, and a light vehicle traffic condition, which corresponds to the disconnected network case) previously discussed in [7]. The protocol is implemented on an ns-2 (version 2.29.1) platform and tested against a realistic highway mobility pattern with a Ricean fading propagation model with K factor equal to 1 and the 802.11a MAC protocol. A. NS2 Tool The protocol is simulated on ns2 tool. Ns2 tool is combination of OTCL (Object Oriented Tool Command Language) and C++ languages. In OTCL we have to create the nodes, create the topology and data is transferred between nodes. Finally the protocol is implemented using C++ language. To compile the OTCL file we gee the TRACE file. Using Gnu plot we can draw the simulation results. B. Experimental Results

b. Time required disseminating the broadcast message to nodes that are 10 km away. Fig 5. Broadcast statistics at various traffic densities

IJ
ISSN: 2230-7818

A
Fig 6. Average per-gap rehealing time. VI. CONCLUSION In this article we present a review on design and implementation of a DV-CAST protocol on highways under multiple traffic conditions. Since the protocol is designed to address how to deal with extreme conditions such as heavy traffic during rush hours, very light traffic during certain hours of the day and low market penetration rate of cars using DSRC technology, DVCAST performs well in every aspect considered and is robust against various extreme traffic (a) Packet loss ratio in VANET
@ 2011 http://www.ijaest.iserp.org. All rights Reserved. Page 308

ES

Ch.Vijaya Durga et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 5, Issue No. 2, 301 - 309

conditions. Our current research efforts are focused on simulating the protocol on NS2 simulator using circular scenario. For future work, it would be interesting to see how much of the underlying design principles of DV-CAST would also be applicable to urban areas. REFERENCES
[1]R. C. Shah et al., Data MULEs: Modeling and Analysis of a Three-tier Architecture for Sparse Sensor Networks, Elsevier Ad Hoc Net. J., vol. 1/23, Sept. 2003, pp. 215333. [2] A. Vahdat and D. Becker, Epidemic Routing for Partially Connected Ad Hoc Networks, tech. rep. no. cS- 200006, Duke University, Apr. 2000. [3] L. Briesemeister and G. Hommel, Role-Based Multicast in Highly Mobile but Sparsely Connected Ad Hoc Networks, Proc. ACM MobiHoc, Boston, MA, Aug. 2000, pp. 4550 [4] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, SingleCopy Routing in Intermittently Connected Mobile Networks, 1st IEEE SECON 04, Oct. 2004, pp. 23544. [5] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks, Proc. 2005 ACM SIGCOMM Wksp. Delay-Tolerant Net., Philadelphia, PA, Aug. 2005, pp. 25259. [6] Z. D. Chen, H. T. Kung, and D. Vlah, Ad Hoc Relay Wireless Networks over Moving Vehicles on Highways, Proc. ACM MobiHoc, Long Beach, CA, Oct. 2001, pp. 24750. [7] N. Wisitpongphan et al., Routing in Sparse Vehicular Ad Hoc Wireless Networks, IEEE JSAC, vol. 25, no. 8, Oct. 2007, pp. 153856. [8] O.K. Tonguz, W. Viriyasitavat, and F. Bai, Modelin Urban Traffic: A Cellular Automata Approach, IEEE Commun. Mag., vol. 47, no. 5, May 2009. [9] G. Korkmaz, E. Ekici, and F. Ozguner, An Efficient Fully Ad-Hoc multihop Broadcast Protocol for Inter-Vehicular Communication Systems, Proc. IEEE ICC, Istanbul, Turkey, June 2006, pp. 42328. [10] G. Korkmaz et al., Urban multihop Broadcast Protocol for Inter-Vehicle Communication Systems, Proc. ACM VANET, Philadelphia, PA, Oct. 2004. [11] J. Zhao and G. Cao, VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks, Proc. IEEE INFOCOM, Apr. 2006, pp. 112. [12] N. Wisitpongphan et al., Broadcast Storm Mitigation Techniques in Vehicular Ad Hoc Networks, IEEE Wire-less Commun., vol. 14, no. 6, Dec. 2007, pp. 8494. [13] S. Ni et al., The Broadcast Storm Problem in a Mobile Ad Hoc Network, Proc. ACM MobiCom, Seattle, WA, 1999, pp. 15162. [14] S. Ni, Y. Tseng, and E. Y. Shih, Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network, Proc. IEEE 21st ICDSC, 2000, pp. 48188. [15] C. Hu, Y. Hong, and J. Hou, On Mitigating the Broadcast Storm Problem with Directional Antennas, Proc. IEEE ICC, vol. 1, Seattle, WA, May 2003, pp. 10410. [16] A. Laouiti, A. Qayyum, and L. Viennot, Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks, IEEE 35th Annual Hawaii Intl. Conf. Sys. Sci., 2001, pp. 386675. [17] S. Ni, Y. Tseng, and E. Y. Shih, "Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network," in IEEE conference.

IJ
ISSN: 2230-7818

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES
Page 309