Study On Coverage Control Strategy Based On Mobile Model For Wireless Sensor Networks

Wireless Sensor Networks are consisted of lots of micro sensor nodes with sensing,data processing and communication capabilities which were deployed in monitoringarea. In the industry, agriculture, military, medical and environmental protection fields,wireless sensor networks have broad application prospects. Coverage control, a basicproblem in quality of service for wireless sensor networks, aim to get the targetinformation with the sensor nodes and send the necessary information to the data centerwirelessly. The research of coverage control is the only way wireless sensor networksare from theory to practice because the coverage control responses the sensing capacityof wireless sensor network for monitoring area.Based on different wireless sensor networks deployment and monitoring objects, thispaper analyze and conclude the current research of coverage control for wireless sensornetworks. With the advent of new senerios, the present algorithms of coverage controlcan not meet the requirements because lots of researchs for coverage control are basedon static sensor networks. Against the above, this paper works on studing coveragecontrol stragety and designing the rule of nodes moving in order to improve theperformance of coverage control for wireless sensor networks in the condition offulfilling the task of monitoring the mobile target.In this paper, a strategy of coverage control based on the mobile mobile namedReference Center of Circle Mobile Model (RCCM) is proposed, after studing lots ofcorrelation algorithms used to barrier coverage. In this new mobile model, in order todetecting intruders who attempt to cross the monitoring region, all of sensor nodes dothe circumference sport around the same point which is the center of the monitoringarea. Considering the defects of RCCM, a node moving algortithm named NearestNeighbor Vitual Force Algorithm (NNVFA) is advised. The algorithm of NNVFA,which is a modified virual force algorithm, needs the mobile nodes finding their nearestneighbor node according the way the mobile nodes sense their neighbors. Then, themobile nodes do the moving based on the distance of the mobile node and their nearestneighbor.. of coverage control base on RCCM is better to find intruders than RWP in the sameconditions. And the relationships between detection time and node’s numbers, node’ssensor radius are analysed. Compare to the algorithm of RCCM, nodes is not required tokeep moving all the simulation time in the algorithm of NNVFA. In this strategy ofcoverage control, the performance of network coverage is improved as the probabilityof finding intruders is increased and the detection time is reduced.