2013/12/14 by Shwan Ashrafi, Ashrafi, Shwan, Sumit Roy +3
Computer Science · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Wireless Networks and Protocols
paper · pdf · doi:10.48550/arxiv.1312.4091
openalex publication_date 2013/12/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Random linear network coding (RLNC) unicast protocol is analyzed over a rapidly-changing network topology. We model the probability mass function (pmf) of the dissemination time as a sequence of independent geometric random variables whose success probability changes with every successful reception of an innovative packet. We derive a tight approximation of the average networked innovation probability conditioned on network dimension increase. We show through simulations that our approximations for the average dissemination time and its pmf are tight. We then propose to use a RLNC-based broadcast dissemination protocol over a general dynamic topology where nodes are chosen for transmission based on average innovative information that they can provided to the rest of the network. Simulation results show that information disseminates considerably faster as opposed to standard RLNC algorithm where nodes are chosen uniformly at random.