Rateless-Coding-Assisted Multi-Packet Spreading over Mobile Networks

TL;DR

This paper introduces a rateless-coding-assisted protocol for efficient multi-packet spreading in mobile networks, significantly reducing redundancy and spreading time, with validated theoretical bounds and analysis of packet duplication.

Contribution

It presents a novel RMPR protocol that reduces redundancy and spreading time, along with theoretical bounds and analysis of packet duplication in mobile networks.

Findings

Packet redundancy reduced by factor of √n

Spreading time reduced by at least factor of ln(n)

Packet duplication phenomenon analyzed for the first time

Abstract

A novel Rateless-coding-assisted Multi-Packet Relaying (RMPR) protocol is proposed for large-size data spreading in mobile wireless networks. With this lightweight and robust protocol, the packet redundancy is reduced by a factor of $\sqrt n$, while the spreading time is reduced at least by a factor of $\ln (n)$. Closed-form bounds and explicit non-asymptotic results are presented, which are further validated through simulations. Besides, the packet duplication phenomenon in the network setting is analyzed for the first time.