The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol

01/07/2019
by   Vinay Kumar B. R., et al.
0

This paper is concerned with the problem of broadcasting information from a source node to every node in an ad-hoc network. Flooding, as a broadcast mechanism, involves each node forwarding any packet it receives to all its neighbours. This results in excessive transmissions and thus a high energy expenditure overall. Probabilistic forwarding or gossiping involves each node forwarding a received packet to all its neighbours only with a certain probability p. In this paper, we study the effect of introducing redundancy, in the form of coded packets, into a probabilistic forwarding protocol. Specifically, we assume that the source node has k data packets to broadcast, which are encoded into n > k coded packets, such that any k of these coded packets are sufficient to recover the original k data packets. Our interest is in determining the minimum forwarding probability p for a "successful broadcast", which we take to be the event that the expected fraction of network nodes that receive at least k of the n coded packets is close to 1. We examine, via simulations and analysis of a number of different network topologies (e.g., trees, grids, random geometric graphs), how this minimum forwarding probability, and correspondingly, the expected total number of packet transmissions varies with the amount of redundancy added. Our simulation results indicate that over network topologies that are highly connected, the introduction of redundancy into the probabilistic forwarding protocol is useful, as it can significantly reduce the expected total number of transmissions needed for a successful broadcast. On the other hand, for trees, our analysis shows that the expected total number of transmissions needed increases with redundancy.

READ FULL TEXT
research
01/22/2019

Probabilistic Forwarding of Coded Packets on Networks

We consider a scenario of broadcasting information over a network of nod...
research
05/18/2021

An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs

We consider the problem of energy-efficient broadcasting on dense ad-hoc...
research
01/11/2018

A Monetary Mechanism for Stabilizing Cooperative Data Exchange with Selfish Users

This paper considers the problem of stabilizing cooperative data exchang...
research
07/22/2021

Low latency allcast over broadcast erasure channels

Consider n nodes communicating over an unreliable broadcast channel. Eac...
research
07/06/2009

Design of an Optimal Bayesian Incentive Compatible Broadcast Protocol for Ad hoc Networks with Rational Nodes

Nodes in an ad hoc wireless network incur certain costs for forwarding p...
research
07/02/2020

MICN: a network coding protocol for ICN with multiple distinct interests per generation

In Information-Centric Networking (ICN), consumers send interest packets...
research
11/09/2017

Match Made in Heaven: Practical Compressed Sensing and Network Coding for Intelligent Distributed Communication Networks

Based on the impressive features that network coding and compressed sens...

Please sign up or login with your details

Forgot password? Click here to reset