Broadcast Storm Research Articles

A Local Information Sensing-Based Broadcast Scheme for Disseminating Emergency Safety Messages in IoV

Internet of Vehicle (IoV) is playing an increasingly important role in constructing an Intelligent Transport System (ITS) of safety, efficiency, and green. Safety applications such as emergency warning and collision avoidance require high reliability and timeliness for data transmission. In order to address the problems of slow response and local broadcast storm commonly existing among waiting-based relay schemes of emergency messages, a local topology information sensing technology-based broadcast (LISCast) protocol is proposed in this paper, making use of the advantage of probability-based forwarding scheme in redundancy inhibition. According to the beacon broadcasted periodically between vehicles, LISCast collects information about number and distribution of neighbor, from which the characteristic information such as effective candidate number, maximum forwarding distance, and global traffic density are extracted. Through embedding the characteristic information into the head of broadcast packets by the message sender for assisting in making relay decision, the alternative receivers uniformly schedule forwarding priorities in a distributed and adaptive way. LISCast works without the help of a roadside unit and generates a little more overhead. The simulation results show that LISCast improves the ability to adapt to dynamic topology by optimizing the performance of delay, redundancy, and broadcast efficiency upon the condition of satisfying the high level of transmission reliability.

Modeling Probabilistic Flooding in VANETs for Optimal Rebroadcast Probabilities

Probabilistic flooding is commonly considered in vehicular ad-hoc networks (VANETs) to alleviate the celebrated broadcast storm problem. Heuristics and simulations have so far proved to be an efficient way with which to design probabilistic information dissemination solutions with demonstrated effectiveness. Supplementing with mathematical analysis for both design and evaluation is expected to generalize the results, and increase the confidence in the proposed solutions. So far, this has been limited due to the difficulties associated with the underlying stochastic dependencies. In this paper, we introduce simple models of single and multiple lane roads to design effective probabilistic flooding schemes for VANETs. The proposed analytical framework offers a novel and generic tool which can cover any number of lanes, vehicle transmission range, and density. We derive difference equations whose solutions yield the probability of all vehicles receiving the emergency warning message as a function of the rebroadcast probability, the number of neighbors of each vehicle, and the dissemination distance. The models are validated using simulations, realistically representing both the traffic and networking aspects, and are used as a baseline to design two schemes for information dissemination which employ probabilistic flooding. The one attempts direct calculation of the required parameters whereas the other adaptively regulates the rebroadcast probability based on the vehicle speed. The schemes are evaluated using simulations and are found to achieve significant performance improvements compared to blind flooding with respect to the achieved reachability, end-to-end delay, and number of rebroadcasts, comparable to the performance achieved by optimal flooding, obtained via brute force.

FPR: fuzzy controlled probabilistic rebroadcast in mobile ad hoc network

Broadcasting in mobile ad hoc networks is performed using various techniques like blind flooding, counter based broadcast, probabilistic broadcast etc. Among these flooding is the most primitive, where every node forwards the broadcast message whenever it gets the message for the first time. However, duplicate copies of the same broadcast message are always eliminated. In spite of simplicity of the mechanism, it results in highly redundant retransmission, contention and collision in the network. This is popularly termed as broadcast storm problem. Probabilistic broadcast method reduces the broadcast probability from 1 to some fraction close to 0.5. Certain probabilistic scheme use fixed probability while some others take into account network size, total number of nodes etc. The proposed article fuzzy controlled probabilistic broadcast or FPR computes rebroadcast probability of a node based on various factors line distance of downlink neighbours of current node from broadcast source, left, right, top, bottom coordinators of nodes already covered, hop count etc. Simulation results reveal that the proposed protocol improves network throughput, saves a lot of rebroadcast while reducing end-to-end delay.

The Broadcast Storm Problem in FANETs and the Dynamic Neighborhood-Based Algorithm as a Countermeasure

