…

The emergence of low-power wide-area networking has fundamentally altered the design space available to Internet of Things engineers over the past decade. Before technologies such as LoRa became widely accessible, sensor deployments in remote locations were largely confined to whatever cellular coverage happened to exist in the area, or they required bespoke satellite links whose cost placed them far beyond the reach of most research projects and small-scale commercial ventures. The addition of LoRa to the connectivity portfolio of a sensor node means that a device can now maintain a low-power lifeline to the network over distances that can exceed ten kilometres in favorable terrain, while still retaining the option to exploit higher-bandwidth channels when they become available. This layering of capabilities is precisely the design philosophy underlying the adaptive switching framework developed by researchers at Makerere University working alongside collaborators at the Abdus Salam International Centre for Theoretical Physics and the Norwegian University of Science and Technology.

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: …

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

Article References: Adaptive network switching algorithm for sensor data transfer: a simulation framework integrating GSM, Wi-Fi, and LoRa networks. (n.d.). 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

In a paper published in Cluster Computing, Jasmine Kaur, Inderveer Chana and Anju Bala introduce an enhanced version of a serverless simulation framework that adds a virtual machine layer between physical servers and the containers that actually run user code. On top of that more realistic architecture, they bolt on a multi-agent reinforcement learning technique known as proximal policy optimization, or PPO, to decide where workloads should go. The results are striking: cold start latency drops by up to 29 percent, the number of active physical machines falls by as much as 66 percent, and energy consumption shrinks by up to 23 percent. For an industry under mounting pressure to curb the enormous electricity appetite of data centers, those numbers carry real weight.

To understand why the virtual machine layer matters, it helps to look at how serverless platforms are actually built. In principle, containers, lightweight packages of software that share the host operating system’s kernel, could run directly on physical machines. That is precisely how ServlessSimPro, the earlier simulation platform on which the new work builds, modeled the world. But in production deployments at major cloud providers and in popular open-source platforms such as Knative and OpenFaaS, containers are almost always nested inside virtual machines. The VM adds an extra boundary of isolation and security, but it also introduces an additional layer of resource management, with its own scheduling decisions, consolidation opportunities and performance overheads.

By ignoring that layer, earlier simulators produced results that diverged from what operators actually observe. A scheduling algorithm that looks brilliant in a flat, container-on-metal simulation may behave very differently when it must first choose a virtual machine, and only then a container within it. The enhanced framework bridges this architectural gap, giving researchers a testbed whose resource abstractions mirror the deployment models used in the real world. That matters because simulation is where most scheduling research lives: few academic groups can run experiments on hyperscale infrastructure, so the fidelity of the simulator effectively determines how transferable their ideas are.

The second half of the contribution is the scheduling brain itself. Rather than a single centralized controller making every placement decision, the researchers deploy multiple reinforcement learning agents, each powered by proximal policy optimization, working in parallel across the simulated cluster. PPO is a policy-gradient method that has become a favorite of the reinforcement learning community because it makes steady, clipped updates to its decision policy, avoiding the catastrophic performance collapses that can plague more aggressive learning algorithms. Each agent is responsible for a slice of the scheduling problem: deciding where containers should be placed, when virtual machines should be consolidated onto fewer physical hosts, and how incoming workloads should be distributed across the fleet.

Decentralization is not just an aesthetic choice. In a large data center, a single scheduler becomes a bottleneck and a single point of failure, and the state of the system grows so large that no one agent can see everything at once. Multi-agent architectures let decisions happen closer to the resources they affect, and the multi-agent formulation of PPO, often abbreviated MAPPO, allows the agents to learn coordinated behavior despite their partial views. The approach builds on the authors’ earlier work on multi-agent deep Q-learning for serverless job scheduling, but PPO’s more stable training dynamics make it better suited to the high-dimensional, continuous decisions involved in juggling containers, VMs and workloads simultaneously.

The headline metric, cold start latency, deserves particular attention because it is the Achilles’ heel of serverless computing. When a function is invoked and no warm instance exists, the platform must provision a container from scratch, an operation that can add hundreds of milliseconds or more to response time. For latency-sensitive applications, from interactive web services to real-time data pipelines, those milliseconds are the difference between a seamless experience and a visibly sluggish one. By learning placement and consolidation policies that keep likely-to-be-needed functions warm and co-located with available capacity, the MAPPO-driven scheduler cuts cold starts by nearly a third in the reported experiments.

