The problem the researchers set out to solve is brutally practical. In the aftermath of a natural disaster, armed conflict, or large-scale humanitarian crisis, conventional communication infrastructure is frequently damaged or destroyed entirely. Rescue teams, medical services, and humanitarian organizations then turn to rapidly deployable wireless systems such as mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs), which can be set up without any pre-existing towers or cables. But these networks face a hostile combination of challenges: the topology changes constantly as people and devices move, battery power is limited and cannot be recharged, wireless links are unreliable, and traffic arrives in unpredictable bursts as critical information is exchanged.

Traditional routing protocols were designed for relatively stable environments, and they struggle under these conditions. Static routing schemes and single-heuristic optimization approaches lack the flexibility to cope with sudden node failures, shifting congestion, and depleting energy reserves. The research team — Samir Haddad and Jinane Sayah of the University of Balamand, Kassem Danach of Al Maaref University, and Khouloud Eledlebi of Abu Dhabi University — argues that what is needed is not a better single strategy, but a system that can choose among many strategies as conditions change.

That is where the hyper-heuristic comes in. Unlike traditional metaheuristics, which directly search a problem’s solution space, hyper-heuristics operate one level up: they automatically select or generate heuristics rather than solving the optimization problem themselves. The framework maintains a heterogeneous pool of low-level communication heuristics divided into four classes. Constructive heuristics build initial feasible routing paths, for example by minimizing energy consumption or communication distance. Improvement heuristics refine existing configurations through incremental adjustments such as delay-aware routing or load balancing. Perturbation heuristics introduce controlled modifications to escape local optima — opportunistic forwarding, which lets nodes pick alternative relays when link quality degrades, falls into this category. Reconstructive heuristics partially or completely rebuild routing structures when topology changes or node failures make the current configuration inefficient, and cluster-based communication mechanisms can be applied here to reorganize the network into energy-efficient groups.

The candidate heuristics in the pool include energy-aware routing, delay-aware routing, load-balanced routing, cluster-based communication, and opportunistic forwarding. A high-level hyper-heuristic controller acts as the decision-maker, evaluating the current network state at each decision epoch and selecting the most suitable heuristic. The selection mechanism relies on adaptive scoring with reinforcement learning principles: each heuristic carries a performance score reflecting its effectiveness under particular conditions, and after it is applied, its impact on network metrics is evaluated and the score updated. A choice-function-based mechanism ranks heuristics by combining their recent improvement contribution, historical performance, and the time elapsed since last use, encouraging selection of strategies that have demonstrated strong results while still exploring less frequently applied options.

What guides these decisions is a continuous stream of real-time network state indicators. The system monitors residual node energy, wireless link quality and signal strength, traffic congestion and queue lengths, node density and connectivity degree, and packet delivery performance. These indicators are aggregated into a state vector that serves as input to the controller. If node energy levels become critically low, the controller prioritizes energy-aware routing heuristics; if congestion rises, load-balancing heuristics are selected to redistribute traffic. The framework also incorporates acceptance criteria that determine whether a newly generated network configuration should replace the current one — new solutions are accepted if they improve a multi-objective performance function, and otherwise may still be accepted with a small probability to encourage exploration and prevent premature convergence.

That multi-objective optimization model is central to the approach. Rather than optimizing a single metric, the framework simultaneously minimizes energy consumption, communication delay, and packet loss while maximizing network reliability, measured through the packet delivery ratio. The global objective is a weighted function aggregating these components, with non-negative weighting factors determining each metric’s relative importance. The weights were selected to provide balanced consideration between energy efficiency, delay, packet loss, and reliability according to the operational requirements of disaster-response systems, initially determined through empirical observations and preliminary simulations to avoid dominance of a single objective. The formulation acknowledges the inherent trade-offs: minimizing delay may increase energy consumption, improving reliability may require redundant paths that add overhead, and reducing packet loss may trigger retransmissions that affect both latency and energy efficiency. The optimization is subject to operational constraints including positive residual energy for each node, network connectivity, and bandwidth limits on each link.

The network itself is modeled as a distributed, infrastructure-less system of heterogeneous nodes deployed across a disaster region: mobile user nodes carried by rescue teams and civilians, lightweight sensor nodes for environmental monitoring such as structural damage, temperature, smoke detection, or human presence, and UAV relay nodes acting as aerial relays to extend coverage and restore connectivity between disconnected ground segments. Energy consumption follows a widely adopted radio model in which nodes expend energy during packet transmission, reception, and idle listening, with transmission energy depending on the path-loss exponent, typically ranging between 2 and 4 depending on the propagation environment. Network lifetime is defined as the time until the first critical node exhausts its energy or connectivity drops below a predefined threshold.

To evaluate the framework, the researchers conducted extensive simulations in NS-3, a packet-level network simulator widely used in wireless research. Networks of 50 to 200 nodes were randomly deployed in a disaster region, each equipped with an IEEE 802.11 wireless interface, with ground node mobility following the Random Waypoint Mobility Model to emulate the unpredictable movement of rescue teams and civilians. Three crisis scenarios were modeled: a disaster-damaged urban network with node failures and intermittent connectivity, an emergency rescue communication system with high traffic loads and dynamic mobility, and a dynamic connectivity disruption scenario in which nodes randomly fail or become temporarily unavailable. The hyper-heuristic framework was compared against three conventional baselines: Energy-Aware Routing, Delay-Aware Routing, and Cluster-Based Routing, with each experiment repeated multiple times using different random seeds to obtain statistically reliable results.

The results were consistent across all network sizes. The hyper-heuristic framework achieved the longest network lifetime, up to 15 percent greater than conventional strategies, mainly due to dynamic selection of energy-efficient communication heuristics based on real-time conditions. It also attained the highest packet delivery ratio, improved by approximately 6 to 10 percent, because adaptive heuristic selection allows the system to avoid congested or unreliable paths. End-to-end delay was reduced by nearly 20 percent — particularly beneficial for time-sensitive emergency services — while total energy consumption dropped significantly as the controller switched to energy-aware strategies when battery levels became critical. Energy efficiency, measured as successfully delivered packets per unit of energy consumed, was superior across the board. The authors note that future work could integrate reinforcement learning for more advanced heuristic selection, extend the framework to UAV-assisted networks, evaluate it in large-scale real-world deployments, and incorporate predictive analytics capable of anticipating topology changes and node failures before degradation occurs. For now, the study offers a practical and scalable solution for emergency response networks — and a demonstration that hyper-heuristic optimization can support reliable, energy-efficient wireless communications during disaster recovery and humanitarian operations.

Subject of Research: A hyper-heuristic-driven framework for sustainable, crisis-resilient wireless communication networks that adaptively selects routing heuristics to optimize energy, delay, packet loss, and reliability in disaster scenarios.

Article Title: Hyper-heuristic driven sustainable wireless networks for crisis-resilient communication systems

Article References: Haddad, S., Danach, K., Eledlebi, K., & Sayah, J. (2026). Hyper-heuristic driven sustainable wireless networks for crisis-resilient communication systems. Frontiers in Communications and Networks, 7, Article 1834396. https://doi.org/10.3389/frcmn.2026.1834396

Image Credits: AI Generated

DOI: 10.3389/frcmn.2026.1834396

Keywords: hyper-heuristics, wireless networks, disaster response, MANETs, wireless sensor networks, energy efficiency, network lifetime, packet delivery ratio, crisis communication, NS-3 simulator, multi-objective optimization, UAV relays

