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.

scholarly journals V2X-Based Mobile Localization in 3D Wireless Sensor Network

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Iram Javed ◽  
Xianlun Tang ◽  
Kamran Shaukat ◽  
Muhammed Umer Sarwar ◽  
Talha Mahboob Alam ◽  
...  
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Three Dimensional ◽  
Link Quality ◽  
Wireless Sensor ◽  
Localization Error ◽  
Localization Algorithm ◽  
Position Information ◽  
Mobile Anchor ◽  
Anchor Nodes

In a wireless sensor network (WSN), node localization is a key requirement for many applications. The concept of mobile anchor-based localization is not a new concept; however, the localization of mobile anchor nodes gains much attention with the advancement in the Internet of Things (IoT) and electronic industry. In this paper, we present a range-free localization algorithm for sensors in a three-dimensional (3D) wireless sensor networks based on flying anchors. The nature of the algorithm is also suitable for vehicle localization as we are using the setup much similar to vehicle-to-infrastructure- (V2I-) based positioning algorithm. A multilayer C-shaped trajectory is chosen for the random walk of mobile anchor nodes equipped with a Global Positioning System (GPS) and broadcasts its location information over the sensing space. The mobile anchor nodes keep transmitting the beacon along with their position information to unknown nodes and select three further anchor nodes to form a triangle. The distance is then computed by the link quality induction against each anchor node that uses the centroid-based formula to compute the localization error. The simulation shows that the average localization error of our proposed system is 1.4 m with a standard deviation of 1.21 m. The geometrical computation of localization eliminated the use of extra hardware that avoids any direct communication between the sensors and is applicable for all types of network topologies.

INVESTIGATING A WIRELESS SENSOR NETWORK OPTIMAL LIFETIME SOLUTION FOR LINEAR TOPOLOGIES

2006 ◽  
Vol 07 (01) ◽  
pp. 91-99 ◽  
Author(s):  
Keith Hellman ◽  
Michael Colagrosso
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Nearest Neighbor ◽  
Analytic Solution ◽  
Routing Algorithm ◽  
Optimal Solution ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Global Knowledge ◽  
Alternative Solutions

We investigate a known optimal lifetime solution for a linear wireless sensor network through simulation, and propose alternative solutions where a known optimal solution does not exist. The network is heterogeneous in the sensors' energy distribution and also in the amount of data each sensor must communicate. As a basis for comparison, we analyze the lifetime of a network using a simple, nearest-neighbor routing algorithm, and an analytic solution to the optimal lifetime of networks meeting certain constraints. Alternative solutions considered range from those requiring global knowledge of the network to solutions using only next-neighbor knowledge. We compare the performance of all the routing algorithms in simulation.

A Wireless Sensor Network Routing Algorithm Based on Zigbee

2014 ◽  
Vol 513-517 ◽  
pp. 1845-1849
Author(s):  
Hua Rui Wu ◽  
Li Zhu
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Large Scale ◽  
Routing Algorithm ◽  
Network Routing ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Quantitative Relation ◽  
Analysis Model

Routing strategy with effective and saving energy is an important problem in the research on the application of wireless sensor network into the farmland micro climate and soil moisture monitoring,it analyzed the disadvantage of the layered tree routing algorithm and ZigBee routing algorithms in energy saving, combined with ZigBee network topology,establishing an optimal node analysis model based on fuzzy decision, bringing forward a new routing algorithm which is suitable for large-scale farmland gradient environment, this new algorithm find out the quantitative relation between energy consumption and routing node selecting strategy,which can greatly decrease the route hop number by routing discovery mechanism and create an optimum goal group. Simulation results showed that compared with the layered tree and ZigBee routing algorithms,the new routing algorithms can significantly reduce the energy consumption of routing process.

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.

The Research of Sensors’ Interface on Wireless Sensor Network

2014 ◽  
Vol 926-930 ◽  
pp. 2630-2633
Author(s):  
Dan Su
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Communication Technology ◽  
Wireless Sensor ◽  
Sensor Technology ◽  
Application Research ◽  
Sensor Interface ◽  
Ieee 1451 ◽  
Microelectronics Technology ◽  
Technology And Communication

Sensor technology is the key technology in industrial application and scientific research. With the progress of microelectronics technology, computer technology and communication technology, determining how to connect various sensors and various networks freely becomes a new problem in the field of sensor application research. In this paper, first I introduced several important modules that IEEE 1451 standard has defined, then I analyzed concepts and models of intelligence sensor interface in IEEE 1451. Finally I build a model which is more suitable to wireless sensor network.

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.

Small world routing algorithm of wireless sensor network

2010 ◽  
Vol 30 (9) ◽  
pp. 2497-2500
Author(s):  
Xiu-li REN ◽  
Jiang-ying DONG ◽  
Jian-sheng XUE
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Small World ◽  
Wireless Sensor
Sign in / Sign up

Export Citation Format

Share Document