Determining the optimal configuration for the relative distance microdiscovery ad hoc routing protocol

The relative distance microdiscovery (RDM) ad hoc routing (RDMAR) protocol is an on-demand protocol that reactively discovers and repairs routes within a local region of the network. This is accomplished by a simple distributed route searching algorithm, which we refer to as RDM, using a probability model for estimating the relative distance between two nodes as the basis for routing searching and, thus, for routing decisions. The relative distance (RD) between two nodes is the hop-wise distance that a message needs to travel from one node to the other. Knowledge of this RV is leveraged by the RDMAR protocol to improve the efficiency of a reactive route discovery/repair mechanism. Previous work has demonstrated that localization of routing control messaging serves to minimize communication overhead and overall network congestion. We analyze the RDMAR protocol and its individual mechanisms, and determine their effectiveness and the manner in which they interact in order to contribute to the overall protocol performance. A framework for the modeling and analysis of the RDM algorithm is also presented and, based on this, a method for estimating a nearly optimal RD between two mobiles is then introduced. As demonstrated through simulations, the performance of RDM is very close to this of an optimal route searching policy while the query localization protocol is able to reduce the routing overhead significantly, often in the neighborhood of 48-50% of the flooding-based schemes