Localization In Sensor Networks Research Articles

Periodic Energy Optimization Using IOT and ML

The rapid expansion of Internet of Things (IoT) applications across various sectors generates an enormous volume of continuous time-series data. However, transmitting this massive amount of sensor data from energy constrained IoT nodes poses a significant challenge. The continuous transmission of such data consumes vast amounts of energy.In this work, we present a solution to this problem by predicting the periodic behavior of sensor data through a higher-level view of continuous transmission data from nodes in IoT at server side. Our system is composed of an IoT sensor network and a data processing unit. The local sensor network: temperature and humidity data is collected using 4 different nodes, as well, which afterward this info is transferred into a data processing unit built on the Raspberry Pi device. We use the machine learning model Autoregressive Integrated Moving Average (ARIMA) on the processing unit. This model is then applied individually to the data from each of the four nodes, predicting processed sensor values in the future accurately. In short, after getting highly accurate prediction, then we settle down proper energy saving pattern which reduces the data transmission requirements hence results in energy saving pattern.By utilizing the predictive capabilities of the ARIMA model, we minimize the need for constant transmission of raw sensor data. Instead, we transmit only essential updates or deviations from the predicted values. This approach substantially reduces energy consumption by eliminating the transmission of redundant information. In summary, our project aims to overcome the energy limitations of IoT sensor nodes by leveraging predictive modelling techniques, specifically the ARIMA model. By accurately predicting periodic patterns in sensor data, we can optimize energy usage by transmitting only the necessary information, while still ensuring effective monitoring of temperature and humidity in the IoT network.

Enhancing 3D localization in wireless sensor network: a differential evolution method for the DV-Hop algorithm

Enhancing 3D localization in wireless sensor network: a differential evolution method for the DV-Hop algorithm

OptiLoc: Integrating SCSO and DV-Hop for wireless sensor network localization with application to disease forecasting in cattle farm monitoring

Disease prediction and management in cattle farming present significant challenges due to the complex interplay of environmental factors, disease transmission dynamics and the need for accurate localization of disease-carrying cattle. Traditional approaches often fall short in optimizing anchor node selection and accurately forecasting disease occurrences. To address these limitations, we propose OptiLoc, a novel framework that integrates advanced optimization techniques and disease forecasting algorithms. The proposed OptiLoc framework leverages Enhanced Sand Cat Swarm Optimization (SCSO) for optimizing anchor node selection within the farm area network. By dynamically adjusting the exploration rate and incorporating an opposition-based memory mechanism, OptiLoc ensures thorough exploration of the search space while preventing premature convergence. Furthermore, the multi-objective optimization aspect of SCSO considers factors such as coverage, energy efficiency, and connectivity, resulting in optimal anchor node placement. Additionally, OptiLoc integrates disease forecasting capabilities using logistic regression classifiers with dictionary learning. By extracting meaningful features from sensor data and training linear classifiers, OptiLoc predicts disease outbreaks among the cattle population. These predictions are seamlessly integrated into the optimization process through an expanded fitness function, which considers disease-related parameters alongside traditional optimization objectives. Furthermore, OptiLoc enhances disease management and control efforts by localizing sensor nodes using the DV-Hop method. By estimating sensor node positions based on hop distances to anchor nodes and dynamically calibrating hop distances based on real-time data on disease prevalence and environmental factors, OptiLoc achieves precise localization results. The proposed OptiLoc framework offers several advantages over traditional approaches. It optimizes anchor node placement, accurately forecasts disease outbreaks, and enhances localization accuracy, thereby empowering farmers with actionable insights to safeguard the health and well-being of their livestock. Performance evaluation reveals for the anchor nodes, it measures a mean localization error of 3.2% to 9.1% with a mean error of 5.91%. Similarly, for the sensor nodes, the mean localization error is 3.45% to 8.25% with a mean error of 5.445%. The AUC of the logistic regression classifier with dictionary learning is 0.97. Through its comprehensive approach, OptiLoc represents a significant advancement in optimizing WSNs in agricultural environments.

Low-cost sensor-based damage localization for large-area monitoring of FRP composites

In recent years, there has been growing interest in self-sensing structural materials across research and industry sectors. Detecting and locating structural damage typically requires numerous sensors wired to a data acquisition (DAQ) circuit, rendering implementation impractical in real structures. This paper proposes an innovative, cost-effective sensor network for damage detection and localization in fiber-reinforced polymer composites. The innovation encompasses three key elements: (1) utilizing carbon fiber tows within the composite as piezoresistive sensors, eliminating the need for additional foreign sensor devices; (2) introducing a novel sensor layout wherein sensor tow branches with varied resistance values are connected in parallel, reducing the number of connections to the DAQ circuit and cutting manufacturing costs significantly; (3) developing a practical sensor terminal fabrication technique to minimize manufacturing expenses. The proposed design methodology for the branch resistance values is first validated using a demonstration panel. Subsequently, the overall strategy is assessed by conducting impact tests on carbon and glass fiber-reinforced composite specimens. Results validate the sensor’s ability to accurately detect and locate structural damage.

Proposal of a wireless sensor network for footstep localization and optimization of its location using bio-inspired metaheuristics

This paper introduces a proposal for a wireless network of smart sensors designed to capture the vibrations produced by the impact of a person’s footsteps on a dispersive and damped floor. These vibrations are utilized to pinpoint the location of impacts using a heuristic algorithm, enabling operation at a low data transmission/reception rate. Traditionally, the placement of sensors within a room has not been given significant consideration in the context of localization; however, our findings indicate that a detailed analysis of both the number and location of sensors can substantially enhance the accuracy of footstep localization. In this study, we have optimized the arrangement and quantity of sensors through the application of bio-inspired metaheuristics, aiming to minimize localization errors across the room. Upon evaluating various bio-inspired metaheuristic optimization algorithms, we identified the one that yielded the lowest estimation errors for the room as a whole. Our experimental tests demonstrate that such optimization significantly enhances the efficacy of the localization algorithm, resulting in a reduction of localization error ranging from 18.24% to 46.78% across different trajectories.

A Study on Scan Trajectory Based Effective Localization Method Using Mobile Anchor in Wireless Sensor Networks

A Wireless Sensor Network (WSN) is a collection of different nodes working together in a networked fashion in an ordered way. For many applications, sensor location in wireless sensor networks (WSN) is crucial. It is expensive to equip each sensor node with a GPS receiver. Numerous methods, including range-based and range-free methods, have been put forth in the past to determine the locations of sensor nodes that are randomly distributed. The majority of them make use of unique nodes known as anchor nodes, which are thought to be aware of their own positions. These anchor nodes supply the information that other sensors use to calculate their locations. Massive numbers of sensor nodes are used in wireless sensor networks (WSNs) to gather data about the immediate environment. However, this data is useless until the precise location of the data collection points is known. Sensor node localization in wireless sensor networks (WSNs) is important for a number of applications. The current research study develops a path planning technique to apply mobile anchors to the localization systems that are currently in use. The two mobile anchors supported by the effective trajectories, or effective SCAN, is the focus of the proposed research project. To localise the sensor node and transmit data, this method involves setting the mobile anchors to move in the opposite direction. The advantages of this dual movable anchor are demonstrated by the research study in terms of decreased localization time, localization error, and other factors.

Dealing with Outliers in Wireless Sensor Networks Localization: An Iterative and Selection-Minimization Strategy

