- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

International Journal of Distributed Sensor Networks

Volume 2013 (2013), Article ID 586193, 14 pages

http://dx.doi.org/10.1155/2013/586193

## VCAST: Scalable Dissemination of Vehicular Information with Distance-Sensitive Precision

Department of Computer Science and Electrical Engineering, West Virginia University, Morgantown, WV 26506, USA

Received 12 April 2013; Revised 31 July 2013; Accepted 13 September 2013

Academic Editor: Chunming Qiao

Copyright © 2013 V. Kulathumani et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Real-time information about the state (location, speed, and direction) of other vehicles in the system is critical for both safety and navigation applications in future intelligent transportation systems. However, reliably obtaining this information over multiple hops in a capacity constrained, contention-prone wireless network poses a significant challenge. In this paper, we describe an algorithm *VCAST* that addresses this challenge by exploiting a notion of *distance sensitivity in information propagation*, in which information is forwarded at a rate that decreases linearly with distance from the source. By doing so, the required communication overhead per node can be significantly reduced, thereby reducing channel contention, allowing higher information supply rates, and scaling to larger network sizes. *VCAST* can be used to improve safety against collisions and to enable dynamic routing and navigation techniques by providing aggregate traffic information in an extended neighborhood. The performance of *VCAST* is validated using extensive ns-3 simulations under different network sizes and densities with an IEEE 802.11b transmission model and the advantages of *VCAST* in comparison to non-distance-sensitive approaches are highlighted.

#### 1. Introduction

Infrastructureless, vehicle-to-vehicle (V2V) wireless communication is expected to be the basis for both safety and navigation applications in future intelligent transportation systems [1, 2]. Examples of safety applications in transportation scenarios include collision warnings, guidance on lane change and lane merge, and stopped vehicle alert. Examples of intelligent navigation applications include dynamic travel-time computations and rerouting based on real-time traffic information. A building block for all these applications is a real-time vehicular traffic mapping system on board every vehicle, which portrays information about current position of other vehicles in its vicinity and provides guidance about accidents, approaching emergency vehicles and traffic congestion over an extended neighborhood. In this paper, we design *VCAST*, a scalable, infrastructureless, peer-to-peer wireless network service for computing such a real-time traffic map over a given region surrounding each vehicle (This paper is a significant extension of a shorter version that appeared in IEEE VTC 2012 [3]. The specific additions are as follows. (1) Simulations are carried out in ns-3 using an IEEE 802.11 b transmission model to quantify the impact of network size, vehicular density, vehicular mobility, and time-varying intervehicular separations on the achievable staleness. (2) The average communication cost incurred by each vehicle is quantified. (3) The performance is compared analytically and using simulations with schemes that do not incorporate distance sensitivity, and the significant impact on scalability using* VCAST* is highlighted. (4) Complete proofs are included for all lemmas and theorems).

We assume that vehicles are equipped with a differential GPS that can estimate its location to an accuracy of about 1-2 m. As a result, by advertising this information, vehicles can learn about traffic within a one hop communication range. However, estimating traffic maps over a large area using multihop wireless communication is a much more challenging task. (1) Firstly, we note that forwarding each vehicle’s information over multiple hops at a constant rate is unlikely to be scalable as it will cause the amount of communication required at each vehicle to grow with the number of vehicles in the region over which traffic information is required. As a result, both the allowable broadcast rate and the accuracy of the traffic map obtained at each vehicle will decrease as vehicular density and size of the region increase. *Hence effective forwarding algorithms need to be designed to ensure that the system remains scalable with vehicular density, information supply rate, and region size.* (2) Secondly, there exist tradeoffs in choosing the rate and communication range of each broadcast. While higher broadcast rates and range promise greater tracking accuracy, in reality wireless channel contention can cause an adverse effect in tracking accuracy as these levels exceed a certain limit. Existing broadcast techniques for vehicular safety systems have primarily focused on balancing transmission rate and communication range to maximize the reliability of single hop wireless communication. However, in such an approach information about other vehicles is available only when intervehicular distance is too small which may not be enough to avert a collision [4] or to provide a timely re-route in the presence of traffic congestion. On the other hand, increasing the single-hop communication range or moving to multihop forwarding techniques to learn about vehicles in a larger area quickly decreases the achievable information supply rate from each vehicle (even those at smaller distances). * Hence, there remains a need for multihop broadcasting techniques that are able to supply timely information over large distances without compromising on data supply rates at smaller distances.*

*Contributions.* To address the above challenges and to ensure scalability when providing traffic maps over large regions in real time, we exploit a notion of* distance sensitivity* in propagating individual vehicle information: information about each vehicle is propagated at a rate that decreases linearly with the distance from the vehicle [5, 6]. The rationale behind exploiting distance sensitivity is that the reaction time available to a vehicle for taking safety actions or for computing new routes towards the destination is lesser with respect to the state of nearby vehicles than that of farther vehicles. * VCAST* maps this distance-dependent reaction time into delivery of information with quality that progressively decays as a function of distance.

We use staleness in vehicular state information as a metric for information quality as it reflects how old the current information about a particular vehicle is and show that traffic information in * VCAST* can be obtained with a worst-case staleness that is bounded by where is the distance from the source of the information. Thus,* VCAST* provides traffic information with * distance-sensitive precision* in which the error does not grow with the number of vehicles in the region and is independent of traffic density and network size. At the same time, the average communication cost (the required transmission rate at each node) also is only bounded by , where is the broadcast rate at the source. Lower communication overhead per node ensures lower channel contention and higher source broadcast rates, thus benefiting information supply at smaller distances. * VCAST* can be used to propagate actual vehicle location as well as to propagate aggregate traffic information such as average speed and density of vehicles over individual traffic * cells* inside a region. One possible scenario is to propagate actual vehicle location up to a distance of 500–1000 m and aggregate traffic information up to several miles. When propagating only aggregate cell information, we note that the required communication rate per node decreases further by a factor , where is the radius of each aggregation cell.

