Font Size: a A A

Research On Coverage Control In Wireless Sensor Networks

Posted on:2014-01-02Degree:MasterType:Thesis
Country:ChinaCandidate:J Q ZhangFull Text:PDF
GTID:2248330395484282Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
Wireless Sensor Networks (WSNs) play an important role in next generation networks, WSNshave become a primary focus of science studies. The purpose of COVERAGE CONTROL isoptimazing network resource, in order to accomplish the environmental awareness and capture theinformation as better as possible, which is the foundation of keeping on the whole monitoringtask.In this dissertation, we mainly focus on coverage control problems in wireless sensornetworks. The outline of this dissertation is described as follows:(1) This paper proposes a self-organizing algorithm for enhancing the coverage for WSNs,which is so-called Ionic bond-directed particle swarm optimization (IBPSO). The proposedalgorithm combines the ionic bond method with particle swarm optimization (PSO), where ionicbond method uses a judicious ionic bond between two sensor nodes to determine which nodeneeds to move and also the path and direction of the movement and PSO is suitable for solvingmulti-dimension function optimization in continuous space.(2) The main study of traditional probability coverage problem in wireless sensornetworks(WSNs) is aiming at two-dimensional space, however, most practical applications ofwireless sensor network is placed in a three-dimensional sensor networks. Therefore, probabilitymodel is introduced for three-dimensional WSNs. This paper presents a method that usingVoronoi divide to control the Scheduling of the probability model nodes in the target area. Also, acoverage control algorithm based on probability model (PMCCA) is proposed.We verify the effectiveness and the practice of PMCCA algorithm and IBPSO algorithmrespectively by comparing them to other algorithms in simulation experiments.
Keywords/Search Tags:Wireless sensor networks, Coverage control, Ionic bond, Particle swarm optimization, Node scheduling, three-dimensional coverage, Probability model, Voronoi divide
PDF Full Text Request
Related items