The Broadcast Storm Problem in FANETs and the Dynamic Neighborhood-Based Algorithm as a Countermeasure

Time Barrier-Based Emergency Message Dissemination in Vehicular Ad-hoc Networks

With the advancement in technology and inception of smart vehicles and smart cities, every vehicle can communicate with the other vehicles either directly or through ad-hoc networks. Therefore, such platforms can be utilized to disseminate time-critical information. However, in an ad-hoc situation, information coverage can be restricted in situations, where no relay vehicle is available. Moreover, the critical information must be delivered within a specific period of time; therefore, timely message dissemination is extremely important. The existing data dissemination techniques in VANETs generate a large number of messages through techniques such as broadcast or partial broadcast. Thus, the techniques based on broadcast schemes can cause congestion as all the recipients re-broadcast the message and vehicles receive multiple copies of same messages. Further, re-broadcast can degrade the coverage delivery ratio due to channel congestion. Moreover, the traditional cluster-based approach cannot work efficiently. As clustering schemes add additional delays due to communication with cluster head only. In this paper, we propose a data dissemination technique using a time barrier mechanism to reduce the overhead of messages that can clutter the network. The proposed solution is based on the concept of a super-node to timely disseminate the messages. Moreover, to avoid unnecessary broadcast which can also cause the broadcast storm problem, the time barrier technique is adapted to handle this problem. Thus, only the farthest vehicle rebroadcasts the message which can cover more distance. Therefore, the message can reach the farthest node in less time and thus, improves the coverage and reduces the delay. The proposed scheme is compared with traditional probabilistic approaches. The evaluation section shows the reduction in message overhead, transmission delay, improved coverage, and packet delivery ratio.

Channel-Adaptive Probabilistic Broadcast in Route Discovery Mechanism of MANETs

Broadcasting is the backbone of the route discovery process in on-demand routing protocols in Mobile Ad-hoc Networks (MANETs). Pure flooding is the simplest and most common broadcasting technique for route discovery in on-demand routing protocols. In pure flooding, the route request (RREQ) packet is broadcasted and each receiving node rebroadcasts it. This continues until the RREQ packet arrives at the destination node. The obvious drawback of pure flooding is excessive redundant traffic that degrades the system performance. This is commonly known as broadcast storm problem (BSP). To address BSP, various probabilistic broadcast schemes have been proposed in the literature where a node broadcasts a RREQ packet with a certain probability. However, these schemes do not consider the effects of thermal noise and co-channel interference which cannot be ignored in realistic MANETs, and therefore, these schemes do not perform well in real life MANETs. This paper presents a novel Channel Adaptive Probabilistic Broadcast (CAPB) scheme that adapts the rebroadcast probability dynamically to the current SINR (Signal to Interference plus Noise Ratio) and node density in the neighborhood. The proposed scheme and two related state of the art (SoA) schemes from the literature are implemented in the standard AODV routing protocol to replace the pure flooding based broadcast. Extensive ns-2 simulation results show that the proposed scheme outperforms the standard AODV, and the two competitors in terms of routing overhead, throughput, end-to-end delay and energy consumption significantly in noisy MANETs.

Context-Aware Data Dissemination for ICN-Based Vehicular Ad Hoc Networks

Information-centric networking (ICN) technology matches many major requirements of vehicular ad hoc networks (VANETs) in terms of its connectionless networking paradigm accordant with the dynamic environments of VANETs and is increasingly being applied to VANETs. However, wireless transmissions of packets in VANETs using ICN mechanisms can lead to broadcast storms and channel contention, severely affecting the performance of data dissemination. At the same time, frequent changes of topology due to driving at high speeds and environmental obstacles can also lead to link interruptions when too few vehicles are involved in data forwarding. Hence, balancing the number of forwarding vehicular nodes and the number of copies of packets that are forwarded is essential for improving the performance of data dissemination in information-centric networking for vehicular ad-hoc networks. In this paper, we propose a context-aware packet-forwarding mechanism for ICN-based VANETs. The relative geographical position of vehicles, the density and relative distribution of vehicles, and the priority of content are considered during the packet forwarding. Simulation results show that the proposed mechanism can improve the performance of data dissemination in ICN-based VANET in terms of a successful data delivery ratio, packet loss rate, bandwidth usage, data response time, and traversed hops.

