A new broadcast scheme for sensor networks

Broadcast is a common operation used in Mobile Ad hoc Networks (MANETs) for many services, such as, rout discovery and sending an information messages. The direct method to perform broadcast is simple flooding, which it can dramatically affect the performance of MANET. Recently, a probabilistic approach to flooding has been proposed as one of most important suggested solutions to solve the broadcast storm problem, which leads to the collision, contention and duplicated messages. This paper proposed new probabilistic method to improve the performance of existing on-demand routing protocol by reduced the RREQ overhead during rout discovery operation. The simulation results show that the combination of AODV and a suitable probabilistic rout discovery can reduce the average end-to-end delay as well as overhead and still achieving low normalized routing load, comparing with AODV which used fixed probability and blind flooding.

2018

Mobile ad hoc networks (MANETs) is a collection of wireless mobile devices that dynamically communicates with each other as a self-configuration without the need of centralized administration or fixed infrastructure. In this paper, we interested to introduce the different broadcast methods based on the probabilistic scheme which is simple implement code with speed broadcast and to reduce a storm broadcast problem effects and to alleviate redundancy through rebroadcast by using different routing protocols such as (AODV, DSR, LAR, PAR) that we interested in MANETs.

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.

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.

International Journal of Computer Science & Engineering Survey, 2010

Broadcasting is a fundamental operation in MANETs where a source node transmits a message that is to be disseminated to all the nodes in the network. Broadcasting is categorized into deterministic and probabilistic schemes. This paper reviews the probabilistic broadcasting protocol because of its adaptability in changing environment. Probabilistic broadcasting is best suited in terms of ad hoc network which is well known for its decentralized network nature. Probability, counter and distance based scheme under probabilistic scheme are discussed in this paper. Besides the basic probability scheme this paper also includes their recent advancements. Rebroadcast is one of the initial task for route discovery in reactive protocols. This review paper identify which protocol gives better performance in terms of reachability, saved rebroadcast and average latency in rebroadcasting a route request message. Simulation results are presented, which shows reachability, saved rebroadcast and average latency of the probabilistic broadcast protocols and their enhancement schemes. The comparative study shows the improvement of enhanced scheme over probabilistic schemes.

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.

—Mobile ad hoc networks routing protocols rely on traditional broadcast (flooding) to establish a route to the destination. Every node which receives this broadcast packet will rebroadcast it to all neighbors. This broadcast consumes valuable network resources (e.g., battery power, bandwidth, processing time, etc.). Many schemes were proposed to restrict traditional flooding by means of probability or mathematical methods. Some of these protocols utilize the location information on the nodes to restrict the broadcast zone like Location Aided Routing (LAR). In this paper, we will propose Vectorized Broadcast Routing (VBR) as an enhancement for LAR scheme 1 to reduce the broadcast by enlarging the broadcast region around the destination. In case of discovery phase failure, VBR will enlarge the broadcast region again around the destination, unlike LAR where the network will be flooded with this request again. Simulation results show that VBR can decrease the number of routing packets b...

… of the 5th annual ACM/IEEE …, 1999

Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we refer as the broadcast storm problem. In this paper, we identify this problem by showing how serious it is through analyses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcasts to alleviate this problem. Simulation results are presented, which show different levels of improvement over the basic flooding approach.

2009

Flooding is the simplest mechanism for broadcasting in mobile ad hoc networks (MANETs), where each node retransmits a given broadcast packet exactly once. Despite its simplicity, flooding can result in high redundant retransmission, contention and collision, a phenomenon collectively referred to as the broadcast storm problem. Several probabilistic broadcast schemes have been proposed to mitigate this inherent phenomenon. However, probabilistic schemes that utilize a random assessment delay (RAD) mechanism suffer from poor performance in terms of end-to-end delay and reachability in congested networks. In this paper, we propose a new adaptive probabilistic counter-based broadcast scheme that enables a mobile node to adapt its RAD to reflect its current local congestion level. Simulation results reveal that this simple adaptation achieves superior performance in terms of saved rebroadcast, end-to-end delay and reachability over existing similar schemes.

2011

Broadcasting has a central importance to Mobile Ad hoc Networks (MANETs) wherein it is frequently executed for the route discovery, address resolution, the application of paging a host and many other network services. Use of simple flooding, for broadcasts, causes redundant rebroadcasts and contention and collision issues that may lead to what is known as the broadcast storm problem. In this paper, we propose an angle-aware broadcasting algorithm as a contribution to address the broadcast storm problem. In this algorithm, rebroadcast probability is dynamically calculated, based on the angles covered (cover angles) by a node with respect to its neighbors, without using the latter's knowledge information or any complex calculations thereof. A simulation based execution of the proposed algorithm and performance comparison with flooding and fixed probabilistic broadcasting schemes show that our angle-aware probabilistic broadcasting technique outperforms the other two, in term of both delivery ratio and number of retransmissions.

IET Communications, 2011

Broadcasting is a key component of several networking mechanisms in mobile ad hoc networks.

2015 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS), 2015

Broadcasting is used in on-demand routing protocols to discover routes in Mobile Ad-hoc Networks (MANETs). On-demand routing protocols, such as AODV (Adhoc On-demand Distance Vector) routing, commonly employ pure flooding based broadcasting. However, pure flooding generates excessively redundant routing traffic that may lead to broadcast storm problem (BSP) and deteriorate the performance of MANETs significantly. Probabilistic broadcasting schemes were proposed in the literature to address BSP. However, these schemes do not consider thermal noise and interference which exist in real life MANETs, and therefore, do not perform well in real life MANETs. This paper presents a novel Channel Adaptive Probabilistic Broadcast (CAPB) scheme to disseminate RREQ packets efficiently. The proposed CAPB scheme determines the probability of rebroadcasting RREQ packets on the fly according 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 ([1] and [2]) are implemented in the standard AODV routing protocol to replace the pure flooding based broadcast. Simulation results show that the proposed scheme outperforms the standard AODV and the two competitors in terms of routing overhead, throughput and end-to-end delay significantly.

International Journal of Wireless & Mobile Networks, 2011

A mobile adhoc network is a collection of autonomous mobile nodes that that communicate with each other over wireless links. Hosts need to specify the requirements of the neighbors for efficient routing outside their transmission range. However, since there is no stationary infrastructure such as base stations, each host has to act as a router in itself and hence, a routing protocol runs on every host and is therefore subject to the limit of the resources at each mobile host. This paper proposes a new Efficient and dynamic probabilistic broadcasting (EDPB) approach, which solves the broadcast storm problem of AODV. Global Mobile Simulator is used to run simulations. The main performance metrics considered in simulations are routing overhead and end-to-end delays. The results show that, the normalized routing load is reduced to around 35% to 40% compared with AODV-blind flooding and AODV-fixed probability model, at a very heavy traffic load, when used with AODV-EDPB. The results show that AODV-EDPB algorithm performs better than AODV-blind flooding and AODV-fixed probability in terms of packet delivery ratio, end-to-end delay etc. especially in dense networks.

Mobile Ad-Hoc Networks: Protocol Design, 2011

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...