Construction of Hexagonal-Based Strategic Connected Dominating Set for mobile ad hoc networks

Validation of ad hoc network mobility models almost depends on simulation. However, most of the widely used models are currently very simple and they focus on the ease of implementation rather than soundness of establishment. As an outcome, simulation based mobility models are often randomly generated movement patterns. Various simulators are available to mimic the movement of wireless nodes in a mobile ad hoc network. Even though simulation based models are available, in this paper we propose a novel hexagonal-based algorithm to study the movement of wireless nodes in an ad hoc network through algorithmic approach. Specifically, we use the applications of Graph Theory algorithms to determine connected dominating sets for analyzing the route dissemination in Mobile Ad Hoc Networks (MANETs). Therefore, the focus in this paper is on the Hexagonal-Based Strategic Connected Dominating Set (HBS-CDS). This algorithmic approach authenticates its application for battlefield defence operations.