The performance of * VCAST* is validated using extensive simulations in ns-3, a discrete event simulator for wireless networks, under different network sizes, network densities, source broadcast rates, and communication ranges. The results of our evaluation show that, by using distance-sensitive forwarding, * VCAST* is able to scale to larger network sizes as well as support much higher broadcast rates compared to non-distance-sensitive techniques. The reason for scalability was shown to be the significantly lower message overhead which reduces the channel contention in the network. We have also characterized the performance of * VCAST* under severe random mobility and studied information staleness when aggregated data is transmitted as opposed to individual vehicle information.

*Impact.* By forwarding traffic information over multiple communication hops, we expect several advantages: (1) vehicle location over a vicinity will be available even if the communication range is extremely low because of high density, thus improving vehicular safety, (2) information about approaching emergency vehicles will be available, (3) information about lane changing and merging vehicles will be available even if they are outside a single communication range, and (4) information about road blocks, accidents, and impending congestion will be available from several miles ahead, thus permitting higher level applications that dynamically re-route based on this information. Some of these scenarios, from a vehicular safety perspective, are illustrated in Figure 1. To achieve scalability, * VCAST* provides traffic information with an accuracy that degrades with distance, but we expect this to be a reasonable condition that is still sufficient for both vehicular safety and intelligent navigation. Finally, we note that * VCAST* does not require any special hardware or modification to vehicular transmission standards; instead, it can simply piggyback on the proposed * Here I am* communication [1, 2] for vehicular networks.

*Outline of the Paper*. In Section 2, we describe related work. In Section 3, we describe our system model, the *VCAST* algorithm, and provide an analysis for the expected accuracy and communication cost. In Section 4, we evaluate the performance of our system in simulations. In Section 5, we present conclusions and state future work.

#### 2. Related Work

The design of routing protocols for vehicular ad hoc networks and more generally in mobile ad hoc networks is a well-researched topic and a good survey of these techniques can be found in [7–9]. Many of these protocols have focused on delivering aperiodic, low bandwidth data such as emergency vehicle information to either a single vehicle (unicast) or a group of vehicles in a geographic region (geocast) with low latency [10–17]. On the other hand, the focus in this paper is on broadcasting information from each vehicle at high rates to support the design of safety and navigation applications.

The design of wireless broadcast protocols has also received a lot of research attention lately [1, 18–22] in the context of vehicular safety applications. There have been several recent papers that have focused on the problem of balancing broadcast range and reliability so as to maximize the number of successful receptions in close proximity of the sender [18–21]. A common foundation in these papers to handle the tradeoff is to reduce the communication range in regions of high density so as to improve the reliability of reception. However, these papers mainly focus on reliable one-hop message reception and not on multihop propagation. As a result, the information about vehicles outside the communication range is not available even when the range has to be very low because of high density. The trade-off in single-hop broadcast schemes is that a higher communication range causes larger staleness even for nearby vehicles, while a lower communication range prevents information availability from beyond that range. On the other hand, the algorithm developed in this paper can be used to propagate both individual vehicle information and aggregate traffic information over several communication hops and yet retain high data supply rates at smaller distances.

We also note that rate and power control algorithms [1, 18–21] developed for a single hop vehicular broadcast are complementary and can be used in conjunction with the distance-sensitive multihop forwarding algorithm designed in this paper. Thus decisions on source broadcast rate and range can be made commensurate with traffic density using the techniques proposed in [1, 18–21], and * VCAST* can be used to aggregate and forward this information over multiple hops.

Multihop broadcast algorithms [23–29] for vehicular networks have mainly focused on the choice of optimal forwarding vehicles and on the reduction of redundant forwarding vehicles using one of several heuristics proposed in [30]. A good survey of multihop broadcast techniques in mobile ad hoc networks is presented in [31]. The idea of distance-sensitive broadcasting rates developed in this paper for ensuring scalable all-all information broadcast has thus far not been explored in the context of mobile ad-hoc and vehicular networks. The improvement in communication overhead gained by exploiting distance sensitivity is characterized in Section 3.3.

The concept of distance sensitivity has previously found applications in several other networking fields in different forms. For example, route aggregation in the Internet utilizes this concept for efficiently distributing routing information [32]. Fisheye routing [33] uses this idea to propagate routing tables in mobile ad hoc networks. Fractionally cascaded information [34] is a form of distance-sensitive key sharing that is widely used for speeding up traversal of data structures. Distance sensitivity has also been used in wireless sensor network based querying and tracking applications to model communication latency and information quality as functions of distance [35–38]. In the context of network-wide continuous broadcast of system states, an algorithm has been designed in [39] for supplying global state information to all nodes in a static sensor network with distance-sensitive latency and error. In this paper, we show that distance sensitivity is a valuable tool for efficient and scalable propagation of state information even for * networks of mobile nodes (vehicles)*. Unlike the algorithm in [39], we design * VCAST* without assuming an underlying clustering or routing structure, thus avoiding the need for maintenance related communication.

#### 3. System Description