The motivation behind the framework stems from a long-standing simplification in the field. Traditional mobility models, such as the classic Random Walk, treat movement as a planar problem, which makes trajectory planning and collision avoidance mathematically tractable but fails to capture the reality that drones must navigate around buildings, adjust altitude, and avoid collisions in all three spatial dimensions. Earlier attempts to extend models like the Random Walk, the Random Direction model, and the Gauss-Markov process into 3D produced smoother or more realistic trajectories, but they generally ignored two crucial ingredients: correlation between the movements of different drones, and avoidance of obstacles and of each other. Models that did address group behavior, such as the Particle Swarm Mobility Model, offered only static, two-dimensional collision avoidance and no obstacle handling at all. Meanwhile, sophisticated path-planning algorithms borrowed from robotics, including Optimal Reciprocal Collision Avoidance, artificial potential fields, and Rapidly-exploring Random Trees, offer strong theoretical guarantees, but their computational cost makes them impractical for generating mobility patterns for large numbers of simulated nodes.

Mo3D builds on the earlier Mo3 model, a lightweight, rule-based framework that had only partial 3D support. The key insight of the new work is that the framework’s five rules, each governing a different aspect of node movement, can be upgraded to three dimensions with targeted mathematical modifications rather than a complete redesign. Two of the rules, Individual Mobility and Correlated Mobility, already supported 3D in the original formulation. The real engineering challenge lay in the Collision Avoidance and Obstacle Avoidance rules, which required significant rework to handle the added complexity of volumetric space.

The 3D collision avoidance mechanism is a study in geometric pragmatism. Each drone’s trajectory is represented as a ray originating from its current position, defined by an azimuth angle and an elevation angle, with the drone’s future location expressed parametrically along that ray. When two drones come within a trigger radius, the framework performs a coplanarity check by computing the determinant of a matrix built from their positions and direction vectors. If the determinant is zero, the two trajectories lie in a common plane, and the analysis proceeds much as it would in 2D, with the lines either parallel, coinciding, or intersecting. If the trajectories are not coplanar, a direct crossing cannot occur, but danger can still lurk: the framework solves a system of two dot-product equations to find the points of minimum distance between the two lines, and flags a collision risk if that distance falls below a safety threshold and if both drones will reach those points in the future rather than having already passed them. This forward-looking check matters because trajectories change as avoidance rules are applied, so two drones skimming past each other today could still collide tomorrow.

Obstacle avoidance in 3D posed a different problem: how to represent solid objects without prohibitive computation. The framework models obstacles as vertical parallelepipeds or elliptic cylinders, in three configurations: resting on the floor, hanging from the ceiling, or filling the entire vertical extent of the environment. The elegant trick is projection. For any obstacle whose vertical span includes the drone’s current altitude, the obstacle is projected onto the drone’s horizontal plane, reducing it to a 2D shape that the original rule can handle directly. The drone’s heading is adjusted to circumvent the projected shape while its elevation angle is left untouched, avoiding unnecessary altitude changes. Obstacles outside the drone’s vertical span are generally ignored, except when a specific set of conditions signals vertical danger: the drone’s ground projection falls within the obstacle’s footprint, the vertical gap to the obstacle is smaller than a trigger distance, and the drone’s elevation angle indicates it is heading toward the hazard. In that case, the drone simply levels off, setting its elevation angle to zero to stabilize altitude and avert impact.

The software architecture reflects the same modularity that characterized the original model. Each drone’s velocity is described in spherical coordinates by magnitude, azimuth, and elevation, and five modules, Individual Mobility, Correlated Mobility, Collision Avoidance, Obstacle Avoidance, and Upper Bounds Enforcement, can be independently enabled or disabled through configuration flags, each running on its own update interval. The default Individual Mobility module uses the Boundless model, but the design allows any model capable of producing a velocity vector, including ones incorporating inertia or aerodynamics, to be swapped in without touching the other modules. A new memory feature stores the speed and direction set by the individual model and restores them if other modules modify them, preserving the drone’s original target destination. Correlated Mobility introduces group behavior through bindings between node pairs, a connectivity distance, and a grouping factor; when a drone’s fraction of connected bound partners falls below a threshold, it enters a Forced state, either steering toward its closest disconnected mate or, in a new option, toward the centroid of the group. Binding matrices can even change over the course of a simulation, allowing group structures to dissolve and reform dynamically.

Validation results demonstrate that the framework’s guarantees hold up in practice. In an ablation study with five nodes in a ten-meter cubic area, the collision avoidance mechanism consistently reduced the probability of two nodes coming within the safety threshold, even in extreme cases where the desired minimum distance approached the maximum possible separation in the volume. In a second test, five drones bound into a single tight group still maintained increased average inter-drone distances as the safety threshold grew, showing that collision avoidance works even when correlation rules are pulling the swarm together. Obstacle avoidance was tested with four drones navigating a grid of sixteen elliptic-cylinder obstacles: the minimum realized clearance rose monotonically from roughly 0.8 meters at the smallest trigger distance to about 12.3 meters at the largest, confirming that the trigger parameter provides effective, predictable control over safety margins even though the relationship is not strictly linear at small values.

Computational cost scales honestly with swarm size. With only the Upper Bounds Enforcement module active, execution time grows approximately linearly with the number of drones, matching the per-node cost of that rule. With all modules enabled, growth becomes superlinear, reaching roughly 7.8 times the normalized baseline time at six drones. The culprit is collision avoidance, which must recompute the pairwise distance matrix between all drones at every update, an operation whose cost grows with the square of the swarm size. The authors are candid that this measurement, taken for swarms of up to six, should be treated as indicative for larger fleets, and they note that collision avoidance is computationally heavy in essentially every model of this kind; optimization-based alternatives also scale quadratically. Future mitigations, such as spatial partitioning or neighbor-list approaches, are outlined in the paper, along with other limitations: obstacle shapes are restricted to two families, avoidance acts primarily through azimuth changes, and obstacles are static, though the architecture is designed so that dynamic obstacles would require only regenerating coordinates each update, not changing the avoidance logic itself.

The illustrative examples showcase the framework’s range. Four drones navigating a replica of a real industrial environment, complete with floor-mounted machinery in a room sixteen by thirty-three by six meters, maintained tight group cohesion while smoothly avoiding both obstacles and each other, with elevation angles varying to clear obstacles at different heights. With correlation disabled, the same drones scattered into independent trajectories yet still avoided every hazard. A second scenario demonstrated dynamic correlation, with drones alternating between independent wandering and convergence as two different binding matrices took effect in turn, while handling obstacles in all three vertical configurations. A third confirmed that full-height elliptic cylinders are circumvented as smoothly as box-shaped obstacles.

The broader implications reach into industrial automation and wireless network design. The work aligns with the RESTART Industrial Networks project, funded under the European Union’s NextGenerationEU program, which targets future factory communication systems involving mobile robots, automated guided vehicles, and drones in obstacle-rich environments. Because Mo3D supports both asynchronous integration, where trajectories are pre-generated for offline use, and synchronous integration, where a network simulator triggers each update in real time and can even reconfigure mobility based on network status, it plugs naturally into 5G and future 6G simulation pipelines. By lowering the barrier between abstract mobility mathematics and realistic deployment scenarios, the framework positions itself as a practical tool for the smart factories and safety-critical robotic systems now on the horizon, where movement, communication, and control are inseparably intertwined.

Subject of Research: 3D mobility modeling and simulation for UAVs in indoor environments

Article Title: Mo 3D – a mobility framework for mobility modeling in 3D indoor environments

Article References: Ferretti, D., De Nardis, L., & Di Benedetto, M.-G. (2026). Mo3D – a mobility framework for mobility modeling in 3D indoor environments. SoftwareX, 36, Article 103098. https://doi.org/10.1016/j.softx.2026.103098

Image Credits: AI Generated

DOI: 10.1016/j.softx.2026.103098

Keywords: UAV mobility, 3D modeling, collision avoidance, obstacle avoidance, drone swarms, indoor simulation, open-source software, wireless networks, 5G, 6G, industrial automation, Python

