Research Of The K-coverage Algorithms Of The Best-support Path In The WSN

Coverage problem in wireless sensor networks is the core content to ensure quality of service (Qos). Scholars Meguerdichian, and others made the "maximal breach path" and "maximal support path" is a fence typical problems of WSN coverage. k-coverage has bring the research focus in the WSN coverage and control theory.However, applying the concepts of two paths to the conditions under the requirement of k-coverage has not been considered, and the study for solve its coverage characteristics has not yet started.In this thesis, work is under the special require of the k-coverage conditions, through a specific algorithm for wireless sensor networks in the worst-case and best case of two special path-" maximal breach path " and the "maximum support path". Research the relationship among the number of nodes n,coverage multiplicity k,the node sensing radius r above the two paths. This work can give help in wireless sensor network nodes deployment and management in the future, and network architecture planning for reference and guidance.