IARMTS: Design of an Interference-Aware Routing Model with Time Synchronization Capabilities for Dense Wireless Sensor Network Deployments

Abstract

Performance of dense wireless sensor networks is often degraded due to communication interference and time synchronization issues. Existing machine learning & deep learning models that propose bioinspired & pre-emptive packet-analysis solutions for these tasks either have high complexity, or high deployment costs. Moreover, these models cannot be scaled for heterogeneous node & traffic types, which limits their applicability when applied to real-time scenarios. To overcome these issues, this text proposes design of an interference-aware routing model with time synchronization capabilities for dense wireless sensor network deployments. The network initially collects temporal clock states & packet delivery performance of different nodes on heterogeneous traffic scenarios. These traffic patterns are converted into frequency, entropy, Gabor, and Wavelet components. The converted components are used to train an ensemble set of Naïve Bayes (NB), k Nearest Neighbour (kNN), Multilayer Perceptron (MLP), and Support Vector Machine (SVM) classifiers. These classifiers assist in identification of optimal clock deviations and set of routing paths. These routing paths are further fine-tuned via use of a Bacterial Foraging Optimization (BFO) Model, which assists in identification of interference-aware paths. The BFO Model uses a temporal fitness function that fuses throughput, communication delay, energy levels, and packet delivery performance for different set of contextual communications. Due to which, the model is able to showcase lower end-to-end delay, higher throughput, lower energy consumption, and higher packet delivery performance when compared with existing routing methods under high density nodes & heterogeneous network scenarios. The model showcases 99% PDR, 18.3% lower delay, 19.5% higher energy efficiency and 10.4% lower delay levels when compared with existing methods.