Probing-based two-hop relay with limited packet redundancy

Due to their simplicity and efficiency, the two-hop relay algorithm and its variants serve as a class of attractive routing schemes for mobile ad hoc networks (MANETs). With the available two-hop relay schemes, a node, whenever getting an opportunity for transmission, randomly probes only once a neighbor node for the possible transmission. It is notable that such single probing strategy, although simple, may result in a significant waste of the precious transmission opportunities in highly dynamic MANETs. To alleviate such limitation for a more efficient utilization of limited wireless bandwidth, this paper explores a more general probing-based two-hop relay algorithm with limited packet redundancy. In such an algorithm with probing round limit τ and packet redundancy limit f, each transmitter node is allowed to conduct up to τ rounds of probing for identifying a possible receiver and each packet can be delivered to at most f distinct relays. A general theoretical framework is further developed to help us understand that under different setting of τ and f, how we can benefit from multiple probings in terms of the per node throughput capacity.