scholarly journals Monte Carlo Node Localization Based on Improved QUARTE Optimization

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Ling Song ◽  
Xiaoyu Jiang ◽  
Liying Wang ◽  
Xiaochun Hu
Keyword(s):  
Monte Carlo ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Sampling Area ◽  
Node Localization ◽  
Positioning Accuracy ◽  
Anchor Nodes ◽  
The Impact

Wireless sensor network (WSN) is a research hot spot of scholars in recent years, in which node localization technology is one of the key technologies in the field of wireless sensor network. At present, there are more researches on static node localization, but relatively few on mobile node localization. The Monte Carlo mobile node localization algorithm utilizes the mobility of nodes to overcome the impact of node velocity on positioning accuracy. However, there are still several problems: first, the demand for anchor nodes is large, which makes the positioning cost too high; second, the sampling efficiency is low, and it is easy to fall into the infinite loop of sampling and filtering; and third, the positioning accuracy and positioning coverage are not high. In order to solve the above three problems, this paper proposes a Monte Carlo node location algorithm based on improved QUasi-Affine TRansformation Evolutionary (QUATRE) optimization. The algorithm firstly selects the high-quality common nodes in the range of one hop of unknown nodes as temporary anchor nodes, and takes the temporary anchor nodes and anchor nodes as the reference nodes for positioning, so as to construct a more accurate sampling area; then, the improved QUATRE optimization algorithm is used to obtain the estimated location of unknown nodes in the sampling area. Simulation experiments show that the Monte Carlo node positioning algorithm based on the improved QUATRE optimization has higher positioning accuracy and positioning coverage, especially when the number of anchor nodes is relatively small.

scholarly journals An Efficient Localization Method for Mobile Nodes in Wireless Sensor Networks

2017 ◽  
Vol 13 (03) ◽  
pp. 160 ◽  
Author(s):  
Zhiyu Qiu ◽  
Lihong Wu ◽  
Peixin Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Monte Carlo ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Node Localization ◽  
Location Algorithm

<p style="margin: 1em 0px; -ms-layout-grid-mode: char;"><span style="font-family: Times New Roman; font-size: medium;">With the development of electronic technology and communication protocols, wireless sensor network technology is developing rapidly. In a sense, the traditional static wireless sensor network has been unable to meet the needs of new applications. However, the introduction of mobile nodes extends the application of wireless sensor networks, despite the technical challenges. Because of its flexibility, the mobile wireless sensor network has attracted great attention, and even small, self-controlled mobile sensor devices have appeared. At present, mobile node localization has become one of the hotspots in wireless sensor networks. As the storage energy of wireless sensor network nodes is limited, and the communication radius is small, many scientists have focused their research direction on the location algorithm of mobile nodes. According to the continuity principle of mobile node movement, in this paper we propose an improved mobile node localization algorithm based on the Monte Carlo Location (MCL) algorithm, and the method can reduce the sampling interval effectively. First of all, this paper introduces the structure and classification of wireless sensor localization technology. Secondly, the principle of the Monte Carlo Location algorithm is described in detail. Thirdly, we propose an efficient method for mobile node localization based on the MCL algorithm. Finally, the effectiveness and accuracy of the new algorithm are verified by comparative analysis.</span></p>

A Comparative Study of Range-Free and Range-Based Localization Protocols for Wireless Sensor Network

2020 ◽  
pp. 1522-1537 ◽  
Author(s):  
Essa Qasem Shahra ◽  
Tarek Rahil Sheltami ◽  
Elhadi M. Shakshuki
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Average Distance ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Military Operations ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Routing Tables ◽  
Range Free

Wireless Sensor Network is deployed in many fields including military operations, mechanical applications, human services, smart homes, etc. However, deploying WSN encounters many challenges. One of the challenges is localizing the node position, especially mobile targets in critical situations. In this paper, the authors compare two types from range-free localization algorithms and one type from range-based algorithms, namely: Received Signal Strength (RSS), Centroid, and Distance Vector Hop (DV-Hops) protocols, using Cooja simulator. RSS localization algorithms require determining values of the RSS from the anchor nodes around the mobile node, to calculate the distance between the unknown mobile and the first three anchor nodes in the mobile range. The centroid localization requires only three anchors to compute the location of the mobile sensor without the need for distance measuring. Lastly, the DV-Hop algorithm uses routing tables of each anchor in the network topology to compute the Average Distance of Hops. The results show that rang-based algorithms are more accurate than range-free.

scholarly journals Traffic Information Collection Using Wireless Sensor Network Positioning Technology

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Jinxi Zhang ◽  
Wenying Zhu ◽  
Xueying Wu ◽  
Tianshan Ma
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Sensor Technology ◽  
Application Research ◽  
Positioning Accuracy ◽  
Position Information ◽  
Anchor Nodes

