H–V scan and diagonal trajectory: accurate and low power localization algorithms in WSNs
| Autor: | Amin Kargar-Barzi, Ali Mahani |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
General Computer Science
Computer science 010401 analytical chemistry Diagonal 020206 networking & telecommunications 02 engineering and technology Collinearity 01 natural sciences 0104 chemical sciences Power (physics) Position (vector) 0202 electrical engineering electronic engineering information engineering Trajectory Wireless sensor network Algorithm Energy (signal processing) |
| Zdroj: | Journal of Ambient Intelligence and Humanized Computing. 11:2871-2882 |
| ISSN: | 1868-5145 1868-5137 |
| Popis: | Obtaining the accurate location of the sensor nodes, which is known as the localization algorithm, is considered a significant issue in various applications of wireless sensor networks (WSNs). The present study introduced two anchor-based localization algorithms, namely, H–V scan and diagonal localization. These two algorithms are based on the received signal strength indicator (RSSI) and connectivity information, respectively. In addition, the diagonal algorithm relies on a diagonal trajectory in which the accuracy is improved while the consumed energy and localization time are decreased. Further, the H–V scan method benefits from collinearity and thus the location of the nodes is determined by the collinear position packets. Therefore, RWP, circle, LMAT, Z-curve, and H-curve methods, along with the proposed methods by Inet package of Omnetpp simulator were implemented for a fair comparison. The results indicated that in diagonal method accuracy improves about 1.2 times and consumed energy and localization time decrease about 65% compare to the best results of all the related studies. Furthermore, the results confirmed that the H–V scan which uses from collinearity concept, increases the accuracy about eight times. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink