An Optimal Node Localization in WSN Based on Siege Whale Optimization Algorithm

Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand allocates the acquired location information to unknown devices. The metaheuristic approach is one of themost advantageous ways to deal with this challenging issue and overcome the disadvantages of the traditionalmethods that often suffer from computational time problems and small network deployment scale. This studyproposes an enhanced whale optimization algorithm that is an advanced metaheuristic algorithm based on thesiege mechanism (SWOA) for node localization inWSN. The objective function is modeled while communicatingon localized nodes, considering variables like delay, path loss, energy, and received signal strength. The localizationapproach also assigns the discovered location data to unidentified devices with the modeled objective functionby applying the SWOA algorithm. The experimental analysis is carried out to demonstrate the efficiency of thedesigned localization scheme in terms of various metrics, e.g., localization errors rate, converges rate, and executedtime. Compared experimental-result shows that theSWOA offers the applicability of the developed model forWSNto perform the localization scheme with excellent quality. Significantly, the error and convergence values achievedby the SWOA are less location error, faster in convergence and executed time than the others compared to at least areduced 1.5% to 4.7% error rate, and quicker by at least 4%and 2% in convergence and executed time, respectivelyfor the experimental scenarios.

A Review and Analysis of Localization Techniques in Underwater Wireless Sensor Networks

In recent years,there has been a rapid growth in Underwater Wireless Sensor Networks(UWSNs).The focus of research in this area is now on solving the problems associated with large-scale UWSN.One of the major issues in such a network is the localization of underwater nodes.Localization is required for tracking objects and detecting the target.It is also considered tagging of data where sensed contents are not found of any use without localization.This is useless for application until the position of sensed content is confirmed.This article’s major goal is to review and analyze underwater node localization to solve the localization issues in UWSN.The present paper describes various existing localization schemes and broadly categorizes these schemes as Centralized and Distributed localization schemes underwater.Also,a detailed subdivision of these localization schemes is given.Further,these localization schemes are compared from different perspectives.The detailed analysis of these schemes in terms of certain performance metrics has been discussed in this paper.At the end,the paper addresses several future directions for potential research in improving localization problems of UWSN.

Intelligent Aquila Optimization Algorithm-Based Node Localization Scheme for Wireless Sensor Networks

In recent times,wireless sensor network(WSN)finds their suitability in several application areas,ranging from military to commercial ones.Since nodes in WSN are placed arbitrarily in the target field,node localization(NL)becomes essential where the positioning of the nodes can be determined by the aid of anchor nodes.The goal of any NL scheme is to improve the localization accuracy and reduce the localization error rate.With this motivation,this study focuses on the design of Intelligent Aquila Optimization Algorithm Based Node Localization Scheme(IAOAB-NLS)for WSN.The presented IAOAB-NLS model makes use of anchor nodes to determine proper positioning of the nodes.In addition,the IAOAB-NLS model is stimulated by the behaviour of Aquila.The IAOAB-NLS model has the ability to accomplish proper coordinate points of the nodes in the network.For guaranteeing the proficient NL process of the IAOAB-NLS model,widespread experimentation takes place to assure the betterment of the IAOAB-NLS model.The resultant values reported the effectual outcome of the IAOAB-NLS model irrespective of changing parameters in the network.

Metaheuristics Based Node Localization Approach for Real-Time Clustered Wireless Networks

In recent times,real time wireless networks have found their applicability in several practical applications such as smart city,healthcare,surveillance,environmental monitoring,etc.At the same time,proper localization of nodes in real time wireless networks helps to improve the overall functioning of networks.This study presents an Improved Metaheuristics based Energy Efficient Clustering with Node Localization(IM-EECNL)approach for real-time wireless networks.The proposed IM-EECNL technique involves two major processes namely node localization and clustering.Firstly,Chaotic Water Strider Algorithm based Node Localization(CWSANL)technique to determine the unknown position of the nodes.Secondly,an Oppositional Archimedes Optimization Algorithm based Clustering(OAOAC)technique is applied to accomplish energy efficiency in the network.Besides,the OAOAC technique derives afitness function comprising residual energy,distance to cluster heads(CHs),distance to base station(BS),and load.The performance validation of the IM-EECNL technique is carried out under several aspects such as localization and energy efficiency.A wide ranging comparative outcomes analysis highlighted the improved performance of the IM-EECNL approach on the recent approaches with the maximum packet delivery ratio(PDR)of 0.985.

