Broadcast Storm Problem Research Articles

Limited area broadcast for warning message delivery over vehicular ad-hoc networks

Vehicular ad hoc networks have been developed in consideration of advancing driving safety. In driving-safety applications, rapid dissemination of warning messages is highly demanded to avoid accidents involving incoming vehicles. Broadcast transmission is considered the most appropriate technique to spread warning messages because it can simultaneously reach all neighboring nodes within a transmission range using only a brief wireless media access. However, blindly broadcasting redundant messages may severely overcrowd wireless media channels and provoke transmission collisions; this is known as the broadcast storm problem. In order to reduce broadcast redundancy, broadcasting must be intelligently controlled. Simultaneously, an intelligent broadcast scheme should aim to reduce the number of hops needed to arrive at a destination, to achieve smaller propagation delay. In this paper, we observed the behavior of a few broadcast schemes and found that their performances can be explained as limiting a space to control the number of contentions in broadcasting. From the observation, we propose a limited area-based (LAB) scheme to achieve a shorter propagation time as well as a smaller number of redundant broadcast messages. The proposed scheme can maintain a proper collision rate to obtain a faster propagation time by adjusting the size of an area in which broadcasting nodes belong. Performance evaluation results from simulation show that the proposed scheme is feasible and reasonable.

Directed broadcasting with mobility prediction for vehicular sensor networks

This article suggests a new directed broadcasting method with mobility prediction of moving vehicles in vehicular sensor networks (VSNs). VSNs can play a critical role to ensure prompt delivery of real-time sensing data and be able to prevent various road dangers. The suggested method is particularly for vehicle safety communication (VSC) on highway roads by using directed broadcasting between vehicles. In VSNs, broadcasting is the most suitable communication mechanism for VSC. The simplest broadcasting mechanism is flooding, which introduces the redundant message retransmission and the broadcast storm problem. It is because all vehicles rebroadcast the messages in flooding. The broadcast storm problem can be addressed with selective flooding schemes which select rebroadcast vehicles to perform rebroadcasting. However, selective flooding schemes cannot promise enough reliability for VSC because of the highly dynamic topology and frequent disconnections of vehicular networks. Fast movement and frequent topology changes cause repeated link breakages and it increases the packet loss rate of vehicular networks. In this article, we propose a mobility prediction-based directed broadcasting (MPDB) protocol to achieve a reliable broadcasting in VSNs. MPDB protocol broadcasts emergent messages only to the rear vehicles on the same road. MPDB protocol consists of two phases: (i) mobility prediction phase and (ii) broadcasting phase. The mobility prediction can be acquired through periodical beaconing. In mobility prediction phase, each vehicle gets its rear vehicle set on the same road through neighbour’s position, inter-vehicle distance, relative speed and moving direction. In broadcast phase, MPDB protocol selects a vehicle having the largest link available time (LAT) values acquired by the mobility prediction as a rebroadcast vehicle among the rear vehicle set acquired in previous phase. By using LAT for broadcasting propagation, MPDB protocol can intensify the reliability of the message dissemination and also prevent the broadcast storm problem in vehicular networks. The simulation results show that MPDB protocol has better performance improvement in terms of average packet rate and packet delay.

A Bandwidth-Efficient Dissemination Scheme of Non-Safety Information in Urban VANETs.

The recent release of standards for vehicular communications will hasten the development of smart cities in the following years. Many applications for vehicular networks, such as blocked road warnings or advertising, will require multi-hop dissemination of information to all vehicles in a region of interest. However, these networks present special features and difficulties that may require special measures. The dissemination of information may cause broadcast storms. Urban scenarios are especially sensitive to broadcast storms because of the high density of vehicles in downtown areas. They also present numerous crossroads and signal blocking due to buildings, which make dissemination more difficult than in open, almost straight interurban roadways. In this article, we discuss several options to avoid the broadcast storm problem while trying to achieve the maximum coverage of the region of interest. Specifically, we evaluate through simulations different ways to detect and take advantage of intersections and a strategy based on store-carry-forward to overcome short disconnections between groups of vehicles. Our conclusions are varied, and we propose two different solutions, depending on the requirements of the application.

ReIDD: reliability-aware intelligent data dissemination protocol for broadcast storm problem in vehicular ad hoc networks