The efficiency gains are equally significant. Consolidating workloads so that up to 66 percent fewer physical machines need to stay active is a dramatic reduction, and it cascades directly into the 23 percent cut in energy consumption. Data centers are among the fastest-growing consumers of electricity worldwide, and idle servers draw substantial power even when they process nothing. Any technique that lets operators switch off more of the fleet, without degrading the responsiveness users feel, translates into both lower costs and lower carbon emissions. The fact that the framework achieves these savings while simultaneously improving latency suggests the agents are finding genuinely smarter trade-offs, not merely shifting costs from one column to another.

The study also situates itself within a rapidly maturing ecosystem of simulation tools. Open-source options such as FaasSim, FaaS-Sim and SimFaaS have given researchers starting points for modeling function-as-a-service platforms, and commercial offerings from AWS, Microsoft Azure, Google Cloud and IBM have defined the de facto behavior the simulators try to capture. What has been scarce, the authors argue, is a comprehensive platform that combines realistic multi-layer resource modeling with the ability to train and evaluate learning-based schedulers. By pairing the VM-aware architecture with MAPPO, the framework becomes both a measurement instrument and a training ground, letting researchers prototype scheduling policies that can be benchmarked consistently before any real-world trial.

The broader significance of the work lies in the convergence of two trends: the industrial consolidation around serverless architectures and the rapid advance of multi-agent reinforcement learning as a practical tool for systems management. As edge computing, Kubernetes-based orchestration and energy-aware provisioning continue to reshape how cloud infrastructure is organized, the ability to simulate those systems faithfully, and to let learning agents discover scheduling policies that human engineers might never hand-design, could define the next generation of cloud efficiency. The Thapar Institute team’s framework offers the research community a way to explore that future at scale, on a laptop rather than a data center, and with an architectural honesty that earlier tools lacked. If the reported gains hold when such policies migrate from simulation to production clusters, the invisible machinery of the cloud may soon be run by algorithms that learned their craft in a simulator, one carefully modeled virtual machine at a time.

Subject of Research: VM-aware serverless simulation and multi-agent reinforcement learning for cloud job scheduling

Article Title: VM-aware serverless simulation framework with multi-agent proximal policy optimization for scalable and efficient job scheduling

Article References: Kaur, J., Chana, I., & Bala, A. (2026). VM-aware serverless simulation framework with multi-agent proximal policy optimization for scalable and efficient job scheduling. Cluster Computing, 29(13), Article 758. https://doi.org/10.1007/s10586-026-06585-w

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06585-w

Keywords: serverless computing, simulation framework, virtual machines, multi-agent reinforcement learning, proximal policy optimization, job scheduling, cold start latency, energy efficiency, cloud computing, resource utilization, container orchestration, data centers

The research, led by Arezo Bodaghi of Concordia University together with Benjamin C. M. Fung of McGill University, Jonathan Shahen of the University of Waterloo, and Ketra A. Schmitt of Concordia, was developed in collaboration with an industry partner, the creative technology company Scrawlr. That industrial grounding shaped the framework’s central premise: a moderation model is not simply good or bad, but better or worse suited to a particular platform environment. The authors contend that a classifier scoring highest on a benchmark F1-score may still be the wrong choice once latency, throughput, user attrition, and platform revenue enter the equation.

The problem the researchers set out to solve is well documented. Offline evaluations typically freeze a model’s decisions on a fixed dataset, judging each prediction against a ground-truth label. Real platforms are nothing like that. Comments arrive continuously, at varying rates, from users with different sensitivities to harmful content. A false negative, a missed toxic comment, may drive a victim away from the platform entirely, while a false positive, censoring a benign remark, can alienate users who feel unjustly silenced. Neither outcome is captured by a conventional accuracy metric, yet both translate directly into lost engagement and lost advertising revenue, which for major platforms constitutes the bulk of their income.

Previous work has shown that personal attacks measurably decrease user activity on social networking sites, and that toxic behavior is not uniformly distributed across the internet. Some spaces, such as personal networks among friends and family, see comparatively little abuse. Others, like public forums devoted to contentious topics, can be saturated with hostility. The PDS framework embraces this heterogeneity. It allows operators to configure environments ranging from low-toxicity to high-toxicity settings, adjust user sensitivity thresholds, and tune comment flow rates, so that the same pool of candidate classifiers can be stress-tested against the specific conditions a platform actually faces.

