TY - GEN
T1 - Sampling based sensor-network deployment
AU - Isler, Volkan
AU - Kannan, Sampath
AU - Daniilidis, Kostas
PY - 2004
Y1 - 2004
N2 - In this paper, we consider the problem of placing networked sensors in a way that guarantees coverage and connectivity. We focus on sampling based deployment and present algorithms that guarantee coverage and connectivity with a small number of sensors. We consider two different scenarios based on the flexibility of deployment If deployment has to be accomplished in one step, like airborne deployment, then the main question becomes how many sensors are needed. If deployment can be implemented in multiple steps, then awareness of coverage and connectivity can be updated. For this case, we present incremental deployment algorithms which consider the current placement to adjust the sampling domain. The algorithms are simple, easy to implement, and require a small number of sensors. We believe the concepts and algorithms presented in this paper will provide a unifying framework for existing and future deployment algorithms which consider many practical issues not considered in the present work.
AB - In this paper, we consider the problem of placing networked sensors in a way that guarantees coverage and connectivity. We focus on sampling based deployment and present algorithms that guarantee coverage and connectivity with a small number of sensors. We consider two different scenarios based on the flexibility of deployment If deployment has to be accomplished in one step, like airborne deployment, then the main question becomes how many sensors are needed. If deployment can be implemented in multiple steps, then awareness of coverage and connectivity can be updated. For this case, we present incremental deployment algorithms which consider the current placement to adjust the sampling domain. The algorithms are simple, easy to implement, and require a small number of sensors. We believe the concepts and algorithms presented in this paper will provide a unifying framework for existing and future deployment algorithms which consider many practical issues not considered in the present work.
UR - http://www.scopus.com/inward/record.url?scp=14044252227&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=14044252227&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:14044252227
SN - 0780384636
T3 - 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
SP - 1780
EP - 1785
BT - 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
T2 - 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
Y2 - 28 September 2004 through 2 October 2004
ER -