Search Results (50)

Localization is vital and fundamental for underwater sensor networks. However, the field still faces several challenges, such as the difficulty of accurately deploying beacon nodes, high deployment costs, imprecise underwater ranging, and limited node energy. To overcome these challenges, we propose a crowdsensing-based underwater localization algorithm (CSUL) by leveraging the computational and localization resources of vessels. The algorithm is composed of three stages: crowdsensing, denoising, and aggregation-based optimization. In the crowdsensing stage, nodes transmit localization requests, which are received by vessels and broadcasted to nearby vessels. Using concentric circle calculations, the localization problem is transformed from a three-dimensional space to a two-dimensional plane. An initial set of potential node locations, termed the concentric circle center set, is derived based on a time threshold. The denoising stage employs a Density-Based Noise Removal (DBNR) algorithm to eliminate noise caused by vessel mobility, environmental complexity, and the time threshold, thereby improving localization accuracy. Finally, in the aggregation-based optimization stage, the denoised node location set is refined using a centroid-based approximate triangulation (CBAT) algorithm to determine the final node location. Simulation results indicate that the proposed method achieves high localization coverage without requiring anchor nodes and significantly improves localization accuracy. Additionally, since all localization computations are carried out by vessels, node energy consumption is greatly reduced, effectively extending the network’s lifetime. Full article

As a range-free localization algorithm, DV-Hop has gained widespread attention due to its advantages of simplicity and ease of implementation. However, this algorithm also has some defects, such as poor localization accuracy and vulnerability to network topology. This paper presents a comprehensive analysis of the factors contributing to the inaccuracy of the DV-Hop algorithm. An improved proportional integral derivative (PID) search algorithm (PSA) DV-Hop hybrid localization algorithm based on weighted hyperbola (IPSA-DV-Hop) is proposed. Firstly, the first hop distance refinement is employed to rectify the received signal strength indicator (RSSI). In order to replace the original least squares solution, a weighted hyperbolic algorithm based on the degree of covariance is adopted. Secondly, the localization error is further reduced by employing the improved PSA. In addition, the selection process of the node set is optimized using progressive sample consensus (PROSAC) followed by a 3D hyperbolic algorithm based on coplanarity. This approach effectively reduces the computational error associated with the hopping distance of the beacon nodes in the 3D scenarios. Finally, the simulation experiments demonstrate that the proposed algorithm can markedly enhance the localization precision in both isotropic and anisotropic networks and reduce the localization error by a minimum of 30% in comparison to the classical DV-Hop. Additionally, it also exhibits stability under the influence of a radio irregular model (RIM). Full article

This research introduces a hybrid approach combining bio- and nature-inspired metaheuristic algorithms to enhance scheduling efficiency and minimize energy consumption in Underwater Acoustic Sensor Networks (UASNs). Five hybridized algorithms are designed to efficiently schedule nodes, reducing energy costs compared to existing methods, and addressing the challenge of unscheduled nodes within the communication network. The hybridization techniques such as Elephant Herding Optimization (EHO) with Genetic Algorithm (GA), Firefly Algorithm (FA), Levy Firefly Algorithm (LFA), Bacterial Foraging Algorithm (BFA), and Binary Particle Swarm Optimization (BPSO) are used for optimization. To implement these optimization techniques, the Scheduled Routing Algorithm for Localization (SRAL) is introduced, aiming to enhance node scheduling and localization. This framework is crucial for improving data delivery, optimizing Route REQuest (RREQ) and Routing Overhead (RO), while minimizing Average End-to-End (AE2E) delays and localization errors. The challenges of node localization, RREQ reconstruction at the beacon level, and increased RO, along with End-to-End delays and unreliable data forwarding, have a significant impact on overall communication in underwater environments. The proposed framework, along with the hybridized metaheuristic algorithms, show great potential in improving node localization, optimizing scheduling, reducing energy costs, and enhancing reliable data delivery in the Internet of Underwater Things (IoUT)-based network. Full article

The efficient operation of smart farms relies on the precise monitoring of farm environmental information, necessitating the deployment of a large number of wireless sensors. These sensors must be integrated with their specific locations within the fields to ensure data accuracy. Therefore, efficiently and rapidly determining the positions of sensor nodes presents a significant challenge. To address this issue, this paper proposes a hybrid optimization DV-Hop localization algorithm based on the chaotic crested porcupine optimizer. The algorithm leverages the received signal strength indicator, combined with node hierarchical values, to achieve graded processing of the minimum number of hops. Polynomial fitting methods are employed to reduce the estimation distance error from the beacon nodes to unknown nodes. Finally, the chaotic optimization crested porcupine optimizer is designed for intelligent optimization. Simulation experiments verify the proposed algorithm’s localization performance across different monitoring areas, varying beacon node ratios, and assorted communication radii. The simulation results demonstrate that the proposed algorithm effectively enhances node localization accuracy and significantly reduces localization errors compared to the results for other algorithms. In future work, we plan to consider the impact of algorithm complexity on the lifespan of wireless sensor networks and to further evaluate the algorithm in a pH monitoring system for farmland. Full article