Technically, the framework works by simulating a living social ecosystem. A synthetic user interaction graph of 10,000 users, generated for the study in partnership with Scrawlr, drives a week-long stream of comments and engagement events. Each simulated user posts, reads, reacts, and, crucially, responds to the content they encounter. When a toxicity classifier is plugged into the simulation, its real-time classification decisions ripple through the ecosystem: toxic comments that slip through can depress engagement among sensitive users, while overzealous filtering can suppress legitimate conversation. The framework then aggregates these dynamics into measures of each model’s effectiveness, efficiency, and impact on platform profitability, providing a holistic scorecard that no static benchmark can offer.

The team put eight deep learning classifiers through this gauntlet, spanning the spectrum of modern natural language processing architectures. The lineup included a convolutional neural network (CNN) and a CNN variant built on FastText word embeddings, transformer-based heavyweights BERT and RoBERTa, and their lightweight counterparts such as DistilBERT and smaller BERT miniatures. The models were trained on the publicly available Jigsaw Toxic Comment Classification dataset released by Google Jigsaw, a widely used benchmark corpus of Wikipedia comments labeled for multiple categories of toxicity. This choice ensured that any differences in simulation performance stemmed from deployment behavior rather than from exotic or proprietary training data.

The results dismantle the notion of a single best toxicity detector. In low-toxicity environments, where abusive comments are rare and the moderation system acts mostly as a quiet safety net, high-throughput models proved optimal; the modest accuracy cost of a lighter architecture mattered far less than its speed and low computational overhead. In high-toxicity settings, fast and reasonably accurate models again came out ahead, because the sheer volume of incoming content made it impractical to route every comment through a heavyweight transformer. Strikingly, it was the medium-toxicity environments that rewarded a different strategy: there, moderately accurate models with reasonable efficiency excelled, because the balance between catching harmful content and processing throughput shifted in a way that favored middleweight architectures over both the fastest and the most accurate options.

These findings carry practical weight for platform operators who must make concrete engineering choices. Deploying RoBERTa-scale models on every incoming comment is expensive in both latency and compute, and the study shows that this expense is not always justified. Conversely, in environments with a moderate, persistent level of toxicity, cutting corners on accuracy can allow enough harmful content through that sensitive users disengage, eroding the platform’s community and its bottom line. The profit-driven framing makes these trade-offs explicit and quantifiable: instead of arguing abstractly about the cost of a missed toxic comment, operators can simulate their own comment flow and user base, and see projected engagement and revenue effects for each candidate model before committing to a deployment.

The framework also speaks to a broader methodological shift in machine learning research toward operationally grounded evaluation. Scholars studying toxicity detection have repeatedly warned that classification models generalize poorly across datasets and that context and knowledge are essential to defining and detecting toxicity. By embedding classifiers in a configurable, dynamic simulation, the PDS approach captures interactions between the model and its environment that batch evaluation cannot see, including feedback loops in which moderation decisions shape user behavior, which in turn shapes the content the model must judge. The authors position this as a scalable, practical path toward context-aware model selection, in which the question changes from “which model is most accurate” to “which model serves this platform, these users, and these business realities best.”

Limitations and next steps remain. The synthetic interaction data and operational parameter configurations used in the study cannot be released publicly due to confidentiality agreements and platform authorization requirements, though the underlying toxicity models relied on open Jigsaw data. Future work will likely extend the simulation to more platforms, more languages, and richer user models, and integrate the framework with recent advances in toxicity detection such as reinforcement-learning-based data augmentation. For now, the study delivers a clear and provocative message to the content moderation community: the leaderboard of a benchmark competition is a poor proxy for the demanding, revenue-sensitive, and human-centered reality of moderating a live social platform. Choosing the right toxicity detector, the researchers argue, is not a science of accuracy alone, but an engineering discipline of profit, performance, and people.

Subject of Research: A simulation framework for real-time, profit-driven evaluation of toxicity detection models in social media content moderation.

Article Title: A Profit-Driven Simulation framework for real-time evaluation of toxicity detection models in social media

Article References: Bodaghi, A., Fung, B. C. M., Shahen, J., & Schmitt, K. A. (2026). A Profit-Driven Simulation framework for real-time evaluation of toxicity detection models in social media. International Journal of Data Science and Analytics, 22(1), Article 297. https://doi.org/10.1007/s41060-026-01276-6

Image Credits: AI Generated

DOI: 10.1007/s41060-026-01276-6

Keywords: toxicity detection, content moderation, social media, machine learning, deep learning, BERT, RoBERTa, simulation framework, classifier evaluation, real-time systems, user engagement, platform profitability