In this section, we first state the system model and objective. We then describe * VCAST* and analytically characterize its accuracy and required communication rate.

##### 3.1. System Model and Problem Statement

We model the vehicular network as a large geographic area with multiple traffic flows, each with potentially different traffic densities at different places. Let denote the maximum density, that is, the maximum number of vehicles per unit area at any time in the whole region. Note that the geographic area will consist of regions with no traffic flows (i.e., no roads), as well as regions with high density traffic flows. When analyzing the impact of aggregation, we assume that the region is partitioned into geographic *cells* which allow representation of aggregated traffic information for that cell. The cells need not be of the same size, but for ease of explanation we assume that the area of each cell is constant and equal to with a radius of . In a realistic environment, these cells could be used to model critical traffic links such as the traffic in a region between two highway exits or traffic between two urban streets. Let denote the single hop communication range for a vehicle. The objective of our system is to provide each vehicle with information about all vehicles and all cells within a radius around itself where . We call this area of radius around each vehicle the * tracking zone *(We note that our system can also be specialized to propagate individual vehicle information within a smaller radius than aggregate cell information).

Let denote the maximum number of vehicles within the tracking zone of each vehicle. Thus . Let denote the maximum number of cells in a radius of around each vehicle. Thus . Note that by using a two dimensional model for the vehicular network, the bounds on communication cost in our analysis are expected to hold for dense urban traffic scenarios as well as highway traffic scenarios in which the number of vehicles is expected to be lower.

Let denote the frequency at which each vehicle broadcasts its own information. Let denote the geographic distance between vehicles and . Let denote the distance between vehicle and cell in terms of the smallest number of cells traversed to reach cell from . In the following subsections, we first describe * VCAST* assuming that only vehicle location is propagated up to a distance . Then we describe the required changes when aggregate * cell* information is propagated. The communication cost and accuracy for both these cases are characterized in Section 3.3.

##### 3.2. Distance-Sensitive Broadcast Algorithm

A naive technique would be to require each vehicle to obtain information about all vehicles in its tracking zone at a constant interval of seconds. However, in such a scenario each vehicle would have to broadcast information about at most vehicles at Hz, making the required communication rate at each node per unit time . Note that the required communication rate grows with the number of vehicles in the region and is therefore directly proportional to the vehicle density and the area of the region. Also if denotes the allowable wireless channel transmission capacity at a node in bits per second, we observe that the allowable broadcast rate is limited by , that is, inversely proportional to the number of vehicles. This in turn has an adverse effect on the latency with which traffic information is obtained and as a result the accuracy of the obtained traffic map information decreases with increasing vehicular density, which is not desirable.

To address these drawbacks, we propose to forward information about a vehicle at a rate that is proportional to the distance from that vehicle. Also, in * VCAST*, a vehicle suppresses forwarding of information about a vehicle in an interval, if some other vehicle has already forwarded information about the respective vehicle in that interval. By doing so, we show that the communication cost can be significantly reduced, leading to scalability. A more formal description of *VCAST* is presented below. A pseudocode in guarded command notation [40] is provided in Algorithm 1, which shows the program at each vehicle in the form of pairs.

In *VCAST*, each vehicle maintains a list of vehicles that are within a distance from itself. Associated with each vehicle is the location of as most recently heard by , a timestamp associated with the location and which is the number of times information about has been heard since the last broadcast interval. A timer is fired at each vehicle every seconds for broadcasting information and a randomness is introduced in this interval because of CSMA based transmission. Let denote the timer sequence at vehicle . Let denote the set of vehicles whose information is forwarded in the interval number at vehicle . is initially set to be equal to . Thus information about itself is broadcasted by a vehicle in every interval along with the current time which serves as the timestamp for this record. Node is added into the set only if and if information about has not been broadcasted by any other vehicle within ’s range in the last intervals. This ensures that information about nodes at a distance of communication hops is broadcasted at most once every interval in each communication neighborhood. In the presence of channel interference, we note that nodes may occasionally duplicate the transmission of information of a vehicle within a neighborhood. But we expect this to cause a much smaller overhead when compared with all nodes transmitting. Finally, whenever information about a vehicle is heard by a node , it is added to the list if the timestamp of the incoming record is more recent than .

For the case where aggregate traffic information is to be propagated, each vehicle computes summary information such as density and average speed for the cell in which it resides based on the information it possesses about vehicles within its communication range. This summary is then propagated in a distance-sensitive manner: information about a cell at distance is forwarded at a rate of Hz.

##### 3.3. Analysis

Theorem 1. *The average amount of data communicated per unit time by each node in VCAST to obtain information about all vehicles within a distance of from itself is bounded by .*

*Proof. *Let denote the average amount of data communicated per unit time, by each node in *VCAST*. We discretize distance in intervals of (the communication range), as information forwarding rate decreases linearly after each time a vehicle’s information is forwarded. The number of vehicles at a distance of at most away from a vehicle is bounded by . The number of vehicles at a distance of at most away from a vehicle is bounded by . As a result, the number of vehicles between a distance of and away from a vehicle is bounded by . Let us denote this as the distance interval from the vehicle in terms of the communication range. Note that information about vehicles between a distance of and is broadcasted only at Hz. Thus the total amount of data to be communicated about vehicles in the distance interval of is . Note that this information is broadcasted by at most one vehicle in every area . Hence, on average each node is responsible for communicating only bits about vehicles at distance interval from itself. Summing up over all distance intervals and by noting that each vehicle broadcasts its own state at Hz, we get

