File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/SAHCN.2006.288510
- Scopus: eid_2-s2.0-44049083006
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Distance matrix reconstruction from incomplete distance information for sensor network localization
Title | Distance matrix reconstruction from incomplete distance information for sensor network localization |
---|---|
Authors | |
Issue Date | 2007 |
Citation | 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006, 2007, v. 2, p. 536-544 How to Cite? |
Abstract | This paper focuses on the principled study of distance reconstruction for distance-based node localization. We address an important issue in node localization by showing that a highly incomplete set of inter-node distance measurements obtained in ad-hoc node deployments carries sufficient information for the accurate reconstruction of the missing distances, even in the presence of noise and sensor node failures. We provide an efficient and provably accurate algorithm for this reconstruction, and we show that the resulting error is bounded, decreasing at a rate that is inversely proportional to √n, the square root of the number of nodes in the region of deployment. Although this result is applicable to many localization schemes, in this paper we illustrate its use in conjunction with the popular MultiDimensional Scaling algorithm. Our analysis reveals valuable insights and key factors to consider during the sensor network setup phase, to improve the quality of the position estimates. © 2006 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/254514 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Drineas, P. | - |
dc.contributor.author | Javed, A. | - |
dc.contributor.author | Magdon-Ismail, M. | - |
dc.contributor.author | Pandurangan, G. | - |
dc.contributor.author | Virrankoski, R. | - |
dc.contributor.author | Savvides, A. | - |
dc.date.accessioned | 2018-06-19T15:40:45Z | - |
dc.date.available | 2018-06-19T15:40:45Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006, 2007, v. 2, p. 536-544 | - |
dc.identifier.uri | http://hdl.handle.net/10722/254514 | - |
dc.description.abstract | This paper focuses on the principled study of distance reconstruction for distance-based node localization. We address an important issue in node localization by showing that a highly incomplete set of inter-node distance measurements obtained in ad-hoc node deployments carries sufficient information for the accurate reconstruction of the missing distances, even in the presence of noise and sensor node failures. We provide an efficient and provably accurate algorithm for this reconstruction, and we show that the resulting error is bounded, decreasing at a rate that is inversely proportional to √n, the square root of the number of nodes in the region of deployment. Although this result is applicable to many localization schemes, in this paper we illustrate its use in conjunction with the popular MultiDimensional Scaling algorithm. Our analysis reveals valuable insights and key factors to consider during the sensor network setup phase, to improve the quality of the position estimates. © 2006 IEEE. | - |
dc.language | eng | - |
dc.relation.ispartof | 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006 | - |
dc.title | Distance matrix reconstruction from incomplete distance information for sensor network localization | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/SAHCN.2006.288510 | - |
dc.identifier.scopus | eid_2-s2.0-44049083006 | - |
dc.identifier.volume | 2 | - |
dc.identifier.spage | 536 | - |
dc.identifier.epage | 544 | - |