Throughput analysis for two-hop relay mobile ad hoc networks with receiver probing

Available works either explore the order sense capacity scaling laws or derive closed-form throughput results for mobile ad hoc networks (MANETs) where a transmitter randomly probes only once a neighboring node for possible transmission. Obviously, such single probing strategy may result in a significant waste of the precious transmission opportunities in highly dynamic MANETs since the randomly selected node may already get the packets that the transmitter hopes to deliver. In this paper, we consider a two-hop relay MANET where each transmitter may conduct multiple rounds of probing so as to identify a possible receiver. We first develop closed-form expressions for per node throughput capacity in such probing-based network, with a careful consideration of the time cost taken to probe for an eligible receiver in each time slot. Extensive numerical results are further presented to explore the possible maximum per node throughput capacity, the corresponding optimum setting of probing round limit, and also their relationships with the network control parameters, like the probing time limit, the redundancy limit and the number of users, etc.

I. Introduction

Mobile ad hoc networks (MANETs) in which mobile nodes communicate to each other via wireless links without any pre-existing infrastructure support or centralized management, hold great promise for lots of applications, such as the last mile wireless Internet, vehicular ad hoc networks, disaster relief, etc. However, the lacking of network capacity theory characterizing the maximum achievable throughput between all node pairs, is still a challenging roadblock for the massive development and commercialization of such networks [1], [2].