| Wireless sensor networks (WSN) are emerging as an effective means for environ-ment monitoring. A typical large-scale WSN consists of thousands of sensor nodeswhich are low-cost, low-power, multi-functional and can sense environment, performdata processing and communicate with each other over short distances. Wide rangeof potential application have been envisioned using WSN, such as surveillance in mil-itary and battle-fields, smart home and offices. The notion of area of coverage canbe considered as a measure of the quality of service in sensor network, it is signif-icant to design efficient node coverage strategies that would reduce communicationand computation, prolong the lifetime of the network. Along with the coverage, thenotion of network connectivity is equally fundamental to a sensor network. In this pa-per, we investigate the sensing coverage and network connectivity problem, especiallythe saving network energy strategy through coverage control. The main works are asfollows:(1) We introduce the notion of Voronoi diagram, in particular describe the notionof k-th order Voronoi diagram and prove the important property which is the theoreti-cal basis in network coverage-connectivity.(2) There are a wide range of applications about detection algorithm . Basedon the dual of Delaunay triangulation property, we proposed an algorithm for two-dimensional point deletion in Voronoi diagram which is a efficient way in the require-ments of dynamically updating the Voronoi diagram.(3) In different applications, it is varied for the requirements of coverage degree.It is necessary to determine the coverage degree. We proposed a k-th order Voronoi-based coverage degree algorithm which can result in network resources'optimal allo-cation.(4) It is a important requirement to saving the network energy in WSN. We focuson the constructing minimum connected cover set based on k-th order Voronoi dia-gram, which is discussed in two cases: under the condition of Rc≥2Rs and withoutthis condition. |
PDF Full Text Request