2006
DOI: 10.1080/15501320600719151
|View full text |Cite
|
Sign up to set email alerts
|

Coverage Strategies in Wireless Sensor Networks

Abstract: An energy efficient cover of a region using

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
23
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 46 publications
(23 citation statements)
references
References 44 publications
0
23
0
Order By: Relevance
“…Commuri et al [22] gives details of series of simulated design experiments which demonstrate the energy efficiency of bcc lattice-based deployment strategy compared to random deployment of sensor networks. The work entails different simulated scenarios.…”
Section: 7889rmentioning
confidence: 99%
See 2 more Smart Citations
“…Commuri et al [22] gives details of series of simulated design experiments which demonstrate the energy efficiency of bcc lattice-based deployment strategy compared to random deployment of sensor networks. The work entails different simulated scenarios.…”
Section: 7889rmentioning
confidence: 99%
“…Failure of a single node in reduced coverage network will result in loss of coverage in 3D WSN field. Since reduced coverage deployment strategy is based on bcc lattice pattern, the work in [22] also deduces that number of nodes required to cover a 3D field is less using bcc lattice-based deployment strategies as opposed to randomly deployed WSNs. Similar Fig.…”
Section: 7889rmentioning
confidence: 99%
See 1 more Smart Citation
“…In the last years, many schemes and solutions have been proposed to improve network performance by placing wireless relays in specific positions [11,12]. The most common objectives are energy consumption and coverage as presented in [4,[13][14][15][16][17].…”
Section: Related Workmentioning
confidence: 99%
“…Compute link parameter for Next and Prev hops; (5) if (RTT next > RTT prev ) then (6) Move towards the Next hop; (7) else if (RTT next < RTT prev ) then (8) Move towards the Prev hop; (9) else (10) Do not move; (11) end if (12) set TIMER to expire in time k × ProbePeriod; (13) end if (14) end while Algorithm 1: APA (adaptive positioning algorithm). more realistic since in real environments, some geographical positions cannot be considered as a suitable position due to potential obstacles, for example, a wireless mobile device cannot cross a vehicles road.…”
Section: Move To Newmentioning
confidence: 99%