The core insight is deceptively simple. When a person describes a scene to a friend, they do not send a pixel-by-pixel account of the image; they convey the essential content, trusting the listener’s background knowledge to fill in the rest. Semantic communication applies the same principle to machines. Instead of compressing and transmitting complete data streams, a semantic system extracts the features that matter for the task at hand, encodes those, and lets the receiver reconstruct what is needed. The review argues that this approach can keep communication reliable even under extraordinarily poor conditions, maintaining effectiveness at a signal-to-noise ratio of 0 decibels and delivering audiovisual content over just a few kilohertz of available spectrum, conditions under which conventional systems would collapse entirely.

A crucial distinction runs through the review: multimodal communication is not the same as multimedia communication. Multimedia systems, which matured in the late 1990s and early 2000s around standards such as MPEG video compression, treat text, audio, images and video as separate data streams that are processed independently and then synchronized at the receiver. Multimodal semantic communication, by contrast, exploits the correlations and complementarities that exist across modalities. Speech, gesture and facial expression in a video conference carry overlapping information; a system that understands this redundancy can transmit a compact semantic representation once and let the different modalities reinforce one another. The review describes this as a fundamental shift from independent data processing towards joint semantic understanding across modalities.

The performance gains reported are striking. Systems built on these principles have achieved audiovisual delivery at rates below 1 kilobit per second, orders of magnitude below what traditional video codecs require. One cited approach, Txt2vid, compresses talking-head videos by transmitting text descriptions and regenerating the visual content at the receiver. In Internet of Things deployments, semantic methods have reduced traffic by a factor of forty, while satellite links using semantic techniques have cut overhead by sixty percent without sacrificing task performance. These are not incremental improvements; they represent a different way of thinking about what a communication system is for. If the goal is for a receiver to answer a question, recognize an object or render a convincing avatar, transmitting the exact original waveform may be an enormous waste of precious bandwidth.

None of this would be practical without deep learning. The review maps out how neural networks now support the entire semantic pipeline, from representation and sampling through coding, modulation and resource allocation. Deep learning models learn latent features, abstract representations that capture the patterns most relevant to a task, and these features become the currency of the new systems. Semantic sampling techniques decide which parts of a data source are worth measuring in the first place, in some cases relaxing the strictures of the Shannon-Nyquist sampling theorem when full reconstruction is unnecessary. Joint semantic-channel coding, often implemented as deep joint source-channel coding, blurs the traditional boundary between compression and error protection, training a single network end to end so that the encoded representation is inherently robust to the noise and fading of the wireless channel.

Quantifying meaning, however, remains one of the field’s hardest problems. Shannon’s entropy measures the statistical surprise of a message but says nothing about what the message signifies. The review traces a lineage of semantic theory stretching back to Carnap and Bar-Hillel’s 1952 outline of semantic information, and highlights modern tools such as semantic entropy, which has recently gained attention as a way to detect hallucinations in large language models by measuring uncertainty at the level of meaning rather than wording. Related metrics, including the age of information and the age of incorrect information, capture whether a received update is both fresh and actually correct, ideas that matter enormously for safety-critical applications such as vehicle coordination, where a stale or wrong position report can be worse than no report at all.

Large artificial intelligence models are accelerating the field dramatically. Multimodal foundation models, large language models and large speech models can serve as shared semantic vocabularies between transmitter and receiver: the sender extracts compact descriptions or tokens from raw data, and the receiver’s generative model reconstructs high-fidelity content from those descriptions. The review cites systems for generative video conferencing, talking-face transmission and video question answering that lean on these models to achieve ultralow-bitrate communication. Knowledge graphs and scene graphs offer another representation strategy, encoding objects, attributes and relations rather than pixels, which supports explainable and task-oriented transmission. The trade-off is that both ends must share compatible models, raising questions about how such systems interoperate with the legacy infrastructure that dominates today’s networks.

Practical deployment challenges are considerable. Most early semantic systems transmitted analog-like representations over the channel, which conflicts with the digital modulation and standardized protocols that underpin existing hardware. A significant strand of current research therefore focuses on digital semantic communication, learning quantization and modulation schemes that fit within conventional constellation constraints while preserving semantic fidelity. Resource allocation must also be rethought: rather than maximizing raw throughput, networks should allocate power, spectrum and computation to maximize quality of experience and task success, an optimization the review describes across metaverse services, unmanned aerial vehicle relays and non-terrestrial satellite downlinks. Energy efficiency emerges as a recurring theme, with the authors framing the end goal as a unified, green and compatible architecture for intelligent connectivity.

Looking further ahead, the review identifies token communication as a possible convergence point. In this emerging vision, all modalities, text, speech, images, video and even 3D representations such as point clouds and Gaussian splatting scenes, are converted into unified token sequences, the same currency used by large multimodal models. Tokens could then be sampled, prioritized, coded and transmitted with a single coherent framework, making systems naturally compatible across modalities and applications. The authors suggest this could provide a native communication fabric for future autonomous agents, machines that must exchange goals, observations and plans with one another rather than raw sensor dumps. An AI agent access network concept, in which communication is designed around embodied multi-agent collaboration, illustrates how far this rethinking extends beyond the physical layer.

If the vision holds, the implications ripple outward across the technology landscape. Immersive extended reality and holographic communication demand data rates that strain even the most optimistic spectrum plans; semantic transmission could make them feasible by sending only what the eye and ear actually need. Satellite and underwater links, where bandwidth is scarce and errors are punishing, stand to benefit from systems that degrade gracefully instead of hitting cliff effects. The Internet of Things, with billions of battery-powered sensors, could shrink its traffic by orders of magnitude. What Shannon gave the twentieth century was a theory of how to move bits reliably; what this research programme proposes for the twenty-first is a theory of moving meaning, one that treats the intelligence at the network’s edges not as an add-on but as the very medium through which communication happens.

Subject of Research: Multimodal semantic communication systems that transmit meaning rather than raw bits across wireless networks

Article Title: Multimodal semantic communications

Article References: Qin, Z., Ying, J., Tao, X., & Tong, W. (2026). Multimodal semantic communications. Nature Reviews Electrical Engineering. https://doi.org/10.1038/s44287-026-00336-0

Image Credits: AI Generated

DOI: 10.1038/s44287-026-00336-0

Keywords: semantic communication, multimodal communication, 6G, wireless networks, deep learning, joint source-channel coding, token communication, large language models, spectrum efficiency, Internet of Things, satellite communication, Shannon theory

The N×On-Off/D/1 model describes a single server with deterministic service times, fed by N independent sources that each alternate between active ON periods, during which they emit packets, and silent OFF periods. This structure matters because real network traffic is nothing like the smooth, memoryless arrivals assumed in textbook models. Since the landmark measurements of Ethernet traffic by Leland and colleagues in the 1990s, engineers have known that packet streams are bursty and correlated, and that burstiness is precisely what inflates queues and delays. The On-Off source model captures this correlation in a tractable way, making it a workhorse for teletraffic engineering in broadband and wireless systems alike.

Before trusting any simulator, the researchers had to prove it reproduces known results. Their first validation stage used the M/D/1 queue, the classical model with Poisson arrivals and deterministic service, as a baseline. For this model, the asymptotic decay rate of the queue-length tail distribution is known in closed form, giving an exact mathematical benchmark. Across utilization levels rho ranging from 0.7 to 0.95, the simulator matched the theoretical decay rate to within one percent. That level of agreement is the kind of result that separates a credible simulation framework from a toy, and it established the foundation for everything that followed.