Vehicular ad hoc networks (VANETs) have emerged as fast growing networks with aims to provide safety, and comfort to the onboard passengers. But, in this environment reliable data dissemination to the destination nodes is one of the biggest challenges as there may be a congestion in the network due to blind flooding of messages to their final destination, called as broadcast storm which may lead to the performance degradation with respect to the metric such as-message delivery, reliability and response time. To address this issue, in this paper, we propose a reliability-aware intelligent data dissemination protocol for broadcast storm problem in VANETs. We have solved the above specified problem using game theory concepts in which players, strategy space and decisions with respect to the current state of the system. To reduce the message overhead with respect to the communication cost among the players of the game, in the proposed scheme, messages are routed to the next destination by selecting the most reliable path in an intelligent manner. A coalition game is formulated among the vehicles by considering vehicles as the players in the game. Each player in the game has an initial payoff value based upon the parameters such as-communication range, storage requirements, and computation power. Based upon the payoff value of the players in the game, different coalitions/clusters are formulated among the players in the proposed scheme. Then, the players send the messages to the other vehicles/players within the same coalition which increases the reliability of transmission. In the proposed scheme, messages are unicasted to their final destination in an intelligent manner. Different algorithms are designed for coalition formation, maintenance, and reliability-aware data dissemination. The performance of the proposed scheme is evaluated using various evaluation metrics such as-service time, packet delivery ration, and throughput. The results obtained prove the effectiveness of the proposed scheme as compared to the other state-of-the-art existing schemes.

Minimizing Broadcast Expenses in Clustered Ad-hoc Networks

One way to minimize the broadcast expenses of routing protocols is to cluster the network. In clustered ad-hoc networks, all resources can be managed easily by resolving scalability issues. However, blind query broadcast is a major issue that leads to the broadcast storm problem in clustered ad-hoc networks. This query broadcast is done to carry out the route-search task that leads to the unnecessary propagation of route-query even after route has been found. Hence, this query propagation poses the problem of congestion in the network. In particular this motivates us to propose a query-control technique in such networks which works based on broadcast repealing. A huge amount of work has been devoted to propose the query control broadcasting techniques. However, such techniques used in traditional broadcasting mechanisms need to be properly extended for use in the cluster based routing architecture. In this paper, query-control technique is proposed for cluster based routing technique to reduce the broadcast expenses. Finally, we report some experiments which compare the proposed technique to other commonly used techniques including standard one-class AODV that follows TTL-sequence based broadcasting technique.

A Probabilistic Broadcasting Mechanism based on Cross Layer Model Deliberating Received Signal Strength Ratio in Mobile Ad Hoc Networks

Mobile Ad Hoc Networks(MANETs) consists of mobile nodes which communicate with each other without any centralized infrastructure. Message broadcasting by flooding for route discovery in MANET can result in high redundant retransmission, contention and collision of broadcasting packet, known as the broadcast storm problem collectively. The cross-layer design is adopted in this paper, which lets routing layer share the received signal strength information at MAC layer. Also this paper proposes a new probabilistic approach that dynamically adjusts the rebroadcasting probability of a node for routing request packets (RREQs) according to the received signal strength. The simulation results show that the proposed approach demonstrates better performance than blind flooding, fixed probabilistic broadcasting approaches.

A Novel VANET Data Dissemination Approach Based on Geospatial Data

The main objective of VANET networks is to improve road safety as well as transportation efficiency through the use of wireless communications technologies and the emergence of low cost embedded sensors. Thus, the design of an efficient data dissemination protocol, that informs vehicles about interesting safety events, is of paramount importance. The thriving challenge would be to maximize the delivery ratio by avoiding as far as possible the broadcast storm problem. A scrutiny of the literature wealthy number of approaches highlights that all of them fail to fulfill with a critical requirements. In this paper and to palliate this shortage, we introduce a new infrastructure-less Geocast protocol that send messages only to vehicles in the Zone of Relevance (ZOR) with a minimum overhead cost. Our protocol stands in reaching a high delivery ratio as well as a high Geocast precision by only sending messages to vehicles in the Zone of Relevance (ZOR) with a minimum overhead cost. Carried out experiments show that our protocol outperforms its competitors in terms of effectiveness and efficiency.

A novel approach for scalable multi-hop data dissemination in vehicular ad hoc networks

