Determining the optimal configuration for the relative distancemicrodiscovery ad hoc routing protocol

摘要

The relative distance microdiscovery (RDM) ad hoc routing (RDMAR)nprotocol is an on-demand protocol that reactively discovers and repairsnroutes within a local region of the network. This is accomplished by ansimple distributed route searching algorithm, which we refer to as RDM,nusing a probability model for estimating the relative distance betweenntwo nodes as the basis for routing searching and, thus, for routingndecisions. The relative distance (RD) between two nodes is the hop-wisendistance that a message needs to travel from one node to the other.nKnowledge of this RV is leveraged by the RDMAR protocol to improve thenefficiency of a reactive route discovery/repair mechanism. Previous worknhas demonstrated that localization of routing control messaging servesnto minimize communication overhead and overall network congestion. Wenanalyze the RDMAR protocol and its individual mechanisms, and determinentheir effectiveness and the manner in which they interact in order toncontribute to the overall protocol performance. A framework for thenmodeling and analysis of the RDM algorithm is also presented and, basednon this, a method for estimating a nearly optimal RD between two mobilesnis then introduced. As demonstrated through simulations, the performancenof RDM is very close to this of an optimal route searching policy whilenthe query localization protocol is able to reduce the routing overheadnsignificantly, often in the neighborhood of 48-50% of the flooding-basednschemes