A Novel Method for Node Connectivity With Adaptive Dragonfly Algorithm And Graph-Based m- Connection Establishment in MANET
Source abstract
Abstract
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-
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Mobile Ad Hoc Networks · Cooperative Communication and Network Coding · Energy Efficient Wireless Sensor Networks
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References
Reference metadata was not supplied for this record.