Insect-Inspired Algorithm Promises Smarter, Safer Routing for Wireless Ad Hoc Networks

Mobile ad hoc networks, known as MANETs, remain one of the most challenging environments in modern communications. Unlike conventional networks that rely on fixed infrastructure such as routers, base stations, or access points, a MANET is formed spontaneously by a collection of mobile devices that communicate directly with one another. Every device in the network acts as both a terminal and a relay, forwarding traffic on behalf of its neighbors. Because the nodes move constantly, the topology of the network changes without warning: links appear and disappear, signal quality fluctuates, and routes that were optimal a few seconds earlier may vanish entirely. This instability makes routing the single most difficult problem in MANET design, and it is precisely the problem that a new study published in Mobile Networks and Applications sets out to address.

A research team led by P. Suma of Telangana Social Welfare Residential Degree College in Warangal, India, together with colleagues from National Kaohsiung University of Science and Technology in Taiwan, Sreenidhi Institute of Science and Technology in India, South East Technological University in Ireland, and Sri Padampat Singhania University in India, has introduced a hybrid nature-inspired optimization technique called the Greater Cane Mayfly Algorithm, or GCMA. The method is designed to select alternative paths and optimize network resources so that quality of service and communication security improve simultaneously. The work, published in September 2026, reports measurable gains across the standard performance metrics that network engineers use to judge routing protocols.

The inspiration behind the algorithm draws on two strands of the metaheuristic literature. Hybrid optimization methods frequently combine the exploration strength of one biological metaphor with the exploitation strength of another, and the GCMA follows this pattern by merging ideas associated with the greater cane rat algorithm, a recent swarm-based metaheuristic, with the mayfly optimization approach, which models the short-range mating behavior and long-range swarming flight of mayflies. In optimization terms, this means the algorithm balances broad searches across the solution space, which help it avoid getting trapped in local optima, with fine-grained refinement around promising candidates, which helps it converge quickly. Applied to routing, each candidate solution represents a potential path through the network, and the fitness of that candidate is judged against multiple criteria rather than a single measure.

Those criteria are at the heart of why the work matters. Traditional routing protocols in MANETs, such as the well-known ad hoc on-demand distance vector family, typically select paths based on hop count, meaning the route with the fewest intermediate nodes wins. That approach is simple and fast, but it ignores the practical realities of battery-powered wireless devices. A short path through nodes with depleted batteries, congested queues, or poor link quality will fail quickly, forcing the network to rediscover routes repeatedly and wasting scarce energy. The GCMA instead evaluates alternative paths by considering quality of service parameters, queue length at each intermediate node, available bandwidth, and remaining energy resources together. By weighing all of these factors simultaneously, the algorithm can steer traffic away from overloaded or fragile nodes and toward routes that are likely to remain viable.

The mechanics of the proposed routing framework unfold across several coordinated stages. During route discovery, source nodes flood route request messages through the network to find candidate paths toward a destination. When route reply packets travel back along those candidate paths, the scheme measures the probability that each route is stable, using information gathered by the intermediate nodes that the replies traverse. This stability estimation allows the source node to rank routes before committing traffic to them, and the overall procedure terminates once the source has gathered sufficient information. Route maintenance then monitors the active path, and when a link breaks because a node moves away or runs out of power, the alternative path selection mechanism kicks in. Rather than triggering a complete rediscovery cycle, the system can switch to a pre-ranked backup route, minimizing interruption to ongoing communication sessions.

Security considerations motivate much of this design. Because MANETs are decentralized and often deployed in dynamic or hostile environments, including disaster zones, battlefields, and temporary event venues, they are vulnerable to threats such as data tampering and eavesdropping. A routing layer that blindly trusts any available path can inadvertently deliver sensitive traffic through compromised or unreliable nodes. By incorporating stability probabilities and resource-aware selection into the routing decision, the framework reduces the chances of traffic being routed through nodes that exhibit abnormal behavior or deteriorating conditions. The authors position the technique as a step toward safe communication in these decentralized systems, combining quality of service enhancements with mechanisms that make manipulation of the routing process harder for an adversary.

The reported results quantify the gains. In the team’s evaluation, the GCMA achieved a normalized routing overhead of 20.365, a throughput of 9.321 megabits per second, a packet delivery rate of 83.680 percent, and an end-to-end delay of 0.254 seconds, with the delay figure representing the lowest value recorded in the study. Each of these numbers speaks to a different aspect of network health. Throughput measures how much useful data the network can deliver per unit of time, packet delivery rate captures the fraction of transmitted packets that actually reach their destination, end-to-end delay reflects how long packets take to traverse the network, and normalized routing overhead indicates how much control traffic is required per unit of delivered data. Low overhead matters especially in MANETs, where every control message competes with user data for the same wireless channel and drains the same batteries.

The study situates itself within a rich body of prior work on multipath and energy-aware routing in ad hoc networks. Earlier research has explored energy-centric swarm approaches such as tunicate-inspired algorithms, bandwidth-aware adaptive multipath schemes, cooperative medium access control designs to extend network lifetime, trust-based topology-hiding protocols, and bio-inspired routing techniques drawn from ant colonies and hybrid metaheuristics like the mayfly harmony search and the multi-objective M-LionWhale model. Cross-layer designs that share information between physical, medium access, and network layers have also been proposed to improve energy efficiency. What distinguishes the current contribution is the specific hybrid pairing of the greater cane rat and mayfly metaphors, together with an integrated pipeline that ties stability estimation, queue and bandwidth awareness, and energy considerations directly into both primary and alternative path selection rather than treating them as separate optimization problems.

The practical implications extend to any scenario where infrastructure is absent or destroyed. Emergency response teams operating after earthquakes, military units in the field, vehicular networks on highways, and internet-of-things deployments in remote regions all depend on networks that can reconfigure themselves on the fly. In these settings, a routing layer that can anticipate link failures and switch to backup paths without flooding the network with control messages translates directly into longer battery life, more reliable video and voice communication, and better resilience under stress. The resource-aware path scoring also aligns with broader sustainability goals in networking, since minimizing wasted transmissions reduces the energy footprint of the entire system.

Limitations and open questions remain, as with any simulation-based study. The authors note that no datasets were generated or analyzed beyond the study’s own evaluation environment, and real-world validation across heterogeneous hardware, varied mobility models, and adversarial conditions would be the natural next step for this line of research. Scaling the algorithm to very large networks and assessing its behavior under sophisticated attack models will also matter for adoption. Nevertheless, the work offers a concrete demonstration that hybrid bio-inspired optimization can push MANET performance forward on multiple fronts at once, and it adds a new entry to the growing catalog of nature-derived strategies that computer scientists are using to tame systems that never stop moving. For a field in which every dropped packet and drained battery carries a cost, an algorithm that borrows the collective intelligence of swarming insects may prove a fitting guide.

Subject of Research: Nature-inspired hybrid optimization for routing and resource management in mobile ad hoc networks

Article Title: A Novel Hybrid Greater Cane Mayfly Optimization Algorithm for Alternative Path Selection and Resource Optimization Strategies in MANET

Article References: A Novel Hybrid Greater Cane Mayfly Optimization Algorithm for Alternative Path Selection and Resource Optimization Strategies in MANET. (n.d.). https://doi.org/10.1007/s11036-026-02524-6

Image Credits: AI Generated

DOI: 10.1007/s11036-026-02524-6

Keywords: MANET, routing protocols, swarm intelligence, metaheuristics, quality of service, multipath routing, energy efficiency, network security, path selection, throughput, wireless networks, optimization