Note that this result makes an assumption that information about nodes at a distance of communication hops is broadcasted at most once every intervals in each communication neighborhood. In the presence of channel contention and hidden terminals, the assumption may be violated causing duplicate transmissions of vehicular information within a communication neighborhood and an increase in the amount of communication per node. The results of our simulation will include the impact of channel contention and duplicate transmissions.

Under a uniform distribution of vehicles in a 2d region, it can be inferred from the results of the previous theorem that the communication cost per node only grows as . In contrast, without distance-sensitive forwarding the average communication incurred per node is , as discussed below.

*Comparison with Multihop Broadcast Protocols without Distance Sensitivity.* In order to analytically compare the bound on communication cost with multihop broadcast algorithms that do not incorporate distance sensitivity in message forwarding, first consider an algorithm in which information is simply flooded without suppression of redundant messages. In this case, each node broadcasts information about all nodes in the region at a rate of times every second yielding a communication cost per node that is bounded by . This is clearly not scalable with the size of the network, and such an approach is likely to yield severe channel contention thus reducing the achievable broadcast rate . Several heuristics have been proposed to address this broadcast storm problem so that redundant broadcasts of the same message can be eliminated; that is, information about every vehicle is broadcasted exactly once in every communication neighborhood per interval. In this case, the average communication cost reduces by a factor of over a naive flooding approach, yielding an average communication cost per node of , that is, . Thus, by comparison with Theorem 1, we see that the effective communication cost per node by applying distance-sensitive forwarding rules reduces by a factor of . Reducing the amount of communication incurred by each node results in smaller channel contention and allows a higher broadcast rate at smaller distances. This is especially crucial when forwarding information over large areas because it ensures that information supply rates at smaller distances are not penalized for having to forward information over multiple hops.

We now obtain a bound on how outdated the state information possessed by a vehicle is because of distance-sensitive forwarding. We refer to this as * staleness* in the information possessed by a vehicle.

*Definition 2 (staleness ( j,i)). *The staleness in the state of vehicle as possessed by vehicle at time is the time elapsed since the timestamp of the state of (). Thus .

Note that the staleness with respect to a vehicle is initially equal to the message latency from the source when information about the vehicle is received but continues to rise until the next update from the vehicle is received. The maximum staleness with respect to a vehicle thus occurs just before fresh information about the vehicle is received. Maximum staleness thus depends on the message latency as well as on the update interval. Staleness can further increase when messages containing information about a vehicle are lost. The effect of message losses will be quantified using simulations in Section 4.5.

Theorem 3. *The maximum staleness in the state of vehicle at vehicle in VCAST is bounded by .*

*Proof. *Consider a vehicle at a distance between and away from a vehicle . Let us denote this by a distance-interval from vehicle in terms of the communication range . Thus . Note that at a distance interval of from a vehicle , information about is updated only once every broadcast interval. As a result, the maximum time before which hears fresher information about from some vehicle at distance interval away from is bounded by seconds. Likewise, the maximum time elapsed between a vehicle at distance-interval receiving information about and a vehicle at distance-interval obtaining the same information is bounded by seconds. Summing from a distance interval of to , we get that the maximum latency in communicating the state of vehicle to a vehicle is bounded by .

From Theorem 3, we note that the staleness at a distance from a vehicle does not depend on the vehicular density or the region size, but only on the communication hop distance and the initial broadcast rate at the source. Hence, we expect that as the communication range increases the staleness should decrease. However, as the communication range increases, the interference within the vehicular transmission also increases and this can adversely affect the network reliability and system accuracy. In Section 4.5, we analyze the performance of our algorithm in large scale simulation and point out the impact of and on the staleness at different distances.

We now state the average communication rate and staleness when aggregate cell information is propagated instead of actual vehicle location information.

Theorem 4. *The amount of data communicated by each node in VCAST per unit time, when aggregate cell information is propagated, to obtain information about each cell at distance up to from itself is bounded by .*

*Proof. *Let denote the average amount of data communicated per unit time, by each node in * VCAST* when aggregate cell information is propagated. Recall that denotes the * cell distance* between vehicle and cell , that is, the smallest number of cells traversed to reach cell from . The number of cells at a cell distance of at most from a vehicle is bounded by , that is, . As a result, the number of cells at exactly distance away from a vehicle is bounded by . Information about cells at distance away is broadcasted at Hz. Thus the total amount of data to be communicated about cells at distance away is . Note that this information is broadcasted by at most one vehicle in every area . Hence, on average each node is responsible for communicating only bits about cells at distance away from itself. Summing up over all cell distances from to , we get

In comparison with the result from Theorem 1, we note that the average communication rate reduces by a factor equal to the number of vehicles in each cell () because only aggregate information about the cell is propagated with distance-sensitive rate as opposed to propagating information about each vehicle in the cell.

Theorem 5. *The staleness in the state of cell at vehicle in VCAST, when aggregate cell information is propagated, is bounded by , where denotes the communication hop distance between and the closest vehicle to in cell .*

*Proof. *Consider a vehicle and cell . The lowest broadcast rate about cell that is available for vehicle is . Also the number of communication hops between and the closest vehicle in is . Hence, latency in forwarding information about cell to vehicle is bounded by . Also note that the subsequent update about cell will be available within seconds. The result follows.

#### 4. Performance

We evaluate the performance of *VCAST* using simulations in ns-3, a discrete event simulator for wireless, and mobile ad hoc networks.

