Table of Content

Open Access iconOpen Access



A Novel Method for Node Connectivity with Adaptive Dragonfly Algorithm and Graph-Based m-Connection Establishment in MANET

S. B. Manoojkumaar1, *, C. Poongodi2

1 Department of Computer Science and Engineering, J. K. K. Munirajah College of Technology, Gobichettipalayam, Erode, 638506, India.
2 Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, Sathyamangalam, Erode, 638401, India.

* Corresponding Author: S. B. Manoojkumaar. Email: email.

Computers, Materials & Continua 2020, 65(2), 1649-1670.


Maximizing network lifetime is measured as the primary issue in Mobile Adhoc Networks (MANETs). In geographically routing based models, packet transmission seems to be more appropriate in dense circumstances. The involvement of the Heuristic model directly is not appropriate to offer an effectual solution as it becomes NP-hard issues; therefore investigators concentrate on using Meta-heuristic approaches. Dragonfly Optimization (DFO) is an effective meta-heuristic approach to resolve these problems by providing optimal solutions. Moreover, Meta-heuristic approaches (DFO) turn to be slower in convergence problems and need proper computational time while expanding network size. Thus, DFO is adaptively improved as Adaptive Dragonfly Optimization (ADFO) to fit this model and re-formulated using graph-based m-connection establishment (G-


Cite This Article

S. B. Manoojkumaar and C. Poongodi, "A novel method for node connectivity with adaptive dragonfly algorithm and graph-based m-connection establishment in manet," Computers, Materials & Continua, vol. 65, no.2, pp. 1649–1670, 2020.

cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1994


  • 1206


  • 0


Share Link