Vehicular Ad hoc Networks (VANETs) have the potential to improve road safety and travel convenience, by providing self-organizing decentralized environments to disseminate traffic data, without requiring fixed infrastructure. The public interest of traffic data makes it appropriate for VANET data dissemination methods to rely on broadcasting. However, scalability issues arise when broadcasting under high density scenarios, where the high percentage of data redundancy and packet collisions may easily lead to the broadcast storm problem. Existing solutions either do not scale well under high density scenarios, or require extra overhead to estimate traffic density, so as to manage data dissemination accordingly. In this paper, we provide a novel approach for data dissemination in multi-hop VAENT that relies on traffic regime estimation to provide scalable broadcast, without extra communication overhead. Simulation results show the efficiency of our broadcasting approach in achieving low broadcasting overhead while maintaining the high data delivery ratio.

SEAD: A simple and efficient adaptive data dissemination protocol in vehicular ad-hoc networks

Vehicular ad-hoc network (VANET) is becoming a promising technology for improving the efficiency and the safety of intelligent transportation systems by deploying a wide variety of applications. Smart vehicles are expected to continuously exchange a huge amount of data either through safety or non-safety messages dedicated for road safety or infotainment and passenger comfort applications, respectively. One of the main challenges posed by the study of VANET is the data dissemination design by which messages have to be efficiently disseminated in a high vehicular speed, intermittent connectivity, and highly dynamic topology. In particular, broadcast mechanism should guarantee fast and reliable data delivery within a limited wireless bandwidth in order to fit the real time applications' requirements. In this work, we propose a simple and efficient adaptive data dissemination protocol called SEAD. On the one hand, the originality of this work lies in its simplicity and efficiency regardless the application's type. Simplicity is achieved through a beaconless strategy adopted to take into account the surrounding vehicles' density. Thanks to a metric locally measured, each vehicle is able to dynamically define an appropriate probability of rebroadcast to mitigate the broadcast storm problem. Efficiency is manifested by reducing excessive retransmitted messages and hence promoting the network capacity and the transmission delay. The simulation results show that the proposed protocol offers very low packet drop ratio and network load while still maintaining a low end-to-end delay and a high packet delivery. On the other hand, SEAD protocol presents a robust data dissemination mechanism which is suitable either for safety applications or for other kinds of application. This mechanism is able to adapt the protocol performance in terms of packet delivery ratio to the application's requirements.

Broadcasting strategies for cognitive radio networks: Taxonomy, issues, and open challenges

Broadcasting is the simplest form of communication in which nodes disseminate the same information simultaneously to all of their neighbors. Broadcasting has been widely used in many types of networks including wireless networks, wireless sensor networks, and mobile ad-hoc networks. Likewise these networks, broadcasting is also used in cognitive radio networks (CRNs) to accomplish various tasks such as spectrum sensing, spectrum sharing, spectrum management, and spectrum mobility. This article investigates and provides a comprehensive overview of various broadcasting strategies that have been proposed so far for cognitive radio networks. Moreover, it provides a detailed study of broadcast storm problem in CRNs. Finally, it discusses issues, challenges and future research directions for broadcasting strategies in CRNs.

Energy evaluation of AID protocol in Mobile Ad Hoc Networks

Mobile Ad Hoc Networks (MANETs) are communication networks formed on the fly by radio-equipped mobile nodes without relying on any fixed infrastructure. Flooding is the simplest technique for information dissemination in ad hoc based networks, in which nodes disseminate a received message to all their neighbors. This algorithm leads to the broadcast storm problem that severely affects the energy consumption due to redundant submissions. To regulate redundant submissions, which can cause more collisions and requires more energy, recently there have been developed numerous broadcasting techniques. These techniques have been mainly proposed to solve the storm problem by preventing certain nodes from rebroadcasting received messages and/or by differentiating the timing of rebroadcasts. In this paper, we have evaluated and compared an adaptive information dissemination (AID) algorithm with other MANETs broadcasting protocols with respect to the energy efficiency. In AID, each node can dynamically adjust the values of its local parameters using information from neighboring nodes without requiring any additional effort, such as distance measurements or exact location-determination of nodes. Simulation results are reported and show that adaptive broadcasting schemes are most efficient with respect to save broadcast, energy consumption, and reachability.

How Shadowing Hurts Vehicular Communications and How Dynamic Beaconing Can Help

