Multihop Localization Algorithms (MLAs) are an efficient alternative to traditional message-passing methods in multihop wireless networks in terms of communication costs, robustness to mobility and location privacy to end users. However MLAs are accurate only under particular network conditions (high number of anchor nodes, isotropic topologies, etc . . . ) therefore up to now they have not been widely used. In this paper we analyze the causes of this behaviour through a comparison of different schemes. We therefore introduce a new MLA based on Semidefinite Programming (SDP) which results to be highly robust when inaccurate range information are present.
S. Severi, G. Abreu, D. Dardari (2010). A quantitative comparison on multihop algorithms. s.l : s.n [10.1109/WPNC.2010.5653925].
A quantitative comparison on multihop algorithms
SEVERI, STEFANO;DARDARI, DAVIDE
2010
Abstract
Multihop Localization Algorithms (MLAs) are an efficient alternative to traditional message-passing methods in multihop wireless networks in terms of communication costs, robustness to mobility and location privacy to end users. However MLAs are accurate only under particular network conditions (high number of anchor nodes, isotropic topologies, etc . . . ) therefore up to now they have not been widely used. In this paper we analyze the causes of this behaviour through a comparison of different schemes. We therefore introduce a new MLA based on Semidefinite Programming (SDP) which results to be highly robust when inaccurate range information are present.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
