Comparative study on ant colony optimization (ACO) and K-Means clustering approaches for jobs scheduling and energy optimization model in Internet of Things (IoT)

• Main Authors: Kumar, Sumit, Solanki, Vijender Kumar, Choudhary, Saket Kumar, Selamat, Ali, Crespo, Ruben Gonzalez
• Format: Article
• Published: UNIR - Universidad Internacional de La Rioja 2020
• Subjects: QA75 Electronic computers. Computer science; T58.5-58.64 Information technology
• Online Access: http://eprints.utm.my/id/eprint/89956/; http://dx.doi.org/10.9781/ijimai.2020.01.003

The concept of Internet of Things (IoT) was proposed by Professor Kevin Ashton of the Massachusetts Institute of Technology (MIT) in 1999. IoT is an environment that people understand in many different ways depending on their requirement, point of view and purpose. When transmitting data in IoT environment, distribution of network traffic fluctuates frequently. If links of the network or nodes fail randomly, then automatically new nodes get added frequently. Heavy network traffic affects the response time of all system and it consumes more energy continuously. Minimization the network traffic/ by finding the shortest path from source to destination minimizes the response time of all system and also reduces the energy consumption cost. The ant colony optimization (ACO) and K-Means clustering algorithms characteristics conform to the auto-activator and optimistic response mechanism of the shortest route searching from source to destination. In this article, ACO and K-Means clustering algorithms are studied to search the shortest route path from source to destination by optimizing the Quality of Service (QoS) constraints. Resources are assumed in the active and varied IoT network atmosphere for these two algorithms. This work includes the study and comparison between ant colony optimization (ACO) and K-Means algorithms to plan a response time aware scheduling model for IoT. It is proposed to divide the IoT environment into various areas and a various number of clusters depending on the types of networks. It is noticed that this model is more efficient for the suggested routing algorithm in terms of response time, point-to-point delay, throughput and overhead of control bits.