An Amalgamated Kruskal’s Algorithm to ascertain the shortest route in the futuristic smart world

Article type: Research Article

Authors: Kather Mohideen, Ashma Banu | Jayakumar, Vimala^{; *} | Pethaperumal, Mahalakshmi | Kannan, Jeevitha

Affiliations: Department of Mathematics, Alagappa University, Karaikudi, Tamilnadu, India

Correspondence: [*] Corresponding author. Vimala Jayakumar. E-mail: [email protected].

Abstract: As the globe enters a new era, web applications will become indispensable to managing business. Businesses can easily grow, become simpler, and accomplish their objective much faster by employing web applications. Creating a web application in cloud computing allows for the more affordable leveraging of cloud-based services. This makes it easier to avoid setting up and maintaining several servers. To get around cloud computing’s built-in restrictions such as scalability, security, and bandwidth limitations, the future smart world of cloud computing will be coupled with LiFi connectivity. Beyond creating the web application, it is important to promote this web application among the network of users as quickly and effectively as possible. This manuscript proposes a strategy to address these challenges. There are two primary components to this MCDM technique. The first step is to model the problem as a graph and weigh the edges by employing the Hamacher aggregation operator. The second step involves using a fresh iteration of Kruskal’s technique in conjunction with this approach to discover a Minimum Spanning Tree as a resolution. This manuscript adds to the literature by solving real-world Minimum Spanning Tree problems by combining existing algorithms with MCDM techniques. This technique is demonstrated for marketing a web application(created via cloud service) in a future smart world using LiFi technology.

Keywords: Cloud computing, LiFi technology, Kruskal’s technique, minimum spanning tree, Hamacher aggregation operator

DOI: 10.3233/JIFS-219423

Journal: Journal of Intelligent & Fuzzy Systems, vol. Pre-press, no. Pre-press, pp. 1-16, 2024