The choice of GSM, Wi-Fi, and LoRa as the three candidate technologies is not arbitrary, and understanding the complementary strengths of each helps explain why switching between them yields measurable gains. GSM, despite its age as a standard, remains the most universally available wide-area technology in many parts of the world, and its circuit-switched and packet-switched heritage gives it mature, well-characterized behavior under mobility. Its principal weaknesses for sensor applications are comparatively low throughput for data-intensive payloads and the substantial power draw of cellular modems, particularly in regions where nodes must operate from batteries or small solar installations for months at a time. Wi-Fi inverts this trade-off almost entirely: within its limited range it delivers data rates several orders of magnitude higher than either GSM or LoRa, making it suitable for media-rich payloads, but its dependence on nearby access points restricts its usefulness to structured environments such as research stations, farms with wired infrastructure, or urban deployments.

LoRa occupies the third corner of this triangular trade-off space. Its chirp spread spectrum modulation, operating in sub-gigahertz license-exempt bands in most jurisdictions, sacrifices data rate in exchange for remarkable link budgets and receiver sensitivity. A LoRa transceiver can often close a link at received signal strengths far below the noise floor of conventional receivers, which is why the technology performs well in foliage-dense environments, hilly terrain, and other conditions that would defeat higher-frequency systems. The modulation also permits very low current consumption during both transmission and reception, which extends node lifetimes dramatically. The penalty, of course, is that payloads must be small and duty cycle regulations in many countries limit how often a device may transmit. No single technology in this trio dominates the others across all dimensions, which is the classic precondition under which adaptive selection strategies deliver genuine value rather than mere engineering elegance.

The intellectual glue binding these technologies together in the framework is the delay tolerant networking paradigm. Delay tolerant networking emerged originally from efforts to support interplanetary communication, where propagation delays and periodic disconnections make standard internet protocols fail outright. The core abstraction is the bundle layer, which sits between the transport and application layers and implements store-and-forward custody transfer. In terrestrial sensor deployments, the practical consequence of adopting DTN principles is that a node experiencing a connectivity outage does not discard its sensor readings or block indefinitely waiting for a link. Instead, data accumulates in local storage until a viable path reappears, at which point buffered payloads are forwarded. This design decision is particularly consequential in rural African deployments, where grid electricity for network infrastructure is unreliable and backhaul links can be down for hours at a time.

The methodology described in the study grounds its switching decisions in real-time performance metrics rather than static rules. Throughput, latency, and packet loss are the canonical triad of network quality measurement, and each captures a different failure mode. Throughput degradation often signals congestion or weak signal-to-noise ratio; rising latency can indicate queuing delays, retransmissions, or routing problems; and packet loss directly measures the fraction of transmitted data that never arrives intact. By continuously evaluating these metrics on each available network and computing a composite assessment, the algorithm can rank the candidate channels dynamically and hand off transmissions to whichever medium currently offers the best expected performance for the payload type in question. This is conceptually related to the decision logic used in vertical handover research for cellular networks, but adapted to the resource constraints and heterogeneous capabilities of low-power sensor systems.

The distinction between payload types deserves particular attention, because it drives much of the observed behavior in the simulation results. Text sensor readings, such as temperature, humidity, or hive weight measurements, are small and delay-tolerant, making them natural candidates for LoRa transmission. Audio and image payloads are intermediate in size and benefit from Wi-Fi when infrastructure is available, or from GSM when it is not. Video is the most demanding payload class by a wide margin, requiring sustained bandwidth that only Wi-Fi or high-quality GSM data channels can supply. The reported peak performance score for video data at night reflects a well-known characteristic of shared wireless media: unlicensed spectrum and cellular capacity both experience diurnal load patterns, with congestion peaking during evening hours of human activity in some environments while in others the nighttime release of interference and competing traffic creates a window of exceptional channel quality. An adaptive system that senses these windows can schedule demanding transfers to exploit them.

The simulation methodology itself merits discussion, because simulation remains a contested but indispensable tool in networking research. Building physical testbeds spanning urban, suburban, and rural environments with three parallel network technologies is expensive and logistically complex, so well-constructed simulations calibrated against empirical measurements offer a practical compromise. The use of a real-world case study, in this instance beehive monitoring, to validate the simulated results is a methodological strength that many purely synthetic studies lack. Apiculture is an instructive application domain for adaptive networking: hives are typically located in rural or semi-rural apiaries far from reliable infrastructure, the sensor payloads include both slow-changing environmental measurements and richer data such as audio recordings used for swarming detection, and the economic value of timely alerts about hive conditions gives a concrete motivation for dependable delivery.

The reported aggregate improvements, including an average throughput gain of roughly a third, a latency reduction of about a quarter, and a packet loss decrease of nearly half relative to standalone networks, are consistent with what queuing-theoretic reasoning would predict when traffic is steered away from congested or degraded channels. Packet loss in particular tends to improve disproportionately under adaptive switching because losses on wireless links are bursty: when a link enters a fade or an interference episode, losses arrive in cascades rather than as an independent random process. A switching algorithm that detects the onset of such an episode and reroutes traffic can avoid entire bursts of loss rather than merely reducing per-packet loss probability, which explains why the packet loss benefit is the largest of the three reported gains.