In recent years, there has been considerable interest in robust range-based Wireless Sensor Network (WSN) localization due to the increasing importance of accurately locating sensors in various WSN applications. However, achieving precise localization is often hampered by the presence of outliers or underestimations in range measurements, particularly when employing the RSS technique. To tackle these issues, we introduce a Two-Step Localization (namely, the SelMin approach). In the initial phase, the approach utilizes Second-Order Cone Programming (SOCP) to minimize distance discrepancies. It does this by comparing a reference Euclidean Distance Matrix (EDM) with a weighted one derived from imprecise distances between sensor nodes. In the subsequent phase, a heuristic method is employed to identify a specific number of imprecise distances, referred to as outliers, that will be disregarded in the first phase, and this two-phase process continues iteratively. The experimental results demonstrate that the SelMin strategy performs better than the DSCL method when evaluated using the Root Mean Square Error (RMSE) metric. This superior performance is maintained even in challenging conditions, such as when there are many outliers (i.e, around 30%\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\%$$\\end{document}) in the network. This indicates that SelMin is a reliable and robust choice for these environments.

Layout of Detection Array Based on Multi-Strategy Fusion Improved Adaptive Mayfly Algorithm in Bearing-Only Sensor Network.

The various applications of bearing-only sensor networks for detection and localization are becoming increasingly widespread and important. The array layout of the bearing-only sensor network seriously impacts the detection performance. This paper proposes a multi-strategy fusion improved adaptive mayfly algorithm (MIAMA) in a bearing-only sensor network to perform layout planning on the geometric configuration of the optimal detection. Firstly, the system model of a bearing-only sensor network was constructed, and the observability of the system was analyzed based on the Cramer-Rao Lower Bound and Fisher Information Matrix. Then, in view of the limitations of the traditional mayfly algorithm, which has a single initial population and no adaptability and poor global search capabilities, multi-strategy fusion improvements were carried out by introducing Tent chaos mapping, the adaptive inertia weight factor, and Random Opposition-based Learning. Finally, three simulation experiments were conducted. Through comparison with the Particle Swarm Optimization (PSO) algorithm, Mayfly Algorithm (MA), and Genetic Algorithm (GA), the effectiveness and superiority of the proposed MIAMA were validated.

Rigid Body Localization in Unsynchronized Sensor Networks: Analysis and Solution

Rigid Body Localization in Unsynchronized Sensor Networks: Analysis and Solution

Implementation of a Wireless Sensor Network for Environmental Measurements

Nowadays, the need to monitor different physical variables is constantly increasing and can be used in different applications, from humidity monitoring to disease detection in living beings, using a local or wireless sensor network (WSN). The Internet of Things has become a valuable approach to climate monitoring, daily parcel monitoring, early disease detection, crop plant counting, and risk assessment. Herein, an autonomous energy wireless sensor network for monitoring environmental variables is proposed. The network’s tree topology configuration, which involves master and slave modules, is managed by microcontrollers embedded with sensors, constituting a key part of the WSN architecture. The system’s slave modules are equipped with sensors for temperature, humidity, gas, and light detection, along with a photovoltaic cell to energize the system, and a WiFi module for data transmission. The receiver incorporates a user interface and the necessary computing components for efficient data handling. In an open-field configuration, the transceiver range of the proposed system reaches up to 750 m per module. The advantages of this approach are its scalability, energy efficiency, and the system’s ability to provide real-time environmental monitoring over a large area, which is particularly beneficial for applications in precision agriculture and environmental management.

Asynchronous Localization for Underwater Acoustic Sensor Networks: A Continuous Control Deep Reinforcement Learning Approach

Asynchronous Localization for Underwater Acoustic Sensor Networks: A Continuous Control Deep Reinforcement Learning Approach

Research on WSN reliable ranging and positioning algorithm for forest environment

Wireless sensor network (WSN) location is a significant research area. In complex environments like forests, inaccurate signal intensity ranging is a major challenge. To address this issue, this paper presents a reliable WSN distance measurement-positioning algorithm for forest environments. The algorithm divides the positioning area into several sub-regions based on the discrete coefficient of the collected signal strength. Then, using the fitting method based on the signal intensity value of each sub-region, the algorithm derives the reference points of the logarithmic distance path loss model and path loss index. Finally, the algorithm locates target nodes using anchor nodes in different regions. Additionally, to enhance the positioning accuracy, weight values are assigned to the positioning result based on the discrete coefficient of the signal intensity in each sub-region. Experimental results demonstrate that the proposed WSN algorithm has high precision in forest environments.

