Topological Cluster-Based Geographic Routing in Multihop Ad Hoc Networks
Existing geographic routing algorithms face serious challenges due to location errors, non-planarity issues and overhead of location service. To solve these issues, the authors propose Topological Cluster Based Geographic Routing that combines topology-based routing and geographic routing. It is a localized routing scheme where the geographic routing is performed on an overlay network of topological clusters. Preliminary results from simulations show that the overlay graph created by topological clustering has the potential to create planar graphs even with realistic wireless models. Hence, the typical Greedy-FACEGreedy protocol used in geographic routing works in these overlay graphs and makes the geographic routing applicable in realistic wireless networks.