The second validation stage tackled the harder target: the Burst Scale Decay Rate, or BSDR, a closed-form approximation that predicts how quickly the probability of large queue buildups decays when many On-Off sources feed the buffer. Here the simulator tracked the approximation within 2.2 to 12.5 percent across the tested configurations. Crucially, the team did not treat that residual gap as an embarrassment. By running multiple independent replications and constructing confidence intervals, they showed that the discrepancy is a systematic property of the closed-form approximation itself, not random simulation noise. In other words, the simulator is more accurate than the approximation it was being tested against, a subtle but important inversion that gives engineers a clearer picture of how much to trust the analytical shortcut.

With the framework validated, the researchers turned to the central question: what does the distribution of per-packet queueing delay actually look like under bursty load? They examined three different ON/OFF configurations at utilization levels from 0.89 to 0.98, deep in the congested regime where wireless networks spend much of their operating life. Each operating point was simulated with five independent replications totaling roughly 700 million packets, an enormous dataset by any statistical standard. The scale matters because the question they were asking, whether a delay distribution follows a particular mathematical form, is exactly the kind of question where insufficient data produces misleading answers.

The verdict came from four independent distance measures: the Kolmogorov-Smirnov statistic, the Anderson-Darling statistic, the coefficient of determination between cumulative distribution functions, and the Bhattacharyya overlap coefficient. All four measures told the same story. As the load increases, the queueing delay distribution steadily approaches a lognormal shape. The Kolmogorov-Smirnov distance shrank to 0.051 at the highest loads, and the fixed-sample Anderson-Darling statistic, which is especially sensitive to the tails of a distribution, dropped by factors of three to seven. For network engineers, this is a genuinely useful regularity: the lognormal distribution, whose parameters can be estimated from a mean and a variance, offers a compact closed-form description of delay behavior that grows more accurate precisely where delays matter most, near saturation.

Yet the study is equally emphatic about the limits of that regularity. Bootstrap-corrected goodness-of-fit tests rejected exact lognormality at every single operating point, no matter how close the visual and distance-based agreement appeared. The authors therefore present the lognormal as an approximation with quantified accuracy rather than an exact law, a distinction that reflects a mature statistical philosophy. To test whether some other two-parameter distribution might do better, they systematically compared the lognormal against Weibull, gamma, log-logistic, and Lomax alternatives. The result was nuanced: at moderate loads the lognormal could lag behind the best competitor for a given configuration, but as load increased it became competitive with, and in some cases the best among, all the two-parameter candidates.

Configuration mattered too. The team’s sensitivity analysis showed that OFF-dominated or symmetric traffic patterns, where the silent period is at least as long as the active period, produced better lognormal agreement at moderate loads. Near saturation, however, this dependence weakened, suggesting that extreme congestion washes out the details of the source structure and drives the delay distribution toward a common heavy-tailed form regardless of how the bursts are shaped. This finding has practical implications for traffic engineering, because it tells operators when they can rely on a simple lognormal fit and when the specifics of their traffic mix demand a more careful analysis.

Perhaps the most consequential result concerns the tails, the extreme delays that determine whether a system meets the stringent latency budgets of 5G, the tactile internet, and ultra-reliable low-latency communications. Above a utilization of roughly 0.95, the fitted lognormal consistently overestimated the empirical 95th, 99th, and 99.9th percentile delays in every configuration tested, at P99.9 by factors ranging from 3.6 to 9.6 times the observed values. At moderate loads, by contrast, the sign of the tail error depended on the traffic configuration, sometimes underestimating the true risk. The authors frame the heavily loaded overestimation as a virtue: the lognormal acts as an empirically conservative closed-form tool for delay budgeting, erring on the safe side exactly in the regime where network dimensioning decisions are made.

The broader significance of the work lies in its marriage of large-scale simulation with rigorous uncertainty quantification. Rather than declaring a new universal law of network delay, the study delivers something more useful: a validated simulator, a calibrated understanding of when the BSDR approximation can be trusted, and a quantified recipe for using the lognormal as a delay-budgeting tool with known error bounds. As wireless networks absorb everything from factory robots to remote surgery, the difference between a guessed delay distribution and a statistically verified one translates directly into either wasted capacity or violated service guarantees. This research gives the engineers building that future a sharper instrument, and a candid account of its precision.

Subject of Research: Queueing-theoretic modeling and statistical validation of packet delay distributions in bursty wireless network traffic

Article Title: Validation of burst scale decay rate and analysis of lognormal delay distribution in NxOn-Off/D/1 queueing models for wireless network performance

Article References: Enisoglu, R., Inan, B. A., & Ugurlu, S. Y. (2026). Validation of burst scale decay rate and analysis of lognormal delay distribution in NxOn-Off/D/1 queueing models for wireless network performance. Cluster Computing, 29(13), Article 780. https://doi.org/10.1007/s10586-026-06591-y

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06591-y

Keywords: queueing theory, N×On-Off/D/1 model, burst scale decay rate, lognormal distribution, packet delay, QoS provisioning, wireless networks, tail probability estimation, goodness-of-fit testing, network dimensioning, discrete-event simulation, 5G latency

The core challenge the researchers set out to tame is one of the hardest in edge computing. Wireless channels fluctuate constantly as signals are blocked, interfered with, and faded. Task arrivals are random and unpredictable. A device’s battery drains as it computes or transmits. If tasks arrive faster than the system can process them, the queues of waiting data at the edge server grow without bound, and the whole system becomes unstable. Traditional optimization methods struggle in this environment because they typically assume knowledge of future conditions that simply does not exist. Machine learning approaches, particularly deep reinforcement learning, can adapt to changing conditions, but they often fail to guarantee the long-term stability of the system’s queues and its average power consumption, which are the metrics that determine whether a network remains usable over hours and days rather than seconds.

RIASO attacks this problem by fusing three techniques that have rarely been combined so tightly. The first is Lyapunov optimization, a mathematical framework that converts long-term stability requirements into per-time-frame decisions. Instead of trying to plan far into an uncertain future, Lyapunov optimization maintains virtual queues that track accumulated data backlog and power consumption, and then makes each frame’s decision in a way that pushes those queues back toward zero. This provides a theoretical guarantee of long-term stability without needing to predict the future. The second ingredient is deep reinforcement learning, in which a neural network learns through trial and error which offloading decisions yield the best outcomes. The third, and arguably the most novel, is multi-output learning, which trains a single neural network to produce many candidate solutions simultaneously rather than just one.

The architecture that ties these together is an actor-critic structure, a well-established reinforcement learning pattern in which one component proposes actions and another evaluates them. In RIASO, the actor is a multi-input multi-output convolutional neural network, dubbed MIMO_CNN, that receives three pieces of information for every user device at each time frame: the current wireless channel gain, the length of the device’s data queue, and the length of its virtual power queue. From this input, the network generates not one but multiple candidate binary offloading decisions, each specifying which devices should compute locally and which should offload to the edge server. The critic then evaluates each candidate analytically, solving the remaining resource allocation problem, which is convex once the binary decisions are fixed, using an efficient primal-dual algorithm. The best action is selected, stored in a replay memory, and used to retrain the actor network.

This multi-output design is where RIASO departs most sharply from conventional actor-critic schemes, which typically use a single-output network and rely on random exploration to discover good actions. By generating many diverse candidate solutions in parallel, the MIMO_CNN naturally balances exploration and exploitation: the system can pick the best of many well-informed options rather than gambling on random perturbations of a single guess. The researchers report that this leads to more robust and faster convergence of the training process, which matters enormously in edge networks with high-dimensional action spaces where the number of possible offloading combinations grows exponentially with the number of devices.

