ASPG Menu
search

American Scientific Publishing Group

Research Feed

Found 3791 matches for "All Articles"

Fog-Assisted Trust and Anomaly-Aware Scheduling for Wireless Sensor IoT Devices

Wireless sensor Internet of Things (IoT) devices increasingly generate time-sensitive traffic that cannot be efficiently inspected only in a remote cloud. Fog computing reduces the distance between sensing devices and decision logic, but fog nodes must jointly manage latency, queue pressure, wireless channel variability, energy use and security risk. This paper presents FogSense-TSA, a trust-aware and anomaly-aware scheduling model for wireless sensor IoT traffic in fog computing environments. The model integrates traffic intensity, wireless link behaviour, fog-resource state and temporal trust into a local decision process that determines whether a device-window should be accepted, quarantined at the fog layer or escalated to cloud inspection. The empirical analysis is conducted using a reduced analysis-ready file aligned with a recent public IoT device-identification and anomaly-detection setting. The proposed formulation introduces three algorithmic components: online trust-risk scheduling, load-aware fog placement and adaptive threshold calibration. Mathematical analysis is provided for evidence aggregation, trust stability, latency decomposition, energy cost, constrained placement and computational complexity. The results show that fog placement substantially reduces service latency relative to cloud-only routing while preserving high anomaly-discrimination capability. The strongest predictors are trust score, flow intensity, jitter, fog CPU load, payload entropy and queue pressure, indicating that fog-layer security should be coupled with wireless access and resource conditions rather than treated as a separate classifier. The study provides a reproducible and interpretable basis for designing lightweight security and scheduling modules for wireless sensor IoT deployments.

groups
Arash Salehpour mail -
Tamara Zhukabayeva mail
link https://doi.org/10.54216/IJWAC.100202

Volume & Issue

Vol. Volume 10 / Iss. Issue 2

Details open_in_new

Tiny Intelligence in Fog-Assisted Wireless Sensor IoT Networks: A Review of Deployment Patterns, Resource Trade-offs, and Open Challenges

Wireless sensor IoT networks are moving from simple measurement pipelines toward distributed systems where sensing, interpretation, filtering, and coordination are divided across devices, fog nodes, and cloud services. This review examines that transition through the lens of tiny intelligence, with special attention to how small models, local event filters, federated updates, service placement, and privacy controls reshape fog-assisted wireless sensor deployments. The paper does not treat fog computing as a generic latency layer. Instead, it studies fog as a governance and orchestration layer that decides which data should stay at the device, which events should be aggregated nearby, and which models require cloud-level supervision. A structured comparison of prior studies is provided across architecture, TinyML, federated learning, placement, security, benchmarking, and lifecycle coverage. The synthesis shows that the literature has matured in modelling fog resources and building lightweight inference functions, but remains fragmented in lifecycle management, cross-layer wireless awareness, privacy accounting, and reproducible evaluation. The review concludes with a research agenda for sensor-to-fog intelligence pipelines that are adaptive, auditable, energy-aware, and suitable for long-lived cyber-physical deployments.

groups
Aygul Z. Ibatova mail -
Baumuratova Dilaram mail
link https://doi.org/10.54216/IJWAC.100203

Volume & Issue

Vol. Volume 10 / Iss. Issue 2

Details open_in_new

A Deep Reinforcement Learning Framework with Solar Energy Forecasting for Adaptive Routing and Lifetime Extension in Energy-Harvesting Wireless Sensor Networks

Battery-powered sensor nodes expire when their energy reserves are depleted, terminating data collection regardless of the physical integrity of the hardware. Solar harvesting offers a viable path to perpetual operation, but only when the routing layer can continuously track the time-varying energy state of every node and steer traffic away from nodes likely to be power-starved in the near future. Classical clustering and chain-based protocols select forwarding paths without regard to harvested energy, leading to premature node death even when sufficient solar income would have been available to sustain operation. This paper presents a deep reinforcement learning framework in which each sensor node operates an independent Deep Q-Network agent that adapts its next-hop forwarding decision based on local battery state, short-horizon solar energy forecasts, link quality estimates, and the residual energy levels of candidate neighbours. A lightweight LSTM sub-model provides the solar prediction horizon that the agent uses as part of its state representation, enabling it to distinguish nodes that are temporarily depleted but will recover from those whose batteries are trending toward permanent failure. Extensive simulation across a 100-node deployment over 3,000 operational rounds confirms that the proposed approach substantially extends network lifetime, improves packet delivery, and reduces wasted harvested energy compared with five competitive baselines. Reward function ablation, scalability experiments, and an energy neutrality verification further validate the design choices and confirm stability across a wide range of deployment conditions.

groups
Suhasini Monga mail -
Damandeep Kaur mail
link https://doi.org/10.54216/IJWAC.100204

Volume & Issue

Vol. Volume 10 / Iss. Issue 2

Details open_in_new

Frequency-Aware Antenna Configuration for Reliable Wi-Fi Communication Networks

