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

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-mCE) to overcome computational time and DFO's convergence based problems, considerably enhancing DFO performance. In (G-mCE), Connectivity Zone (CZ) is chosen among source to destination in which optimality should be under those connected regions and ADFO is used for effective route establishment in CZ indeed of complete networking model. To measure complementary features of ADFO and (G-mCE), hybridization of DFO-(G-mCE) is anticipated over dense circumstances with reduced energy consumption and delay to enhance network lifetime. The simulation was performed in MATLAB environment.