The adaptability score, averaging approximately 0.7 in rural scenarios, functions as a normalized measure of how consistently the algorithm selects channels that perform near the best available option at each moment. Values below unity reflect the inherent cost of imperfect or delayed information: real-time metrics arrive with their own latency, and network conditions can change between measurement and decision. Rural environments tend to produce lower adaptability scores than urban ones because network availability there is sparser and more volatile, meaning the algorithm more frequently confronts situations where only a single degraded channel exists and no beneficial switching is possible. The dimensionless nature of such composite scores provides a standardized yardstick that future adaptive networking proposals can be measured against, addressing a long-standing reproducibility problem in this literature where studies report incomparable bespoke metrics.

The regional context of this work is significant in ways that extend beyond the immediate technical contributions. Much of the foundational literature on adaptive networking originates in institutions with ubiquitous connectivity and dense infrastructure, and the resulting assumptions about always-available backhaul and stable mains power do not transfer cleanly to deployment environments in sub-Saharan Africa and similar regions. Research conducted from Makerere University in Kampala brings deployment realities to the foreground: intermittent grid electricity, variable cellular coverage that degrades rapidly outside urban cores, and long distances between points of infrastructure. Designing for these constraints tends to produce systems that are more robust everywhere, a phenomenon familiar from fields such as mobile payments, where systems engineered for low-connectivity environments proved highly resilient.

Looking forward, the framework suggests several natural avenues for extension. The inclusion of additional radio technologies, such as NB-IoT, satellite small-datum services, or emerging standards for non-terrestrial networks, would widen the decision space and further improve worst-case availability. Machine learning approaches could replace or augment the metric-based ranking, learning predictive models of network quality from historical patterns, including diurnal and seasonal cycles. Energy-aware extensions that weigh the residual battery state of each node alongside network quality would align switching decisions with lifetime objectives, which often matter more to deployers than raw throughput. The convergence of these directions points toward self-optimizing sensor networks that manage their own connectivity as fluidly as modern devices manage their own power states, a capability that would substantially lower the operational burden of large-scale environmental and agricultural monitoring.

The broader lesson of this study is that reliability in distributed sensing is rarely a property of any single link but an emergent property of the system architecture that binds links together. As IoT deployments continue to spread into environments that were never designed for connectivity, the engineering pattern demonstrated here, namely the fusion of heterogeneous networks under delay-tolerant, metric-driven control, offers a reusable template. The quantified benefits reported in the simulation and case study provide empirical justification for the additional architectural complexity, and the standardized evaluation vocabulary introduced by the authors should help the community accumulate comparable evidence as adaptive strategies proliferate across the Internet of Things.

Subject of Research: Adaptive network switching algorithm for sensor data transfer: a simulation framework integrating GSM, Wi-Fi, and LoRa networks

Article Title: Adaptive network switching algorithm for sensor data transfer: a simulation framework integrating GSM, Wi-Fi, and LoRa networks

Article References: Namugenyi, E. E., Sansa Otim, J., Zennaro, M., Wolthusen, S., & Nsabagwa, M. (2025). Adaptive network switching algorithm for sensor data transfer: a simulation framework integrating GSM, Wi-Fi, and LoRa networks. Frontiers in the Internet of Things, 4, Article 1520653. https://doi.org/10.3389/friot.2025.1520653

Image Credits: AI Generated

DOI: 10.3389/friot.2025.1520653

Keywords: IoT, adaptive network switching, GSM, Wi-Fi, LoRa, delay tolerant networking, sensor data, beehive monitoring, throughput, packet loss, simulation framework, rural connectivity

The core insight behind the work is that not all link interruptions in a satellite network are surprises. Because satellites follow deterministic orbital trajectories, a substantial portion of the on–off behavior of inter-satellite links can be predicted in advance from the laws of orbital motion. Conventional terrestrial routing protocols were never designed to exploit this predictability. The widely deployed Open Shortest Path First (OSPF) protocol, for example, computes shortest paths solely on the basis of link distance, without considering how long a link will remain usable or how much bandwidth it has available. In a satellite constellation where a link may vanish in a matter of minutes, a path that is shortest today can be useless tomorrow, and services riding on it will be abruptly severed.

Existing remedies fall short in different ways. Fast reroute strategies, borrowed from terrestrial carrier networks, can protect traffic against sudden link failures by pre-establishing backup paths, but they consume substantial bandwidth resources and cannot provide protection for every node across an entire network. For a constellation with hundreds or thousands of satellites, blanket fast-reroute protection would be prohibitively expensive in terms of the reserved capacity it requires. The alternative—reacting only after a link breaks—forces the network to reconverge while traffic is already being dropped. The Beijing team’s approach occupies the middle ground: use the predictability of orbital dynamics to move services onto fresh paths just before the old ones are scheduled to disappear, minimizing both service disruption and resource overhead.

