Target Coverage Deployment Based On Adjustable Sensing Radius Model In Wireless Sensor Network

With the widespread deployment and application of sensors in real life,Wireless Sensor Networks(WSNs)have attracted the attention and research of many researchers.Coverage is an important parameter of WSNs,as it determines how well a region of interest is monitored.There are currently three main types of coverage problems in existing literature:regional coverage,target coverage and barrier coverage.Among them,the connected target coverage problem is a sub-problem in the target coverage problem.It mainly considers how to schedule the working state of the sensor so that a limited set of target points in the network area can be effectively monitored,and the monitoring information can be efficiently transmitted to the sink node.Adjusting the sensor's sensing ranges is a relatively energy-saving technique.By reasonably selecting the sensor's sensing radius,many unnecessary energy wastes can be reduced.However,in the adjustable sensing radius model,the sensor can only select one sensing radius to working,otherwise it will cause the radius conflict.In this case,in the existing research,the solution based on the fixed sensing radius model will no longer be applicable to the adjustable sensing radius model.In the research on the adjustable perceptual radius,the research mainly focuses on the target coverage problem with the 0/1 sensing model.There are still many blank areas compared to the fixed sensing radius model.Combined with the adjustable sensing radius model,the main research work of this dissertation is as follows:(1)In order to enhance the fault tolerance of the network,this dissertation considers the target k-coverage requirement,that is,each target point is covered by at least k sensors.This dissertation uses a 0/1 sensing model with adjustable radius and propose the Adjustable Radius Maximum Lifetime Connected target k-Coverage problem for the first time,aims to maximizing network lifetime by scheduling the working state and working radius of the sensor in multiple rounds.This dissertation proves that the problem is NP-hard problem,so two heuristic algorithms are designed and the theoretical analysis of the algorithm is given.This dissertation demonstrates the high performance of the algorithm based on C++programming on the CodeBlocks platform.(2)Considering that the 0/1 sensing model is too idealized,this dissertation adopts a probabilistic sensing model that is closer to the practical application.Combined with the adjustable sensing radius model,the Probabilistic sensor with Adjustable Radius-based Minimum Energy Connected ?-Coverage problem is proposed for the first time.This dissertation proves that the problem is also NP-hard problem,so two heuristic algorithms are designed and the theoretical analysis of the algorithm is given.This dissertation demonstrates the high performance of the algorithm based on C++programming on the CodeBlocks platform.