Topology characterizing using packet forwarding distance dissimilarity in multi-greedy geographic routing

Abstract

Characterizing the topology of MANETs provides the means for packet routing protocols to perform adaptively and efficiently in the particular environments. We show that the geographic routing’s greedy packet forwarding distance dissimilarity distributions in relation to node size characterizes MANET topologies and supports efficient multi-greedy forwarding. The models we described, based on the average greedy packet forwarding distance measures, showed distinct distribution patterns of the dissimilarity indices when applied to the example multi-greedy routing environment consisting of the ELLIPSOID and the GREEDY forwarding metrics. The scheme demonstrates the potential for adaptive forwarding performance to improve successful packets delivery in environments of high node-size variations such as VANETs.