Optimal Forwarding Games in Mobile Ad Hoc Networks with Two-Hop f-cast Relay

This paper examines the optimal forwarding problem in mobile ad hoc networks (MANETs) based on a generalized two-hop relay with limited packet redundancy f (f-cast) for packet routing. We formulate such problem as a forwarding game, where each node i individually decides a probability τ
_i
(i.e., a strategy) to deliver out its own traffic and helps to forward other traffic with probability 1-τ
_i
, τ
_i
∈[0,1], while its payoff is the achievable throughput capacity of its own traffic. We derive closed-form result for the per node throughput capacity (i.e., payoff function) when all nodes play the symmetric strategy profiles, identify all the possible Nash equilibria of the forwarding game, and prove that there exists a Nash equilibrium strategy profile that is strictly Pareto optimal. Finally, for any symmetric profile, we explore the possible maximum per node throughput capacity and determine the corresponding optimal setting of f to achieve it.