ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

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

Vinay Kumar, BR and Kashyap, N and Yogeshwaran, D (2021) An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs. In: 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks, WiOpt 2021, 18-21 Oct 2021, Virtual, Philadelphia.

[img]
Preview
PDF
IEEE_WiOpt_2021.pdf - Published Version

Download (969kB) | Preview
Official URL: https://doi.org/10.23919/WiOpt52861.2021.9589218

Abstract

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. © 2021 IFIP.

Item Type: Conference Paper
Publication: 2021 19th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2021
Publisher: Institute of Electrical and Electronics Engineers Inc.
Additional Information: The copyright for this article belongs to Authors
Keywords: Encoding (symbols); Energy efficiency; Probability, Ad-hoc networks; Coded packet; Data packet; Energy efficient broadcasting; Euclidean distance; Forwarding probabilities; Forwarding protocols; Number of transmissions; Probabilistic forwarding; Random geometric graphs, Ad hoc networks
Department/Centre: Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited: 13 Dec 2021 11:30
Last Modified: 13 Dec 2021 11:30
URI: http://eprints.iisc.ac.in/id/eprint/70723

Actions (login required)

View Item View Item