The technical foundation of the strategy is an extended OSPF protocol. The researchers augmented the routing information advertisement with two new fields: a “termination time of validity” and an “available bandwidth” value. These extensions, illustrated in the structure of the extended Route-LSA (link state advertisement), allow every router in the network to learn not just that a link exists, but how long it will remain available and how much capacity it can offer. Synchronization of the link state database across the entire network is achieved through the Link Management Protocol, ensuring that all nodes share a consistent, time-aware view of the constellation’s topology. This transforms the link state database from a static map into a dynamic schedule of the network’s future state.

With that time-aware database in place, the team redefined the routing metric itself. Rather than a pure distance measure, the new metric is a weighted combination of the conventional metric and the link effective duration. The weighting factor can be adjusted according to service requirements, letting operators strike a balance between the shortest path and the longest effective duration. The Constrained Shortest Path First (CSPF) algorithm then uses this metric to select paths that satisfy both length and duration constraints simultaneously. The researchers demonstrate the value of this with a concrete example: a path with fewer hops that interrupts after 200 seconds cannot satisfy a service requiring 800 seconds of transmission, whereas the CSPF algorithm can select a path with slightly more hops but an effective duration of up to 1,000 seconds, keeping the service alive for its entire lifetime.

On top of the extended protocol, the researchers built a pre-rerouting mechanism that operates at the source node of each label switched path (LSP). The source node continuously monitors the remaining effective time of the established LSP. When that remaining time falls below the remaining service transmission duration and is less than a preset threshold, the mechanism triggers automatically: the source node recomputes the optimal path satisfying both bandwidth and duration constraints based on the current network state, reserves resources and establishes a new LSP through the constraint-based routed label distribution protocol, performs the service switching, and finally releases the resources of the old path. The result is a handoff that completes before the old link ever breaks, rather than a recovery that begins after it does.

To prove that the mechanism actually works in hardware rather than only on paper, the team constructed an experimental environment based on the VxWorks embedded system and an FPGA hardware platform. Dynamic link on–off behavior was simulated by plugging and unplugging ports between control nodes. In the functional verification, when the old LSP was established over a port with a shorter effective time, triggering of the pre-rerouting caused the source node to automatically construct a new path through a port with a longer effective time. Ping packets were transmitted normally throughout the process, and after the old path was released, service transmission continued without any packet loss. This demonstrated that the strategy can autonomously complete path switching ahead of link interruption and preserve service continuity end to end.

The quantitative performance validation was carried out on the EXata hardware-in-the-loop simulation platform, using a topology in which two alternative paths connect the source node to the destination node. The primary path was configured with an effective duration of 100 seconds, while the service required 500 seconds of transmission, and the source node sent a total of 1,000 UDP packets. In the conventional OSPF rerouting scenario, the link failed at the 100-second mark and service transmission resumed only after an interruption of approximately 20 seconds; the destination ultimately received 930 packets, corresponding to a packet loss rate of 7 percent. In the pre-rerouting scenario, the service was switched to the backup path before the interruption occurred, transmission proceeded uninterrupted for the entire duration, and the destination received 990 packets—a packet loss rate of merely 1 percent, roughly 6 percentage points better than the conventional scheme.

The researchers are candid about the limits of the approach. The new path established by pre-rerouting may be inferior to the original path in terms of hop count and transmission delay, since the mechanism prioritizes availability over optimality when the clock is running out. They note that future work could further optimize transmission performance by recomputing the globally optimal path after the interruption has passed, combining the continuity guarantees of pre-rerouting with the efficiency of full recalculation. Even with that caveat, the study delivers an efficient, low-loss service continuity assurance solution for LEO satellite networks facing predictable link interruptions, and the authors argue it carries significant engineering application value for the stable and reliable operation of space–air–ground integrated networks.

As 6G architectures pull satellites, aircraft, and ground networks into a single seamless fabric, the ability to route around scheduled disruptions will only grow in importance. Constellation operators are planning systems with thousands of satellites whose links rise and set on orbital schedules, and every predictable interruption handled proactively is bandwidth and capacity saved for the failures that genuinely cannot be foreseen. By teaching a decades-old routing protocol to read the orbital clock—embedding link lifetimes and bandwidth into the advertisements that shape every path decision—the Beijing team’s work points toward networks that treat the dynamism of space not as a hazard to be survived, but as a schedule to be planned around, keeping business and broadband services flowing smoothly through the churn of the constellation overhead.

Subject of Research: Pre-rerouting strategy based on an extended OSPF protocol to ensure service continuity in low Earth orbit satellite networks

Article Title: Pre-rerouting strategy to ensure business continuity for low-Earth-orbit satellite network

Article References: Pre-rerouting strategy to ensure business continuity for low-Earth-orbit satellite network. (n.d.). Original publication

Image Credits: AI Generated

DOI: Not provided

Keywords: LEO satellite networks, 6G, pre-rerouting, OSPF, CSPF, inter-satellite links, service continuity, packet loss, label switched path, space-air-ground integrated networks, routing protocol, Beijing University of Posts and Telecommunications