We study the effect of radio signal shadowing dynamics, caused by vehicles and by buildings, on the performance of beaconing protocols in Inter-Vehicular Communication (IVC). Recent research indicates that beaconing, i.e., one hop message broadcast, shows excellent characteristics and can outperform other communication approaches for both safety and efficiency applications, which require low latency and wide area information dissemination, respectively. To mitigate the broadcast storm problem, adaptive beaconing solutions have been proposed and designed. We show how shadowing dynamics of moving obstacles hurt IVC, reducing the performance of beaconing protocols. To the best of our knowledge, this is one of the first studies on identifying the problem and the underlying challenges and proposing the opportunities presented by such challenges. Shadowing also limits the risk of overloading the wireless channel. We demonstrate how these challenges and opportunities can be taken into account and outline a novel approach to dynamic beaconing. It provides low-latency communication (i.e., very short beaconing intervals), while ensuring not to overload the wireless channel. The presented simulation results substantiate our theoretical considerations.

Speed Adaptive Probabilistic Flooding for Vehicular Ad Hoc Networks

A significant issue in vehicular ad hoc networks (VANETs) is the design of an effective broadcast scheme that can facilitate the fast and reliable dissemination of emergency warning messages in the vicinity of an unexpected event, such as a traffic accident. In this paper, we propose a novel solution to this problem, which we refer to as speed adaptive probabilistic flooding. The scheme employs probabilistic flooding to mitigate the effects of the broadcast storm problem, which is typical when using blind flooding, and its unique feature is that the rebroadcast probability is adaptively regulated based on the vehicle speed to account for varying traffic densities within the transportation network. The motivation behind this choice is the identification of the existence of phase transition phenomena in probabilistic flooding in VANETs, which dictate a critical probability being affected by the varying vehicle traffic density and are shown to be linearly related to the vehicle speed (a locally measurable quantity). The scheme is evaluated using simulations on different sections of the freeway system in the City of Los Angeles, CA, USA. Simulation results indicate that the proposed scheme fulfills its design objectives, as it achieves high reachability and low latency of message delivery with low overhead in a number of representative scenarios. The scheme is also shown to outperform existing solutions, including Global-Positioning-System-based, and exhibits robustness with respect to different road topologies and parameters such as the transmission range of vehicles and the number of hops.

Performance Investigation of Signal Strength based Gossip AODV

Due to their “on demand” nature, the reactive protocols for MANETs, incurred less overhead and hence are preferred over proactive protocols. Since reactive protocols rely on network wide flooding of routing messages, they suffer from the “broadcast storm” problem. Received signal strength based probabilistic flooding scheme named RSSGossipAODV was proposed in [13]as an attempt to solve the frequent link breakages and broadcast storm experienced in AODV routing protocol. This paper investigates the ability of RSS-GossipAODV to handle different node mobility speeds in faded and non-faded environments.The performance of RSS-GossipAODV is evaluated by varying node mobility speed. It is evident from our experimental results that in both non faded and Rician faded scenarios, RSS-GossipAODV outperforms conventional AODV in term of packet delivery ratio, throughput, delay and link breakages and at the same time tries to minimize the broadcast storm problem by flooding lesser number of route request (RREQ) messages. General Terms Ad Hoc Networks, MANET

A rate control video dissemination solution for extremely dynamic vehicular ad hoc networks

Video dissemination to a group of vehicles is one of the many fundamental services envisioned for Vehicular Ad hoc Networks, especially as a building block for entertainment applications. For this purpose, in this paper we describe VoV, a video dissemination protocol that operates under extremely dynamic road traffic conditions. Contrary to most existing approaches that focus exclusively on always-connected networks and tackle the broadcast storm problem inherent to them, VoV is designed to operate under any kind of road traffic condition. We propose a new geographic-based broadcast suppression mechanism that gives a higher priority to rebroadcast to vehicles inside especial forwarding zones. Furthermore, vehicles store and carry received messages in a local buffer in order to forward them to vehicles that were not covered by the first dissemination process, probably as a result of collisions or intermittent disconnections. Finally, VoV employs a rate control mechanism that sets the pace at which messages must be transmitted according to the perceived network data traffic, thus avoiding channel overloading. Therefore, VoV adapts not only to the perceived road traffic condition, but also to the perceived channel quality. When compared to two related and well-accepted solutions–ABSM and AID–under Manhattan grid and real city scenarios, we show that, overall, our proposal is more efficient in terms of message delivery, delay and overhead.

A Suitable Vehicular Broadcast Protocol under Different Traffic Patterns for Urban Scenario

