An Improved Node Localization Method for Wireless Sensor Network Based on PSO and Evaluation of Environment Variables

Node localization is an essential problem for some engineering applications in wireless sensor network (WSN). The problem characteristics of node localization in WSN are analyzed firstly, and then a framework and a strategy for the settings of important p

  • PDF / 302,801 Bytes
  • 9 Pages / 439.37 x 666.142 pts Page_size
  • 59 Downloads / 199 Views

DOWNLOAD

REPORT


Abstract. Node localization is an essential problem for some engineering applications in wireless sensor network (WSN). The problem characteristics of node localization in WSN are analyzed firstly, and then a framework and a strategy for the settings of important parameters are given to solve such problems with particle swarm optimization (PSO). Furthermore, the environment variable of WSN is evaluated and an improved node localization method of wireless sensor network based on PSO is proposed. In the proposed node localization method, the environment variable of WSN is evaluated during the process of ranging and the fitness function is designed according to the environment variable, and then the PSO algorithm is adopted to solve the node localization problem. Compared with the traditional methods, the experiments results show that the proposed method has good performance. Besides, we also discussed the relationship among the number of nodes, the number of failure nodes, the positioning error and the mean distance-measuring error. Keywords: Particle swarm optimization (PSO) · Wireless sensor network (WSN) · Node localization · Environment variable

1

Introduction

Wireless sensor network (WSN) is a network consisting of a series of sensor nodes, which can transmit information through wireless signal. In WSN, several base stations on the ground are used as data processing center to help process data. Sensor nodes of WSN can collect information in the region to be monitored according to specific requirements. However, the performance of each sensor node is limited in computing capacity, energy and transmission bandwidth. Node localization in WSN is a very critical issue, and it directly affects the efficiency of the entire network. According to different node localization methods, node localization in WSN can be divided into two categories: range based localization and non ranging based localization. Range based localization locates nodes by measuring the distance between nodes, while non ranging based localization locates nodes by network connectivity. In WSN, the nodes whose positions are known are called anchor nodes, and the others are called ordinary c Springer International Publishing Switzerland 2016  Y. Tan et al. (Eds.): ICSI 2016, Part II, LNCS 9713, pp. 324–332, 2016. DOI: 10.1007/978-3-319-41009-8 35

An Improved Node Localization Method for Wireless Sensor Network

325

nodes. The location of an ordinary node can be determined by measuring the distance between the ordinary node and the anchor nodes. The node localization problem in WSN can be described as an optimization problem [1]. Evolutionary computation is a method which can be applied to solving complex optimization problem [1,2]. And PSO algorithm is widely used to solve all kinds of complex optimization problems because it is easy to implement and has fast convergence rate. PSO algorithm has been introduced to solve the node localization problem in WSN [3,7]. However, most research used the basic PSO algorithm when selecting PSO variants. The setti