The wireless sensor network integrates sensor technology, microelectromechanical technology, distributed information processing technology, and wireless communication technology. In order to solve this problem, this paper designs and proposes an anchor node self-location algorithm. Aiming at the positioning accuracy of wireless sensor network nodes, this paper proposes an improved algorithm for sensor network node positioning that uses error correction methods to reduce accumulated distance errors and positioning errors. In this paper, the designed routing algorithm is simulated and implemented, and the performance of the routing algorithm is evaluated based on different network topologies. From the analysis results, compared with the existing typical routing algorithms, the routing algorithms designed in this paper can effectively reduce the energy consumption of the network and prolong the lifetime of the network. The core of the algorithm is to integrate the known and available information of the system to locate unknown anchor nodes. This greatly reduces the number of anchor nodes whose initial position information is required by the system, and under the condition of less impact on the positioning accuracy of the system, the cost of the system is reduced and the scope of application of the system is improved. This paper has deeply studied the positioning and tracking problems in wireless sensor networks, including node positioning, biochemical gas source positioning, and target tracking, and designed and developed a platform for positioning and tracking application research to lay the foundation for further application research. In the study of the above problems, new methods of positioning and tracking with theoretical and practical value are proposed for different practical application scenarios, and the performance is verified and evaluated through computer simulation.

A Comparative Study of Range-Free and Range-Based Localization Protocols for Wireless Sensor Network

2017 ◽  
Vol 8 (1) ◽  
pp. 1-16 ◽  
Author(s):  
Essa Qasem Shahra ◽  
Tarek Rahil Sheltami ◽  
Elhadi M. Shakshuki
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Average Distance ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Military Operations ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Routing Tables ◽  
Range Free

Wireless Sensor Network is deployed in many fields including military operations, mechanical applications, human services, smart homes, etc. However, deploying WSN encounters many challenges. One of the challenges is localizing the node position, especially mobile targets in critical situations. In this paper, the authors compare two types from range-free localization algorithms and one type from range-based algorithms, namely: Received Signal Strength (RSS), Centroid, and Distance Vector Hop (DV-Hops) protocols, using Cooja simulator. RSS localization algorithms require determining values of the RSS from the anchor nodes around the mobile node, to calculate the distance between the unknown mobile and the first three anchor nodes in the mobile range. The centroid localization requires only three anchors to compute the location of the mobile sensor without the need for distance measuring. Lastly, the DV-Hop algorithm uses routing tables of each anchor in the network topology to compute the Average Distance of Hops. The results show that rang-based algorithms are more accurate than range-free.

AoSP-Based Secure Localization for Wireless Sensor Network

2020 ◽  
pp. 125-144
Author(s):  
Ankur Shrivastava ◽  
Nitin Gupta ◽  
Shreya Srivastav
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Signal Propagation ◽  
Multipath Fading ◽  
Wireless Sensor ◽  
Coordinate Frame ◽  
Angle Of Arrival ◽  
Node Localization ◽  
Secure Localization ◽  
Anchor Nodes

In wireless sensor network, node localization is helpful in reporting the event's origin, assisting querying of sensors, routing, and various cyber-physical system applications, where sensors are required to report geographically meaningful data for location-based applications. One of the accurate ways of localization is the use of anchor nodes which are generally equipped with global positioning system. However, in range-based approaches used in literature, like Angle of Arrival, the accuracy and precision decreases in case of multipath fading environment. Therefore, this chapter proposes an angle of signal propagation-based method where each node emits only two signals in a particular direction and knows its approximate position while receiving the second signal. Further, a method is proposed to define the coordinates of the nodes in reference to a local coordinate frame. The proposed method does the work with a smaller number of transmissions in the network even in the presence of malicious adversaries.

A Study of Mobile Node Localization Algorithm Based on Ranging MCL for WSN

2012 ◽  
Vol 182-183 ◽  
pp. 2012-2018
Author(s):  
Wei Dong Tang ◽  
Bai Liu ◽  
Chao Qun Zhang ◽  
Jin Zhao Wu
Keyword(s):  
Wireless Sensor Network ◽  
Simulation Analysis ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Motion Model ◽  
Localization Algorithm ◽  
Node Localization ◽  
Node Density ◽  
Positioning Accuracy ◽  
Key Technologies

Node localization is one of the key technologies in wireless sensor network. This paper proposed an improved RBDMCL algorithm based on traditional MCL algorithm, which can reduce the sampling areas and improve the positioning accuracy by building a node motion model. Then concludes by simulation analysis and comparison that RBDMCL has higher positioning accuracy than MCL in the anchor node density and node velocity.

Range-Free Localization Algorithm in Wireless Sensor Networks with Asymmetric Links

2013 ◽  
Vol 446-447 ◽  
pp. 1591-1595
Author(s):  
Hong Gang Zhao ◽  
Hao Shan Shi ◽  
Yong Hui Zhao
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Neighbor Discovery ◽  
Localization Algorithm ◽  
Positioning Accuracy ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Asymmetric Links ◽  
Range Free

Good positioning accuracy and coverage are important evaluation criterion for Wireless Sensor Network localization algorithm. DV-HOP is one of the classical range-free localization algorithms, which has good adaptivity and flexibility when node density (ND) and anchor density (AD) are both smaller. However, DV-HOP doesn't consider asymmetric links' influence in heterogeneous network, which is analyzed and proved as the main reason for poor positioning accuracy in DV-HOP. Then a Range-Free Localization Algorithm in Wireless Sensor Network with Asymmetric Links (RLAAL) is proposed, whose kernel mechanisms are Neighbor Discovery Algorithm (NDA) and Least Hops Acquiring Mechanism (LHAM). Every Node uses NDA to find all neighbors and uses LHAM to find least hops to Anchor nodes. Simulation results show that RLAAL can reduce asymmetric links' influence and have better positioning accuracy and coverage than DV-HOP.

Sign in / Sign up

Export Citation Format

Share Document