File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Distance matrix reconstruction from incomplete distance information for sensor network localization

TitleDistance matrix reconstruction from incomplete distance information for sensor network localization
Authors
Issue Date2007
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?
AbstractThis 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 Identifierhttp://hdl.handle.net/10722/254514

 

DC FieldValueLanguage
dc.contributor.authorDrineas, P.-
dc.contributor.authorJaved, A.-
dc.contributor.authorMagdon-Ismail, M.-
dc.contributor.authorPandurangan, G.-
dc.contributor.authorVirrankoski, R.-
dc.contributor.authorSavvides, A.-
dc.date.accessioned2018-06-19T15:40:45Z-
dc.date.available2018-06-19T15:40:45Z-
dc.date.issued2007-
dc.identifier.citation2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006, 2007, v. 2, p. 536-544-
dc.identifier.urihttp://hdl.handle.net/10722/254514-
dc.description.abstractThis 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.languageeng-
dc.relation.ispartof2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006-
dc.titleDistance matrix reconstruction from incomplete distance information for sensor network localization-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/SAHCN.2006.288510-
dc.identifier.scopuseid_2-s2.0-44049083006-
dc.identifier.volume2-
dc.identifier.spage536-
dc.identifier.epage544-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats