A virtual topology for routing in adhoc networks

Routing in adhoc networks is often solved through classical algorithms such as AODV, OLSR, ... Several recent works have evaluated such algorithms and have investigated self-organization for reducing the number of messages in a dense and a mobile deployment. The main idea is to create and maintain locally a hierarchy that is well suitable for routing packets in an Adhoc network. The contribution of this work is mainly based on the construction of a virtual topology where cluster heads and gateways collaborate for searching the destination node. Hence, inter-cluster and intra-cluster routing are jointly used. The Netlogo platform has been investigated for constructing in an asynchronous manner a virtual topology. Results showed a significant reduction in the exchanging messages. By comparison to the existing methods, our contribution is also able to find the shortest path between a source and a destination.