*Network Models.* We use an IEEE 802.11 b physical layer communication model with a DSSS rate of at each node. We first model vehicular traffic by considering vehicles to be in grids of different sizes (, and ) with uniform separation between the vehicles at all times (i.e., traveling with uniform speed). For the case of aggregated data forwarding, we have also simulated a network size of nodes which allows us to test over larger intervehicular distances. We consider intervehicular separations of , m, m, and m, thus simulating different densities. Note that a uniform separation of m would correspond to a headway time of s at a speed of mph (and a proportionately lower headway time at lower speed), which are typically observed separations on roadways. We have chosen densities that create vehicular separation around this range. We also consider source broadcast rates of Hz, Hz, and Hz, and communication ranges of m, m, m, and m, which are within the range of expected transmission rate and range values of * Here I am* messages for intelligent transportation systems [1, 2]. These simulations characterize the performance of * VCAST* when it is used to disseminate vehicular state information to a network of the corresponding size. The grid model allows us to emulate 2d network traffic of different densities in a region and by simulating uniform velocity, the relative distance between vehicles is maintained during the course of the simulation allowing the clear characterization of distance versus information staleness. We use this model to compare *VCAST* with non-distance-sensitive approaches and to systematically study the impact of density, source broadcast rates, and communication range on the performance. Next, we consider a 2d model of vehicles with nonuniform mobility incorporated—the goal here is to study if time varying densities impact the performance and therefore we use a random waypoint model to simulate mobility which generalizes possible vehicular traffic patterns.

*Measurement Strategy*. Each vehicle’s state information is assumed to be bytes long. In any given slot, a vehicle may transmit a variable number of such records. At each vehicle, we measure the maximum staleness with respect to every other vehicle by measuring the time elapsed since the information originated at the source, just before fresh information about a vehicle is received. For information aggregation, we consider the cell size to be equal to the communication range of each vehicle, propagate only aggregate cell information instead of individual vehicle information, and measure the maximum staleness with respect to every cell in the region. All simulations are run for 20 seconds except simulations at 1 Hz which are run for 40 second due to higher staleness values. We then group the maximum staleness based on pairwise distances between vehicle-vehicle and vehicle-cell, respectively. The average of these measurements over multiple experiments is used in our evaluations.

##### 4.1. Impact of Distance Sensitivity

The objective of this section is to quantify the performance gains achieved by using distance-sensitive forwarding as opposed to forwarding information about all vehicles at the same rate.

*Scaling in Number of Nodes*. In Figure 2(a), we show the maximum staleness as a function of intervehicular distance for at a network size of nodes for both * VCAST* as well as non-distance-sensitive forwarding; that is, information about all vehicles is forwarded at the source broadcast rate by every node. Here, we observe that the non-distance-sensitive scheme is able to keep staleness low at all distances and the growth is linear with distance. On the other hand, * VCAST* has low staleness at small distances while the staleness is observed to grow as at higher distances, as expected. However, at a network size of (see Figure 2(b)), the non-distance-sensitive approaches show much higher staleness even at smaller distances. However, * VCAST* is able to maintain low staleness at small distances while the staleness is observed to grow as at higher distances. Information within m is obtained in under 300 ms using * VCAST* while it takes about seconds in the case of a non-distance-sensitive approach. The reason is that as the number of nodes increases, the channel contention increases at a much higher rate in the non-distance-sensitive forwarding causing message losses and consequently increase in staleness (i.e., quantified in our analysis on message complexity). By reducing channel contention, * VCAST* is able to achieve scalability in number of nodes. In Figure 3, we show the maximum staleness as a function of intervehicular distance for at a network size of , , , and nodes for * VCAST*. * We observe that staleness values are preserved at corresponding intervehicular distances, irrespective of network size.*

*Scaling in Source Broadcast Rate.* In Figures 4(a) and 4(b), we fix the network size to nodes and vary the source broadcast rate. In Figure 4(a), we observe that, at s source broadcast rate of Hz, the-non-distance-sensitive scheme is able to scale to large distances and has lower latencies at larger distances compared with * VCAST* since there is no staggered forwarding. * However, when attempting to reduce the staleness at smaller distances, by increasing the source broadcast rate, non-distance-sensitive forwarding fails.* This is shown in Figure 4(b) for broadcast rates of . The non-distance-sensitive approaches show much higher staleness even at smaller distances. On the other hand, * VCAST* is able to deliver lower staleness at smaller distances even at a network size of nodes by increasing the source broadcast rate and progressively increasing the staleness at larger distances. * This allows the network bandwidth to be utilized where it is needed and to achieve scalability.*

*Message Complexity: The Reason Behind Successful Scaling in VCAST*. In Figures 5(a) and 5(b), we show the number of vehicular records transmitted per second by every node for varying network sizes and varying source broadcast rates, respectively. These figures highlight the significantly lower message complexity in* VCAST* which reduces the contention even as network size and broadcast rates grow.

##### 4.2. Impact of Communication Range, Source Broadcast Rate, and Density

In this subsection, we evaluate the performance of* VCAST* under different communication ranges, source broadcast rate, and network densities. The aim is to highlight the scalability of * VCAST* and identify the * tipping point* in terms of each of these parameters for * VCAST*, that is, the point at which channel capacity is exceeded.

*Communication Range.* In Figure 6, we plot the maximum staleness in vehicle information against the intervehicular distance for a node network with Hz at different communication ranges. As range increases from m to m, we observe that staleness at larger distances decrease (due to fewer number of hops), while the staleness at smaller distances increase slightly due to increased contention. However, starting from a range of m, we observe that the channel contention within a single hop starts increasing and at a range of m, we observe a tipping point leading to higher message losses and much higher staleness at smaller distances (the corresponding plot is shown in red).