Node cooperation based location secure verification algorithm in wireless sensor networks localization

For the application of wireless sensor networks in the military field, one of the main challenges is security. To solve the problem of verifying the location claim for a node, a new location verifica- tion algorithm called node cooperation based location secure verification （NCBLSV） algorithm is proposed. NCBLSV could verify malicious nodes by contrasting neighbor nodes and nodes under beam width angle using an adaptive array antenna at a base point. Simulation experiments are con- ducted to evaluate the performance of this algorithm by varying the communication range and the an- tenna beam width angle. Results show that NCBLSV algorithm has high probability of successful ma- licious nodes detection and low probability of false nodes detection. Thus, it is proved that the NCBLSV algorithm is useful and necessary in the wireless sensor networks security.

AModified Search and Rescue Optimization Based Node Localization Technique inWSN

Wireless sensor network(WSN)is an emerging technology which find useful in several application areas such as healthcare,environmentalmonitoring,border surveillance,etc.Several issues that exist in the designing of WSN are node localization,coverage,energy efficiency,security,and so on.In spite of the issues,node localization is considered an important issue,which intends to calculate the coordinate points of unknown nodes with the assistance of anchors.The efficiency of the WSN can be considerably influenced by the node localization accuracy.Therefore,this paper presents a modified search and rescue optimization based node localization technique(MSRONLT)forWSN.The major aim of theMSRO-NLT technique is to determine the positioning of the unknown nodes in theWSN.Since the traditional search and rescue optimization(SRO)algorithm suffers from the local optima problemwith an increase in number of iterations,MSRO algorithm is developed by the incorporation of chaotic maps to improvise the diversity of the technique.The application of the concept of chaotic map to the characteristics of the traditional SRO algorithm helps to achieve better exploration ability of the MSRO algorithm.In order to validate the effective node localization performance of the MSRO-NLT algorithm,a set of simulations were performed to highlight the supremacy of the presented model.A detailed comparative results analysis showcased the betterment of the MSRO-NLT technique over the other compared methods in terms of different measures.

An Iterative Clustering-Based Localization Algorithm for Wireless Sensor Networks

In wireless sensor networks,node localization is a fundamental middleware service.In this paper,a robust and accurate localization algorithm is proposed,which uses a novel iterative clustering model to obtain the most representative intersection points between every two circles and use them to estimate the position of unknown nodes.Simulation results demonstrate that the proposed algorithm outperforms other localization schemes (such as Min-Max,etc.) in accuracy,scalability and gross error tolerance.

Quantum Artificial Intelligence Based Node Localization Technique for Wireless Networks

Artificial intelligence(AI)techniques have received significant attention among research communities in the field of networking,image processing,natural language processing,robotics,etc.At the same time,a major problem in wireless sensor networks(WSN)is node localization,which aims to identify the exact position of the sensor nodes(SN)using the known position of several anchor nodes.WSN comprises a massive number of SNs and records the position of the nodes,which becomes a tedious process.Besides,the SNs might be subjected to node mobility and the position alters with time.So,a precise node localization(NL)manner is required for determining the location of the SNs.In this view,this paper presents a new quantum bird migration optimizer-based NL(QBMA-NL)technique for WSN.The goal of the QBMA-NL approach is for determining the position of unknown nodes in the network by the use of anchor nodes.The QBMA-NL technique is mainly based on the mating behavior of bird species at the time of mating season.In addition,an objective function is derived based on the received signal strength indicator(RSSI)and Euclidean distance from the known to unknown SNs.For demonstrating the improved performance of the QBMA-NL technique,a wide range of simulations take place and the results reported the supreme performance over the recent NL techniques.

A newself-localization method for wireless sensor networks