Equally inventive is the way RIASO handles its own training schedule. In standard deep reinforcement learning, the model is retrained every time new experience accumulates, which is computationally expensive and can slow the system down. RIASO instead waits until its replay memory is completely full and then trains on the entire batch at once, setting the batch size equal to the memory size so that every stored sample is used and the memory is emptied. Moreover, training is triggered only if the current loss exceeds the minimum of all previous loss values, preventing wasteful retraining when the model is already performing well. The researchers found that this policy cut the training phase from roughly 10,000 time frames down to just 2,000, a fivefold reduction that directly translates into shorter response times and shorter data queues for users.

The team also carefully tuned the network’s structure. They examined how the number of output branches in the MIMO_CNN affects performance, discovering that with only five output layers the system behaved erratically, with unreasonable queue lengths, while configurations with ten or more layers converged reliably. After 2,000 time frames, the average data queue lengths for ten, twenty, and thirty output layers were nearly identical, so the researchers settled on ten as the sweet spot between convergence quality and computational cost. Similarly, they swept the size of the replay memory and sample batch, finding that a size of 256 offered the best balance: smaller memories risked trapping the model in local optima, while larger ones updated the data too slowly and lengthened training time.

To validate RIASO, the researchers ran simulations on a TensorFlow 2.0 platform modeling a multi-user MEC network in which an access point integrated with an edge server assists a set of user devices whose tasks arrive stochastically across consecutive time frames. Channel gains followed a Rician distribution built on a path-loss model, with devices positioned at varying distances from the server. The benchmarks included LyDROO, a well-known Lyapunov-guided deep reinforcement learning framework; DRL-DO, a distributed offloading framework using multiple convolutional networks; and three naive strategies: executing everything locally, executing everything at the edge, and executing randomly. Across the weighted sum computation rate, average data queue length, average power consumption, average energy queue length, and average response time per channel, RIASO delivered the best computation rate and the shortest data queue of all tested methods.

The comparison with LyDROO was particularly instructive. Under identical conditions and parameters, RIASO performed comparably on most metrics but achieved better results on average response time per channel, average data queue length, and average energy queue length, indicating a more stable system overall. DRL-DO showed better average power consumption than RIASO, but at the cost of instability across the other metrics, which the authors argue is a fatal flaw for real deployments where queue blowups mean dropped tasks and angry users. The naive strategies illustrated the trade-offs vividly: local execution minimized response time but produced a low computation rate and high energy queues, while edge execution minimized power consumption but created very long data queues, and random execution was poor on nearly every measure.

The implications reach well beyond the simulation lab. As 5G and future 6G networks push computing closer to users, the offloading decision layer becomes the nervous system of the entire edge infrastructure, and algorithms like RIASO demonstrate that it is possible to be simultaneously fast, energy-aware, and provably stable without clairvoyant knowledge of the future. The authors point to several directions for extending the work, including multitier offloading across edge, fog, and cloud layers, collaborative offloading among neighboring devices with spare resources, and support for partial offloading in which a task’s data is split between local and remote execution. For now, RIASO stands as a compelling proof that combining Lyapunov optimization’s stability guarantees with the adaptive intelligence of multi-output deep reinforcement learning can produce an offloading algorithm that is greater than the sum of its parts, one that keeps the edge responsive even as the wireless world around it refuses to sit still.

Subject of Research: Real-time adaptive computation offloading in multi-access edge computing using Lyapunov optimization and deep reinforcement learning

Article Title: A novel real-time integrated adaptive stable offloading (RIASO) algorithm in multi-access edge computing

Article References: Elhadidy, H., Saleh, H., Rizk, R., & Saber, W. (2026). A novel real-time integrated adaptive stable offloading (RIASO) algorithm in multi-access edge computing. Cluster Computing, 29(14), Article 796. https://doi.org/10.1007/s10586-026-06444-8

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06444-8

Keywords: edge computing, mobile edge computing, computation offloading, deep reinforcement learning, Lyapunov optimization, multi-output learning, Internet of Things, queue stability, actor-critic, convolutional neural network, energy efficiency, wireless networks

The core of their argument is a concept they call data endogeneity. In a classical machine learning pipeline, data is collected, cleaned, labeled, and then fed to a model; the model’s predictions do not change how the data was generated. In a learning-enabled 6G network, the opposite happens. The observations a learning system sees—channel measurements, traffic statistics, interference patterns, latency readings—are produced by the very communication, control, and architectural decisions the network itself makes. When a scheduler reallocates spectrum, the traffic statistics shift. When a beam-training algorithm changes its probing strategy, the channel measurements it later receives are different from what they would have been otherwise. The data is not a static resource sitting in a warehouse; it is a native byproduct of network dynamics, continuously regenerated by the system’s own behavior.

That feedback loop may sound like a philosophical nicety, but the survey shows it has hard technical consequences. Standard machine learning theory leans on assumptions such as independent and identically distributed samples, stationarity of the underlying process, and a clean separation between the training phase and the deployment phase. Wireless networks violate all three. The wireless channel is famously non-stationary: users move, obstacles appear, interference sources come and go, and the statistical properties of the signal environment drift on timescales from milliseconds to hours. Interference, in particular, exhibits temporal correlation under common fading models, meaning that successive observations are not independent draws from a fixed distribution but tightly coupled samples of an evolving process. A model trained on yesterday’s channel statistics may be stale by lunchtime.

Partial observability compounds the problem. No network element sees the whole system. A base station observes its own cells in detail and neighboring cells only dimly; a user device sees its local link but nothing of the broader topology. Learning algorithms deployed in such conditions must make decisions from incomplete, biased, and correlated views of the state, and the survey emphasizes that the placement of learning within the network architecture—what the authors call edge–cloud data locality—becomes a first-order design question rather than an implementation detail. Where data is aggregated, and where models are trained and updated, determines the statistical coherence of the learning problem and the timescales over which the network can actually adapt. A model refreshed every second at the network edge faces a fundamentally different learning problem from one retrained nightly in a central cloud, even if the underlying algorithm is identical.

Latency and resource constraints add a further layer of realism that much of the algorithmic literature ignores. 6G envisions services such as ultra-reliable low-latency communications, where decisions must be made within millisecond budgets and where failures carry safety implications for applications like industrial automation and vehicular control. Learning systems cannot simply pause the network while they retrain. Inference must run on hardware with finite compute and energy, often on edge devices, and the communication cost of coordinating distributed learning—federated updates, model synchronization, data shipment—competes directly with the network’s primary job of moving user traffic. The survey synthesizes work on edge intelligence, federated learning with non-IID data, and communication-efficient distributed training to map how these constraints reshape what is learnable in practice.

One of the most striking threads in the analysis draws on the emerging theory of performative prediction. In conventional supervised learning, the model is a passive observer of a fixed world. In performative settings, the model’s own predictions change the distribution it is predicting—a phenomenon first formalized in the machine learning literature and now, the authors argue, unavoidable in closed communication and control loops. A scheduling policy trained on observed traffic will alter that traffic once deployed; a reinforcement learning agent controlling radio resources changes the interference environment that its next observations will reflect. The survey reviews performative reinforcement learning in gradually shifting environments and state-dependent performative prediction, arguing that 6G networks are a natural habitat for these effects and that ignoring them leads to systematic, reproducible failures rather than random noise.

The closed-loop nature of learning-enabled networking also raises the stakes on stability and safety. When a learning controller sits inside a feedback loop with the physical channel and the network’s control plane, the question is no longer just whether the model’s accuracy is high but whether the coupled system remains stable. The authors survey work on learning-based model predictive control, predictive safety filters, control barrier functions, and safe reinforcement learning under partial observability—techniques developed largely in robotics and control theory that they argue must migrate into network design. Open RAN platforms, which expose programmable closed-loop control interfaces for machine-learning applications, are highlighted as both an opportunity and a testbed: they make it possible to study these dynamics experimentally, on real radio hardware, rather than only in simulation.