Processing‐in‐memory based multilateration localization in wireless sensor networks using memristor crossbar arrays

SummaryMost of the multilateration algorithms for object localization rely heavily on matrix multiplication for calculating the precise location of the target from all the reference points in a 3D domain. A significant disadvantage is that performing matrix multiplication can be computationally expensive, particularly for larger matrices, leading to slower performance and longer processing times. In this article, we propose a Processing‐in‐Memory (PIM) based localization approach for multilateration using a memristor crossbar array for performing faster matrix multiplication. The experiments were conducted on real‐time data collected through ultra‐wideband (UWB) chip. The simulation results demonstrate that the proposed model is around 50% faster than the fastest known localization algorithm considered for evaluation and exhibits an average of 55% improvement in localization accuracy.

Multi-Strategy Fusion for Enhancing Localization in Wireless Sensor Networks (WSNs)

Localization in wireless sensor networks (WSNs) plays a crucial role in various applications thatrely on spatial information. This paper introduces the Multi-Strategy Fusion for Localization model, whichintegrates optimization techniques (ABO, DSA, EHO, and KNN) and neurocomputing techniques (BP, MTLSTM,BILSTM, and Autoencoder) to enhance localization accuracy in WSNs. The work is divided into three phases: datacollection, model building, and implementation. The first and the last are carried out in the field, while the secondis made in the laboratory. The three phases involve a few general steps. The (1) Data Collection Phase includesfour steps: (a) Deploy three anchors at known locations, forming an equilateral triangle. (b) Each anchor startsbroadcasting its location. (c) Using an ordinary sensor, the RSSI of each anchor is measured at every possiblelocation where the signal of the three anchors can reach it. (d) Data is logged to a CSV file containing themeasuring location and the RSSI of the three anchors and their locations. The Model Building Phase includes (a)preprocessing of the collected data, and (b) building a model based on optimization and optimization techniques.The Implementation phase includes five steps: (a) Convoy sensors to the target field. (b) Manually deploy anchorsaccording to the distribution plan. (c) Randomly deploy ordinary sensors. (d) Each ordinary sensor starts ininitialization mode. When receiving a signal from three anchors, a sensor computes its location and stores it forfuture use. When a sensor has its location, it turns into operational mode. (e) A sensor in the operational modeattaches the location with sensed data each time it sends it to the sink or neighbors according to routing protocols(routing is not considered in this study). ABO and DSA optimization techniques show similar performance, withlower Mean Squared Error (MSE) values compared to EHO and KNN. ABO and DSA also have similar MeanAbsolute Error (MAE) values, indicating lesser average absolute errors. BP emerges as the top performer amongthe neurocomputing techniques, demonstrating better accuracy with lower MSE and MAE values compared toMTLSTM, BILSTM, and Autoencoder. Finally; The Multi-Strategy Fusion for Localization model offers aneffective approach to enhance localization accuracy in wireless sensor networks. The paper focuses on addressingthe correlation between wireless device positions and signal intensities to improve the localization process. Theobtained results and provided justification emphasize the significance and value of the model in the field oflocalization in WSNs. The model represents a valuable contribution to the development of localization techniquesand improving their accuracy to meet the needs of various applications. The model opens up opportunities for itsutilization in diverse domains such as environmental monitoring, healthcare, smart cities, and disastermanagement, enhancing its practical applications and practical significance.

Seagull optimization algorithm for node localization in wireless sensor networks

Seagull optimization algorithm for node localization in wireless sensor networks

Exploiting sparsity for localisation of large‐scale wireless sensor networks

