An Efficient Self-Mapping Algorithm for Hexagon-Based Gridding in Ad Hoc Networks

Abstract

Mobile Ad hoc NETwork (MANET) is a multi-hop autonomous network formed exclusively among a collection of mobile nodes without any centralized infrastructure. MANETs are generally unstable; the alternative for this non-infrastructure topology is to construct a virtual infrastructure. Using virtual clustering helps in creating an infrastructure for MANET to simplify routing and network management. Network terrain may be portioned into numerous shapes to support scalable routing. Hexagon-based gridding outperforms other gridding shapes; due to its geometric features. However, cell coordinate assignment and mapping node physical location into grid map is an important aspect. In this paper, we introduce a self-mapping algorithm to enable each mobile node to be aware of the precise cell it belongs to during the network lifetime without the need to communicate with other nodes. This algorithm is a core part of the position-based unicast and multicast routing protocols that rely on virtual hexagon infrastructure. Our algorithm has been developed to simplify routing discovery in large-scale MANETs and to ensure that the overhead is as low as possible.