Research On Mobile Sensor Relocation Algorithm Based On Confident Information Coverage Model In WSNs

With the development of sensor technology,communication technology and robot technology,mobile wireless sensor networks(Mobile Wireless Sensor Network,M-WSNs)have become a new type of sensor network with high fidelity,sensor position adjustment,sensor mobility control,network deployment flexibility,etc.The advantages are of concern to industry and academia.Nodes with mobility capabilities are widely used in battlefield reconnaissance,forest patrol,medical monitoring,smart home and other application scenarios.Due to the uneven distribution of nodes randomly deployment or the exhaustion of node energy,resulting in coverage holes or node failures,it is particularly important to relocate nodes to repair holes or replace failed nodes.Sensor relocation problem is one of the key research issues in mobile wireless sensor networks.In the traditional network coverage algorithm,in order to ensure that the network can cover the entire target area,sensor nodes are randomly deployed in the target area.However,after such a deployment method,a target area is covered by multiple nodes,resulting in coverage redundancy.So redundant nodes are used to fully solve node failure or coverage holes.This paper studies the problem of node relocation in mobile wireless sensor networks to balance network coverage and node energy consumption.The main tasks include:1)This paper uses the novel Confident Information Coverage(CIC)model as the coverage model,and points out the problem of Confident Information Coverage Sensor Relocation(CICSR).Selecting some random distributed redundant sensors to repair coverage holes or failed nodes,suggested using cascaded movement to relocate redundant sensors in an efficient and balanced manner.The simulation results show that the CIC-ESTSA(CIC-Energy Saving and Time Saving algorithm)algorithm is 53.10% higher than the CIC-DRA(CIC-Direct Replacement Algorithm)algorithm in the relocation time,while the total energy consumption of the CIC-DRA algorithm is 32 times that of CIC-ESTSA,which makes the network lifetime of the CIC-ESTSA algorithm more than CIC-DRA algorithm has increased by 16.53%.2)In this paper,a TSP-based robot-assisted relocation(RASR)region coverage problem is developed to achieve Confident Information Coverage(CIC)through cooperative sensing and information fusion between adjacent sensors.This is called CIC-RASR issue.In order to solve the CIC-RASR problem,a robot assisted sensor relocation of CIC-based centralized genetic method(Centralized Genetic algorithm to Robot-assisted Sensor Relocation based on CIC,CGA-CIC-RASR)algorithm are proposed.This algorithm uses the Hungarian method to achieve the optimal matching between redundant nodes and holes,and then uses the Genetic Algorithm to obtain the shortest path of the robot.The experimental results show that the CGA-CIC-RASR algorithm saves 72.26% of the robot's trajectory length,and the coverage ratio is significantly 100% faster than the Random algorithm.