2010
DOI: 10.1109/tmc.2010.78
|View full text |Cite
|
Sign up to set email alerts
|

Maximizing the Lifetime of a Barrier of Wireless Sensors

Abstract: 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 heterogen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
72
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 104 publications
(73 citation statements)
references
References 22 publications
1
72
0
Order By: Relevance
“…In this paper, we extend the results of Kumar et al [13] who proposed an optimal solution to achieving k-barrier coverage without energy harvesting. The solution also has applications in achieving coverage in non-disk sensing regions and heterogeneous sensing regions as it is based on a coverage graph.…”
Section: Related Worksupporting
confidence: 62%
See 1 more Smart Citation
“…In this paper, we extend the results of Kumar et al [13] who proposed an optimal solution to achieving k-barrier coverage without energy harvesting. The solution also has applications in achieving coverage in non-disk sensing regions and heterogeneous sensing regions as it is based on a coverage graph.…”
Section: Related Worksupporting
confidence: 62%
“…For this application, barriers made of sensors are set up to detect intruders' crossing of the barriers. The k-barrier coverage problem is to set up k disjoint barriers in a wireless sensor network with an objective of achieving the longest operation time [12], [13]. The network lifetime for k-barrier coverage is the longest time of having k operational disjoint barriers.…”
mentioning
confidence: 99%
“…A number of barrier coverage problems with respect to power issue have been explored in recent years [21]- [23]. Sensor scheduling [24], [25] is a widely used method to prolong the lifetime of networks. It helps to extend the lifetime of networks by inactivating some sensors while satisfying the coverage requirement.…”
Section: Related Workmentioning
confidence: 99%
“…The barrier coverage problem has been widely studied in the literature for static WSNs [1], [2], [14], [15], just to mention some of the most representative works. In this section we 978-1-4244-9268-8/11/$26.00 ©2011 IEEE only consider previous works on barrier coverage with mobile sensors due to space limitations.…”
Section: Related Workmentioning
confidence: 99%