Font Size: a A A

Research On Node Localization And Target Coverage In Wireless Sensor Network

Posted on:2015-12-06Degree:MasterType:Thesis
Country:ChinaCandidate:H Q LiuFull Text:PDF
GTID:2348330518470368Subject:Signal and Information Processing
Abstract/Summary:PDF Full Text Request
Wireless sensor network (WSN) links the physical world and the transmission network.It is low-cost, fault tolerance and can perform long-term monitoring task, etc and widely used in military, environmental, medical and health care and business, etc. Node localization is an important supporting technology and coverage control technology is the theoretical basis in WSN. Location information is the premise of most applications. The data without location information is meaningless for most applications. Complete coverage to the monitoring area or target is the premise of achieving user service quality for WSN. Only reaching the coverage control requirements, it can ensure that the information obtained is comprehensive, reliable,and accurate. This paper makes a in-depth study on node localization and target coverage.This paper summarizes the results of previous studies and iterative average is proposed for error propagation in distributed iterative localization algorithm, it uses the population classification and dynamic learning factor particle swarm optimization (CDLPSO). It has fast convergence capability, and the boundary value of CDLPSO is set by experiment which can select a suitable evolution model for particle velocity, and through experiment simulation,it shows that the proposed method in the the positioning error and positioning time is better than PSO. According to the actual application, target coverage in heterogeneous sensor network in three-dimensional space is studied in this paper, for the genetic algorithm(GA) easily falling into local optimum, the chaotic local binary differential evolution algorithm (CLBDE) is proposed, and the chaotic map thinking is introduced which can make the initial population uniformly distribute in the search space, and a similar schedule is made for the part outstanding solution in the optimization late, through several simulation experiments and all targets meeting the coverage requirement, simulation results show that the proposed algorithm finds the minimum number of working sensor nodes than GA and binary difference algorithm from the common node maximum no effect radius, the attenuation factor, the number of target,coverage threshold and area size.
Keywords/Search Tags:WSN, Node Localization, Localization Error, Target Coverage, Working Node Number
PDF Full Text Request
Related items