Throughput capacity of the group-based two-hop relay algorithm in MANETs

This paper focuses on the per node throughput capacity in mobile ad hoc networks (MANETs) with the general group-based two-hop relay algorithm. Under such an algorithm with packet redundancy limit f and group size g (2HR-(f, g) for short), each packet is delivered to at most f distinct relay nodes and can be accepted by its destination if it is a fresh packet to the destination and also it is among g packets of the group the destination is currently requesting. A general Markov chain-based theoretical framework is first developed to characterize the complicated packet delivery process in the challenging MANET environment. With the help of the new theoretical framework, closed-form expressions are further derived for the throughput capacity of the 2HR-(f, g) algorithm, from which one can easily recover the available throughput capacity results by proper settings of the redundancy limit f and group size g.