Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

14Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

In today's Internet routing infrastructure, designers have addressed scaling concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain. In tactical Mobile Ad-hoc Network (MANET), hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out, self-mending and self-administration. Clustering in the routing process is one of the key aspects to increase MANET performance by coordinating the pathways using multiple criteria and analytics. We present a Group Adaptive Hybrid Routing Algorithm (GAHRA) for gathering portability, which pursues table-driven directing methodology in stable accumulations and onrequest steering strategy for versatile situations. Based on this aspect, the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach, with the objectives of enhancing the output of MANET routing computation in each hub. Simulation analysis and replication results reveal that the proposed method is promising than a single wellknown existing routing approach and is well-suited for sensitive MANET applications.

Cite

CITATION STYLE

APA

Shanthini, J., Punitha, P., & Karthik, S. (2023). Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET. Computer Systems Science and Engineering, 44(3), 2619–2636. https://doi.org/10.32604/csse.2023.027330

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free