2009 WRI International Conference on Communications and Mobile Computing 2009
DOI: 10.1109/cmc.2009.231
|View full text |Cite
|
Sign up to set email alerts
|

Research on Optimal Coverage Problem of Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2010
2010
2015
2015

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…Optimal deployment of sensors is achieved when all sensors have the same equal sensing radius. Moreover, the boundary of sensing field should have a regular shape and there are no obstacles in the sensing field [20]. The optimal deployment is achieved by deploying sensors regularly with same threshold distance ( d th ) between them.…”
Section: Analytical Optimal Deploymentmentioning
confidence: 99%
“…Optimal deployment of sensors is achieved when all sensors have the same equal sensing radius. Moreover, the boundary of sensing field should have a regular shape and there are no obstacles in the sensing field [20]. The optimal deployment is achieved by deploying sensors regularly with same threshold distance ( d th ) between them.…”
Section: Analytical Optimal Deploymentmentioning
confidence: 99%
“…Sensor Deployments Based on Square 1) Four sensors at four vertexes of the square(its edge length is equal to r) [2] have proved that the sensor deployment illustrated in Fig. 9 [ 2 ] of the large gray field in Fig. 10 is S = S x 4 = 2;r -3Jj rZ Z 1 6 (9) (10) Fig.…”
Section: Sensor Deploymentsmentioning
confidence: 99%
“…The coverage problem is also one of basic problem in wireless sensor networks. References [1], [2] give the analysis formula of the minimum number of nodes, the maximum efficient coverage area and its ratio, the maximum of net efficient coverage area of nodes and the maximum of net efficient coverage area ratio of nodes under the condition of seamless coverage. By analyzing both the deployments and considering different coverage redundancy requirement for different applications, the documents [3], [4], [5] proposes Virtual Rhomb Grid-based Movement-assisted Sensor Deployment algorithm (VRGMSD), k-variable Movement-assisted Sensor Deployment based on Virtual Rhomb Grid (kMSDVRG) and the s-Redundant Movement-assisted Sensor Deployment based on Virtual Rhomb Grid (sMSDVRG).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Typical determin schemes model the sensing/target area as grid and place sensors on the vertices of regular triangular [1], hexagon, and square patterns [2] In order to achieve desired coverage and co same time, some evolving patterns (e.g., Di improved placement schemes are proposed ratios ⁄ of sensor communication radius over sensing radius (denoted by ) [3][4][5][6][7][8][9].…”
Section: Introductionmentioning
confidence: 99%