Dense Wi-Fi deployments are often tuned by changing channel width or adding access points, while the joint effect of antenna gain, operating frequency, wall loss, and network interference receives less systematic attention. This paper presents a frequency-aware antenna configuration model for Wi-Fi communication networks operating in the 2.4, 5, and 6 GHz bands. The model combines an indoor link budget, antenna-pattern classes, bandwidth dependent noise, an airtime-overlap penalty, and a coverage-assurance score that balances signal quality, throughput, latency, and packet error. A reproducible design-space table is generated from a validated Wi-Fi engineering model and analyzed across five deployment scenarios, three antenna families, four channel widths, and multiple client distances. The results show that higher frequency bands improve short-range capacity but deteriorate faster under distance and wall loss, while directional antenna gain can recover a substantial part of the lost link margin. The paper provides planning rules for selecting antenna type, frequency band, and channel width according to coverage, capacity, and interference risk. The work is intended for Wi-Fi network designers who need interpretable engineering evidence rather than a black-box prediction model.

groups
Mohammed. I. Alghamdi mail -
Abdul Rahaman Wahab Sait mail
link https://doi.org/10.54216/IJWAC.100205

Volume & Issue

Vol. Volume 10 / Iss. Issue 2

Details open_in_new

Pareto-Based Joint Optimization of Node Activity and Communication in Dense IoT Sensor Networks

Dense IoT sensor networks face a fundamental trade-off between energy efficiency, communication delay, and packet delivery reliability. As network density increases, controlling node activity and communication behavior becomes increasingly important because energy-saving decisions can affect forwarding availability and communication performance. This study presents a Pareto-based framework for jointly optimizing node activity and communication decisions in dense IoT sensor networks. The proposed formulation considers total energy consumption, average end-to-end delay, and packet delivery reliability as competing objectives, with NSGA-II employed as the multi-objective optimization engine. The study evaluates three network densities comprising 50, 100, and 200 nodes. For each density, a selected Pareto configuration is independently validated using five random seeds and 1000 simulation rounds per seed. The validated configurations consume 8.6090 J, 28.1479 J, and 70.6780 J of mean energy for 50, 100, and 200 nodes, respectively, while the corresponding mean delays are 0.08458 s, 0.13441 s, and 0.19901 s. The mean PDR values are 36.4393%, 46.6317%, and 42.5616%, respectively. The results show that increasing network density leads to substantially higher energy consumption and delay, while packet delivery reliability does not improve monotonically. The findings demonstrate that joint activity and communication control provides distinct Pareto operating points and that multi-seed validation is important for assessing their stability under stochastic network conditions. The study provides a transparent density-wise analysis of the energy–delay–reliability trade-off in dense IoT sensor networks.

groups
Upendra Kumar Singh mail -
Monika Nanda mail
link https://doi.org/10.54216/IJWAC.110101

Volume & Issue

Vol. Volume 11 / Iss. Issue 1

Details open_in_new

Ground Truth-Oriented Fake News Detection Using Sentiment-Aware Hybrid Ensemble Learning and Bi-Directional LSTM Networks

Fake news is the spreading of misinformation or disinformation. The proliferation of fake news on social media makes it difficult for one to procure reliable information online. Our motive is for information to be freely and widely available to all, while maintaining the integrity of said information. Ground truth refers to the actual reality or a baseline truth. Existing research focuses on the importance of deciphering the ground truth value and into a feature-oriented approach [1]. This paper contributes to the existing body of literature by meticulously selecting features and leveraging emotional cues through natural language processing (NLP), to address the issue of fake news detection. This is done by availing of the Truth Seeker [2] and Liar [3] datasets. The models used are an ensemble model which is a combination of Naive Bayes, passive aggressive classifier with a layer of deep neural network and Bi-directional LSTM (Long Short-Term Memory) networks with sentiment analysis. Our findings suggest that sentiment analysis can serve as a valuable tool for enhancing the detection of fake news.

groups
Alcardo Alex Barakabitze mail
link https://doi.org/10.54216/IJWAC.110102

Volume & Issue

Vol. Volume 11 / Iss. Issue 1

Details open_in_new

Rank Fingerprints and Discounted Absence for Wi-Fi Positioning Across Devices and Access-Point Outages: Four Hypotheses Tested on a Multi-Building Dataset

Wi-Fi fingerprinting is usually scored on the phones that built the radio map and with every access point alive. We state four hypotheses about what happens otherwise and test them on a public multi-building dataset, holding out one phone at a time and then scoring a campaign recorded months later. A nearest-neighbour locator is run on five fingerprint representations; a distance that discounts access points present in the map but absent from the query is introduced; and three ways of attaching an error radius to each fix are compared. Holding out a phone multiplies the mean error by more than four, most of it owed to unseen locations, while the loss in floor identification is owed mainly to the device. A rank-based fingerprint improves floor identification for twelve of sixteen phones and lowers the later-campaign error by a fifth, at a price when the phone is known. Offset correction does not help. Discounting absence keeps the error within a quarter of its clean value when three access points in ten are silent, where the standard distance more than doubles it. Neighbour spread alone is a poor guide to the error; a four-cue quantile model is better.

groups
Amine Saddik mail -
Ika Hesti Agustin mail
link https://doi.org/10.54216/IJWAC.110105

Volume & Issue