*Source Broadcast Rate.* In Figure 7(a), we plot the maximum staleness in vehicle information against the intervehicular distance for a node network with a communication range of m for different source broadcast rates. As rate increases from Hz to Hz, we observe that staleness decreases as expected. However, with a rate of Hz, we observe that the channel contention starts increasing, leading to disproportionate staleness values at smaller distances. Figure 7(b) shows a zoomed-in version of Figure 7(a) at smaller distances. Here, we observe that staleness values for Hz are higher than those at Hz due to higher channel contention.

*Network Density.* In Figure 8(a), we plot the maximum staleness in vehicle information against the intervehicular distance for a node network with a communication range of 100 m and rate of 10 Hz for different intervehicular separations. Note that, in Figure 8(a), the plots for separations of m, m, and 30 m only extend to , , and Km, respectively, because these are the possible maximum intervehicular distances at the corresponding densities for a given network size of vehicles. We observe that going from a separation of m to m, the staleness at larger distances decreases. This is because of fewer number of * hops* required to reach a given distance. However, with a separation of m, we observe that channel capacity is exceeded causing message losses and higher staleness values (the corresponding plot is shown in red). In Figure 8(b), we have shown the corresponding message complexity at different intervehicular separations. Here we observe a drastic increase in messages per second, at a separation of m which explains the corresponding increase in message losses and information staleness.

##### 4.3. Impact of Time Varying Intervehicular Separations

The aim of this subsection is to characterize the performance of * VCAST* in the presence of time varying intervehicular separations caused by nonuniform mobility patterns. We note that there are potentially several traffic mobility patterns that can arise in a real vehicular network scenario. Our goal here is to analyze the scalability of * VCAST* and one of the important underlying factors that can impact performance in the context of these mobility patterns is the time varying density. There could be instants when a vehicle has a lot of neighbors within communication range and also instances when there are no neighbors. Therefore, in this simulation, we have chosen the * random 2d walk mobility pattern* with time varying speeds in the range of 20 m/s to 40 m/s, a potentially severe form of mobility that captures the essence of time varying separations and interference zone, caused in a traffic scenario.

In Figures 9(a) and 9(b), we compare the information staleness graphs for the random and uniform mobility patterns at Hz and Hz source broadcast rates with nodes. As seen from these figures, the graphs are quite similar, highlighting that random mobility does not significantly impact the performance. Staleness values at larger distances are observed to be slightly higher for the case of random mobility. However, the reason for this is not higher communication cost but rather the fact that the severe random mobility scenario often creates sparse and disconnected regions within the network, thereby increasing the number of hops traversed between two vehicles at a given distance. This effect is more pronounced at larger distances. In Figure 10, we compare the average communication cost for the random and uniform mobility scenarios. This graph highlights the fact that communication costs do not increase in the random mobility scenario—in fact a small decrease is observed in the average communication cost over several random patterns.

##### 4.4. Impact of Aggregation

In this section, we evaluate* VCAST* when aggregate information about a cell is transmitted over multiple hops as opposed to individual vehicle information. The region being simulated is divided into square * cells* of equal size. The width of each cell is assumed to be equal to the single hop communication range. In this evaluation, we have increased the network size to nodes, thereby allowing us to evaluate staleness over larger distances. Figure 11 shows the information staleness graphs with a communication range of m ad m, both with a source broadcast rate of Hz. As seen in these graphs, information up to Km can be obtained in less than seconds, without the need for any infrastructure—while still maintaining extremely low staleness values at smaller distances.

##### 4.5. Summary of Results

Our experimental results show that by using distance-sensitive forwarding, * VCAST* is able to scale to larger network size as well as support much higher broadcast rates compared to non-distance-sensitive techniques. The reason for scalability is the significantly lower message overhead which reduces the channel contention in the network. We also characterized the performance of* VCAST* under severe mobility and studied information staleness when aggregated data is transmitted as opposed to individual vehicle information.

From all of the above experimental evaluations, we note that an ideal parameterization for * VCAST* is to set communication range to a small value and increase the source broadcast rate. By doing so, information at smaller distances can be obtained at high rates with low contention due to the small communication range. At the same time, information to larger distances can be transmitted with progressively increasing staleness. Moreover, by limiting the propagation of individual vehicular information up to distances of about 500–1000 m (for utilization by safety applications) and only propagating aggregate information beyond that, we observe that information from several miles ahead can be obtained within a few seconds without the need for any communication infrastructure.

#### 5. Conclusions

We have presented an algorithm,* VCAST*, for obtaining individual vehicle location and aggregate traffic information over a multihop wireless vehicular network without the need for expensive roadside infrastructure, any special hardware, or modification to vehicular transmission standards. To ensure scalability in forwarding information over multiple hops, traffic information is propagated at a rate that decreases linearly with distance from the source. By doing so, the required communication rate per node can be reduced when compared with schemes that do not utilize distance sensitivity in information forwarding. This results in lower channel contention, thereby enabling higher source broadcast rates and better information quality at smaller distances while still being able to propagate information to large distances. Despite staggered forwarding, traffic information can be obtained with a staleness, which is a measure of error in the traffic information that is bounded by where is the communication hop distance from the source of the information.

