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
Penyetempatan adalah salah satu masalah asas dalam banyak aplikasi rangkaian penderia wayarles, tetapi kebanyakannya memerlukan nod untuk melengkapkan perkakasan penentu julat atau penentu sudut khas untuk mendapatkan maklumat berkaitan kedudukan. Dalam makalah ini, kami mencadangkan algoritma penyetempatan suar sepusat yang merupakan pendekatan bebas julat. Empat sauh ditetapkan di empat penjuru kawasan sasaran persegi, dan memancarkan suar penyetempatan pada tahap kuasa yang berbeza, dengan maklumat kedudukannya dan anggaran julat suar. Nod di rantau ini menerima suar ini dan mengira kedudukannya secara sepadan. Dalam kawasan skala yang berbeza, kami mencadangkan dua skim alternatif. Satu untuk skala kecil mempunyai kerumitan pengiraan yang lebih rendah, dan satu lagi mempunyai kestabilan yang lebih baik pada aplikasi skala besar. Keputusan simulasi menunjukkan ralat anggaran adalah kurang daripada 0.4 kali selang suar.
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.
Salinan
Qing ZHOU, Depeng JIN, Li SU, Lieguang ZENG, "Area Concentric Beacons Localization for Wireless Sensor Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 8, pp. 2151-2154, August 2009, doi: 10.1587/transfun.E92.A.2151.
Abstract: Localization is one of the fundamental problems in many wireless sensor networks applications, but most of them require the node to equip special range-determining or angle-determining hardware in order to obtain the position related information. In this paper, we propose a concentric beacons localization algorithm which is a range-free approach. Four anchors are set in the four corners of the square target region, and emit localizing beacons at different power levels, with the information of their position and the estimated range of the beacon. The nodes in this region receive these beacons and compute their positions correspondingly. In region of different scale, we propose two alternative schemes. The one for small scale has lower calculation complexity, and the other has better stability on large scale applications. Simulation results show the estimation error is less than 0.4 times the beacon interval.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.2151/_p
Salinan
@ARTICLE{e92-a_8_2151,
author={Qing ZHOU, Depeng JIN, Li SU, Lieguang ZENG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Area Concentric Beacons Localization for Wireless Sensor Networks},
year={2009},
volume={E92-A},
number={8},
pages={2151-2154},
abstract={Localization is one of the fundamental problems in many wireless sensor networks applications, but most of them require the node to equip special range-determining or angle-determining hardware in order to obtain the position related information. In this paper, we propose a concentric beacons localization algorithm which is a range-free approach. Four anchors are set in the four corners of the square target region, and emit localizing beacons at different power levels, with the information of their position and the estimated range of the beacon. The nodes in this region receive these beacons and compute their positions correspondingly. In region of different scale, we propose two alternative schemes. The one for small scale has lower calculation complexity, and the other has better stability on large scale applications. Simulation results show the estimation error is less than 0.4 times the beacon interval.},
keywords={},
doi={10.1587/transfun.E92.A.2151},
ISSN={1745-1337},
month={August},}
Salinan
TY - JOUR
TI - Area Concentric Beacons Localization for Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2151
EP - 2154
AU - Qing ZHOU
AU - Depeng JIN
AU - Li SU
AU - Lieguang ZENG
PY - 2009
DO - 10.1587/transfun.E92.A.2151
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2009
AB - Localization is one of the fundamental problems in many wireless sensor networks applications, but most of them require the node to equip special range-determining or angle-determining hardware in order to obtain the position related information. In this paper, we propose a concentric beacons localization algorithm which is a range-free approach. Four anchors are set in the four corners of the square target region, and emit localizing beacons at different power levels, with the information of their position and the estimated range of the beacon. The nodes in this region receive these beacons and compute their positions correspondingly. In region of different scale, we propose two alternative schemes. The one for small scale has lower calculation complexity, and the other has better stability on large scale applications. Simulation results show the estimation error is less than 0.4 times the beacon interval.
ER -