A new localization method in internet of things by improving beetle antenna search algorithm

Localization is regarded as one of the important challenges in the internet of things and Wireless Sensor Networks. The failure to localize sensors properly causes data loss and inefficiency in their information. Also, using GPS in all sensors causes extra cost. Hence, proper localization with least error is very important. Algorithms according to range- based and range-free are the major methods of location detection, as DV-Hop is one of the examples of range-free algorithm. Its important challenge is the error that is caused by this localization method. For solving the problem of error of GPS-free node localization, we used the new, efficient, simple Beetle Antennae Search algorithm (BAS). At first, we resolved some shortcomings of beetle antennae search algorithm. The results of the implementation on random data in Matlab shows that suggested algorithm is more accurate than firefly algorithm butterfly optimization algorithm (BOA), particle swarm optimization and whale optimization algorithm. And, beetle antennae search algorithm (BAS) does localization with least error and more accuracy. The proposed algorithm offers about 35.23% less error for positioning than the butterfly algorithm (BOA).

Automated summary

Localization is a significant challenge in the internet of things and Wireless Sensor Networks. This article discusses the importance of proper localization to avoid data loss and inefficiency. It also introduces different algorithms for location detection and presents a new algorithm, Beetle Antennae Search (BAS), to solve the error issue in GPS-free node localization.