2008
DOI: 10.1016/j.adhoc.2007.11.013
|View full text |Cite
|
Sign up to set email alerts
|

Sacrificing a little coverage can substantially increase network lifetime

Abstract: We present a simple, local protocol, pCover, which provides partial (but high)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
12
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 24 publications
(13 citation statements)
references
References 24 publications
1
12
0
Order By: Relevance
“…In (Wang & Kulkarni, 2008), the authors describe a localized protocol for the area coverage problem, called pCover. The protocol tries to maintain a high degree of coverage (over 90%), but it also produces an increased surveillance time compared to the full coverage approach.…”
Section: Partial Target Coveragementioning
confidence: 99%
See 2 more Smart Citations
“…In (Wang & Kulkarni, 2008), the authors describe a localized protocol for the area coverage problem, called pCover. The protocol tries to maintain a high degree of coverage (over 90%), but it also produces an increased surveillance time compared to the full coverage approach.…”
Section: Partial Target Coveragementioning
confidence: 99%
“…lifetime Wang et al (2006) (4) -no for target coverage Cardei, Wu, Lu & Pervaiz (2005) (1), adjustable Centralised & no sensing ranges distributed Cardei, Wu, Lu & Pervaiz (2005) (1), adjustable Centralised no sensing ranges Lu et al (2009) (1), adjustable Centralised & yes sensing ranges distributed Abrams et al (2004) (1), partial coverage Centralised & no for target coverage distributed Wang & Kulkarni (2008) (2), partial coverage Distributed no Yan et al (2003) (2), partial or Distributed no over-coverage Liu & Liang (2005) (1), partial coverage Centralised yes (3), Partial coverage Centralised yes Zhou et al (2004) (2), k-coverage Centralised & yes distributed Simon et al (2007) (2), k-coverage Centralised & no for target coverage distributed Hefeeda & Bagheri (2006) (1), k-coverage Centralised & no for target coverage distributed Vu et al (2006) (1), k-coverage Distributed no for target coverage Zhao & Gurusamy (2008a) (2), k-coverage Centralised yes Gu et al (2009) (1), Q-coverage Centralised no Cheng et al (2005) ( 1) Wireless Sensor Networks came into prominence around the start of this millennium motivated by the omnipresent scenario of small-sized sensors with limited power deployed in large numbers over an area to monitor different phenomenon. The sole motivation of a large portion of research efforts has been to maximize the lifetime of the network, where network lifetime is typically measured from the instant of deployment to the point when one of the nodes has expended its limited power source and becomes in-operational â€"…”
Section: Referencementioning
confidence: 99%
See 1 more Smart Citation
“…pCover [6] is a distributed approach which increases lifetime by trading it for reduced sensing coverage. Each node takes into the account the location of its neighbors.…”
Section: Related Workmentioning
confidence: 99%
“…-Heads may not collide on k ≥ 2 consecutive rounds. This is justifiable as, in the kind of applications our work is targeting, coverage [18] is important. Hence, it means that heads, thus clusters, will rarely be close to each other.…”
Section: An Adaptive Tdma-based Mac Protocolmentioning
confidence: 99%