Probabilistic Second-Chance Broadcasting With/Without Global Positioning System Information in Wireless Ad Hoc Networks

Abstract

A flooding algorithm aims to distribute messages to all nodes within the mobile environment. In a simple flooding scheme, every node broadcasts a newly received message. However, this simple mechanism generates massive redundant messages, which is referred to as the broadcast storm problem. To ease the negative effect of the broadcast storm problem, we proposed a novel scheme, Probabilistic Second-chance broadcasting with/without Global positioning system information (PSG) in wireless ad hoc networks, which amalgamates the merits of probability-based and location-based flooding algorithms. PSG eases the broadcast storm problem by reducing the total number of transmissions and does not require hello messages from neighboring nodes, yet achieves better results than Multipoint Relaying Flooding (MPR), a neighbor-knowledgebased flooding scheme, by accurately determining whether subsequent forwarding is advantageous while a node receives a broadcasting message. We also discuss the advantages of a two-phase/second-time algorithm and utilize a simplified topology to further explain and demonstrate the merits of second-time broadcasting. We compare our PSG scheme with the simple flooding scheme, the probabilistic schemes with different preassigned probabilities, and the MPR schemes with or without the overhead of hello messages. The simulation results show that our scheme demands fewer forwarding nodes to rebroadcast messages and therefore lowers the total number of transmissions. PSG scales down a large number of collisions and attains high delivery ratios compared to other flooding algorithms. INDEX TERMS Ad hoc networks, broadcasting, global positioning system, flooding, probabilistic.

A Novel Cross-Layer Adaptive Fuzzy-Based Ad Hoc On-Demand Distance Vector Routing Protocol for MANETs

“…Several dynamic probabilistic approaches have also been proposed in which a variety of criteria are used to determine the forward probability. For example, [27] proposed a two-phase probabilistic algorithm that used a second-timed broadcasting scheme based on signal-strength and GPSderived distances to calculate forward probability and random assessment delay (see [8] for more details). Node mobility and link stability have also been considered in [28] to propose a probabilistic broadcasting algorithm to predict stable links that are involved in routing paths.…”

“…Finally, hybrid broadcast schemes optimize MANET broadcasting by combining the benefits of two or more methods to achieve better routing performance. An adaptive probabilistic broadcasting technique was proposed in [27] based on Neighbour knowledge and a forwarding zone criterion. The algorithm considers the density of nodes using a density metric called expansion metric.…”

Consensus protocol in heterogeneous opportunistic networks

“…Heterogeneous opportunistic network is an self-organized network that uses the chance of meeting brought by the random movement of nodes to achieve communication between nodes, and the construction of nodes is different.The concept of heterogeneous opportunistic networks comes from Mobile Ad-Hoc Networks [1] and Delay-Tolerant Networks [2]. The Mobile Ad-Hoc Network is a mobile network without infrastructure support, the nodes in the network are moved randomly, and when the two nodes are in their respective communication ranges, they can communicate directly.…”