Wireless Sensor Network Node Location Research Articles

3D Localization for Mobile Node in Wireless Sensor Network

Wireless sensor network (WSN) is an emerging technology that can detect, collect, and transmit information in a specific unknown area in an unknown environment. It is currently playing an increasingly important role in the fields of national defense, medical and health, and daily life. WSN node location information is extremely important in many WSN applications. The data information collected by WSN is developed based on known node location information. The node location is one of the important issues in WSNs. Location information is very important for wireless sensors. A WSN without sensor node location information is meaningless because almost all WSN applications need to know node location information, such as animal populations, tracking research, early warning of building fires, management of goods in warehouses, and traffic monitoring systems. Several research works are underway to expand the 2D positioning algorithm in WSN to 3D regardless of the deployment structure of sensor nodes. This paper proposes an improved Savarese algorithm to the problem of singularity in WSN node localization. The proposed algorithm is a modified version of the conventional Savarese algorithm, and it solves the singularity problem and improved the positioning accuracy. Simulation results show that the proposed algorithm effectively improved system performance, and the accuracy is improved over 2.83% and 2.96% than the existing algorithms. The proposed scheme is effective for indoor environments while it can be deployed outdoor for small-scale.

Three-Dimensional Localization Algorithm Based on Improved A and DV-Hop Algorithms in Wireless Sensor Network.

In the traditional wireless sensor networks (WSNs) localization algorithm based on the Internet of Things (IoT), the distance vector hop (DV-Hop) localization algorithm has the disadvantages of large deviation and low accuracy in three-dimensional (3D) space. Based on the 3DDV-Hop algorithm and combined with the idea of A* algorithm, this paper proposes a wireless sensor network node location algorithm (MA*-3DDV-Hop) that integrates the improved A* algorithm and the 3DDV-Hop algorithm. In MA*-3DDV-Hop, firstly, the hop-count value of nodes is optimized and the error of average distance per hop is corrected. Then, the multi-objective optimization non dominated sorting genetic algorithm (NSGA-II) is adopted to optimize the coordinates locally. After selection, crossover, mutation, the Pareto optimal solution is obtained, which overcomes the problems of premature convergence and poor convergence of existing algorithms. Moreover, it reduces the error of coordinate calculation and raises the localization accuracy of wireless sensor network nodes. For three different multi-peak random scenes, simulation results show that MA*-3DDV-Hop algorithm has better robustness and higher localization accuracy than the 3DDV-Hop, PSO-3DDV-Hop, GA-3DDV-Hop, and N2-3DDV-Hop.

Research on wireless sensor location technology for biologic signal measuring based on intelligent bionic algorithm

Biological signal measurement system based on wireless sensor network is a combination of traditional medical monitor and modern communication technology. It is of great significance for clinical application and the development of medical instruments, especially in family medical treatment. The application of intelligent bionic algorithm in wireless sensor network node location has become a hot topic in academic research. Traditional particle swarm optimization (PSO), as a common method to solve optimization problems, has great advantages in finding the optimal solution iteratively. However, the convergence speed of PSO cannot be adjusted dynamically according to the operation degree of the algorithm, therefore it is easy to go into the situation of finding the local optimal solution. To solve these above problems, this paper proposes a DV-Hop localization algorithm based on particle swarm bionic optimization, which improves the performance of traditional PSO algorithm from three aspects: population selection, inertia weight and learning factor. The simulation results show that, the algorithm can adjust the convergence speed dynamically, and jump out of the local optimal dilemma to the maximum extent, which improves the iterative accuracy of the algorithm for the biologic signal measuring system.

A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks

Wireless sensor networks (WSNs) with nodes spreading in a target area have abilities of sensing, computing, and communication. Since the GPS device is expensive, we used a small number of fixed anchor nodes that are aware of their locations to help estimate the locations of sensor nodes in WSNs. To efficiently route sensed data to the destination (the server), identifying the location of each sensor node can be of great help. We adopted a range-free color-theory based dynamic localization (CDL) [Shen-Hai Shee, Kuochen Wang, I.L. Hsieh, Color-theory-based dynamic localization in mobile wireless sensor networks, in: Proceedings of Workshop on Wireless, Ad Hoc, Sensor Networks, August 2005] approach, to help identify the location of each sensor node. Since sensor nodes are battery-powered, we propose an efficient color-theory-based energy efficient routing (CEER) algorithm to prolong the life time of each sensor node. The uniqueness of our approach is that by comparing the associated RGB values among neighboring nodes, we can efficiently choose a better routing path with energy awareness. Besides, the CEER has no topology hole problem. Simulation results have shown that our CEER algorithm can save up to 50-60% energy than ESDSR [Mohammed Tarique, Kemal E. Tepe, Mohammad Naserian, Energy saving dynamic source routing for ad hoc wireless networks, in: Proceedings of Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, April 2005, pp. 305-310] in mobile wireless sensor networks. In addition, the latency per packet of CEER is 50% less than that of ESDSR.