Node localization is critical for accessing diverse nodes that provide services in remote places. Single-anchor localization techniques suffer co-linearity, performing poorly. The reliable multiple anchor node selection method is computationally intensive and requires a lot of processing power and time to identify suitable anchor nodes. Node localization in wireless sensor networks (WSNs) is challenging due to the number and placement of anchors, as well as their communication capabilities. These senor nodes possess limited energy resources, which is a big concern in localization. In addition to convention optimization in WSNs, researchers have employed nature-inspired algorithms to localize unknown nodes in WSN. However, these methods take longer, require lots of processing power, and have higher localization error, with a greater number of beacon nodes and sensitivity to parameter selection affecting localization. This research employed a nature-inspired crow search algorithm (an improvement over other nature-inspired algorithms) for selecting the suitable number of anchor nodes from the population, reducing errors in localizing unknown nodes. Additionally, the weighted centroid method was proposed for identifying the exact location of an unknown node. This made the crow search weighted centroid localization (CS-WCL) algorithm a more trustworthy and efficient method for node localization in WSNs, with reduced average localization error (ALE) and energy consumption. CS-WCL outperformed WCL and distance vector (DV)-Hop, with a reduced ALE of 15% (from 32%) and varying communication radii from 20 m to 45 m. Also, the ALE against scalability was validated for CS-WCL against WCL and DV-Hop for a varying number of beacon nodes (from 3 to 2), reducing ALE to 2.59% (from 28.75%). Lastly, CS-WCL resulted in reduced energy consumption (from 120 mJ to 45 mJ) for varying network nodes from 30 to 300 against WCL and DV-Hop. Thus, CS-WCL outperformed other nature-inspired algorithms in node localization. These have been validated using MATLAB 2022b. Full article

Localization technology is essential for making wireless sensor networks(WSN)’s information processing and information collecting applications actually feasible. The beacon information is made available to the unknown nodes using the route exchange protocol. These data are more useful for determining the coordinates of neighboring nodes. Consequently, it was discovered that the algorithm for localizing nodes always has a flaw. Consequently, a brand-new metaheuristic termed Bat with simulated annealing is proposed to fix the flaw in the WSN standard node localization technique. The overall effectiveness of identifying the nodes is enhanced as a result of the large reduction in localization errors. The most popular localization estimation methods are the distance vector hop (DV-Hop) technique and approximate point-in-triangulation (APIT), which have high node localization accuracy and simple deployment in real-time environments. The primary benefits and their disadvantages, which give it a slight disadvantage in preference, are presented in this work. Both strategies are compared for their conventional performance and efficiency when combined with the Bat-SA algorithm. Full article

With the rapid development of the intelligent transportation system (ITS), routing in vehicular ad hoc networks (VANETs) has become a popular research topic. The high mobility of vehicles in urban streets poses serious challenges to routing protocols and has a significant impact on network performance. Existing topology-based routing is not suitable for highly dynamic VANETs, thereby making location-based routing protocols the preferred choice due to their scalability. However, the working environment of VANETs is complex and interference-prone. In wireless-network communication, the channel contention introduced by the high density of vehicles, coupled with urban structures, significantly increases the difficulty of designing high-quality communication protocols. In this context, compared to topology-based routing protocols, location-based geographic routing is widely employed in VANETs due to its avoidance of the route construction and maintenance phases. Considering the characteristics of VANETs, this paper proposes a novel environment-aware adaptive reinforcement routing (EARR) protocol aimed at establishing reliable connections between source and destination nodes. The protocol adopts periodic beacons to perceive and explore the surrounding environment, thereby constructing a local topology. By applying reinforcement learning to the vehicle network’s route selection, it adaptively adjusts the Q table through the perception of multiple metrics from beacons, including vehicle speed, available bandwidth, signal-reception strength, etc., thereby assisting the selection of relay vehicles and alleviating the challenges posed by the high dynamics, shadow fading, and limited bandwidth in VANETs. The combination of reinforcement learning and beacons accelerates the establishment of end-to-end routes, thereby guiding each vehicle to choose the optimal next hop and forming suboptimal routes throughout the entire communication process. The adaptive adjustment feature of the protocol enables it to address sudden link interruptions, thereby enhancing communication reliability. In experiments, the EARR protocol demonstrates significant improvements across various performance metrics compared to existing routing protocols. Throughout the simulation process, the EARR protocol maintains a consistently high packet-delivery rate and throughput compared to other protocols, as well as demonstrates stable performance across various scenarios. Finally, the proposed protocol demonstrates relatively consistent standardized latency and low overhead in all experiments. Full article

