- Open Access
LOA-CAST: a novel low-overhead information broadcast scheme for vehicular ad hoc networks
© Kuo and Wu; licensee Springer. 2014
- Received: 8 January 2014
- Accepted: 26 March 2014
- Published: 10 April 2014
In this paper, we propose a novel scheme for broadcasting non-urgent information in vehicular ad hoc networks (VANETs). The scheme, called low-overhead aggregated broadcast (LOA-CAST), aggregates information from different sources on a road and forwards it periodically. By aggregating the information from different sources and periodically propagating the message, it reduces the overall signaling overhead and dynamically adjusts the propagation distance of information according to the source density. We use analysis to evaluate the behavior of LOA-CAST in the presence of malicious/malfunctioning nodes. The results show that LOA-CAST can still function well and control the overall overhead if such nodes exist. Moreover, the results of simulations demonstrate that LOA-CAST incurs a reasonable overhead while propagating information efficiently.
- Vehicular networks
- Signaling overhead
A vehicular ad hoc network (VANET)  is a special type of mobile ad hoc network that enables vehicles to communicate with each other as well as with roadside units in the vicinity. With this technology, many traffic-related applications, such as accident warning systems, congestion detection schemes, and traffic-related information broadcasts, can be implemented to provide more comfortable driving experiences. Each vehicle in a VANET must be equipped with a wireless interface, which typically operates under the IEEE 802.11 Wi-Fi standard . In such a network, the information to be transmitted usually has different degrees of urgency. Some transmissions (e.g., emergency/accident notifications or QoS-sensitive multimedia connections) require short delays and low loss rates, so they should be given a higher priority than non-urgent messages. The latter provides drivers with information about the local environment (e.g., weather conditions, the average speed of traffic on a particular road, the number of vacant spaces in a parking lot, and advertisements from stores). For these kinds of messages, a certain degree of delay is tolerable, and their transmission can be paused, or even postponed indefinitely, if bandwidth is scarce.
Basically, drivers can obtain traffic-related information in two ways: actively and passively. In the active approach, a vehicle sends queries to nodes in the area of interest and waits for the replies; in the passive approach, a vehicle simply receives traffic-related messages from different sources. For non-urgent environmental information, which we focus on in this paper, passive transmission makes more sense for two reasons. The first is the overhead issue. If several vehicles request the same information, the source node has to send separate replies containing identical messages, which wastes the radio bandwidth. The second reason is the blindness issue. Drivers may not be aware of information that may be of interest, e.g., a newly opened parking lot or gasoline station, and it is unlikely that they would request such information actively.
Although broadcasting environmental information is more reasonable, many technical issues must be addressed. The first is the management issue. Because information sources located in different positions broadcast messages independently, they use different relay nodes (i.e., the nodes that help forward messages); therefore, managing the total overhead of broadcasting services is a challenging task. It is very difficult for the relay nodes of different sources to perceive and negotiate with each other. When too many nodes broadcast information simultaneously, or there are malicious nodes that constantly send empty packets, the whole network may be overwhelmed. The second issue is related to efficiency. Messages containing local environmental information (e.g., the average speed on the current section of road or the number of vacant spaces in a parking lot) are relatively short. If each short message is broadcast separately, it may take longer for nodes to access the medium (e.g., sending RTS/CTS messages, waiting for DIFS, and even collisions with other nodes) than to broadcast the message body. However, if information from different sources could be aggregated and relayed as one larger message, the transmission time required by the access process could be reduced substantially. The third issue involves the flexibility of transmitting messages. Because of the number of time-varying broadcast sources and the dynamic total overhead, the broadcast range of each source should be adaptive. That is, the range should be extended to notify as many cars as possible when the radio resource allows, and limited when the traffic is heavy and the resource is scarce.
A number of position-based routing schemes designed to transmit data in static or dynamic topologies of VANETs have been proposed, e.g., [3, 4], and some cluster-based routing schemes have also been designed, e.g., [5, 6]. With these routing approaches and some additional design on higher layers, an active query service can be implemented. For example, Dikaiakos et al.  designed an integral service that enables drivers to actively query a source node whose position is known and obtain the latest information.
Meanwhile, several works have studied broadcast schemes in VANETs. Torrent-Moreno et al.  investigated the probability of successfully receiving broadcast data at a certain distance from the sender, Zhao et al.  proposed a scheme that enables cars or roadside units (RSUs) at an intersection to cache and forward data to improve the reliability of transmissions, and Tonguz et al.  designed a scheme that can function in different traffic conditions. However, these works focus on relaying and routing issues in single broadcast traffic. They do not consider the trouble a malicious node could cause or find ways to manage and reduce the broadcasting overhead.
The geocast paradigm is also important. Schemes based on such model, e.g., [11–14], broadcast information in a range, called a zone of relevance (ZOR), instead of to a predetermined group of nodes. In , Maihöfer et al. proposed a special type of geocast scheme that allows packets to remain in a range for a certain period of time so that all vehicles that come within the range during that period can receive the information. With this class of technologies, a ‘virtual road sign’ can be formed. These approaches may be effective for informing vehicles in a small range, but they are unsuitable for large-scale broadcasts because each message has fixed transmission range and is relayed separately. Hence, the range of the recipients cannot be dynamically adjusted to adapt to the network's traffic load. Moreover, because each source broadcasts separately over a wide area, the total overhead may be heavy and difficult to manage. Some researchers have also highlighted the importance of data aggregation. Authors in  propose a cluster-based scheme which provides drivers the forward visibility of 1.6 km. The scheme works only on a straight road and does not consider the road topology such as branches and intersections. Dietzel  discusses a generic model of VANET data aggregation protocols. Like , he focuses on the aggregation and computation among ‘homogeneous data,’ (such as aggregating speed information of each car to find the overall traffic conditions). However, we focus on putting various kinds of information into a general-purpose broadcast mechanism to reduce and control the overall broadcasting overhead.
In this paper, we propose a scheme called low-overhead aggregated broadcast (LOA-CAST), which is designed to distribute non-urgent environmental information via a best-effort approach. The scheme can deliver such information to vehicles several kilometers away from the source, address all the broadcasting issues mentioned earlier, and manage the total overhead. Through analysis, we show that the operation of the whole network is stable even if there are malfunctioning/malicious nodes in the network. Furthermore, the results of simulations show that the operations are robust and the signaling overhead is light.
The remainder of this paper is structured as follows. In Section 2, we introduce the system model and describe the operation of LOA-CAST. We also show that LOA-CAST is robust in the presence of malfunctioning/malicious nodes. In Section 3, we discuss the simulations conducted to evaluate the scheme's performance. Section 4 contains some concluding remarks.
In the following subsections, we introduce the assumptions in which LOA-CAST is based on and the structure of the broadcast messages, discuss the scheme's architecture, describe the operation of each independent node, explain how messages from different sources are aggregated, and consider the robustness and signaling overhead.
2.1 Assumptions and message contents
Each vehicle knows its current speed, position, and direction.
A vehicle is aware of the position and direction of each of its neighbors (i.e., those within its transmission range).
The clock of each vehicle is loosely synchronized.
These assumptions are realistic and are currently used by most VANET unicast and broadcast schemes, such as those discussed in the previous section. They are practical if every node is equipped with a Global Positioning System (GPS) device and periodically broadcasts its position to adjacent nodes.
To notify cars nearby, each information source sent broadcast messages (BMs) that are structured as follows:
Time - the time the information is broadcast
Duration (optional) - the longest period that a message should remain in the network
Source ID - the ID of the information source
Source position/direction - the direction and position of the sender
Message body - the information each sender broadcasts
To illustrate, we consider an RSU setup near a parking lot to broadcast information about vacant spaces. Normally, a BM contains just one message entry from a single source. The structure of such a BM is shown below. However, when a number of messages are to be aggregated, BMs may contain multiple information entries. We discuss this aspect later in the paper.
Information structure of a BM
2.2 Operations of the LOA-CAST scheme
Next, we detail the operations of the four modes.
Beating mode. If a car does not receive an ABM from forward nodes for a certain period of time, it should initiate the periodical transmission and transmit an ABM to the nodes behind it. Therefore, it switches to beating mode and broadcasts a blank ABM periodically. In addition, basing on the position of the neighbor nodes, the beater finds the most distant node(s) on each branch to act as the next hop relay(s) and assigns them in the ABM accordingly. The relays are responsible for distributing the ABM to the next hop.
Source mode. On receipt of an ABM, a source broadcasts a BM. To ensure that different kinds of information are propagated effectively, LOA-CAST exploits three types of sources: permanent sources (PSs), temporary sources (TSs), and multiple sources (MSs). A PS is a node that belongs to a specific entity and broadcasts the entity's advertising messages, such as an RSU setup by a store or a parking lot. TSs report important information for areas that do not have dedicated PSs. To gather such information, ‘virtual check points’ (VCPs) can be predetermined and stored in each vehicle's GPS device. When an ABM whose range covers the VCP is broadcast, the closest vehicle to the VCP becomes the TS and is responsible for assessing and reporting local conditions. Since each car has the positions of its neighbor, it is feasible to know whether it is the closest one. The operations of PS and TS are illustrated in Figure 1. The only difference between PS and TS is that the latter becomes an ordinary (i.e., silent) node after transmitting a BM. Since the positions of vehicles are dynamic, when the next ABM comes, the TS of a VCP can be different. Finally, an MS handles multiple ABMs. If a road has an intersection, the different branches may propagate ABMs at the same time and generate a heavy traffic load, so the ABMs should be merged. Therefore, when a relayer receives another ABM before transmitting its own ABM, it becomes an MS and broadcasts its own ABM as a multiple-entry BM to let another ABM's relayer merge the information. As shown in Figure 1, when car C receives the ABM from car B, it becomes a relayer and counts down for an interval before forwarding the ABM. However, when it receives another ABM from D during the countdown, it becomes an MS and immediately transmits a BM containing all the entries in its ABM. As a result, relayer E (which receives the ABM from D) merges the messages from C and transmits the new ABM to the cars behind it. When there are multiple ABMs from different roads at an intersection, or a malicious node keeps sending a large number of ABMs, this mechanism can reduce the number of ABMs from different sources but still let them propagate once in every given period Tperiod. In other words, it maintains the transmission rate and overhead. Irrespective of the source type (i.e., a PS, TS, or MS), it always transmits the BM upon receipt of the ABM. If there are multiple sources in an ABM's transmission area, existing approaches (e.g., carrier sense multiple access with collision avoidance (CSMA/CA)) can be used to avoid a collision. After transmitting the BM, a TS or MS becomes an ordinary node, but a PS remains in the source mode and transmits its BM when the next ABM is received.
Relaying mode. When an ABM is transmitted, the most distant node on each road branch within the transmission range becomes the relaying node and is responsible for forwarding the ABM again. After relaying the ABM, it switches to a normal node. Like the beater, basing on its own neighbor information, a relayer decides the next hop's relayer and adds the ID to the transmitted ABM. When the transmission range of the relayer covers crossroads, it selects a relayer on each road. To limit the bandwidth consumption, the size of the ABM is fixed. Therefore, when the number of entries reaches a given limit, the oldest entries (i.e., those with the earliest transmission time) are purged.
Silent mode. When a node does not have to transmit or forward messages, it receives and decodes the ABMs to obtain the latest information.
Conclusively, basing on the four modes, the head of line on each road becomes a beater and pumps ABM periodically along the road, while each chosen relayer forwards the packets to help them propagate. As an ABM passes by, the information sources transmit the latest messages. Therefore, when operating correctly, each vehicle can acquire information from the ABMs it receives. The signaling overhead is reduced because of two reasons. First, unlike flooding approaches, duplicated ABMs are merged by MSs. Second, instead of being transmitted separately, the broadcast messages of all kinds of sources are integrated in LOA-CAST, and the process of accessing the transmission medium (i.e., conducting CSMA/CA) is substantially saved.
2.3 State transition operations and clock settings in LOA-CAST
In addition to receiving ABMs, a node also continuously checks the time to activate some events. For example, MS-TO (i.e., message time-out) represents the event that the previous ABM's interval has passed ΔT, which means it is time for a relayer to transmit an ABM to the next hop. However, if an ABM has not been received for two Tperiod, ABM-TO (i.e., ABM time-out) is activated and the node is switched to a beater. Finally, the event ABM-Beat makes a beater initiate a blank ABM periodically.
Figure 3 shows the state transition diagram based on the detected events in Figure 2. When a node enters the network, it is in the silent mode by default. If the node does not receive an ABM from cars in front of it for two Tperiod (i.e., event ABM-TO), it becomes a beater and periodically transmits an empty ABM to cars behind it every Tperiod (i.e., ABM-Beat). It becomes a normal node when it receives an ABM from cars in front of it. Next, each node switches to the relay mode when chosen as a relayer by an ABM (i.e., ABM-BD), transmits a new ABM, and becomes silent after Δt (i.e., event MS-TO occurs). When a relayer receives another ABM before transmitting its ABM (i.e., ABM-MS), it acts as an MS and immediately transmits its ABM as a BM and returns to silent mode.
For RSUs, which are always PSs, the operation is much simpler because they do not become beaters or relayers and do not switch to the silent mode. They simply transmit a BM whenever an ABM is received.
2.4 The aggregation operation and the transmission interval between messages
In this section, we consider the integration of information and the transmission interval between ABMs. Each relayer must aggregate all the information from different sources in the transmission range as well as that in received ABMs into a new ABM. Given the information entries from the ABM and BMs, the relayer first removes those that have reached time-out (i.e., current time-time > duration) in the ABM and those that have incorrect time tags (i.e., time > current time). This operation is necessary because a malicious RSU may use a longer time tag than the current time to extend the lifetime of its messages. Next, the relayer removes duplicate entries from the same source (i.e., messages with same ID) and only keeps the most recent one (i.e., the message with the largest time value). If the number of entries is still greater than the size of the ABM, the relayer keeps entries which have longer remaining lifetime and are from more approximate distance to the source so that the latest and closest information (i.e., more useful) can be forwarded. Under this aggregation approach, the propagation time of information and the transmission range can be adapted to the bandwidth condition. Given the size of the ABM, the larger the number of messages, the sooner the message is full and the earlier message is removed from the ABM. Therefore, each message will have less time to be forwarded along the road and thus has propagated over a smaller range. Conversely, if there are fewer sources, each message can remain in the ABM for a longer period and be broadcast over a wider range. In other words, the transmission range is adaptive to the number of sources, while the transmission overhead of LOA-CAST is fixed.
2.5 Robustness of LOA-CAST
In a passive attack, if a node does not receive ABMs for two Tperiod, a new beater will emerge. When the node receives an ABM from the forward direction, it will become a normal node again. Therefore, although a passive attack of a node which is supposed to be the relayer may block the information transmitted by nodes in front of the vehicle, it will not affect the operation of nodes and information sent by sources behind the vehicle. In an active BM attack, malicious nodes transmit numerous BMs that may block the space in ABMs and replace the information sent by sources in front of the target node. However, it does not affect the transmission of sources behind the attacked node because they always have later timestamps and can overwrite the previous BMs. Therefore, BMs behind the attacked node are not affected and can always be merged with an ABM. Even if the malicious node forges the timestamp so that it is less than the current time in the BM, the message can be detected easily and removed by the relayer. Finally, in an active ABM attack, a large number of ABMs are transmitted from a malfunctioning area, and several relayers may be responsible for forwarding them. When the interval between the ABMs is less than the Tperiod, nodes will be switched to the ‘cooling-down’ period, which will reduce the transmission rate of the ABMs.
If a malicious node is the only node that can relay messages on a road, it is inevitable that it will block forwarded messages; however, the broadcasts and operation of the nodes behind the attacked node are not affected. Each source and relayer after the attacked source can still operate and forward information normally.
3.1 Model I
We observe the signaling overhead and propagation speed of messages in model I and study the impact of the vehicle density and the positions of the tollbooths. In this work, the signaling overhead is defined as the average amount of data each car receives per second, which refers to the amount of time the proposed scheme occupies in each car's transmission medium. On the other hand, the propagation speed is determined by calculating the time required for an ABM to be forwarded from the RSU to the end of the road. In the simulations, we adjust the entry frequency of cars as well as the number of tollbooths, which are placed at equal distances on the road.
3.2 Model II
In this paper, we have proposed a message aggregation scheme, called LOA-CAST, for non-urgent broadcasts in VANETs. The scheme aggregates the payloads of different information sources and provides a framework that allows messages to propagate. Because of each node's distributed operation, LOA-CAST's signaling overhead is light, while the transmission range of each information source is adaptable to the current traffic load. Our analysis shows that the scheme is robust and stable when it is attacked by malicious/malfunctioning nodes. The simulation results also show that in different scenarios, LOA-CAST's performance is stable, its signaling overhead is reasonable, and its transmission speed is acceptable.
- Hartenstein H, Laberteaux K: A tutorial survey on vehicular ad hoc networks. IEEE Commun. Magazine 2008, 46(6):164-171.View ArticleGoogle Scholar
- IEEE 802.11 Standard, IEEE-SA. . Accessed 5 April 2012 http://standards.ieee.org/getieee802/download/802.11-2012.pdf
- Karp B, Kung HT: GPSR: Greedy perimeter stateless routing for wireless networks. Boston, 6–11 August 2000. Proceedings of the ACM/IEEE international conference on mobile computing and networking (MobiCom)Google Scholar
- Lochert C, Hartenstein H, Tian J, Herrmann D, Füßler H, Mauve M: A routing strategy for vehicular ad hoc networks in city environments. Columbus, OH, USA, 9–11 June 2003. Proceedings of IEEE intelligent vehicles symposium (IV2003) 156-161.Google Scholar
- Lin CR, Gerla M: Adaptive clustering for mobile wireless networks. IEEE J. Selected Areas in Commun 1997, 15(7):1265-1275. 10.1109/49.622910View ArticleGoogle Scholar
- Wu J, Li H: A dominating-set-based routing scheme in ad hoc wireless networks. The special issue on Wireless Networks in the Telecommunication Systems Journal 2001, 3: 63-84.MATHGoogle Scholar
- Dikaiakos MD, Florides A, Nadeem T, Iftode L: Location-aware services over vehicular ad-hoc networks using car-to-car communication. IEEE J. Selected Areas in Commun 2007, 25: 1590-1602.View ArticleGoogle Scholar
- Torrent-Moreno M, Jiang D, Hartenstein H: Broadcast reception rates and effects of priority access in 802.11-based vehicular ad-hoc networks. New York, NY, USA 1 October 2004. Proc. ACM ICMCNGoogle Scholar
- Zhao J, Zhang Y, Cao G: Data pouring and buffering on the road: a new data dissemination paradigm for vehicular ad hoc networks. IEEE Trans. Vehicular Technol 2007, 56: 3266-3277.View ArticleGoogle Scholar
- Tonguz O, Wisitpongphan N, Bai F, Mudalige P, Sadekar V: Broadcasting in VANET. Anchorage, AK, 11 May 2007. Proc. IEEE Mobile Networking for Vehicular EnvironmentsGoogle Scholar
- Maihöfer C: A survey of geocast routing protocols. IEEE Commun. Surv. Tutorials 2004, 6(2):32-42.View ArticleGoogle Scholar
- Maihöfer C, Eberhardt R: Geocast in vehicular environments: caching and transmission range control for improved efficiency. Parma, Italy, 14–17 June 2004. Proc. IEEE Intelligent Vehicles SymposiumGoogle Scholar
- Maihöfer C, Leinmüller T, Schoch E: Abiding geocast: time-stable geocast for ad hoc networks. New York, NY, USA, 2 September 2005. Proceedings of the 2nd ACM International Workshop on Vehicular Ad Hoc Networks (VANET'05) 20-29.Google Scholar
- Ibrahim K, Weigle M: Accurate data aggregation for VANETs. Montreal, Canada, 9–14 September 2007. Proceedings of the 4th ACM International Workshop on Vehicular Ad Hoc Networks 71-72.Google Scholar
- Dietzel S: On the potential of generic modeling for VANET data aggregation protocols. Hyatt Jersey City, NJ, USA, 13–15 December 2010. Proceedings of Vehicular Networking Conference 78-85.Google Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.