Delay control in MANETs with erasure coding and f-cast relay

Abstract

Packet delay control in Mobile Ad Hoc Networks (MANETs) is critical to support delay-sensitive applications in such networks. By combining erasure coding and packet redundancy techniques, this paper proposes a general two-hop relay algorithm 2HR-(x, τ, f) for a flexible control of packet delivery delay in MANETs , where a group of x packets in source node are first encoded into x • τ encoded packets based erasure coding, and each encoded packet is then delivered to at most f distinct relay nodes (f-cast) that will help to forward the encoded packet to destination node. To understand the delay performance in a 2HR-(x, τ, f) MANET, we then develop a discrete time multi-dimensional Markov chain model to depict the packet delivery process in the network, based on which closed-form results on mean and variance of packet delivery delay are further derived. Finally, extensive simulation and theoretical results are provided to illustrate

Hybrid loss recovery technique for multipath load balancing in MANETs

“…Bin Yang et al [16] have proposed a two-hop relay algorithm, including the process of erasure coding, packet delivery and decoding for controlling packet delivery delay by properly setting the coding group size, replication factor and packet redundancy. A group of packets of a source node in a specified coding group was encoded into multiple distinct coded packets based on general erasure coding, and then the source node distributed the redundant copies for each encoded packet to at most distinct relay nodes those relay nodes forwarded the encoded packet to a destination node, After receiving distinct coded packets of the coding group at the destination which decoded the packets for recovering the original packets at the destination node.…”

Weighted community graph–based social routing in delay-tolerant networks

“…Recently, more efficient routing schemes that utilize learned information (e.g. history state, utility metric, and knowledge oracles) [5][6][7][8] or network coding techniques 9 have been proposed. DTN-Flow 5 maintains nodes' transiting probabilities among different geographical sub-areas and chooses nodes that are most likely to move to the proximity of destination node as relay nodes.…”