Node placement for optimal coverage in sensor networks

被引：0

作者：

Hou, Yung-Tsung ^{[1
]}

Lee, Tzu-Chen ^{[1
]}

Chen, Chia-Mei ^{[1
]}

Jeng, Bingchiang ^{[1
]}

机构：

[1] Natl Sun Yat Sen Univ, Dept Informat Management, Kaohsiung, Taiwan

来源：

IEEE INTERNATIONAL CONFERENCE ON SENSOR NETWORKS, UBIQUITOUS, AND TRUSTWORTHY COMPUTING, VOL 1, PROCEEDINGS | 2006年

关键词：

sensor networks; deployment; coverage; best-case coverage; worst-case coverage;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Wireless sensor networks provide an alternative way of improving our environments, such as environment surveillance, hazard monitoring and other customized environmental applications. Good coverage of service in a sensor network is an essential issue to ensure the service of quality. This paper studies the deployment of new sensor nodes so that the improvement of coverage is optimized. We propose an optimal polynomial time algorithm for this problem. Based on computational geometry and graph theory, we show the properties of such a deployment and the correctness of its optimality.

引用

页码：352 / +

页数：2

共 11 条

[1]

Cormen T. H., 1990, INTRO ALGORITHMS

[2] DELAUNAY GRAPHS ARE ALMOST AS GOOD AS COMPLETE GRAPHS [J].

DOBKIN, DP ;

FRIEDMAN, SJ ;

SUPOWIT, KJ .

DISCRETE & COMPUTATIONAL GEOMETRY, 1990, 5 (04) :399-407

[3]

FORTUNE S, 1992, COMPUTING EUCLIDEAN, P193

[4] A NEW STATISTICAL APPROACH TO GEOGRAPHIC VARIATION ANALYSIS [J].

GABRIEL, KR ;

SOKAL, RR .

SYSTEMATIC ZOOLOGY, 1969, 18 (03) :259-&

[5] Dynamic coverage in ad-hoc sensor networks [J].

Huang, H ;

Richa, AW ;

Segal, M .

MOBILE NETWORKS & APPLICATIONS, 2005, 10 (1-2) :9-17

[6] RELATIVE NEIGHBORHOOD GRAPHS AND THEIR RELATIVES [J].

JAROMCZYK, JW ;

TOUSSAINT, GT .

PROCEEDINGS OF THE IEEE, 1992, 80 (09) :1502-1517

[7]

Meguerdichian S, 2001, IEEE INFOCOM SER, P1380, DOI 10.1109/INFCOM.2001.916633

[8]

Meguerdichian S., 2001, 7 ANN INT C MOBILECO, P139

[9]

Savvides A., 2001, P 7 ANN INT C MOB CO

[10]

[No title captured]

← 1 2 →