VANETs have emerged as an exciting research and application area. Increasingly vehicles are being equipped with embedded sensors, processing and wireless communication capabilities. This has opened a myriad of possibilities for powerful and potential life-changing applications on safety, efficiency, comfort, public collaboration and participation, while they are on the road. Although, considered as a special case of a Mobile Ad Hoc Network, the high but constrained mobility of vehicles bring new challenges to data communication and application design in VANETs. This is due to their highly dynamic and intermittent connected topology and different application's QoS requirements.. In this work, we propose a new data dissemination protocol named as TURBO. The TURBO aims is to eliminate the broadcast storm problem in dense scenario and maximize the coverage in sparse scenario. TURBO protocol was compared with four well-known protocols from literature: AID, DBRS, Flooding, and GEDDAI. Simulation results show that our proposed protocol has performed better than other four protocols, outperforming them in different scenarios in all the evaluations carried out.

Intelligent Information Dissemination Scheme for Urban Vehicular Ad Hoc Networks

In vehicular ad hoc networks (VANETs), a hotspot, such as a parking lot, is an information source and will receive inquiries from many vehicles for seeking any possible free parking space. According to the routing protocols in literature, each of the vehicles needs to flood its route discovery (RD) packets to discover a route to the hotspot before sending inquiring packets to the parking lot. As a result, the VANET nearby an urban area or city center may incur the problem ofbroadcast stormdue to so many flooding RD packets during rush hours. To avoid the broadcast storm problem, this paper presents ahotspot-enabledrouting-tree based data forwarding method, called the intelligent information dissemination scheme (IID). Our method can let the hotspot automatically decide when to build the routing-tree for proactive information transmissions under the condition that the number of vehicle routing discoveries during a given period exceeds a certain threshold which is calculated through our developed analytical packet delivery model. The routing information will be dynamically maintained by vehicles located at each intersection near the hotspot if the maintaining cost is less than that of allowing vehicles to discover routes themselves. Simulation results show that this method can minimize routing delays for vehicles with lower packets delivery overheads.

Design of Scalable Navigation System Using Probability-based Broadcasting Approach in VANET

Global Positioning System (GPS) is widely used for finding the shortest path from source to destination based on a local map database, as real-time road situations are not taken into consideration in GPS. Vehicular ad-hoc network (VANET) based navigation system automatically searches for the route that yields minimum traveling delay. The system uses collected data to provide navigation service to drivers. In order to maintain the security and privacy, a Trusted Authority (TA) is able to obtain user's real identity. However, the centralized approach for route searching is not scalable for large cities. Probability based broadcasting approach eliminates privacy issues and provides scalability. Thus, propose broadcasting approach provides two ways to determine a retransmit probability: 1) fixed (V2I) and 2) one-hop distance (V2 V). Broadcasting approach also eliminates broadcast storm problem with reasonable delay and high delivery rate.

An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks.

A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same time considering the node's remaining energy. The Connected Dominating Set is widely used as a virtual backbone or spine in mobile ad hoc networks [MANETs] or Wireless Sensor Networks [WSN]. The CDS of a graph representing a network has a significant impact on an efficient design of routing protocol in wireless networks. Here the CDS is a distributed algorithm with activity scheduling based on unit disk graph [UDG]. The node's mobility and residual energy (RE) are considered as parameters in the construction of stable optimal energy efficient CDS. The performance is evaluated at various node densities, various transmission ranges, and mobility rates. The theoretical analysis and simulation results of this algorithm are also presented which yield better results.

An Intelligent Broadcasting Algorithm for Early Warning Message Dissemination in VANETs

Vehicular ad hoc network (VANET) has gained much attention recently to improve road safety, reduce traffic congestion, and enable efficient traffic management because of its many important applications in transportation. In this paper, an early warning intelligence broadcasting algorithm is proposed, EW-ICAST, to disseminate a safety message for VANETs. The proposed EW-ICAST uses not only the early warning system on the basis of time to collision (TTC) but also the intelligent broadcasting algorithm on the basis of fuzzy logic. Thus, the EW-ICAST resolves effectively broadcast storm problem and meets time-critical requirement. The performance of EW-ICAST is evaluated through simulation and compared with that of other alert message dissemination algorithms. From the simulation results, we know that EW-ICAST is superior toSimple,P-persistence, andEDBalgorithms.