Security identification solutions against WLAN network attacks according to straightforward digital detectors, such as SSID, IP addresses, and MAC addresses, are not efficient in identifying such hacking or router impersonation. These detectors can be simply mocked. Therefore, a further protected key uses new information by combining these simple digital identifiers with an RF signature of the radio link. In this work, a design of a convolutional neural network (CNN) based on fingerprinting radio frequency (RF) is developed with computer-generated data. The developed CNN is trained with beacon frames of a wireless local area network (WLAN) that is simulated as a result of identified and unidentified router nodes of fingerprinting RF. The proposed CNN is able to detect router impersonators by comparing the data pair of the MAC address and RF signature of the received signal from the known and unknown routers. ADAM optimizer, which is the extended version of stochastic gradient descent, has been used with a developed deep learning convolutional neural network containing three fully connected and two convolutional layers. According to the training progress graphic, the network converges to around 100% accuracy within the first epoch, which indicates that the developed architecture was efficient in detecting router impersonations. Full article

Deep-sea object localization by underwater acoustic sensor networks is a current research topic in the field of underwater communication and navigation. To find a deep-sea object using underwater wireless sensor networks (UWSNs), the sensors must first detect the signals sent by the object. The sensor readings are then used to approximate the object’s position. A lot of parameters influence localization accuracy, including the number and location of sensors, the quality of received signals, and the algorithm used for localization. To determine position, the angle of arrival (AOA), time difference of arrival (TDoA), and received signal strength indicator (RSSI) are used. The UWSN requires precise and efficient localization algorithms because of the changing underwater environment. Time and position are required for sensor data, especially if the sensor is aware of its surroundings. This study describes a critical localization strategy for accomplishing this goal. Using beacon nodes, arrival distance validates sensor localization. We account for the fact that sensor nodes are not in perfect temporal sync and that sound speed changes based on the medium (water, air, etc.) in this section. Our simulations show that our system can achieve high localization accuracy by accounting for temporal synchronisation, measuring mean localization errors, and forecasting their variation. The suggested system localization has a lower mean estimation error (MEE) while using RSSI. This suggests that measurements based on RSSI provide more precision and accuracy during localization. Full article

IPS is a crucial technology that enables medical staff and hospital management to accurately locate and track persons or assets inside medical buildings. Among other technologies, readily available BLE can be exploited to achieve an energy-efficient and low-cost solution. This work presents the design, implementation and comparison of a RSSI-based and a MCPD-based indoor localization system. The implementation is based on a lightweight wkNN algorithm that processes RSSI and MCPD distance data from connection-less BLE Beacons. The designed hardware and firmware are implemented around the state-of-the-art SoC for BLE, the nRF5340 from Nordic Semiconductor. Experimental evaluation with real-time data processing has been evaluated and presented in a 7.3 m × 8.9 m room with furniture and six beacon nodes. The experimental results on randomly chosen validation points within the room show an average error of only 0.50 m for the MCPD approach, whereas the RSSI approach achieved an error of 1.39 m. Full article

To increase the positioning accuracy of Distance Vector-Hop (DV-Hop) algorithm in non-uniform networks, an improved DV-Hop algorithm based on RSSI correction is proposed. The new algorithm first quantizes hops between two nodes by the ratio of the RSSI value between two nodes and the benchmark RSSI value, divides the hops continuously, calculates the average hop distance according to the Minimum Mean Square Error (MMSE) criterion of the best index based on the quantized hops, and then adds hop distance matching factor to the fitness function of each anchor node into the calculation of the hop distance fitness function to weight the fitness function. The change index value is introduced to obtain more accurate hop distance value, and then the estimation error of unknown node (UN) coordinate is modified by using the distance relationship between the UN and the nearest beacon node (BN), and the modified coordination position is further modified by using the triangle centroid to improve the accuracy of node positioning in the irregular network. The experimental results show that compared with the original DV-Hop, improved DV-Hop1, improved DV-Hop2 and improved DV-Hop3, the localization error of the improved algorithm in this paper is reduced by 58%, 45%, 34%, and 29%, respectively, on average, in the two network environments. Without increasing the hardware cost and energy consumption, the improved algorithm has excellent localization performance. Full article

