Throughput capacity is of great importance for the design and performance optimization of
mobile ad hoc networks (MANETs). We study the exact per node throughput capacity of …

This paper studies the performance of a general two-hop relay (2HR)-(x, w, f) packet delivery
scheme that combines both erasure coding and packet replication techniques in mobile ad …

This paper focuses on the delivery probability performance in a two-hop relay mobile ad hoc
network (MANET) with erasure coding. Available works in this line either considered a …

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 …

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 …

Among the" store-carry-forward" kind of protocols, the two-hop relay and its variants have
become a class of attractive routing protocols for the mobile ad hoc networks (MANETs) due …

The two hop relay algorithms with redundancy are attractive for mobile ad hoc networks
(MANET) since they are simple and efficient. In this paper, we extend the analysis of the f …

Many studies have presented the order sense results of information transmission capacity
and packet delivery delay in mobile ad hoc networks (MANETs). To achieve the fundamental …

Two-hop relay algorithm serves as a class of promising routing protocols for mobile ad hoc
networks (MANETs). This paper proposes a general two-hop relay algorithm with …

This paper addresses a fundamental trade-off between rate and the diversity gain of an end-
to-end connection in an erasure network. The erasure network is modeled by a directed …