<i>K</i>-Barrier Coverage With A Directional Sensing Model

Ssu, Kuo‐Feng; Wang, Wei-Tong; Wu, Fan; Wu, Tzu-Ting

doi:10.21307/ijssis-2017-339

Cited by 28 publications

(7 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [7], it is proved that contrary to prevalent belief that barrier coverage can not exist in thin long strips (because percolation does not occur in thin long strips), not only critical conditions, but reliable estimates of sensor density needed to achieve barrier coverage can be derived. Also, in [15], a heuristic is proposed to select a subset of directional sensors to achieve k-barrier coverage. These work, however, do not address the problem of lifetime maximization.…”

Section: Model Definitions and Backgroundmentioning

confidence: 99%

Maximizing the Lifetime of a Barrier of Wireless Sensors

Kumar

Lai

Posner³

et al. 2010

IEEE Trans. on Mobile Comput.

104

View full text Add to dashboard Cite

Abstract-To make a network last beyond the lifetime of an individual sensor, redundant sensors must be deployed. What sleep-wakeup schedule can then be used for individual sensors so that the redundancy is appropriately exploited to maximize the network lifetime?We develop optimal solutions to both problems for the case when wireless sensors are deployed to form an impenetrable barrier for detecting movements. In addition to being provably optimal, our algorithms work for non-disk sensing regions and heterogeneous sensing regions. Further, we provide an optimal solution for the more difficult case when the lifetimes of individual sensors are not equal.Developing optimal algorithms for both homogeneous and heterogeneous lifetimes allows us to obtain by simulation several interesting results. We show that even when an optimal number of sensors have been deployed randomly, statistical redundancy can be exploited to extend the network lifetime by up to seven times. We also use simulation to show that the assumption of homogeneous lifetime can result in severe loss (two-thirds) of the network lifetime. Although these results are specifically for barrier coverage, they provide an indication of behavior for other coverage models.Index Terms-Wireless sensor networks, sleep-wakeup, sensor deployment, barrier coverage, multi-route network flows.

show abstract

Section: Model Definitions and Backgroundmentioning

confidence: 99%

Maximizing the Lifetime of a Barrier of Wireless Sensors

Kumar

Lai

Posner³

et al. 2010

IEEE Trans. on Mobile Comput.

104

View full text Add to dashboard Cite

show abstract

“…A sensor network provides k-barrier coverage if it guarantees that every penetrating object is detected by at least k sensors before crossing the barrier of the sensors. Ssu et al in [66] by proposing a distributed algorithm for k-barrier coverage, argued that using directional antenna instead of omni-directional antenna in this problem results in fewer number of active nodes and more robust ability in constructing k-barrier coverage.…”

Section: K-coverage Providing Algorithmsmentioning

confidence: 99%

Deployment of a mobile wireless sensor network with k-coverage constraint: a cellular learning automata approach

Esnaashari

Meybodi

2012

Wireless Netw

View full text Add to dashboard Cite

Deployment of a wireless sensor network is a challenging problem, especially when the environment of the network does not allow either of the random deployment or the exact placement of sensor nodes. If sensor nodes are mobile, then one approach to overcome this problem is to first deploy sensor nodes randomly in some initial region within the area of the network, and then let the sensor nodes to move around and cooperatively and gradually increase the covered section of the area. Recently, a cellular learning automata-based deployment strategy, called CLA-DS, is introduced in literature which follows this approach and is robust against inaccuracies which may occur in the measurements of sensor positions or in the movements of sensor nodes. Despite its advantages, this deployment strategy covers every point within the area of the network with only one sensor node, which is not enough for applications with k-coverage requirement. In this paper, we extend CLA-DS so that it can address the k-coverage requirement. This extension, referred to as CLA-EDS, is also able to address k-coverage requirement with different values of k in different regions of the network area. Experimental results have shown that the proposed deployment strategy, in addition to the advantages it inherits from CLA-DS, outperforms existing algorithms such as DSSA, IDCA, and DSLE in covering the network area, especially when required degree of coverage differs in different regions of the network.

show abstract

“…Using sectors in the covers is still poorly studied subject matter, and there are a few publications on this topic [1, 4, 7-9, 13, 14, 17, 19-21]. A sensing area in the form of a sector is considered, for example, in barrier monitoring [20]. In [1] provided an overview of 3D and 2D directed devices, and in case 2D provides the coverage area in the form of a sector.…”

Section: Introductionmentioning

confidence: 99%

Covering the Plane with Equal Sectors

Erzin

Shabelnikova

Zalyubovskiy

2016

Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication

View full text Add to dashboard Cite

In the regular covers, a region in the plane is split into the equal regular polygons (tiles), and all the tiles are covered equally with some geometric figures. In this paper, a tile is an equilateral triangle. We proposed and analyzed the regular covers with equal sectors in which the number of sectors per unit area is minimal. The problem of minimizing the number of sectors per unit area is closely related to the problem of the least dense coverage, but does not coincide with it completely. We found the optimal number of sectors covering one tile in the case when every sector is involved in covering only one tile, and the vertices of the sectors which cover one tile are located in one point.The results can be used in different applications, for example, for design of the cost-effective sensor networks with equal directed sensors when the coverage area of the sensor is a sector.

show abstract

K-Barrier Coverage With A Directional Sensing Model

Cited by 28 publications

References 15 publications

Maximizing the Lifetime of a Barrier of Wireless Sensors

Maximizing the Lifetime of a Barrier of Wireless Sensors

Deployment of a mobile wireless sensor network with k-coverage constraint: a cellular learning automata approach

Covering the Plane with Equal Sectors

Contact Info

Product

Resources

About