A mobility-aware approach for distributed data update on unstructured mobile P2P networks

In unstructured mobile peer-to-peer systems (MP2P), the frequent link breakages lead frequent topology mismatching problems and data transmission failures due to high mobility of nodes. The overhead of data transmission and synchronization cannot be neglected. In order to keep the data consistent, flooding is a fundamental and straightforward data synchronization mechanism since a mobile node does not know which else has the same shared data item. However, data flooding causes the broadcast storm problem. In this paper, we propose a mobility-aware data update approach (MADU) to improve the data dissemination and to reduce the overhead of maintaining the consistency of shared data items in an MP2P network. We use safe-time which is derived from the neighbor’s location and speed to determine the time for a node to do the checking and updating between the neighbor nodes and itself. We also consider the network connectivity of a mobile node and access frequency of a data item as the factors to trigger the update process. By combining the mobility information of nodes, network connectivity, and access frequency of data items, we set a reasonable data update mechanism, which can significantly decrease the number of retransmissions and redundant messages so as to reduce the overhead of maintaining the data consistency.

On-demand route discovery in a unicast manner.

While having high bandwidth-efficiency, the ad-hoc on-demand distance vector (AODV) routing protocol suffers from high signaling overhead due to route request (RREQ) messages flooding, especially when the node density and the number of connections are increased. In order to resolve this broadcast storm problem of the AODV in a high node density mobile ad-hoc network, we propose a geographical on-demand route discovery scheme. Assuming a known location of the destination, the RREQ of the proposed routing protocol is propagated in a unicast manner by employing a novel parsing mechanism for possible duplicate RREQs. The routing overhead of the proposed routing protocol is greatly robust to the node density change. We derive the node density required for the proposed routing protocol to keep the same connectivity as the AODV under the circumstance where the nodes are uniformly distributed. In addition, we present an imaginary destination consideration method to incorporate the uncertainty of the destination’s location due to mobility. Computer simulations show that the proposed scheme enables the RREQ propagation to cover 95% of the one-hop communication area centered at the originally known location of the destination without sacrificing the unicast feature.

PIF and ReCiF: Efficient Interest-Packet Forwarding Mechanisms for Named-Data Wireless Mesh Networks

In this paper, we propose three mechanisms to reduce the broadcast storm problem in wireless mesh networks based on the Named-Data Network (NDN) architecture. The goal of our mechanisms is to reduce the number of content requests forwarded by nodes and consequently, increase the network efficiency. The first proposed mechanism, called Probabilistic Interest Forwarding (PIF), randomly forwards content requests. The second mechanism, called Retransmission-Counter-based Forwarding (ReCIF), decides to forward content requests based on the number of retransmissions by adding a counter to the header of requests. The third mechanism, called ReCIF+PIF, combines the features of PIF and ReCIF to suppress content requests. We compare the performance of our mechanisms with both the NDN default forwarding mechanism and the Listen First Broadcast Later (LFBL) mechanism. Our proposals outperform the default NDN forwarding mechanism by up to 21% regarding the data delivery rate in dense networks and provide a 25% lower delivery delay than the default NDN. Our mechanisms accomplish this performance by only reducing the number of content requests forwarded by nodes. One of our mechanisms, PIF, outperforms LFBL regarding the data delivery rate and delivery delay by up to 263% and 55%, respectively, for high network contention levels.

Toward a lightweight and efficient UAV‐aided VANET