Perhaps the most uncomfortable part of the survey is its critique of evaluation practice. The authors examine benchmarking protocols commonly used in the field and identify systematic mismatches between those protocols and operational 6G reality. Static datasets stand in for live networks; independent test sets stand in for temporally correlated streams; offline metrics stand in for closed-loop performance. Time series forecasting research has long shown that naive performance estimation can badly mislead when data is non-stationary, and the survey argues that networking research inherits the same trap. The result is a recurring pattern of failure modes induced by abstractions: models that look excellent in the lab and degrade unpredictably in deployment, adaptation mechanisms that oscillate or diverge when coupled with the network, and benchmarks that reward exactly the assumptions real systems violate. The authors also invoke the broader machine learning literature on evaluation gaps and on data cascades in high-stakes AI, where the unglamorous work of data quality is skipped in favor of model work, with predictable consequences.

What the survey deliberately does not do is catalog algorithms. There are already numerous surveys enumerating machine learning techniques for resource allocation, network slicing, beam management, and physical-layer design. Trigka and Dritsas instead ask a prior question: under what system-level conditions does data-driven learning remain valid, stable, and interpretable inside an operational network? Their answer reframes Big Data and machine learning as endogenous system functions of 6G—components woven into the network’s own operation, subject to its physics, its latencies, and its feedback loops—rather than add-on intelligence layered on top. That reframing carries practical implications for how the field should evaluate claims, design experiments, and architect the AI-native networks that standards bodies and vendors are already building.

The timing is not incidental. Research programs on AI-native and task-oriented 6G architectures, foundation-model-based cloud–edge–end collaboration, and integrated sensing and communication are moving from vision papers to engineering specifications, and the decisions made in the next few years will harden into infrastructure that lasts decades. If the survey’s central claim is right—that the classical machine learning playbook quietly breaks when the learner and the learned system are the same machine—then the most important innovations in 6G intelligence may not be new architectures or exotic algorithms at all, but a more honest account of what happens when a network learns from itself. The authors, who contributed equally to the work, frame their contribution as a foundation for understanding, evaluating, and designing learning-enabled 6G systems beyond the algorithm-centric paradigms that have dominated the conversation so far. Whether the field listens may determine how much of the 6G hype survives contact with reality.

Subject of Research: System-level integration of Big Data and machine learning in 6G communication networks

Article Title: Big Data–driven machine learning for 6G communications: from algorithmic promises to system-level realities

Article References: Trigka, M., & Dritsas, E. (2026). Big Data–driven machine learning for 6G communications: from algorithmic promises to system-level realities. International Journal of Data Science and Analytics, 22(1), Article 292. https://doi.org/10.1007/s41060-026-01274-8

Image Credits: AI Generated

DOI: 10.1007/s41060-026-01274-8

Keywords: 6G, machine learning, Big Data, wireless networks, edge intelligence, federated learning, non-stationarity, closed-loop control, performative prediction, O-RAN, network slicing, evaluation benchmarks

The research, led by Tianming Feng and corresponding author Chenyu Wu, tackles a blind spot in how engineers evaluate multi-antenna, multi-user networks. Traditionally, network designers have leaned on a single headline statistic: the success probability, the average chance that a randomly chosen user’s transmission clears a minimum signal-to-interference ratio threshold. That number is useful, but it hides as much as it reveals. A network with a respectable average can still contain a significant minority of users stranded in interference shadows, suffering connections far worse than the mean implies. The new framework refuses to settle for the average. It layers on two additional metrics — the variance of link reliability across users and the so-called SIR meta distribution — to capture not just how well the network performs, but how fairly it performs and how reliably any individual link can be expected to behave.

The meta distribution deserves particular attention, because it is the metric most likely to reshape how next-generation networks are tuned. Rather than reporting the probability that a typical user succeeds, the meta distribution answers a sharper question: what fraction of users can achieve a given link reliability? The authors illustrate the concept with a concrete example — if operators focus on the 5th-percentile, the meta distribution tells them the link reliability that 95 percent of users in the network can attain. That is exactly the kind of cell-edge guarantee that matters for mission-critical applications, from industrial automation to emergency communications, where a good network average is cold comfort to the unlucky user whose connection keeps dropping.

To build this fine-grained picture, the team turned to stochastic geometry, the branch of mathematics that models randomly scattered transmitters and receivers as spatial point processes. Base stations and users are treated as points in a Poisson point process, and the interference each user experiences becomes a random variable whose statistics can be derived in closed form. The authors derive exact expressions for the success probability of each interference-nulling scheme, then obtain approximate expressions for the first and second moments of the link reliability, which in turn yield the variance and an approximation of the SIR meta distribution. The mathematical machinery is formidable — involving Laplace transforms of the interference field, gamma-distributed channel gains, and an elegant inversion technique dating back to a 1951 result by J. Gil-Pelaez — but the payoff is a set of tractable formulas that network planners can actually evaluate without brute-force simulation.

The study compares two distinct strategies for deploying interference nulling, and the contrast between them carries the paper’s most consequential finding. In the fixed scheme, abbreviated FxIN, each base station nulls interference toward users located within a fixed radius around it. Any user inside that protection zone who is being served by another base station gets a null steered in their direction, regardless of how far away their actual server is. In the flexible scheme, FlIN, the protection is adaptive: a user sends an interference-nulling request to a nearby base station only when that station is closer than a configurable multiple of the user’s serving distance. In other words, FlIN concentrates its nulling resources on the interferers that actually threaten a given link, rather than blanketing a fixed geographic area.

When the two schemes are run through the analytical framework, a clear pattern emerges on fairness. The flexible scheme always provides higher fairness among individual links than the fixed scheme, according to the study. This makes intuitive sense once the geometry is examined: FlIN adapts its protection to each user’s actual situation, so users in difficult positions receive proportionally more help, compressing the spread of link qualities across the network. The variance of link reliability — the framework’s fairness metric — comes out consistently lower under FlIN, meaning the gap between the best-connected and worst-connected users shrinks. For operators facing regulatory or commercial pressure to guarantee minimum service levels, that fairness advantage could prove decisive.

But here is the twist that prevents the story from ending with a simple verdict: the flexible scheme does not always win on raw performance. The study shows that the superiority of the success probability and the SIR meta distribution between the two schemes depends on the system parameter design. The fixed scheme, with its predictable geographic protection zone, can outperform the adaptive approach under certain configurations of antenna count, user loading, and nulling capacity. Each base station can only satisfy a limited number of nulling requests — the analysis models this capacity explicitly, deriving the mean number of requests each scheme generates. Under FxIN, the expected number of requests scales with the size of the protection circle and the user density, while under FlIN it scales with the square of the flexibility parameter minus one, multiplied by the number of users served per station. Choosing the parameter that balances request load against antenna resources is therefore the crux of the design problem.

The derivations themselves reveal how the antenna dimension enters the picture. When a base station satisfies a nulling request, it sacrifices one spatial degree of freedom, reducing the effective diversity order of its own served links — the analysis tracks this through the term D, equal to the number of antennas minus the number of served users plus one, minus the number of satisfied nulling requests. The desired channel gain under this reduced diversity follows a gamma distribution whose shape parameter shrinks with each null granted. The authors exploit a lower bound on the incomplete gamma function to derive tractable upper bounds on the conditional success probability, then aggregate over the random number of satisfied requests using the total probability theorem. The final expressions take the form of matrix exponentials and matrix inverses whose induced one-norms give the performance metrics directly — a compact and computationally efficient alternative to Monte Carlo simulation of large networks.