Conventional underwater technologies were not able to provide authentication and proper visualization of unexplored ocean areas to accommodate a wide range of applications. The aforesaid technologies face several challenges including decentralization, beacon node localization (for identification of nodes), authentication of Internet of Underwater Things (IoUTs) objects and unreliable beacon node communication between purpose oriented IoT-enabled networks. Recently, new technologies such as blockchain (BC) and the IoUTs have been used to reduce the issues but there are still some research gaps; for example, unreliable beacon messages for node acquisition have significant impacts on node identification and localization and many constrained node resources, etc. Further, the uncertainty of acoustic communication and the environment itself become problems when designing a trust-based framework for the IoUTs. In this research, a trust-based hybrid BC-enabled beacon node localization (THBNL) framework is proposed to employ a secure strategy for beacon node localization (BNL) to mine the underwater localized nodes via the hybrid blockchain enabled beacon node localization (HB²NL) algorithm. This framework helps to merge two disciplines; it is hybrid because it follows the nature and bio inspired meta heuristics algorithms for scheduling the beacon nodes. The performance of the proposed approach is also evaluated for different factors such as node losses, packet delivery ratios, residual and energy consumption and waiting time analysis, etc. These findings show that the work done so far has been successful in achieving the required goals while remaining within the system parameters. Full article

Wireless indoor localization technology is a hot research field at present. Its basic principle is to estimate the geometric position of the mobile node by measuring the characteristic parameters of the propagation signal between the mobile node and the beacon node. However, in the process of position estimation, there are non-line-of-sight errors such as multipath propagation, which greatly reduces the localization accuracy. This paper proposes an enhanced closest neighbor data association approach based on ultra-wide band (UWB) measurement. First, the measured values were grouped to obtain a series of undetermined prediction position points, and the undetermined points were put into our set verification gate for screening. Then, the particle filter was introduced to weight and redistribute the position estimation after screening, removing the NLOS-contaminated location estimation from consideration. The position estimation group with low error was finally confirmed and weighted again by the nearest neighbor association algorithm. Simulation results showed that the average localization accuracy of the proposed method was about 1 m. Compared with the existing localization algorithms, the proposed method can successfully reduce the influence of NLOS error and obtain higher localization accuracy. Full article

Monitoring and tracking issues related to autonomous mobile robots are currently intensively debated in order to ensure a more fluent functionality in supply chain management. The interest arises from both theoretical and practical concerns about providing accurate information about the current and past position of systems involved in the logistics chain, based on specialized sensors and Global Positioning System (GPS). The localization demands are more challenging as the need to monitor the autonomous robot’s ongoing activities is more stringent indoors and benefit from accurate motion response, which requires calibration. This practical research study proposes an extended calibration approach for improving Omnidirectional Mobile Robot (OMR) motion response in the context of mechanical build imperfections (misalignment). A precise indoor positioning system is required to obtain accurate data for calculating the calibration parameters and validating the implementation response. An ultrasound-based commercial solution was considered for tracking the OMR, but the practical observed errors of the readily available position solutions requires special processing of the raw acquired measurements. The approach uses a multilateration technique based on the point-to-point distances measured between the mobile ultrasound beacon and a current subset of fixed (reference) beacons, in order to obtain an improved position estimation characterized by a confidence coefficient. Therefore, the proposed method managed to reduce the motion error by up to seven-times. Reference trajectories were generated, and robot motion response accuracy was evaluated using a Robot Operating System (ROS) node developed in Matlab-Simulink that was wireless interconnected with the other ROS nodes hosted on the robot navigation controller. Full article

Node localization technology has become a research hotspot for wireless sensor networks (WSN) in recent years. The standard distance vector hop (DV-Hop) is a remarkable range-free positioning algorithm, but the low positioning accuracy limits its application in certain scenarios. To improve the positioning performance of the standard DV-Hop, an enhanced DV-Hop based on weighted iteration and optimal beacon set is presented in this paper. Firstly, different weights are assigned to beacons based on the per-hop error, and the weighted minimum mean square error (MMSE) is performed iteratively to find the optimal average hop size (AHS) of beacon nodes. After that, the approach of estimating the distance between unknown nodes and beacons is redefined. Finally, considering the influence of beacon nodes with different distances to the unknown node, the nearest beacon nodes are given priority to compute the node position. The optimal coordinates of the unknown nodes are determined by the best beacon set derived from a grouping strategy, rather than all beacons directly participating in localization. Simulation results demonstrate that the average localization error of our proposed DV-Hop reaches about 3.96 m, which is significantly lower than the 9.05 m, 7.25 m, and 5.62 m of the standard DV-Hop, PSO DV-Hop, and Selective 3-Anchor DV-Hop. Full article