AbstractWireless Sensor Network (WSN) localisation refers to the problem of determining the position of each of the agents in a WSN using noisy measurement information. In many cases, such as in distance and bearing‐based localisation, the measurement model is a non‐linear function of the agents' positions, leading to pairwise interconnections between the agents. As the optimal solution for the WSN localisation problem is known to be computationally expensive in these cases, an efficient approximation is desired. The authors show that the inherent sparsity in this problem can be exploited to greatly reduce the computational effort of using an Extended Kalman Filter (EKF) for large‐scale WSN localisation. In the proposed method, which the authors call the L‐Banded Extended Kalman Filter (LB‐EKF), the measurement information matrix is converted into a banded matrix by relabelling (permuting the order of) the vertices of the graph. Using a combination of theoretical analysis and numerical simulations, it is shown that typical WSN configurations (which can be modelled as random geometric graphs) can be localised in a scalable manner using the proposed LB‐EKF approach.

Localization in 3D Wireless Sensor Networks with Obstacle Consideration

Wireless sensor network (WSN) refers to the network formed by sensor nodes for communicating sensed data over the wireless medium. These sensor nodes are mostly deployed randomly in the target area, and hence estimating the coordinates of these sensor nodes through the localization process is an important activity. Majority of the localization algorithms existing in the literature assume the target area to be an obstacle-free 2D terrain. However, such algorithms are not suitable for real-life scenarios where WSNs are actually deployed on 3D terrains that may also have obstacles that hinder the radio signals from the deployed sensor nodes. Hence, factors such as the height of the terrain, the presence of obstacles, etc., require significant considerations while designing algorithms for WSN. The proposed research presents a localization scheme for 3D WSN where the sensor nodes are randomly deployed in a 3D area having large obstacles. The proposed scheme adopts a distributed approach for calculating the virtual coordinates of the sensors using four beacon nodes. The deployment area is divided into regions, and each node computes its virtual coordinates with respect to the obstacle. Simulation results indicate an average localization error of 6.93 m. The proposed scheme requires very less computational effort and can be easily adapted in different scenarios.

Joint energy beamforming and bandwidth allocation for cooperative localization in passive sensor networks

Passive sensor networks (PSNs) harvest continuous radio-frequency (RF) energy to work. However, the location information is difficult to maintain with unstable power supply for each passive sensor node. Cooperative localization is a promising solution utilizes the cooperation between the nodes with unknown positions to maintain the location information. And the localization performance relies on the attained energy from the energy access point (E-AP) and also the allocated bandwidth for each node. In this paper, we analyze the impacts of energy beamforming and bandwidth allocation on the cooperative localization performance of PSNs. We formulate the Fisher information matrix (FIM) and deduce the squared position error bound (SPEB) for the proposed network. Then, we propose an alternative optimization method for jointly energy beamforming and bandwidth allocation. Firstly, we employ the first-order Taylor expansions based on the trust region method to allocate the bandwidth of each node. Secondly, the Lagrangian multiplier based energy beamforming strategy is proposed. Then, the bandwidth allocation and energy beamforming calculations are executed alternatively and iteratively until the global optimal solution is achieved. The simulation results indicate that our proposed two-step method can achieve high precision positioning in different scenarios, and the SPEBs of proposed method reach 10−3 m2.

A gradient descent akin method for constrained optimization: algorithms and applications

We present a ‘gradient descent akin’ method (GDAM) for constrained optimization problem, i.e. the search direction is computed using a linear combination of the negative and normalized objective and constraint gradient. We give fundamental theoretical guarantees on the global convergence of the method. This work focuses on the algorithms and applications of GDAM. We present computational algorithms that adapt common strategies for the gradient descent method. We demonstrate the potential of the method using two engineering applications, shape optimization and sensor network localization. When practically implemented, GDAM is robust and very competitive in solving the considered large and challenging optimization problems.

Sensor Network Localization via Riemannian Conjugate Gradient and Rank Reduction

Sensor Network Localization via Riemannian Conjugate Gradient and Rank Reduction