RESUMO
The goal of this paper's novel energy-conscious routing method is to optimize energy usage and extend network lifespans using a new clustering probability. Versatile arrangements and a longer network lifespan (until the last node dies) are achieved through cluster-based routing strategies. Existing algorithms, such as low energy adaptive clustering hierarchy (LEACH), residual energy LEACH (RES-EL), and distributed residual energy LEACH (DIS-RES-EL), have been compared to the newly proposed algorithms: improved residual energy LEACH (IMP-RES-EL) and energy efficient LEACH (EEL). IMP-RES-EL and EEL outperform all other stated algorithms by extending the network lifespan, enhancing stability, increasing the number of aggregated data packets transmitted from cluster heads to the base station (BS), and selecting cluster heads with energy efficiency and optimal routing within the network. The proposed approaches outperform existing algorithms, particularly when every corner-located BS is considered in the wireless sensor network (WSN). The network lifespan in rounds increased by 36 %, the number of aggregated data packets from cluster heads to the BS increased by 44 %, and the efficiency of corner-located BSs improved by 20 %. Extensive simulations on five distinct topologies were reviewed and compared to the three techniques listed above, demonstrating the superiority of the proposed algorithms.
RESUMO
This paper presents an energy-efficient and high-accuracy sampling synchronization approach for real-time synchronous data acquisition in wireless sensor networks (saWSNs). A proprietary protocol based on time-division multiple access (TDMA) and deep energy-efficient coding in sensor firmware is proposed. A real saWSN model based on 2.4 GHz nRF52832 system-on-chip (SoC) sensors was designed and experimentally tested. The obtained results confirmed significant improvements in data synchronization accuracy (even by several times) and power consumption (even by a hundred times) compared to other recently reported studies. The results demonstrated a sampling synchronization accuracy of 0.8 µs and ultra-low power consumption of 15 µW per 1 kb/s throughput for data. The protocol was well designed, stable, and importantly, lightweight. The complexity and computational performance of the proposed scheme were small. The CPU load for the proposed solution was <2% for a sampling event handler below 200 Hz. Furthermore, the transmission reliability was high with a packet error rate (PER) not exceeding 0.18% for TXPWR ≥ -4 dBm and 0.03% for TXPWR ≥ 3 dBm. The efficiency of the proposed protocol was compared with other solutions presented in the manuscript. While the number of new proposals is large, the technical advantage of our solution is significant.
RESUMO
The transmission environment of underwater wireless sensor networks is open, and important transmission data can be easily intercepted, interfered with, and tampered with by malicious nodes. Malicious nodes can be mixed in the network and are difficult to distinguish, especially in time-varying underwater environments. To address this issue, this article proposes a GAN-based trusted routing algorithm (GTR). GTR defines the trust feature attributes and trust evaluation matrix of underwater network nodes, constructs the trust evaluation model based on a generative adversarial network (GAN), and achieves malicious node detection by establishing a trust feature profile of a trusted node, which improves the detection performance for malicious nodes in underwater networks under unlabeled and imbalanced training data conditions. GTR combines the trust evaluation algorithm with the adaptive routing algorithm based on Q-Learning to provide an optimal trusted data forwarding route for underwater network applications, improving the security, reliability, and efficiency of data forwarding in underwater networks. GTR relies on the trust feature profile of trusted nodes to distinguish malicious nodes and can adaptively select the forwarding route based on the status of trusted candidate next-hop nodes, which enables GTR to better cope with the changing underwater transmission environment and more accurately detect malicious nodes, especially unknown malicious node intrusions, compared to baseline algorithms. Simulation experiments showed that, compared to baseline algorithms, GTR can provide a better malicious node detection performance and data forwarding performance. Under the condition of 15% malicious nodes and 10% unknown malicious nodes mixed in, the detection rate of malicious nodes by the underwater network configured with GTR increased by 5.4%, the error detection rate decreased by 36.4%, the packet delivery rate increased by 11.0%, the energy tax decreased by 11.4%, and the network throughput increased by 20.4%.
RESUMO
Clustering and routing protocols play a pivotal role in reducing energy consumption and extending the lifespan of wireless sensor networks. However, optimizing energy efficiency to maximize network longevity remains a primary challenge for these protocols. This paper introduces QPSOFL, a clustering and routing protocol that integrates quantum particle swarm optimization and a fuzzy logic system to enhance energy efficiency and prolong network lifespan. QPSOFL employs an enhanced quantum particle swarm optimization algorithm to select optimal cluster heads, utilizing Sobol sequences for population diversification during initialization. Additionally, it incorporates Lévy flight and Gaussian perturbation-based position updates to prevent trapping in local optima. Benchmark experiments validate QPSOFL's efficacy compared to Harris Hawks Optimization (HHO), Grey Wolf Optimization (GWO), Particle Swarm Optimization (PSO), and Quantum Particle Swarm Optimization (QPSO), focusing on accuracy, search capability, and convergence speed. Within QPSOFL, a fuzzy logic system determines the best next-hop cluster head based on descriptors such as residual energy, energy deviation, and relay distance. Extensive simulations compare QPSOFL's performance in terms of network lifetime, throughput, energy consumption, and scalability against existing protocols E-FUCA, IHHO-F, F-GWO, and FLPSOC, demonstrating its superior performance over these counterparts.
RESUMO
Wireless sensor networks (WSNs) have wide applications in healthcare, environmental monitoring, and target tracking, relying on sensor nodes that are joined cooperatively. The research investigates localization algorithms for both target and node in WSNs to enhance accuracy. An innovative localization algorithm characterized as an asynchronous time-of-arrival (TOA) target is proposed by implementing a differential evolution algorithm. Unlike available approaches, the proposed algorithm employs the least squares criterion to represent signal-sending time as a function of the target position. The target node's coordinates are estimated by utilizing a differential evolution algorithm with reverse learning and adaptive redirection. A hybrid received signal strength (RSS)-TOA target localization algorithm is introduced, addressing the challenge of unknown transmission parameters. This algorithm simultaneously estimates transmitted power, path loss index, and target position by employing the RSS and TOA measurements. These proposed algorithms improve the accuracy and efficiency of wireless sensor localization, boosting performance in various WSN applications.
RESUMO
IoT-wireless sensor networks (WSN) have extensive applications in diverse fields such as battlegrounds, commercial sectors, habitat monitoring, buildings, smart homes, and traffic surveillance. WSNs are susceptible to various types of attacks, such as malicious attacks, false data injection attacks, traffic attacks, and HTTP flood attacks. CONNECT attack is a novel attack in WSN. CONNECT attack plays a crucial role through disrupting packet transmission and node connections and significantly impacts CPU performance. Detecting and preventing CONNECT attacks is imperative for enhancing WSN efficiency. During a CONNECT attack, nodes fail to respond to legitimate requests, resulting in connectivity delays, acknowledgment delays, and packet drop attacks in IoT-WSN nodes. This article introduces an Intrusion Detection Algorithm based on the Cyclic Analysis Method (CAM), which incorporates a forward selection approach and backward elimination method. CAM analyzes routing information and behavior within the WSN, facilitating the identification of malicious paths and nodes. The proposed approach aims to pinpoint and mitigate the risks associated with CONNECT attacks, emphasizing the identification of malevolent pathways and nodes while establishing multiple disjoint loop-free routes for seamless data delivery in the IoT-WSN. Furthermore, the performance of CAM is assessed based on metrics such as malicious node detection accuracy, connectivity, packet loss, and network traffic. Simulation results using Matlab software demonstrate superior accuracy in malicious node detection, achieving accuracy in attack detection of approximately 99%, surpassing traditional algorithms accuracy of attack detection.
RESUMO
The main limitation of wireless sensor networks (WSNs) lies in their reliance on battery power. Therefore, the primary focus of the current research is to determine how to transmit data in a rational and efficient way while simultaneously extending the network's lifespan. In this paper, a hybrid of a fuzzy logic system and a quantum annealing algorithm-based clustering and routing protocol (FQA) is proposed to improve the stability of the network and minimize energy consumption. The protocol uses a fuzzy inference system (FIS) to select appropriate cluster heads (CHs). In the routing phase, we used the quantum annealing algorithm to select the optimal route from the CHs and the base station (BS). Furthermore, we defined an energy threshold to filter candidate CHs in order to save computation time. Unlike with periodic clustering, we adopted an on-demand re-clustering mechanism to perform global maintenance of the network, thereby effectively reducing the computation and overhead. The FQA was compared with FRNSEER, BOA-ACO, OAFS-IMFO, and FC-RBAT in different scenarios from the perspective of energy consumption, alive nodes, network lifetime, and throughput. According to the simulation results, the FQA outperformed all the other methods in all scenarios.
RESUMO
Underwater wireless sensor networks are gaining popularity since supporting a broad range of applications, both military and civilian. Wireless acoustics is the most widespread technology adopted in underwater networks, the realization of which must face several challenges induced by channel propagation like signal attenuation, multipath and latency. In order to address such issues, the attention of researchers has recently focused on the concept of cooperative communication and networking, borrowed from terrestrial systems and to be conveniently recast in the underwater scenario. In this paper, we present a comprehensive literature review about cooperative underwater wireless sensor networks, investigating how nodes cooperation can be exploited at the different levels of the network protocol stack. Specifically, we review the diversity techniques employable at the physical layer, error and medium access control link layer protocols, and routing strategies defined at the network layer. We also provide numerical results and performance comparisons among the most widespread approaches. Finally, we present the current and future trends in cooperative underwater networks, considering the use of machine learning algorithms to efficiently manage the different aspects of nodes cooperation.
RESUMO
Aiming at the problem that traditional wireless sensor networks produce errors in the positioning and tracking of motorised targets due to noise interference, this paper proposes a motorised target tracking method with a convolutional bi-directional long and short-term memory neural network and extended Kalman filtering, which is trained by using the simulated RSSI value and the actual target value of motorised targets collected from the convolutional bi-directional neural network to the sensor anchor node, so as to obtain a more accurate initial value of the manoeuvre target, and at the same time, the extended Kalman filtering method is used to accurately locate and track the real-time target, so as to obtain the accurate positioning and tracking information of the real-time target. Through experimental simulation, it can be seen that the algorithm proposed in this paper has good tracking effect in both linear manoeuvre target tracking scenarios and non-linear manoeuvre target tracking scenarios.
RESUMO
Due to the uniqueness of the underwater environment, traditional data aggregation schemes face many challenges. Most existing data aggregation solutions do not fully consider node trustworthiness, which may result in the inclusion of falsified data sent by malicious nodes during the aggregation process, thereby affecting the accuracy of the aggregated results. Additionally, because of the dynamically changing nature of the underwater environment, current solutions often lack sufficient flexibility to handle situations such as node movement and network topology changes, significantly impacting the stability and reliability of data transmission. To address the aforementioned issues, this paper proposes a secure data aggregation algorithm based on a trust mechanism. By dynamically adjusting the number and size of node slices based on node trust values and transmission distances, the proposed algorithm effectively reduces network communication overhead and improves the accuracy of data aggregation. Due to the variability in the number of node slices, even if attackers intercept some slices, it is difficult for them to reconstruct the complete data, thereby ensuring data security.
RESUMO
Mobile robots play an important role in the industrial Internet of Things (IIoT); they need effective mutual communication between the cloud and themselves when they move in a factory. By using the sensor nodes existing in the IIoT environment as relays, mobile robots and the cloud can communicate through multiple hops. However, the mobility and delay sensitivity of mobile robots bring new challenges. In this paper, we propose a dynamic cooperative transmission algorithm with mutual information accumulation to cope with these two challenges. By using rateless coding, nodes can reduce the delay caused by retransmission under poor channel conditions. With the help of mutual information accumulation, nodes can accumulate information faster and reduce delay. We propose a two-step dynamic algorithm, which can obtain the current routing path with low time complexity. The simulation results show that our algorithm is better than the existing heuristic algorithm in terms of delay.
RESUMO
Intrusion detection systems (IDSs) in wireless sensor networks (WSNs) rely heavily on effective feature selection (FS) for enhanced efficacy. This study proposes a novel approach called Genetic Sacrificial Whale Optimization (GSWO) to address the limitations of conventional methods. GSWO combines a genetic algorithm (GA) and whale optimization algorithms (WOA) modified by applying a new three-population division strategy with a proposed conditional inherited choice (CIC) to overcome premature convergence in WOA. The proposed approach achieves a balance between exploration and exploitation and enhances global search abilities. Additionally, the CatBoost model is employed for classification, effectively handling categorical data with complex patterns. A new technique for fine-tuning CatBoost's hyperparameters is introduced, using effective quantization and the GSWO strategy. Extensive experimentation on various datasets demonstrates the superiority of GSWO-CatBoost, achieving higher accuracy rates on the WSN-DS, WSNBFSF, NSL-KDD, and CICIDS2017 datasets than the existing approaches. The comprehensive evaluations highlight the real-time applicability and accuracy of the proposed method across diverse data sources, including specialized WSN datasets and established benchmarks. Specifically, our GSWO-CatBoost method has an inference time nearly 100 times faster than deep learning methods while achieving high accuracy rates of 99.65%, 99.99%, 99.76%, and 99.74% for WSN-DS, WSNBFSF, NSL-KDD, and CICIDS2017, respectively.
RESUMO
The Internet of Things (IoT) is a growing network of interconnected devices used in transportation, finance, public services, healthcare, smart cities, surveillance, and agriculture. IoT devices are increasingly integrated into mobile assets like trains, cars, and airplanes. Among the IoT components, wearable sensors are expected to reach three billion by 2050, becoming more common in smart environments like buildings, campuses, and healthcare facilities. A notable IoT application is the smart campus for educational purposes. Timely notifications are essential in critical scenarios. IoT devices gather and relay important information in real time to individuals with special needs via mobile applications and connected devices, aiding health-monitoring and decision-making. Ensuring IoT connectivity with end users requires long-range communication, low power consumption, and cost-effectiveness. The LPWAN is a promising technology for meeting these needs, offering a low cost, long range, and minimal power use. Despite their potential, mobile IoT and LPWANs in healthcare, especially for emergency response systems, have not received adequate research attention. Our study evaluated an LPWAN-based emergency response system for visually impaired individuals on the Hazara University campus in Mansehra, Pakistan. Experiments showed that the LPWAN technology is reliable, with 98% reliability, and suitable for implementing emergency response systems in smart campus environments.
Assuntos
Internet das Coisas , Humanos , Aplicativos Móveis , Tecnologia sem FioRESUMO
In the domain of the Internet of Things (IoT), Optical Camera Communication (OCC) has garnered significant attention. This wireless technology employs solid-state lamps as transmitters and image sensors as receivers, offering a promising avenue for reducing energy costs and simplifying electronics. Moreover, image sensors are prevalent in various applications today, enabling dual functionality: recording and communication. However, a challenge arises when optical transmitters are not in close proximity to the camera, leading to sub-pixel projections on the image sensor and introducing strong channel dependence. Previous approaches, such as modifying camera optics or adjusting image sensor parameters, not only limited the camera's utility for purposes beyond communication but also made it challenging to accommodate multiple transmitters. In this paper, a novel sub-pixel optical transmitter discovery algorithm that overcomes these limitations is presented. This algorithm enables the use of OCC in scenarios with static transmitters and receivers without the need for camera modifications. This allows increasing the number of transmitters in a given scenario and alleviates the proximity and size limitations of the transmitters. Implemented in Python with multiprocessing programming schemes for efficiency, the algorithm achieved a 100% detection rate in nighttime scenarios, while there was a 89% detection rate indoors and a 72% rate outdoors during daylight. Detection rates were strongly influenced by varying transmitter types and lighting conditions. False positives remained minimal, and processing times were consistently under 1 s. With these results, the algorithm is considered suitable for export as a web service or as an intermediary component for data conversion into other network technologies.
RESUMO
Wireless Sensor Networks (WSNs) are crucial in various fields including Health Care Monitoring, Battlefield Surveillance, and Smart Agriculture. However, WSNs are susceptible to malicious attacks due to the massive quantity of sensors within them. Hence, there is a demand for a trust evaluation framework within WSNs to function as a secure system, to identify and isolate malicious or faulty sensor nodes. This information can be leveraged by neighboring nodes, to prevent collaboration in tasks like data aggregation and forwarding. While numerous trust frameworks have been suggested in the literature to assess trust scores and examine the reliability of sensors through direct and indirect communications, implementing these trust evaluation criteria is challenging due to the intricate nature of the trust evaluation process and the limited availability of datasets. This research conducts a novel comparative analysis of three trust management models: "Lightweight Trust Management based on Bayesian and Entropy (LTMBE)", "Beta-based Trust and Reputation Evaluation System (BTRES)", and "Lightweight and Dependable Trust System (LDTS)". To assess the practicality of these trust management models, we compare and examine their performance in multiple scenarios. Additionally, we assess and compare how well the trust management approaches perform in response to two significant cyber-attacks. Based on the experimental comparative analysis, it can be inferred that the LTMBE model is optimal for WSN applications emphasizing high energy efficiency, while the BTRES model is most suitable for WSN applications prioritizing critical security measures. The conducted empirical comparative analysis can act as a benchmark for upcoming research on trust evaluation frameworks for WSNs.
RESUMO
Traditional laboratory-based water quality monitoring and testing approaches are soon to be outdated, mainly because of the need for real-time feedback and immediate responses to emergencies. The more recent wireless sensor network (WSN)-based techniques are evolving to alleviate the problems of monitoring, coverage, and energy management, among others. The inclusion of the Internet of Things (IoT) in WSN techniques can further lead to their improvement in delivering, in real time, effective and efficient water-monitoring systems, reaping from the benefits of IoT wireless systems. However, they still suffer from the inability to deliver accurate real-time data, a lack of reconfigurability, the need to be deployed in ad hoc harsh environments, and their limited acceptability within industry. Electronic sensors are required for them to be effectively incorporated into the IoT WSN water-quality-monitoring system. Very few electronic sensors exist for parameter measurement. This necessitates the incorporation of artificial intelligence (AI) sensory techniques for smart water-quality-monitoring systems for indicators without actual electronic sensors by relating with available sensor data. This approach is in its infancy and is still not yet accepted nor standardized by the industry. This work presents a smart water-quality-monitoring framework featuring an intelligent IoT WSN monitoring system. The system uses AI sensors for indicators without electronic sensors, as the design of electronic sensors is lagging behind monitoring systems. In particular, machine learning algorithms are used to predict E. coli concentrations in water. Six different machine learning models (ridge regression, random forest regressor, stochastic gradient boosting, support vector machine, k-nearest neighbors, and AdaBoost regressor) are used on a sourced dataset. From the results, the best-performing model on average during testing was the AdaBoost regressor (a MAE¯ of 14.37 counts/100 mL), and the worst-performing model was stochastic gradient boosting (a MAE¯ of 42.27 counts/100 mL). The development and application of such a system is not trivial. The best-performing water parameter set (Set A) contained pH, conductivity, chloride, turbidity, nitrates, and chlorophyll.
RESUMO
Over the past few years, the scale of sensor networks has greatly expanded. This generates extended spatiotemporal datasets, which form a crucial information resource in numerous fields, ranging from sports and healthcare to environmental science and surveillance. Unfortunately, these datasets often contain missing values due to systematic or inadvertent sensor misoperation. This incompleteness hampers the subsequent data analysis, yet addressing these missing observations forms a challenging problem. This is especially the case when both the temporal correlation of timestamps within a single sensor and the spatial correlation between sensors are important. Here, we apply and evaluate 12 imputation methods to complete the missing values in a dataset originating from large-scale environmental monitoring. As part of a large citizen science project, IoT-based microclimate sensors were deployed for six months in 4400 gardens across the region of Flanders, generating 15-min recordings of temperature and soil moisture. Methods based on spatial recovery as well as time-based imputation were evaluated, including Spline Interpolation, MissForest, MICE, MCMC, M-RNN, BRITS, and others. The performance of these imputation methods was evaluated for different proportions of missing data (ranging from 10% to 50%), as well as a realistic missing value scenario. Techniques leveraging the spatial features of the data tend to outperform the time-based methods, with matrix completion techniques providing the best performance. Our results therefore provide a tool to maximize the benefit from costly, large-scale environmental monitoring efforts.
RESUMO
Data aggregation plays a critical role in sensor networks for efficient data collection. However, the assumption of uniform initial energy levels among sensors in existing algorithms is unrealistic in practical production applications. This discrepancy in initial energy levels significantly impacts data aggregation in sensor networks. To address this issue, we propose Data Aggregation with Different Initial Energy (DADIE), a novel algorithm that aims to enhance energy-saving, privacy-preserving efficiency, and reduce node death rates in sensor networks with varying initial energy nodes. DADIE considers the transmission distance between nodes and their initial energy levels when forming the network topology, while also limiting the number of child nodes. Furthermore, DADIE reconstructs the aggregation tree before each round of data transmission. This allows nodes closer to the receiving end with higher initial energy to undertake more data aggregation and transmission tasks while limiting energy consumption. As a result, DADIE effectively reduces the node death rate and improves the efficiency of data transmission throughout the network. To enhance network security, DADIE establishes secure transmission channels between transmission nodes prior to data transmission, and it employs slice-and-mix technology within the network. Our experimental simulations demonstrate that the proposed DADIE algorithm effectively resolves the data aggregation challenges in sensor networks with varying initial energy nodes. It achieves 5-20% lower communication overhead and energy consumption, 10-20% higher security, and 10-30% lower node mortality than existing algorithms.
RESUMO
Wireless sensor networks (WSNs) encounter a significant challenge in ensuring network security due to their operational constraints. This challenge stems from the potential infiltration of malware into WSNs, where a single infected node can rapidly propagate worms to neighboring nodes. To address this issue, this research introduces a stochastic S E I R S model to characterize worm spread in WSNs. Initially, we established that our model possesses a globally positive solution. Subsequently, we determine a threshold value for our stochastic system and derive a set of sufficient conditions that dictate the persistence or extinction of worm spread in WSNs based on the mean behavior. Our study reveals that environmental randomness can impede the spread of malware in WSNs. Moreover, by utilizing various parameter sets, we obtain approximate solutions that showcase these precise findings and validate the effectiveness of the proposed S E I R S model, which surpasses existing models in mitigating worm transmission in WSNs.
RESUMO
The reliability and scalability of Linear Wireless Sensor Networks (LWSNs) are limited by the high packet loss probabilities (PLP) experienced by the packets generated at nodes far from the sink node. This is an important limitation in Smart City applications, where timely data collection is critical for decision making. Unfortunately, previous works have not addressed this problem and have only focused on improving the network's overall performance. In this work, we propose a Distance-Based Queuing (DBQ) scheme that can be incorporated into MAC protocols for LWSNs to improve reliability and scalability without requiring extra local processing or additional signaling at the nodes. The DBQ scheme prioritizes the transmission of relay packets based on their hop distance to the sink node, ensuring that all packets experience the same PLP. To evaluate the effectiveness of our proposal, we developed an analytical model and conducted extensive discrete-event simulations. Our numerical results demonstrate that the DBQ scheme significantly improves the reliability and scalability of the network by achieving the same average PLP and throughput for all nodes, regardless of traffic intensities and network sizes.