MDS-Based Localization

Author(s):  
Ahmed A. Ahmed ◽  
Xiaoli Li ◽  
Yi Shang ◽  
Hongchi Shi

The authors present several network node localization methods that are based on multidimensional scaling (MDS) techniques. Four algorithms are introduced: MDS-MAP(C), MDS-MAP(P), MDS-Hybrid, and RangeQ-MDS. MDS-MAP(C) is a centralized algorithm that simply applies MDS to estimate node positions. In MDS-MAP(P), a local map is built at each node of the immediate vicinity, then these maps are merged together to form a global map. MDS-Hybrid uses MDS-MAP(C) to relatively localize Nr reference nodes. Then, an absolute localization method uses these Nr nodes as anchors to localize the rest of the network. Finally, RangeQ-MDS assumes the absence of an RSSI-distance mapping function. It uses a quantized RSSI-based distance estimation technique (called RangeQ) to achieve more precise hop distances than other range-free approaches do. While MDS-MAP(C), MDS-MAP(P), and MDSHybrid can be range-aware or range-free, RangeQ-MDS is partially range-aware.

Information ◽  
2021 ◽  
Vol 12 (8) ◽  
pp. 330
Author(s):  
Yinghui Meng ◽  
Qianying Zhi ◽  
Minghao Dong ◽  
Weiwei Zhang

The coordinates of nodes are very important in the application of wireless sensor networks (WSN). The range-free localization algorithm is the best method to obtain the coordinates of sensor nodes at present. Range-free localization algorithm can be divided into two stages: distance estimation and coordinate calculation. For reduce the error in the distance estimation stage, a node localization algorithm for WSN based on virtual partition and distance correction (VP-DC) is proposed in this paper. In the distance estimation stage, firstly, the distance of each hop on the shortest communication path between the unknown node and the beacon node is calculated with the employment of virtual partition algorithm; then, the length of the shortest communication path is obtained by summing the distance of each hop; finally, the unknown distance between nodes is obtained according to the optimal path search algorithm and the distance correction formula. This paper innovative proposes the virtual partition algorithm and the optimal path search algorithm, which effectively avoids the distance estimation error caused by hop number and hop distance, and improves the localization accuracy of unknown nodes.


2019 ◽  
Vol 27 (2) ◽  
pp. 261-270
Author(s):  
Rong Tan ◽  
Yudong Li ◽  
Yifan Shao ◽  
Wen Si

Sign in / Sign up

Export Citation Format

Share Document