Throughput capacity in mobile ad-hoc networks with correlated mobility and f-cast relay
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-cast two-hop relay algorithm under i.i.d. mobility model to the case of corrected nodes movements, where the source node is allowed to send up to f copies of a packet and the clustered nodes move uniformly across the network. We first provide an effective scheduling-routing algorithm for packet relay inter- and intra-cluster and then explore the scaling laws of throughput capacity of the considered network. This result helps us to study the impact of both the packet redundancy and correlated node movement, and guide us to find the maximum possible throughput capacity through a proper setting of redundancy f.