The performance of *VCAST* was validated using extensive ns-3 simulation under different network sizes, network densities, source broadcast rates, and communication ranges. The results of our evaluation showed that by using distance-sensitive forwarding, * VCAST* is able to scale to larger network sizes as well as support much higher broadcast rates compared to non-distance-sensitive techniques. The reason for scalability was shown to be the significantly lower message overhead which reduces the channel contention in the network. We also characterized the performance of *VCAST* under severe mobility and studied information staleness when aggregated data is transmitted as opposed to individual vehicle information.

In future work, we would like to integrate* VCAST* with control algorithms for vehicular safety and navigation that utilize information with distance-sensitive quality. We would like to design optimal control laws for vehicular acceleration under models of distance-sensitive information availability that ensures the safety of the integrated control-communication system. We would also like to integrate our vehicular traffic mapping service with a navigation front end for dynamic computation of alternate routes and evaluate the impact of distance sensitivity on the quality of navigation performance.

#### References

- Y. P. Fallah, C. Huang, R. Sengupta, and H. Krishnan, “Design of cooperative vehicle safety systems based on tight coupling of communication, computing and physical vehicle dynamics,” in
*Proceedings of the 1st ACM/IEEE International Conference on Cyber-Physical Systems (ICCPS '10)*, pp. 159–167, April 2010. View at Publisher · View at Google Scholar · View at Scopus - U. S. Department of Transportation, “Achieving the vision: from VII to IntelliDrive,” Policy white paper, 2010.
- V. Kulathumani and Y. Fallah, “Vcast: an infrastructure-less vehicular traffic information service with distance sensitive precision,” in
*Proceedings of the IEEE Vehicular Technology Conference (VTC '12)*, 2012. - Y. Liu and F. Dion, “Safety assessment of information delays on intelligent vehicle control system performance,” Proceedings of Transportation Research Board Conference, 2006.
- V. Kulathumani and A. Arora, “Aspects of distance sensitive design of wireless sensor networks,” in
*Proceedings of the IEEE Workshop on Spatial Computing*, October 2008. View at Scopus - V. Kulathumani, A. Arora, and S. Ramagiri, “Pursuit control over wireless sensor networks using distance sensitivity properties,”
*IEEE Transactions on Automatic Control*, vol. 56, no. 10, pp. 2473–2478, 2011. View at Publisher · View at Google Scholar · View at Scopus - F. Li and Y. Wang, “Routing in vehicular ad hoc networks: a survey,”
*IEEE Vehicular Technology Magazine*, vol. 2, no. 2, pp. 12–22, 2007. View at Publisher · View at Google Scholar · View at Scopus - K. C. Lee, U. Lee, and M. Gerla, “Survey of routing protocols in vehicular ad hoc networks,” in
*Advances in Vehicular Ad-Hoc Networks: Developments and Challenges*, pp. 149–170, IGI-Global, 2009. - Y.-W. Lin, Y.-S. Chen, and S.-L. Lee, “Routing protocols in vehicular Ad Hoc networks: a survey and future perspectives,”
*Journal of Information Science and Engineering*, vol. 26, no. 3, pp. 913–932, 2010. View at Scopus - J. Zhao and G. Cao, “VADD: vehicle-assisted data delivery in vehicular ad hoc networks,” in
*Proceedings of the 25th IEEE International Conference on Computer Communications*, April 2006. View at Publisher · View at Google Scholar · View at Scopus - C. Lochert, M. Mauve, H. Fera, and H. Hartenstein, “Geographic routing in city scenarios,”
*ACM SIGMOBILE Mobile Computing and Communications Review*, vol. 9, no. 1, pp. 69–72, 2005. - Y.-S. Chen, Y.-W. Lin, and C.-Y. Pan, “DIR: diagonal-intersection-based routing protocol for vehicular ad hoc networks,”
*Telecommunication Systems*, vol. 46, no. 4, pp. 299–316, 2011. View at Publisher · View at Google Scholar · View at Scopus - V. Naumov and T. R. Gross, “Connectivity-aware routing (CAR) in vehicular ad hoc networks,” in
*Proceedings of the 26th IEEE International Conference on Computer Communications*, pp. 1919–1927, May 2007. View at Publisher · View at Google Scholar · View at Scopus - T. Taleb, E. Sakhaee, A. Jamalipour, K. Hashimoto, N. Kato, and Y. Nemoto, “A stable routing protocol to support ITS services in VANET networks,”
*IEEE Transactions on Vehicular Technology*, vol. 56, no. 6, pp. 3337–3347, 2007. View at Publisher · View at Google Scholar · View at Scopus - W. Sun, H. Yamaguchi, K. Yukimasa, and S. Kusumoto, “GVGrid: a QoS routing protocol for vehicular ad hoc networks,” in
*Proceedings of the 14th IEEE International Workshop on Quality of Service (IWQoS '06)*, pp. 130–139, June 2006. View at Publisher · View at Google Scholar · View at Scopus - A. Skordylis and N. Trigoni, “Delay-bounded routing in vehicular ad-hoc networks,” in
*Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing*, pp. 341–350, May 2008. View at Publisher · View at Google Scholar · View at Scopus - H. P. Joshi, M. Sichitiu, and M. Kihl, “Distributed robust geocast multicast routing for inter-vehicle communication,” in
*Proceedings of the WEIRD Workshop on WiMax, Wireless and Mobility*, 2007. - H. Lu and C. Poellabauer, “Balancing broadcast reliability and transmission range in VANETs,” in
*Proceedings of the IEEE Vehicular Networking Conference (VNC '10)*, pp. 247–254, December 2010. View at Publisher · View at Google Scholar · View at Scopus - M. Torrent-Moreno, J. Mittag, P. Santi, and H. Hartenstein, “Vehicle-to-vehicle communication: fair transmit power control for safety-critical information,”
*IEEE Transactions on Vehicular Technology*, vol. 58, no. 7, pp. 3684–3703, 2009. View at Publisher · View at Google Scholar · View at Scopus - L. Cheng and R. Shakya, “VANET Adaptive power control from realistic propagation and traffic modeling,” in
*Proceedings of the IEEE Radio and Wireless Symposium*, pp. 665–668, January 2010. View at Publisher · View at Google Scholar · View at Scopus - L. Yang, J. Guo, and Y. Wu, “Channel adaptive one hop broadcasting for VANETs,” in
*Proceedings of the 11th International IEEE Conference on Intelligent Transportation Systems (ITSC '08)*, pp. 369–374, December 2008. View at Publisher · View at Google Scholar · View at Scopus - C. Chigan and J. Li, “A delay-bounded dynamic interactive power conftol algorithm for VANETs,” in
*Proceedings of the IEEE International Conference on Communications (ICC '07)*, pp. 5849–5855, June 2007. View at Publisher · View at Google Scholar · View at Scopus - A. Bachir and A. Benslimane, “A multicast protocol in ad hoc networks inter-vehicle geocast,” in
*Proceedings of the 57th IEEE Semiannual Vehicular Technology Conference (VTC '03)*, pp. 2456–2460, April 2003. View at Scopus - Y.-S. Chen, Y.-W. Lin, and S.-L. Lee, “A mobicast routing protocol in vehicular Ad-Hoc networks,”
*Mobile Networks and Applications*, vol. 15, no. 1, pp. 20–35, 2010. View at Publisher · View at Google Scholar · View at Scopus - M. N. Mariyasagayam, T. Osafune, and M. Lenardi, “Enhanced multi-hop vehicular broadcast (MHVB) for active safety applications,” in
*Proceedings of the 7th International Conference on Intelligent Transport Systems Telecommunications (ITST '07)*, pp. 223–228, June 2007. View at Publisher · View at Google Scholar · View at Scopus - J. Fukuyama, “A probabilistic protocol for multi-hop routing in VANETs,” in
*Proceedings of the IEEE International Conference on Communications Workshops*, June 2009. View at Publisher · View at Google Scholar · View at Scopus - D. Kumar, A. A. Kherani, and E. Altman, “Route lifetime based optimal hop selection in VANETs on highway: an analytical viewpoint,” in
*Proceedings of the International IFIP-TC6 Networking Conference*, 2006. - T. Fukuhara, T. Warabino, T. Ohseki et al., “Broadcast methods for inter-vehicle communications system,” in
*Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC '05)*, pp. 2252–2257, March 2005. View at Scopus - F. Bai, D. D. Stancil, and H. Krishnan, “Toward understanding characteristics of Dedicated Short Range Communications (DSRC) from a perspective of vehicular network engineers,” in
*Proceedings of the 16th Annual Conference on Mobile Computing and Networking (MobiCom '10)*, pp. 329–340, September 2010. View at Publisher · View at Google Scholar · View at Scopus - S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The broadcast storm problem in a mobile ad hoc network,” in
*Proceedings of the ACM/IEEE international conference on Mobile computing and networking*, 1999. - B. Williams and T. Camp, “Comparison of broadcasting techniques for mobile ad hoc networks,” in
*Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '02)*, pp. 194–205, June 2002. View at Scopus - L. Peterson and B. Davie,
*Computer Networking: A Systems Approach*, Elsevier, 2011. - G. Pei, M. Gerla, and T.-W. Chen, “Fisheye state routing in mobile Adhoc networks,” in
*Proceedings of the ICDCS Workshop on Wireless Networks*, pp. 71–78, June 2000. View at Scopus - F. Dehne, A. Ferreira, and A. Rau-Chaplin, “Parallel fractional cascading on hypercube multiprocessors,”
*Computational Geometry*, vol. 2, no. 3, pp. 141–167, 1992. View at Scopus - S. Funke, L. Guibas, and Y. Zhang, “Distance sensitive information brokerage in sensor networks,” in
*Proceedings of the International Conference on Distrbuted Computing in Sensor Systems (DCOSS '06)*, pp. 234–251, Springer, 2006. - M. Demirbas, A. Arora, and V. Kulathumani, “Glance: a lightweight querying service for wireless sensor networks,”
*Theoretical Computer Science*, vol. 410, no. 6-7, pp. 500–513, 2009. View at Publisher · View at Google Scholar · View at Scopus - V. Kulathumani, A. Arora, M. Sridharan, and M. Demirbas, “Trail: a distance-sensitive sensor network service for distributed object tracking,”
*ACM Transactions on Sensor Networks*, vol. 5, no. 2, pp. 1–40, 2009. View at Publisher · View at Google Scholar · View at Scopus - J. Gao, L. J. Guibas, J. Hershberger, and L. Zhang, “Fractionally cascaded information in a sensor network,” in
*Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN '04)*, pp. 311–319, April 2004. View at Scopus - V. Kulathumani and A. Arora, “Distance sensitive snapshots in wireless sensor networks,” in
*Principles of Distributed Systems*, vol. 4878, pp. 143–158, 2007. - E. W. Dijkstra, “Self-stabilizing systems in spite of distributed control,”
*Communications of the ACM*, vol. 17, no. 11, 1974.