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

The need for such a middle ground comes from a persistent divide in networking education. Simulators including ns-3, OMNeT++ and OPNET offer repeatable experiments at a scale that would be expensive or impossible with physical equipment, but they necessarily simplify interactions among hardware, operating systems and wireless channels. At the other extreme, changing a protocol inside a conventional kernel stack can provide high fidelity while demanding advanced systems programming, low-level languages and administrative access. Virtual machines, containers and emulation platforms make networks easier to deploy, yet they commonly continue to rely on the host operating system’s unmodified TCP/IP stack. The proposed laboratory is designed to occupy the space between these approaches. It preserves the realism of communication over actual wireless hardware while exposing transport and routing logic in readable, modular Python code. That combination could let students progress from simulated concepts to physical experiments without confronting the steepest barriers of kernel development at the beginning of their training.

Technically, the framework reimplements upper layers of the TCP/IP stack in user space and sends the resulting protocol messages through the host system’s UDP socket interface. The operating system therefore provides the underlying mechanism for transmitting UDP datagrams, while the experimental overlay supplies its own virtual transport and network behavior. Application data can be timestamped, buffered and packaged into configurable payloads, allowing researchers to vary message size, transmission intervals and traffic patterns. The virtual transport layer supports session management, sequencing, acknowledgments, retransmission and fragmentation and reassembly, with both connection-oriented and connectionless modes available. Because virtual packets are encapsulated inside UDP, the experimental stack can operate without replacing native networking functions or changing the kernel. This design trades some efficiency for portability and transparency. Researchers can distribute protocol implementations like applications, run them on different Linux-based devices and inspect their internal state without disrupting the computer’s ordinary network services.

The virtual network layer was demonstrated through the Optimized Link State Routing protocol, or OLSR, a proactive routing method suited to networks in which nodes must maintain routes across multiple wireless hops. Each software node maintains neighbor, topology and routing information. HELLO messages allow devices to discover direct neighbors and assess links, while Topology Control messages distribute broader connectivity information. Host and Network Association and Multiple Interface Declaration messages support gateway discovery and multi-interface operation. The framework computes routes with Dijkstra’s shortest-path algorithm and forwards data according to the resulting routing tables. Background threads handle periodic control-message transmission, topology maintenance and route recomputation, while separate logging and monitoring functions record events. The implementation uses JSON serialization rather than compact binary encoding, a deliberate choice that makes messages and state changes easier for students to read and debug. The researchers report that the OLSR demonstration occupies fewer than 600 lines of Python code, emphasizing comprehensibility over the optimization expected from a commercial networking stack.

The laboratory demonstration used five Raspberry Pi 3B+ nodes running Raspberry Pi OS Lite, Python 3.9 and ad hoc wireless networking. The devices were arranged as a multi-hop chain in which intermediate relays were required for end-to-end communication. Students can configure a shared wireless network, assign addresses, launch the OLSR module and follow routing changes through JSON logs and Wireshark packet captures. A dashboard displays topology, node connectivity, traffic statistics, packet delivery, delay and throughput, while a traffic generator can produce constant-rate, burst or randomized workloads. The testbed can be expanded from two or three devices for introductory activities to roughly 10 to 15 nodes for more advanced exercises, although the reported evaluation focused on the five-node arrangement. The architecture can also incorporate resource-constrained devices such as ESP32 boards running MicroPython, creating heterogeneous experiments relevant to sensor networks and Internet of Things systems. These choices make the setup relatively inexpensive and reproducible while preserving direct contact with hardware limitations and wireless behavior.

In the OLSR measurements, students were asked to examine several stages of network behavior rather than simply record whether packets arrived. Neighbor discovery required approximately three to four seconds, while routing information stabilized after about eight to ten seconds during startup. When a node was removed, recovery took roughly four to six seconds. Across a three-hop UDP test, the reported packet delivery ratio was about 98 percent, with average end-to-end delay near 37.5 milliseconds. Per-node CPU use ranged from 3 to 13 percent and memory consumption was approximately 11.5 megabytes in the described exercise. The broader evaluation reported delivery ratios above 95 percent, stable communication performance and low latency variation under repeated measurements. Students can change HELLO intervals or multipoint-relay selection rules, repeat the experiment and compare changes in convergence, delay, delivery and resource use. The framework therefore turns routing trade-offs into observable engineering questions: faster reaction may require more control traffic, while lower overhead can reduce responsiveness to topology changes.

To illustrate how the same physical network could support different research questions, the researchers assigned the five nodes logical roles associated with substation automation, smart factories, medical Internet of Things and intelligent transportation. The topology and hardware remained fixed while application-layer message flows changed. Average latency was reported as 18.6 milliseconds for simulated protection traffic in the substation scenario, 22.4 milliseconds for industrial automation traffic and 19.7 milliseconds for ECG traffic in the medical scenario. The vehicle-communication experiment maintained a packet delivery ratio above 97 percent and jitter below 5 milliseconds under the tested load. Across the evaluated scenarios, normal-operation jitter remained below 6.3 milliseconds and rose to approximately 12 milliseconds during high-load maintenance traffic. These figures indicate feasibility in a controlled laboratory, but they do not establish compliance with safety-critical standards such as IEC 61850, IEEE 11073 or ETSI ITS-G5. The study did not measure tail latency, worst-case delay, deterministic scheduling, certification requirements, high-mobility operation or large-scale deployments, so the results should not be interpreted as guarantees for operational infrastructure.

The researchers describe the platform as a foundation rather than a finished replacement for simulators, production stacks or specialized testbeds. Its current evaluation is limited to a small, controlled network, and user-space processing introduces overhead through interactions with the operating system and UDP sockets. Larger deployments could increase routing traffic, CPU demand and convergence time, particularly because OLSR is proactive. Interference, severe packet loss and rapidly changing mobility were not systematically tested. The paper also does not provide a controlled study of student learning outcomes, meaning its educational value is inferred from transparency, modularity, reproducibility and real-hardware access rather than measured through classroom comparisons. Future work is proposed around larger topologies, controlled interference, additional transport and application protocols, heterogeneous IoT devices, cybersecurity experiments and remote or cloud-hosted laboratories. Formal assessments involving postgraduate students could test conceptual understanding, programming ability and research readiness. For now, the Raspberry Pi system offers an unusually visible route into networking research: it lets learners move from protocol diagrams to live packets, routing tables and measurable behavior with equipment small enough to fit on a laboratory bench.

Subject of Research: User-space networking laboratory for postgraduate experimentation with wireless mesh, mobile ad hoc and sensor networks

Article Title: A user-space virtualization lab for postgraduate networking education and research in WMN, MANET, and WSN

Article References: Al-Healy, A. A., & Ali, Q. I. (2026). A user-space virtualization lab for postgraduate networking education and research in WMN, MANET, and WSN. Discover Informatics, 1(1), Article 10. https://doi.org/10.1007/s44564-026-00011-4

Image Credits: AI Generated

DOI: 10.1007/s44564-026-00011-4

Keywords: user-space networking, protocol virtualization, networking education, Raspberry Pi, OLSR routing, MANET, wireless mesh networks, wireless sensor networks, Internet of Things, user-space, virtualization, postgraduate