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

by   B. R. Vinay Kumar, et al.

We consider the problem of energy-efficient broadcasting on dense ad-hoc networks. Ad-hoc networks are generally modeled using random geometric graphs (RGGs). Here, nodes are deployed uniformly in a square area around the origin, and any two nodes which are within Euclidean distance of 1 are assumed to be able to receive each other's broadcast. A source node at the origin encodes k data packets of information into n (>k) coded packets and transmits them to all its one-hop neighbors. The encoding is such that, any node that receives at least k out of the n coded packets can retrieve the original k data packets. Every other node in the network follows a probabilistic forwarding protocol; upon reception of a previously unreceived packet, the node forwards it with probability p and does nothing with probability 1-p. We are interested in the minimum forwarding probability which ensures that a large fraction of nodes can decode the information from the source. We deem this a near-broadcast. The performance metric of interest is the expected total number of transmissions at this minimum forwarding probability, where the expectation is over both the forwarding protocol as well as the realization of the RGG. In comparison to probabilistic forwarding with no coding, our treatment of the problem indicates that, with a judicious choice of n, it is possible to reduce the expected total number of transmissions while ensuring a near-broadcast.


Probabilistic Forwarding of Coded Packets on Networks

We consider a scenario of broadcasting information over a network of nod...

The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol

This paper is concerned with the problem of broadcasting information fro...

Schedule Sequence Design for Broadcast in Multi-channel Ad Hoc Networks

We consider a single-hop ad hoc network in which each node aims to broad...

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

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

In Information-Centric Networking (ICN), consumers send interest packets...

PPTP: Price-based Path-specified Transport Protocol for Named Data Network using Blockchain

Serving as a potential future Internet architecture, Named Data Network ...

Cooperative Data Exchange based on MDS Codes

The cooperative data exchange problem is studied for the fully connected...

Please sign up or login with your details

Forgot password? Click here to reset