ASPG Menu
search

American Scientific Publishing Group

verified Journal

International Journal of Wireless and Ad Hoc Communication

ISSN
Online: 2692-4056
Frequency

Continuous publication

Publication Model

Open access · Articles freely available online · No author fees or charges

International Journal of Wireless and Ad Hoc Communication

Volume 11 / Issue 1 ( 5 Articles)

Full Length Article DOI: https://doi.org/10.54216/IJWAC.110105

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.
Amine Saddik, Ika Hesti Agustin
visibility 44
download 19
Full Length Article DOI: https://doi.org/10.54216/IJWAC.110104

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.
Wadhah Ahmed Muthanna Abdullah
visibility 66
download 44
Full Length Article DOI: https://doi.org/10.54216/IJWAC.110103

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.
Lobna Osman
visibility 42
download 37
Full Length Article DOI: https://doi.org/10.54216/IJWAC.110102

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.
Alcardo Alex Barakabitze
visibility 74
download 38
Full Length Article DOI: https://doi.org/10.54216/IJWAC.110101

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.
Upendra Kumar Singh, Monika Nanda
visibility 56
download 40