Node Localization in WSN Based on Weighted Vectors Centroid Algorithm

2011 ◽  
Author(s):  
Xiaoqin Su ◽  
Zhaoming Lei
Keyword(s):  
Node Localization ◽  
Centroid Algorithm

An Improved DV-HOP Localization Algorithm Based on Simulation Curve Fitting

2013 ◽  
Vol 684 ◽  
pp. 390-393 ◽  
Author(s):  
Lin Chen ◽  
Zhi Yi Fang ◽  
Wei Lv ◽  
Zhuang Liu
Keyword(s):  
Wireless Sensor Network ◽  
Curve Fitting ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Node Localization ◽  
Centroid Algorithm ◽  
Key Technologies ◽  
Accurate Position ◽  
Beacon Node ◽  
Range Free

Localization technology is one of the key technologies in Wireless Sensor Network (WSN). The Centroid algorithm, DV-HOP algorithm, APIT algorithm and Amorphous are the classic algorithms which are based on Range-free localization algorithm. This paper is improved on the basis of the DV-HOP and Weighted DV-HOP node localization algorithm, proposed an improved DV-HOP and weighted DV-HOP of WSN localization algorithm based on Simulation Curve Fitting (SCF). The SCF algorithm makes the process more refined during selecting the beacon node and the selected beacon node can be closer to the accurate position.

3D weighted centroid algorithm & RSSI ranging model strategy for node localization in WSN based on smart devices

2018 ◽  
Vol 39 ◽  
pp. 298-308 ◽  
Author(s):  
Syed Bilal Shah ◽  
Chen Zhe ◽  
Fuliang Yin ◽  
Inam Ullah Khan ◽  
Seema Begum ◽  
...  
Keyword(s):  
Smart Devices ◽  
Node Localization ◽  
Centroid Algorithm ◽  
Ranging Model

Fringe order identification in optical fibre white-light interferometry using centroid algorithm method

1992 ◽  
Vol 28 (6) ◽  
pp. 553 ◽  
Author(s):  
S. Chen ◽  
A.W. Palmer ◽  
K.T.V. Grattan ◽  
B.T. Meggitt
Keyword(s):  
Optical Fibre ◽  
White Light ◽  
White Light Interferometry ◽  
Fringe Order ◽  
Centroid Algorithm

scholarly journals Distance Mapping Algorithm for Sensor Node Localization in WSNs

2019 ◽  
Vol 27 (2) ◽  
pp. 261-270
Author(s):  
Rong Tan ◽  
Yudong Li ◽  
Yifan Shao ◽  
Wen Si
Keyword(s):  
Sensor Node ◽  
Node Localization ◽  
Mapping Algorithm ◽  
Distance Mapping

SecRET

2021 ◽  
Vol 15 (1) ◽  
pp. 1-26
Author(s):  
Sudip Misra ◽  
Tamoghna Ojha ◽  
Madhusoodhanan P
Keyword(s):  
Sensor Networks ◽  
Error Rates ◽  
Location Information ◽  
Underwater Sensor Networks ◽  
Node Localization ◽  
Limited Bandwidth ◽  
Secure Localization ◽  
Localization Scheme ◽  
Monitoring Application ◽  
Fundamental Requirement

Node localization is a fundamental requirement in underwater sensor networks (UWSNs) due to the ineptness of GPS and other terrestrial localization techniques in the underwater environment. In any UWSN monitoring application, the sensed information produces a better result when it is tagged with location information. However, the deployed nodes in UWSNs are vulnerable to many attacks, and hence, can be compromised by interested parties to generate incorrect location information. Consequently, using the existing localization schemes, the deployed nodes are unable to autonomously estimate the precise location information. In this regard, similar existing schemes for terrestrial wireless sensor networks are not applicable to UWSNs due to its inherent mobility, limited bandwidth availability, strict energy constraints, and high bit-error rates. In this article, we propose SecRET , a <underline>Sec</underline>ure <underline>R</underline>ange-based localization scheme empowered by <underline>E</underline>vidence <underline>T</underline>heory for UWSNs. With trust-based computations, the proposed scheme, SecRET , enables the unlocalized nodes to select the most reliable set of anchors with low resource consumption. Thus, the proposed scheme is adaptive to many attacks in UWSN environment. NS-3 based performance evaluation indicates that SecRET maintains energy-efficiency of the deployed nodes while ensuring efficient and secure localization, despite the presence of compromised nodes under various attacks.

Sign in / Sign up

Export Citation Format

Share Document