Vol. Volume 11 / Iss. Issue 1

Details open_in_new

Dwell Time and Fallback of 5G New Radio Connections on the Road: A Survival Analysis of Device-Side Traces with Early Warning

A phone that shows a 5G icon in a moving car does not keep it for long, and how long it keeps it has rarely been measured as a duration. This paper treats every stretch of New Radio service in public device-side traces from a commercial network as a survival-time observation, with trace ends handled as censoring. Kaplan–Meier curves, five parametric families, a Cox model and a discrete-time hazard regression describe the dwell time; logistic and gradient-boosted classifiers, validated with whole traces held out, then try to announce a fallback ten seconds ahead. On the road the median dwell is 34 s, against more than an hour and a half when the phone is still. A two-component exponential mixture fits best: a fresh connection is about eighteen times more likely to drop in the next second than one that has lasted a minute. Signal level, speed and recent instability move the hazard; the neighbour-cell gap does not. At an alarm duty of 10% the boosted model warns of 83% of fallbacks, and a map of earlier fallbacks improves it further, since they recur at the same places. Mean download rate halves across a fallback while the median barely moves.

groups
Lobna Osman mail
link https://doi.org/10.54216/IJWAC.110103

Volume & Issue

Vol. Volume 11 / Iss. Issue 1

Details open_in_new

Freshness–Transmission Trade-offs in Wireless Ad Hoc Communication: An Analysis of Age-Threshold Random Access

Wireless ad hoc monitoring requires access rules that keep received information fresh without excessive contention. Age-threshold random access suppresses recently successful transmitters, but its performance depends on the transmission probability used after the silent interval. This study examines that dependence through renewal analysis and 1,280 reproducible simulation runs covering network size, independent erasures, correlated outages, and unequal link quality. Twenty independent replications are used per configuration. Exact slotted ALOHA and round-robin expressions provide implementation checks; a decoupling approximation links age, throughput, and transmission attempts for threshold access. At 50 peers and an independent erasure probability of 0.2, a silent interval of 50 slots with access probability 0.04 lowers mean age from 168.59 to 140.02 slots, while increasing attempts from 1.00 to 1.45 per slot. A longer silent interval of 100 slots combined with probability 0.08 raises mean age to 398.94 slots. Reducing that probability to 0.04 instead produces 101.46 slots and 0.84 attempts per slot. The results locate a collision-driven reversal that disappears from comparisons reporting only a preferred configuration. Correlated outages and link heterogeneity further show why mean age, deadline violations, and fairness require separate evaluation. The findings support joint threshold–probability selection within an explicit transmission budget. They apply to a synchronized, single collision domain with ideal acknowledgments; spatial reuse and multi-hop forwarding require further analysis.

groups
Wadhah Ahmed Muthanna Abdullah mail
link https://doi.org/10.54216/IJWAC.110104

Volume & Issue

Vol. Volume 11 / Iss. Issue 1

Details open_in_new

WS-STACK: A Weighted Stacking Ensemble with Multi-Criteria Feature Selection for Multi-Class Traffic Classification and Anomaly Detection in Heterogeneous Wireless Sensor Networks

Heterogeneous Internet-of-Things deployments expose wireless sensor networks to a diverse and continuously evolving threat landscape encompassing distributed denial-of-service flooding, network reconnaissance scanning, and brute-force credential attacks. Existing intrusion detection approaches predominantly adopt single-classifier architectures and binary labelling, which are ill-suited to the multi-class, class-imbalanced traffic characteristic of real-world IoT sensor deployments. This paper proposes WS-STACK, a Weighted Stacking ensemble that combines five heterogeneous base learners—Random Forest, XGBoost, Support Vector Machine, K-Nearest Neighbours, and Gradient Boosting—under an ℓ2-regularised Logistic Regression meta-learner trained on cross validationgenerated probability features. A three-stage feature engineering pipeline comprising mutual information filtering, variance inflation factor pruning, and correlation-based elimination reduces the 83 dimensional RT-IoT2022 feature space to 20 informative features, and the Synthetic Minority Over-Sampling Technique corrects the six-fold class imbalance prior to training. Evaluated on 83,000 labelled network flow records from the publicly available RTIoT2022 benchmark spanning four benign traffic patterns and seven attack categories, WS-STACK achieves 99.61% classification accuracy, a weighted F1-score of 0.9960, and an AUC-ROC of 0.9978, outperforming every individual base classifier and five recently published state-of-the-art baselines. The false positive rate is reduced to 0.0006, and ten-fold cross-validation confirms μacc = 0.9959 (σ = 0.0004). Ablation experiments identify SMOTE as the single most critical preprocessing component, and noise robustness tests confirm 98.81% accuracy under 20% Gaussian feature perturbation. The framework is grounded through a formal variance-reduction proof and a channel-energy anomaly model that establishes the physical motivation for packet-rate features as the dominant intrusion detection signal in constrained wireless sensor networks.

groups
Zainab Hussein Arif mail -
Nureize bt Arbaiy mail
link https://doi.org/10.54216/IJWAC.100206

Volume & Issue

Vol. Volume 10 / Iss. Issue 2

Details open_in_new