Many applications of wireless sensor networks can benefit from fine-grained localization. In this paper, we proposed an accurate, distributed localization method based on the time difference between radio signal and sound wave. In a trilateration, each node adaptively chooses a neighborhood of sensors and updates its position estimate with trilateration, and then passes this update to neighboring sensors. Application examples demonstrate that the proposed method is more robust and accurate in localizing node than the previous proposals and it can achieve comparable results using much fewer anchor nodes than the previous methods.

Industrial Centric Node Localization and Pollution Prediction Using Hybrid Swarm Techniques

Major fields such as military applications,medical fields,weather forecasting,and environmental applications use wireless sensor networks for major computing processes.Sensors play a vital role in emerging technologies of the 20th century.Localization of sensors in needed locations is a very serious problem.The environment is home to every living being in the world.The growth of industries after the industrial revolution increased pollution across the environment.Owing to recent uncontrolled growth and development,sensors to measure pollution levels across industries and surroundings are needed.An interesting and challenging task is choosing the place to fit the sensors.Many meta-heuristic techniques have been introduced in node localization.Swarm intelligent algorithms have proven their efficiency in many studies on localization problems.In this article,we introduce an industrial-centric approach to solve the problem of node localization in the sensor network.First,our work aims at selecting industrial areas in the sensed location.We use random forest regression methodology to select the polluted area.Then,the elephant herding algorithm is used in sensor node localization.These two algorithms are combined to produce the best standard result in localizing the sensor nodes.To check the proposed performance,experiments are conducted with data from the KDD Cup 2018,which contain the name of 35 stations with concentrations of air pollutants such as PM,SO_(2),CO,NO_(2),and O_(3).These data are normalized and tested with algorithms.The results are comparatively analyzed with other swarm intelligence algorithms such as the elephant herding algorithm,particle swarm optimization,and machine learning algorithms such as decision tree regression and multi-layer perceptron.Results can indicate our proposed algorithm can suggest more meaningful locations for localizing the sensors in the topology.Our proposed method achieves a lower root mean square value with 0.06 to 0.08 for localizing with Stations 1 to 5.

Shift control method for the local time at descendi ngnode based on sun-synchronous orbit satellite

This article analyzes the shift factors of the descending node local time for sun-synchronous satellites and proposes a shift control method to keep the local time shift within an allowance range. It is found that the satellite orbit design and the orbit injection deviation are the causes for the initial shift velocity, whereas the atmospheric drag and the sun gravitational perturbation produce the shift acceleration. To deal with these shift factors, a shift control method is put forward, through such methods as orbit variation design, orbit altitude, and inclination keeping control. The simulation experiment and practical application have proved the effectiveness of this control method.

Distributed localization using mobile beacons in wireless sensor networks

A new distributed node localization algorithm named mobile beacons-improved particle filter （MB-IPF） was proposed. In the algorithm, the mobile nodes equipped with globe position system （GPS） move around in the wireless sensor network （WSN） field based on the Gauss-Markov mobility model, and periodically broadcast the beacon messages Each unknown node estimates its location in a fully distributed mode based on the received mobile beacons. The localization algorithm is based on the IPF and several refinements, including the proposed weighted centroid algorithm, the residual resampling algorithm, and the markov chain monte carlo （MCMC） method etc., which were also introduced for performance improvement. The simulation results show that our proposed algorithm is efficient for most applications.

Improved Algorithm for Distributed Localization in Wireless Sensor Networks

Many sensor network applications require location awareness,but it is often too expensive to equip a global positioning system(GPS) receiver for each network node.Hence,localization schemes for sensor networks typically use a small number of seed nodes that know their locations and protocols whereby other nodes estimate their locations from the messages they receive.For the inherent shortcomings of general particle filter(the sequential Monte Carlo method) this paper introduces particle swarm optimization and weighted centroid algorithm to optimize it.Based on improvement a distributed localization algorithm named WC-IPF(weighted centroid algorithm improved particle filter) has been proposed for localization.In this localization scheme the initial estimate position can be acquired by weighted centroid algorithm.Then the accurate position can be gotten via improved particle filter recursively.The extend simulation results show that the proposed algorithm is efficient for most condition.