AbstractConnectivity in a smart vehicular network is quite sensitive and highly affected by its dynamic network topology. Issues related to the intermittent nature of connectivity may arise due to the high mobility of nodes and network heterogeneity. In sparse areas, a vehicular network is basically a disruption‐tolerant network suffering from frequent disconnections, long delays, and messages loss. Facing these issues, and specifically for time‐sensitive applications, Unmanned Aerial Vehicle (UAV) can provide valuable assistance to Vehicular Ad Hoc Network (VANET) by assuming a relay node role between disconnected segments in the road. In such scenarios, effective communication is either between vehicles (V2V) or between vehicles and UAVs (V2U), which would form subsequently a UAV‐assisted vehicular network. In the present paper, we propose a new framework for using small UAVs as mobile infrastructure nodes in order to enhance the connectivity between vehicles. The first part of this framework accurately predicts the disconnected segments such that drones can be deployed to reestablish lost links. We have implemented a theoretical game for this prediction process. Furthermore, since the battery reserves of the UAVs are limited, we have proposed a mitigation technique based on game theory to reduce the power draining effects that a broadcast storm would have on the energy consumption of the network. For the validation of the proposed UVE (UAV‐aided VANET framework, with energy‐conscious constraints), we conducted thorough simulation scenarios with Network Simulator 3. The obtained performances are promising in the sense that our approach achieves high packet delivery ratio, low end‐to‐end delay, and low overhead communication costs.

DIFS: Distributed Interest Forwarder Selection in Vehicular Named Data Networks

In this paper, we propose a distributed interest forwarder selection (DIFS) scheme that mitigates the interest broadcast storm in vehicular named data networks. In DIFS, a vehicle sends an interest packet piggybacking its location, distance to the neighbors, and speed. In this case, the immediate neighbors do not have the requested content and rank themselves to be an eligible interest forwarder by using multiple attributes. Additionally, every intermediate vehicle uses a digital map to be selected as forwarders in both (forward and backward) directions of the consumer. Simulations show that DIFS satisfies more interest packets with less delay as compared with the recent forwarding solutions.

A Trusted Lightweight Communication Strategy for Flying Named Data Networking.

Flying Ad hoc Network (FANET) is a new resource-constrained breed and instantiation of Mobile Ad hoc Network (MANET) employing Unmanned Aerial Vehicles (UAVs) as communicating nodes. These latter follow a predefined path called ’mission’ to provide a wide range of applications/services. Without loss of generality, the services and applications offered by the FANET are based on data/content delivery in various forms such as, but not limited to, pictures, video, status, warnings, and so on. Therefore, a content-centric communication mechanism such as Information Centric Networking (ICN) is essential for FANET. ICN addresses the problems of classical TCP/IP-based Internet. To this end, Content-centric networking (CCN), and Named Data Networking (NDN) are two of the most famous and widely-adapted implementations of ICN due to their intrinsic security mechanism and Interest/Data-based communication. To ensure data security, a signature on the contents is appended to each response/data packet in transit. However, trusted communication is of paramount importance and currently lacks in NDN-driven communication. To fill the gaps, in this paper, we propose a novel trust-aware Monitor-based communication architecture for Flying Named Data Networking (FNDN). We first select the monitors based on their trust and stability, which then become responsible for the interest packets dissemination to avoid broadcast storm problem. Once the interest reaches data producer, the data comes back to the requester through the shortest and most trusted path (which is also the same path through which the interest packet arrived at the producer). Simultaneously, the intermediate UAVs choose whether to check the data authenticity or not, following their subjective belief on its producer’s behavior and thus-forth reducing the computation complexity and delay. Simulation results show that our proposal can sustain the vanilla NDN security levels exceeding the 80% dishonesty detection ratio while reducing the generated end-to-end delay to less than 1 s in the worst case and reducing the average consumed energy by more than two times.

An Adaptive Emergency Broadcast Strategy for Vehicular Ad Hoc Networks

In recent years, since the adoption of the IEEE 802.11p and IEEE 1609 standards, Vehicular Ad hoc Networks (VANETs) have received a significant amount of attention in Ad hoc Network studies. Vehicular safety applications have thus played an important role in VANETs, and many emergency broadcast systems have been proposed. However, some of these broadcast mechanisms might result in the broadcast storm problem. The emergency broadcast strategy proposed in this paper is that when a car accident occurs, the vehicle's sensors detect impacts and immediately send emergency messages to inform other vehicles nearby. In addition, we propose a way to eliminate redundant broadcasts and to ensure that emergency messages can be transmitted properly. We propose a stability function to estimate the reliability of the transponder. The backoff procedure of this proposed method assigns appropriate waiting times to different forwarders. The proposed scheme is implemented with NS2 simulator based on WAVE/DSRC standards. Simulation results show that the proposed protocol exhibits outstanding performance in terms of forwarding counts, packet loss rate, and delay time in different environments. In addition, our protocol maintains stability in different vehicle density scenarios so that each vehicle receives emergency messages and holds a low latency to ensure that the driver has adequate safety response time to enhance traffic safety.

A Novel Algorithm for Enhancement of Energy Efficient Zone Based Routing Protocol for MANET

Mobile Ad-hoc Network (MANET) is a group of self-sustaining movable nodes which are communicating to other nodes in the networks through wireless connections. The motile nodes within the communication range can directly communicate with each other, whereas other nodes require the support of neighbouring nodes by using routing protocols. Most routing protocols are utilizing the rebroadcasting techniques to reduce the path overhead. An energy efficient zone based routing protocols are developed to reduce the redundant broadcasting through on-demand parallel collision guided broadcasting. Nevertheless, the broadcast storm is occurring due to transmit of simultaneous collision guided broadcasting which causes larger power consumption. Hence, this paper deals with a novel algorithm to increase the energy efficient zone based routing protocols which control the network topology by estimating node die out rate. Furthermore, a game theory approach with energy efficient zone based routing protocol to improve QoS routing for MANET. Finally, the experimental outcomes proved the efficiency of the proposed algorithm compared with other routing algorithms.

Performance modeling of SEAD protocol in vehicular environment

Toward the growing number of the transport safety applications offered by VANET, a large amount of messages need to be efficiently disseminated between connected vehicles. The requirement for an efficient data dissemination in vehicular environment is ensuring the highest data reachability, using the minimum network resources within a short end to end delay. To meet these properties, researchers have addressed the data dissemination challenges, mainly the famous broadcast storm, which has lead to a wide variety of solutions. In this work, we present two Simple and Efficient Adaptive data Dissemination protocols called SEAD1 and SEAD2 that combine a probabilistic and a delay based approach. The originality of these protocols is that they can be adaptively tuned according to the VANET applications’ requirements. Therefore, a rigorous performance evaluation of the protocols is proposed through an analytic model and a large set of NS3 simulations. The analytic results show excellent fits to the simulation results which confirm the accuracy of the proposed model. Moreover, based on our analytic model we became able to thoroughly study the protocols parameters’ behavior and derive an accurate configuration. Thereby, a proper trade-off between the packet delivery ratio and the redundancy ratio is possible in attempt to tune the protocols performance according to the application criticality level.

SFabric: a scalable SDN based large layer 2 data center network fabric

Data centers are now the basis for many Internet and cloud computing services. Trends toward multi-core processors, end-host virtualization, and commodities of scale are pointing to future single-site data centers with millions of virtual end-hosts. The Ethernet/IP style layer 2 and layer 3 network protocols are facing some mixture of inherent limitations in supporting such large topologies: lack of scalability, difficult to management, inflexible in communication, limited support for virtual machine migration. Although several large layer 2 network technologies have been proposed in recent years, they still have several weaknesses that impede them from practical applications such as inflexible, broadcast storms, un-scalability and un-interoperability with existing devices. Software defined networking (SDN) is an emerging promising solution to the above problems due to its outstanding characteristics of control plane and data plane separation, centralized and flexible network management. However, the limited efficiency of the centralized SDN Controller and the large number of routing rules needed in switches are the two faced main challenges in scalability when adopting the existing SDN solutions in large data centers. Therefore, this paper proposes a novel SDN based large layer 2 network fabric for data centers: SFabric, which deals with the two challenges by highly reducing the interactions between the Controller and switches in computing and constructing the paths among switches in advance, and decreasing the number of routing rules in tagging and routing packets at switch levels. A prototype is developed and experimental results prove the good efficiency and scalability of the proposed method.