What makes this work timely is the trajectory of wireless technology. Multi-antenna systems have moved from research curiosity to the backbone of 5G and the blueprint for 6G, and interference nulling sits at the heart of techniques from coordinated multipoint transmission to user-centric network MIMO. Prior studies in the literature — including analyses of inter-tier interference nulling in heterogeneous networks and user-centric nulling in small-cell deployments — established that nulling improves average performance, but the meta-distribution lens shows that averages can mask deep inequities between users. As networks densify and the user experience becomes a marketed commodity, the difference between a network with a good average and a network with a good 5th-percentile is the difference between satisfied and frustrated customers.

The authors are candid about the framework’s boundaries. The analysis assumes perfect channel state information at the base stations, though they note the framework can accommodate imperfect CSI, leaving that extension to future work. No datasets were generated or analyzed in the study, which is purely theoretical. Yet the implications are practical: the closed-form results let engineers sweep through design parameters — antenna counts, user loads, protection radii, flexibility factors — and identify the operating points where fairness and performance trade off against each other. In a field where every antenna element and every nulling request carries a cost, a framework that quantifies exactly who benefits and who is left behind is not just an academic exercise. It is a map for building wireless networks that serve everyone, not just the average user.

Subject of Research: Fine-grained performance analysis of multi-antenna multi-user wireless networks using interference nulling

Article Title: A Fine-Grained Performance Analysis for Multi-Antenna Multi-User Networks with Interference Nulling

Article References: Feng, T., Wu, C., Wang, L., Lu, X., & Han, S. (2026). A Fine-Grained Performance Analysis for Multi-Antenna Multi-User Networks with Interference Nulling. Mobile Networks and Applications. https://doi.org/10.1007/s11036-026-02519-3

Image Credits: AI Generated

DOI: 10.1007/s11036-026-02519-3

Keywords: multi-antenna networks, interference nulling, SIR meta distribution, stochastic geometry, success probability, link reliability, fairness, MIMO, 5G, wireless networks, Poisson point process, Mobile Networks and Applications

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: Suma, P., Shieh, C. S., Hussain, M. A., Tabassum, M., & Chakrabarti, P. (2026). A Novel Hybrid Greater Cane Mayfly Optimization Algorithm for Alternative Path Selection and Resource Optimization Strategies in MANET. Mobile Networks and Applications. 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

At the heart of the work is a relatively new hardware concept called the stacked intelligent metasurface (SIM). Unlike conventional massive antenna arrays, an SIM consists of several layers of nearly passive metamaterial elements stacked in front of the transmitter. Each layer can shift the phase of radio waves passing through it, and by coordinating the phase shifts across all layers, the stack can perform part of the beamforming task directly in the electromagnetic wave domain—before the signal even reaches the digital baseband. This wave-domain processing offers the prospect of enormous antenna apertures and fine-grained spatial control at far lower cost and power consumption than fully digital arrays, which is precisely why SIMs have attracted intense attention for 6G applications ranging from holographic multiple-input multiple-output (MIMO) communications to ISAC.

The difficulty is coordination. With many layers and thousands of reconfigurable elements, jointly optimizing the phase configurations is a formidable problem. The researchers address it with a scheme they call layer contribution sorting multi-layer alternating optimization (LCS-MAO). In a naive alternating optimization, the algorithm would tune each SIM layer in a fixed sequence, treating every layer as equally important. LCS-MAO instead evaluates, at each round, how much each layer actually contributes to improving the objective, and prioritizes the layers with the greatest remaining optimization potential. Layers that promise larger improvements are optimized first and more intensively, while layers whose adjustments yield diminishing returns are deprioritized. This dynamic sorting accelerates the search for good phase configurations across the entire stack and makes the multi-layer design far more computationally efficient.

How do the authors judge whether the sensing half of the dual-function system is performing well? They adopt a power-based sensing loss metric, defined as the reciprocal of the effective sensing signal-to-noise ratio (SNR). Minimizing this quantity is equivalent to maximizing the effective sensing SNR, which in turn means sharper, more reliable estimation of target directions. This metric neatly captures the trade-off at the core of ISAC design: every watt of transmit power and every degree of spatial freedom devoted to communication beams is power and freedom unavailable for illuminating and sensing targets. A well-designed beamformer must thread the needle, concentrating energy toward users for data delivery while still sculpting enough of the transmitted waveform toward target directions that the reflected echoes can be read clearly.

On the active side of the system—the transmit beamforming computed digitally—the team turns to reinforcement learning, but with a quantum twist. Their approach builds on the soft actor-critic (SAC) family of algorithms, a widely used off-policy deep reinforcement learning method prized for its stability and its ability to learn continuous control policies. In the proposed quantum soft actor-critic (QSAC), the actor remains a classical neural network that outputs continuous beamforming actions, but the critics are replaced by variational quantum circuits. These parameterized quantum circuits process encoded information through sequences of quantum gates whose parameters are learned during training, and their measurement outputs supply the value estimates that guide the actor’s learning.

The motivation for going quantum is parameter efficiency. Each variational quantum circuit-based critic requires far fewer trainable parameters than an equivalent classical critic network, because the expressive power of a quantum circuit does not scale linearly with the number of its adjustable parameters. Fewer parameters mean less memory, potentially faster training iterations, and a reduced risk of overfitting—advantages that matter when the learning agent must adapt beamforming policies in systems with high-dimensional configuration spaces, exactly the regime that multi-user SIM-assisted ISAC inhabits. The authors report that QSAC achieves better parameter efficiency compared with a classical critic network while maintaining the quality of the learned policies.

The full framework therefore couples the two halves elegantly: LCS-MAO handles the passive beamforming across the SIM layers by sorting layers according to their optimization contribution, while QSAC learns the active transmit beamforming policies that determine how power and spatial structure are allocated among communication and sensing objectives. Because the passive and active designs interact—each layer’s phase profile changes the effective channel that the transmit beams must navigate—the joint framework iterates between them, and the combined LCS-MAO plus QSAC approach is what delivers the study’s headline results.

Those results, demonstrated through simulations of a multi-user downlink ISAC system, show that the proposed scheme converges faster and achieves lower sensing loss than the benchmark schemes considered in the study. Importantly, the sensing gains do not come at the expense of users: the framework satisfies the communication signal-to-interference-plus-noise ratio (SINR) requirements that guarantee each user’s link quality. In other words, the radar-like function of the network is sharpened without starving the data connections, which is the fundamental balancing act that any practical ISAC deployment must perform. The faster convergence is particularly significant for real-world operation, since wireless environments shift constantly and a beamforming controller that needs many training episodes to adapt would lag behind the users and targets it is meant to serve.

The broader context makes clear why this line of work matters. ISAC has moved from a conceptual proposal to a cornerstone of 6G standardization thinking, with surveys in the field describing dual-functional wireless networks that fuse radar and communication infrastructure. Reconfigurable intelligent surfaces and their stacked descendants extend this vision by giving networks programmable control over the propagation environment itself, effectively turning passive structures into tunable optical-style elements for radio waves. Prior studies have applied SIMs to multi-user beamforming in the wave domain, to sensing-communication trade-offs, and to deep reinforcement learning for sum-rate optimization; the present study adds two ingredients—a contribution-aware layer optimization that respects the layered structure of the hardware, and quantum critics that shrink the learning model without sacrificing performance.

There are, of course, caveats that temper the excitement. The results are simulation-based, and the authors note that no datasets were generated or analyzed beyond the study’s own experiments, so real-hardware validation on fabricated SIM stacks and physical quantum processing units remains future work. Variational quantum circuits today run on noisy, small-scale devices, and translating critic networks from simulation to actual quantum hardware will surface challenges that simulations cannot fully anticipate. Nevertheless, the study offers a concrete and testable recipe for one of 6G’s hardest problems: coordinating thousands of nearly passive metamaterial elements and a learning-based transmitter so that the same radio energy simultaneously streams data to users and maps the surroundings. If the promised parameter efficiency and convergence speed hold up on hardware, quantum-assisted beamforming could become a serious candidate for the intelligent surfaces that future networks drape across their base stations.

