The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A localização é um problema importante para Redes de Sensores Sem Fio (RSSF). O método de localização pode ser categorizado como esquemas sem alcance ou baseados em alcance. Como os nós sensores são geralmente baratos e pequenos, os esquemas baseados em alcance que requerem unidades de medição de alcance são inadequados em RSSF. O algoritmo DV-hop é um dos algoritmos de localização sem alcance no qual a distância média de salto e a contagem de saltos são usadas para estimativa de alcance. Mas requer um alto custo de comunicação se o número de nós aumentar na rede. Portanto, propomos um algoritmo simples para reduzir o custo de comunicação e seu desempenho é verificado através de simulações computacionais.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Sunwoo KIM, Byeong-Tae LEE, "Scalable DV-Hop Localization Algorithm with Constrained Multilateration for Wireless Sensor Network" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 10, pp. 3075-3078, October 2009, doi: 10.1587/transcom.E92.B.3075.
Abstract: Localization is an important problem for Wireless Sensor Networks (WSN). The localization method can be categorized as range-free or range-based schemes. Since sensor nodes are usually cheap and small, the range-based schemes that require range measurement unit are unsuitable in WSN. The DV-hop algorithm is one of the range-free localization algorithms in which average hop-distance and hop counts are used for range estimation. But it requires heavy communication cost if the number of nodes increases in the network. Therefore, we propose a simple algorithm to reduce the communication cost and its performance is verified via computer simulations.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.3075/_p
Copiar
@ARTICLE{e92-b_10_3075,
author={Sunwoo KIM, Byeong-Tae LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Scalable DV-Hop Localization Algorithm with Constrained Multilateration for Wireless Sensor Network},
year={2009},
volume={E92-B},
number={10},
pages={3075-3078},
abstract={Localization is an important problem for Wireless Sensor Networks (WSN). The localization method can be categorized as range-free or range-based schemes. Since sensor nodes are usually cheap and small, the range-based schemes that require range measurement unit are unsuitable in WSN. The DV-hop algorithm is one of the range-free localization algorithms in which average hop-distance and hop counts are used for range estimation. But it requires heavy communication cost if the number of nodes increases in the network. Therefore, we propose a simple algorithm to reduce the communication cost and its performance is verified via computer simulations.},
keywords={},
doi={10.1587/transcom.E92.B.3075},
ISSN={1745-1345},
month={October},}
Copiar
TY - JOUR
TI - Scalable DV-Hop Localization Algorithm with Constrained Multilateration for Wireless Sensor Network
T2 - IEICE TRANSACTIONS on Communications
SP - 3075
EP - 3078
AU - Sunwoo KIM
AU - Byeong-Tae LEE
PY - 2009
DO - 10.1587/transcom.E92.B.3075
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2009
AB - Localization is an important problem for Wireless Sensor Networks (WSN). The localization method can be categorized as range-free or range-based schemes. Since sensor nodes are usually cheap and small, the range-based schemes that require range measurement unit are unsuitable in WSN. The DV-hop algorithm is one of the range-free localization algorithms in which average hop-distance and hop counts are used for range estimation. But it requires heavy communication cost if the number of nodes increases in the network. Therefore, we propose a simple algorithm to reduce the communication cost and its performance is verified via computer simulations.
ER -