A efficient and reliable communication to reduce broadcast storms in VANET protocol

Vehicular Ad Hoc Networks are the networks of the vehicles which are connected with the high dynamic topology which changing environment. In this VANET topology, the broadcasting the message is the simplest way for communication. This simplest way of communication will be used for transmission of emergency messages from vehicles to vehicles. But the method of message transmission leads to the unwanted data flooding which causes the broadcast storm problems in which affects the overall reliability and performance of the VANET networks. To eradicate this problem we propose the new algorithm called GHN works on the selective distance allocation methodology for data transmission. The outcome of the system proves to be more efficient in terms of data throughput packet delivery ratio and it has been simulated using NS2.

Physical-traffic attentive vigorous routing (P-TAVR) and hot-spot detection to reduce the bottleneck in WSN

Minimizing the duration of data transmission is one of the major challenges in the wireless sensor communication. The sensor nodes in the networks take certain duration for observing the nearby sensor devices. Prominent factors such as broadcast storms, low bandwidth, multicasting, artificial congestion, etc can cause the bottleneck, results in data loss. In order to reduce the bottleneck in the sensor networks, physical traffic attentive vigorous routing protocol (P-TAVR) is proposed. This protocol will reduce the bottleneck effect by detecting the hot-spots thus reducing the network traffic. The proposed method is presented with three different phases such as Run-up, Set-up, Routing and detection phases. With the use of physical knowledge in this protocol, the location as well as the energy of every other sensor node is known by all the sensor nodes in the stream. In addition, an efficient modified routing algorithm is presented to select the cluster head nearer to the sink next hop. So that, in case of the bottleneck, the nodes are capable of determining the best possible routes with higher energy nodes for data transmission. Since the protocols utilized by the WSNs are application oriented; three classes such as data-centric, hierarchical and location-based classes are investigated. The simulation tool used here is Network Simulator 2 and the comparison has been made with AODV, MintRoute and TADR. The parameters such as End to End Delay, Throughput, Energy Consumption and Packet delivery ratio have been investigated for two cases such as increasing simulation time and increasing density. The results show that P-TAVR provides higher efficiency and throughput among the existing methods.

Dynamic Broadcast Storm Mitigation Approach for VANETs

A high rate of historical accidents on public roads motivated the advent of the Wireless Access in Vehicular Environment (WAVE) standard. The main objective of WAVE was to develop strategies and protocols to enable inter-vehicular communication in view to reduce accident on public roads. Moreover, a successful message exchange can only be possible if the transmission medium is collision free. Under the Intelligent Transportation System (ITS), the cooperative Awareness messages (CAM) have to be transmitted at the rate of 10 Hz as per standard. To account for congestion management, the Distributed Congestion Control (DCC) mechanism was proposed. However, under higher node density, the DDC becomes inefficient and dramatically contribute to the deterioration of the VANET environment. The present work proposes a Dynamic Broadcast Storm Mitigation Algorithm (DBSMA) which can be used to combat the broadcast storm problem in a Vehicular Network (VN). The DBSMA approach performance was assessed against the DCC approach in twofold, first as a function of variable congestion condition under fixed mobility and secondly in term of variable speed under fixed density congestion. Results from several simulations confirmed that the DBSMA has a potentiality to conquer the effect of broadcast storm by offering higher robustness compared to DCC with about 130% improved efficiency. In addition to its computational simplicity, the DBSMA is easy to implement.