Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12323/6488
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Alizada, Azar | - |
dc.date.accessioned | 2023-03-27T07:58:14Z | - |
dc.date.available | 2023-03-27T07:58:14Z | - |
dc.date.issued | 2022 | - |
dc.identifier.citation | Khazar Journal of Science and Technology | en_US |
dc.identifier.issn | 2520-6133 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.12323/6488 | - |
dc.description.abstract | The idea of the Internet of Things (IoT) has received a lot of interest recently because it has the potential to transform our physical world into a meaningful information-filled digital cyber environment. The IoT devices are more computationally powerful and smaller in resources in terms of size, number, memory, bandwidth and energy consumption. This thesis will examine resource management in IoT. The Internet of Things (IoT) is a network that is made up of real-world items, including sensors, software, and other technologies integrated into them with the primary intention of connecting and exchanging data with other equipment and systems. Resource management is a critical component of IoT, as it ensures that the various devices and sensors are able to communicate and work together efficiently (I. Rašan, 2021). In this thesis, we will customize and implement two algorithms for resource management in IoT: Kruskal's algorithm and Floyd's algorithm. Kruskal's algorithm is an algorithm that looks for the most optimal solution, which is utilized to find the minimum spanning tree of a graph. The algorithm works by considering all the possible routes of the graph and selecting the one with the lowest weight. The minimum spanning tree is added to these possible routes, after which, the procedure is repeated until all the edges have been considered. Floyd's algorithm is an all-pairs shortest-path algorithm that is used to detect the best path in terms of length between all pairs of nodes in a certain graph. The algorithm works by considering all the nodes of the graph, and afterwards calculating the shortest route between every pair of nodes. We will compare and contrast the two algorithms, and evaluate their effectiveness by combining both to optimize resource management in IoT. As a result, Floyd’s and Kruskal’s algorithms are customized to detect and eliminate loops within devices to improve resource management in IoT devices. By using Floyd algorithm before Kruskal’s implementation it can be determined if there is a cycle in the IoT resources. Floyd algorithm-discovered cycles can be eliminated by applying the Kruskal algorithm. This method allows fewer cables, tracks, and othercomponents to be used in IoT devices. It can improve the efficiency and management of IoT resources by reducing costs, time, effort, and other factors. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Khazar University Press | en_US |
dc.relation.ispartofseries | Vol. 6;№ 2 | - |
dc.subject | Sensor | en_US |
dc.subject | embedded systems | en_US |
dc.subject | network | en_US |
dc.subject | cloud computing | en_US |
dc.subject | technologies | en_US |
dc.title | Resource Management in Internet of Things by Implementing Kruskal’s and Floyd’s Algorithms | en_US |
dc.type | Article | en_US |
Appears in Collections: | 2022, Vol. 6, № 2 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Resource Management in Internet of Things by Implementing Kruskals and Floyds Algorithms.pdf | 1.42 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.