Using novel distributed heuristics on hexagonal connected dominating sets to model routing dissemination

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.

show abstract

Energy Efficient Green Routing for UAVs Ad-Hoc Network

Muthukumar¹,

Rangasamy²,

Hussain³

et al. 2023

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

Using novel distributed heuristics on hexagonal connected dominating sets to model routing dissemination

Cited by 3 publications

References 8 publications

Pyramidal-Based Connected Dominating Set for Tactical and Energy Harvest Networks

Pyramidal-Based Connected Dominating Set for Tactical and Energy Harvest Networks

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

Energy Efficient Green Routing for UAVs Ad-Hoc Network

Contact Info

Product

Resources

About