Recovery schemes of Hop Count Matrix via topology inference and applications in range-free localization.

Hop Count Matrix (HCM) contains rich connectivity information, which is very important for various Internet of Things (IoT) applications, especially for obtaining the locations of sensor nodes. However, some items of HCMs may be missing due to attacks by malicious nodes or unexpected termination of flooding operations. To solve this problem, two methods, called HCMR-AM and HCMR-DT, are proposed to recover the missing items. In HCMR-AM, the collected partial hop counts are employed to construct Adjacency Matrix (AM), and then the constructed AM is used to obtain the complete HCM. In HCMR-DT, the recovery of HCM is transformed into a classification problem, where multi-dimensional features are used for joint prediction to achieve more accurate recovery performance. Extensive experimental results demonstrate that compared to the original SVT and HCMR-NBC, our proposed algorithms have significant improvement in recovery performance and execution efficiency. In addition, the complete HCM is used for node localization, and experimental results show that the HCM recovered by the proposed methods can achieve the same localization performance as the HCM without missing value when the observation ratio of HCM is greater than 30%, which cannot be achieved by other recovery algorithms. • A hop count matrix recovery scheme based on adjacency matrix is proposed. • A hop count matrix recovery method using Decision Tree is developed. • The complete hop count matrices are suitable for range-free localization. [ABSTRACT FROM AUTHOR]