A Bee Colony-Based Optimized Searching Mechanism in the Internet of Things

Abstract

The Internet of Things (IoT) consists of complex and dynamically aggregated elements or smart entities that need decentralized supervision for data exchanging throughout different networks. The artificial bee colony (ABC) is utilized in optimization problems for the big data in IoT, cloud and central repositories. The main limitation during the searching mechanism is that every single food site is compared with every other food site to find the best solution in the neighboring regions. In this way, an extensive number of redundant comparisons are required, which results in a slower convergence rate, greater time consumption and increased delays. This paper presents a solution to optimize search operations with an enhanced ABC (E-ABC) approach. The proposed algorithm compares the best food sites with neighboring sites to exclude poor sources. It achieves an efficient mechanism, where the number of redundant comparisons is decreased during the searching mechanism of the employed bee phase and the onlooker bee phase. The proposed algorithm is implemented in a replication scenario to validate its performance in terms of the mean objective function values for different functions, as well as the probability of availability and the response time. The results prove the superiority of the E-ABC in contrast to its counterparts.