Mobility

Throughput Capacity of the Group-Based Two-Hop Relay Algorithm in MANETs

Free registration required

Executive Summary

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 chainbased theoretical framework is first developed to characterize the complicated packet delivery process in the challenging MANET environment.

  • Format: PDF
  • Size: 388.77 KB