Subject of Research: Joint beamforming design for stacked intelligent metasurface-assisted integrated sensing and communications using layer contribution optimization and quantum soft actor-critic reinforcement learning

Article Title: Stacked Intelligent Metasurfaces-Assisted ISAC Beamforming Based on Layer Contribution and Quantum Soft Actor-Critic

Article References: Sun, Y., Wang, L., Meng, F., Li, B., Lu, W., & Li, C. (2026). Stacked Intelligent Metasurfaces-Assisted ISAC Beamforming Based on Layer Contribution and Quantum Soft Actor-Critic. Mobile Networks and Applications. https://doi.org/10.1007/s11036-026-02551-3

Image Credits: AI Generated

DOI: 10.1007/s11036-026-02551-3

Keywords: 6G, integrated sensing and communications, beamforming, stacked intelligent metasurfaces, quantum soft actor-critic, reinforcement learning, variational quantum circuits, alternating optimization, reconfigurable intelligent surfaces, wireless networks, signal processing, MIMO

The research, led by Guangzhen Si of Zhejiang University of Technology together with colleagues at Hangzhou Dianzi University, tackles a problem that has quietly constrained drone communications for years. Orthogonal frequency division multiplexing, or OFDM, is the modulation scheme underpinning modern Wi-Fi and cellular systems because it divides a wide channel into many narrow subcarriers that resist multipath fading. But OFDM receivers traditionally rely on pilot signals, known reference symbols embedded in the transmission, to estimate how the channel has distorted the data. In a dynamic aerial environment, pilots are a scarce resource. Every pilot symbol spent on channel estimation is a symbol not carrying useful payload, and when the channel changes rapidly, the estimates go stale almost as soon as they are formed.

The situation is compounded by what the authors describe as multidimensional channel coupling. A drone receiver with multiple antennas receives signals that vary simultaneously across three dimensions: frequency, in the form of the OFDM subcarriers; time, in the sequence of transmitted symbols; and space, in the signals arriving at each antenna element. Conventional receivers often process these dimensions separately or with simplified assumptions, discarding the correlations that link them. When the aircraft banks, accelerates, or flies through a canyon of reflections, those discarded correlations are precisely the information a receiver needs to reconstruct the transmitted symbols accurately.

KRF-DUNet’s central move is to treat the received signal as a single mathematical object rather than a stack of separate vectors. The team models the incoming signal as a third-order tensor whose three axes correspond to the subcarrier, symbol, and antenna dimensions. Tensors, the higher-dimensional generalizations of matrices, have a long pedigree in signal processing because they can capture multilinear structure that flat matrices cannot. In this framework, the channel’s frequency-domain behavior and its spatial behavior are represented as separate factor matrices, and the Khatri-Rao product, a column-wise multiplication operation, is used to preserve the coupling between those frequency and spatial factors. In practical terms, the model explicitly encodes the fact that how the channel distorts each subcarrier is not independent of how it distorts the signals at each antenna, and that this relationship follows a structured, learnable pattern.

Recovering symbols from this tensor model is framed as a regularized tensor recovery problem, a class of optimization tasks that is powerful on paper but often slow or unstable when solved with iterative numerical algorithms. Here the study borrows a technique that has been gaining momentum across signal processing and machine learning: algorithm unrolling, sometimes called deep unfolding. Instead of running an iterative solver for many unbounded iterations, unrolling converts a fixed, finite number of iterations into the layers of a neural-network-like computational structure. Each layer performs one step of the optimization, and parameters that would traditionally be hand-tuned, such as regularization weights and step sizes, become trainable. The result, as the method’s name suggests, is a deep unrolling network, or DUNet, built directly on the Khatri-Rao factorization structure, hence KRF-DUNet.

This architecture gives the receiver the best of both worlds. Because each layer corresponds to a concrete step of a principled tensor recovery algorithm, the network remains interpretable in a way that conventional black-box deep learning detectors are not; an engineer can trace how the estimate evolves layer by layer. At the same time, the learned parameters adapt to the statistics of real channel conditions, something classical algorithms with fixed parameters struggle to do. The finite depth also makes computational cost predictable, a critical consideration for airborne platforms where processing power, energy, and latency budgets are all tight.

One further innovation addresses the pilot bottleneck directly. The researchers introduce what they call pilot constrained symbol projection, a mechanism that uses the known pilot symbols as anchors during the recovery process. Because the receiver knows exactly what the pilot symbols should look like, it can project its intermediate symbol estimates onto constraints defined by those pilots, pulling the solution toward consistency with the ground truth embedded in the transmission. This semi-blind strategy, which exploits both the known pilots and the unknown data symbols’ structure, improves the stability of the recovery, particularly when pilots are few and the channel is strongly correlated across dimensions.

To find out whether the theory translates into performance, the team ran simulation experiments benchmarking KRF-DUNet against a roster of established receivers. The comparison set included zero-forcing (ZF) and minimum mean square error (MMSE) receivers, the classical linear workhorses of multi-antenna detection, as well as alternating least squares (ALS) methods, which solve tensor factorization problems by iteratively updating one factor at a time. Two refined variants, SVD-ALS and DU-ALS, which incorporate singular value decomposition and unrolling ideas respectively, rounded out the field. The evaluation varied the number of pilots, the rank of the tensor model, and the degree of channel correlation, sweeping through the conditions most likely to break a receiver in practice.

Across those conditions, KRF-DUNet achieved a lower bit error rate and a lower symbol normalized mean square error than its competitors, meaning it recovered both the raw data bits and the underlying channel symbols more faithfully. Just as importantly for real deployment, the study reports that the method maintains a favorable balance between recovery reliability and computational complexity. It does not win accuracy by brute-force computation; the tensorized, unrolled structure keeps the workload contained while the Khatri-Rao modeling and pilot constraints do the heavy lifting on accuracy. For a drone that must simultaneously fly, sense, and communicate on a limited battery, that trade-off is not a nicety but a requirement.

The broader vision behind the work is what the authors call embodied spectrum intelligence: the idea that a UAV should not merely pass through the radio spectrum but actively understand and adapt to it, with its physical mobility, its antenna array, and its learning algorithms working as one integrated system. By fusing tensor algebra, which captures the physics of multidimensional channels, with deep unrolling, which captures adaptability, KRF-DUNet offers a template for receivers that stay reliable as the environment around them churns. As drone swarms take on larger roles in logistics, public safety, and integrated sensing-and-communication networks of the 5G-and-beyond era, receivers of this kind could determine whether the sky’s airwaves remain orderly or dissolve into interference. The study was supported by the Zhejiang Provincial Postdoctoral Research Excellence Funding Program and the National Natural Science Foundation of China, and the authors report no competing interests.

Subject of Research: Tensor-based semi-blind signal recovery for UAV OFDM communication receivers

Article Title: KRF-DUNet: A Reliability-Enhanced Tensorized Semi-Blind Communication Receiver for UAV Embodied Spectrum Intelligence

Article References: Si, G., Wang, M., Pan, L., Chen, Z., Xuan, Q., & Yu, S. (2026). KRF-DUNet: A Reliability-Enhanced Tensorized Semi-Blind Communication Receiver for UAV Embodied Spectrum Intelligence. Mobile Networks and Applications. https://doi.org/10.1007/s11036-026-02547-z

Image Credits: AI Generated

DOI: 10.1007/s11036-026-02547-z

Keywords: UAV communication, OFDM, tensor decomposition, semi-blind receiver, Khatri-Rao product, algorithm unrolling, deep learning, channel estimation, MIMO, signal processing, embodied spectrum intelligence, wireless networks