Font Size: a A A

Research On Coverage Hole Detection Algorithm Based On Confident Information Coverage Model In Wsn

Posted on:2018-05-21Degree:MasterType:Thesis
Country:ChinaCandidate:Z H ZouFull Text:PDF
GTID:2348330542467619Subject:Physical Electronics
Abstract/Summary:PDF Full Text Request
Network coverage can reflect the sensing degree of a sensing field by geographically distributed sensor nodes,and is one of appraising the important index about the performance of wireless sensor networks and the quality of service in wireless sensor networks,also can measure the critical factor of success in wireless sensor networks.The coverage and quality of service of the whole WSNs will be effected by producing coverage holes,therefore,the coverage hole problem has become a critical problem in the application of wireless sensor network.The coverage hole problem has become a hot and difficult problem in wireless sensor networks.Coverage hole detection is an important segmentation to solve the coverage holes problem.The method of coverage hole detection consists of two parts,firstly,the coverage model of individual sensor should be determined,secondly,we design the corresponding coverage holes detection algorithm and protocol based on the sensor coverage model.At present,the research on the coverage problem is still based on the node disk coverage model.The disk coverage model is an idealized model,which is too simplified,and it is difficult to accurately reflect the complex relationshipbetween the sensor sensing capability and physical attributes.Moreover,the disk model and its evolution model do not fully take the inherent spatial correlation of the physical attributes into account.In order to overcome the defects of the disk model and its evolution model,in this paper,we select and use the confident information coverage model as the basic node coverage model,and design an efficient algorithm to detect the confident information coverage holes.Based on confident information coverage model,this article designs the algorithm to consider two aspects that the algorithm includes the connectivity of sensors and the residual energy of the node.The following algorithms are designed to detect the confident information coverage holes.(1)The coverage hole detection(CHD)algorithm does not consider the node connectivity,and does not take the residual energy of sensor nodes to detect coverage holes into account.In order to verify and evaluate the performance of CHD algorithm,we carried out a series of simulation experiments,the experimental results show that the CHD algorithm can accurately detect the number of confident information coverage holes and determine its location information,and the performance of CHD algorithm outperform peer algorithm in terms of the coverage hole detection.(2)Two algorithms are proposed based on the sensor connectivity.An algorithm does not consider the residual energy of sensor,namely the connectivity-based coverage hole detection(CCHD)algorithm.Anotheralgorithm does consider residual energy of sensor,namely the connectivity-based coverage hole detection considering residual energy(CCHDRE)algorithm.And the performance of CCHD algorithm and CCHDRE algorithm is evaluated and validated by a series of simulation experiments.The simulation experiment results show that CCHD algorithm and CCHDRE algorithm are not only can accurately detect all confident information coverage holes but CCHDRE algorithm can reduce the cost in practical application,and the performance is better than the peer algorithms.
Keywords/Search Tags:wireless sensor networks, coverage problem, sensor coverage model, confident information coverage hole detection algorithm
PDF Full Text Request
Related items