The broadcast storm problem in a mobile ad hoc network

2006

Routing protocols developed for ad hoc wireless networks use broadcast transmission to either discover a route or disseminate information. More specifically, reactive routing protocols has to flood the network with a route request (RREQ) message in order to find an optimal route to the destination. Several applications developed for vehicular ad hoc wireless networks (VANET), which is a subset of MANET, rely on broadcast to propagate useful traffic information to other vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem.

2016

Information broadcasting in MANETs is an essential building block for cooperative operations, group discussions, and common announcements (e.g., filling routing tables). The flooding is the simplest broadcasting scheme used in MANETs. In this scheme, source nodes broadcast at once packets to all neighbors. Broadcasting through flooding causes increased messages redundancy, collision, and wastage of bandwidth and energy. Several approaches have been proposed to solve these issues and could be classified into two main categories: static schemes and adaptive schemes. In this paper, we introduce an adaptive scheme for information broadcasting in MANETs. This scheme allows nodes to select an appropriate action, either to rebroadcast or to discard receiving messages. The decision is based on the amount and timestamps of received messages. Simulations have been conducted and results show that the proposed scheme reduces the number of packet transmissions, has better latency and SRB, good r...

2008 International Conference on Information Science and Security (ICISS 2008), 2008

In a multi-hop wireless ad hoc network, broadcasting is an elementary operation to support many applications. Broadcasting by flooding may cause serious redundancy, contention, and collision in the network, which is referred to as the broadcast storm problem. Many broadcasting schemes are proposed to give better performance than simple flooding in wireless ad hoc network. How to decide whether rebroadcast or not also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose enhanced broadcasting schemes, which can reduce rebroadcast packets without loss of reachability. Simulation results show that proposed schemes can offer better reachability as well as efficiency as compared to other previous schemes.

Mobile Ad-Hoc Networks: Protocol Design, 2011

Lecture Notes in Computer Science

In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simplest and commonly used mechanism for broadcasting in MANETs, where each node retransmits every uniquely received message exactly once. Despite its simplicity, it however generates redundant rebroadcast messages which results in high contention and collision in the network, a phenomenon referred to as broadcast storm problem. Pure probabilistic approaches have been proposed to mitigate this problem inherent with flooding, where mobile nodes rebroadcast a message with a probability p which can be fixed or computed based on the local density. However, these approaches reduce the number of rebroadcasts at the expense of reachability. On the other hand, counter-based approaches inhibit a node from broadcasting a packet based on the number of copies of the broadcast packet received by the node within a random access delay time. These schemes achieve better throughput and reachability, but suffer from relatively longer delay. In this paper, we propose an efficient broadcasting scheme that combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement. Simulation results reveal that the new scheme achieves superior performance in terms of saved-rebroadcast, reachability and latency.

2010 Wireless Advanced 2010, 2010

Mobile ad hoc networks (MANETs) have been gaining tremendous attention owing to the advances in wireless technologies accompanied by many applications and implementations. However, there are still a number of issues in MANETs which require further investigations and efficient solutions. Out of these issues, broadcasting in MANETs has been a major problem for both industry and the research community. The broadcast communication is usually required to disseminate a message to all the nodes of a network. This operation is highly required in MANETs to distribute necessary information and ensure efficient control and coordination over the network nodes. However, broadcasting in MANETs is usually susceptible to several challenging communication issues, including, flooding, packets contentions and collisions, i.e., these problems all together are called the Broadcast Storm Problem (BSP). Despite a number of suggested solutions for BSP, the probabilistic scheme is considered the most promising solution due to its simplicity and suitability for MANETs. Under the umbrella of this scheme, many dynamic probabilistic broadcasting algorithms have been proposed in the literature to solve the BSP. However, most of them are not suitable for many applications including those real life scenarios as there are many limitations such as the probability of rebroadcasting operation and thresholds rebroadcasting permission, which is caused by collecting local neighbourhoods' connectivity by broadcasting HELLO packets.

11th International Conference on Parallel and Distributed Systems (ICPADS'05), 2005

Broadcasting has many important uses and several Mobile Ad hoc Networks (MANETs) protocols assume the availability of an underlying broadcast service. Applications, which make use of broadcasting, include LAN emulation, paging a particular node, However, broadcasting induces what is known as the "broadcast storm problem" which causes severe degradation in network performance, due to excessive redundant retransmission, collision, and contention. Although probabilistic flooding has been one of the earliest suggested approaches to broadcasting. There has not been so far any attempt to analyse its performance behaviour in MANETs. This paper investigates using extensive ns-2 simulations the effects of a number of important parameters in a MANET, including node speed, pause time and, traffic load, on the performance of probabilistic flooding. The results reveal that while these parameters have a critical impact on the reachability achieved by probabilistic flooding, they have relatively a lower effects on the number of saved rebroadcast packets.

Broadcasting in mobile ad hoc networks (MANETs) is a fundamental data dissemination mechanism, with important applications in, e.g., route discovery, address resolution, and faults diagnosis. However, broadcasting induces what is known as the "broadcast storm problem" which causes severe degradation in network performance, due to excessive redundant retransmission, collision, and contention. Broadcasting in MANETs has traditionally been based on flooding, which swamps the network with large number of rebroadcast packets in order to reach all network nodes. Although probabilistic flooding has been one of the earliest suggested approaches to broadcasting, there has not been so far any attempt to analyse its performance behaviour in MANETs. This paper investigates using extensive ns-2 simulations the effects of a number of important parameters in a MANET, including node speed, pause time and, traffic load, on the performance of probabilistic flooding. The results reveal that while these parameters have a critical impact on the reachability achieved by probabilistic flooding, they have relatively a lower effects on the number of saved rebroadcast packets.

2004

Mobile ad hoc networks (MANETs) suffer from high transmission error rate because of the nature of radio communications. The broadcast operation, as a fundamental service in MANETs, is prone to the broadcast storm problem if the forward nodes are not carefully designated. The objective of reducing the broadcast redundancy while still providing high delivery ratio for each broadcast packet is a major challenge in a dynamic environment. In this paper, we propose a simple reliable broadcast algorithm, called double-covered broadcast (DCB), that takes advantage of the broadcast redundancy to improve the delivery ratio in the environment that has rather high transmission error rate. Among 1-hop neighbors of the sender, only selected forward nodes retransmit the broadcast message. Forward nodes are selected in such a way that (1) the sender's 2-hop neighbors are covered and (2) the sender's 1hop neighbors are either a forward node, or a non-forward node but covered by at least two forwarding neighbors. The retransmissions of the forward nodes are received by the sender as confirmation of their receiving the packet. The non-forward 1-hop neighbors of the sender do not acknowledge the reception of the broadcast. If the sender does not detect all its forward nodes' retransmissions, it will resend the packet until the maximum times of retry is reached. Simulation results show that the algorithm provides good performance for a broadcast operation under high transmission error rate environment.

Simulation Modelling Practice and Theory, 2011

MANETs Broadcast Flooding Counter-based Broadcast storm problem Reachability Delivery ratio a b s t r a c t