In this paper, asymptotical k-coverage of a planar sensor network with a sensing sector assigned to each node/sensor is considered. Sufficient conditions of the node density for the complete k-covering with probability approaching 1 are proposed when nodes deployment forms a planar Poisson point process and the sensing area of each node only covers a sector of a certain angle. Both fixed and va...

—Deployment is an important issue in wireless sensor networks(WSNs). Most of recent researches focus on the optimal deployment patterns for full-coverage WSNs. In practice, there are only finite number of nodes can be used in WSNs applications, which cannot guarantee that the entire region can be monitored; On the other hand, the information generated from monitored objects is distributed uneve...

Consider the region L := {(x, y) : 0 ≤ y ≤ C log(1 + x), x > 0} for a constant C > 0. We study the percolation and coverage properties of this region. For the percolation properties we place a Poisson point process of intensity λ on the region L. At each point of the process we centre a box of a random side length ρ. In case ρ ≤ R for some fixed R > 0 we study the critical intensity λc of perco...

This paper develop a practical and energy-efficient distributed algorithm for the detection of coverage holes in a wireless sensor network. It assumes that the location of sensor nodes is available. We do this in two phases. First we want to identify a set of nodes of which encircle a coverage hole. This is done by introducing a concept of mono-covered arc, which represents the circumference of...

A wireless sensor network (WSN) is composed of a group of small power-constrained nodes with functions of sensing and communication, which can be scattered over a vast region for the purpose of detecting or monitoring some special events. The first challenge encountered in WSNs is how to cover a monitoring region perfectly. Coverage and connectivity are two of the most fundamental issues in WSN...

In wireless sensor networks, one of the fundamental issues is the coverage problem. This is, whether a given region can be sufficiently covered by sensing disks of sensors? In this paper, we discuss the coverage-hole problem by using a sensing topology. From the sensing topology, we figure out the relation between the graph Gn,n+i and coverage holes, and obtain that if m <3n/2-(5-(-1)n)/4, ther...

Intruder detection is an important application in Wireless Sensor Networks (WSNs). Barrier coverage, which requires much fewer sensors than full coverage, is broadly known as an appropriate model of coverage for such an application. However, previous works all focus on providing 1D barrier coverage on a thin belt region based on global network information. In this paper, we introduce the concep...