Clustered Routing Method in the Internet of Things Using a Moth‐Flame Optimization Algorithm

Summary Internet of Things (IoT) is a set of interrelated devices on the Internet platform that can receive and send data to make human life more efficient and convenient. Clustering is a useful data collection method in the IoT that selectively cuts energy consumption by forming IoT nodes into some...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of communication systems Ročník 34; číslo 16
Hlavní autoři: Sadrishojaei, Mahyar, Jafari Navimipour, Nima, Reshadi, Midia, Hosseinzadeh, Mehdi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Chichester Wiley Subscription Services, Inc 10.11.2021
Témata:
Butterflies & moths
Chemical reactions
Clustering
Data collection
Energy consumption
Internet of Things
metaheuristic algorithm
moth‐flame optimization
Nodes
Optimization
Optimization algorithms
Population-based studies
population‐based algorithms
routing
Search algorithms
ISSN:1074-5351, 1099-1131
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Summary Internet of Things (IoT) is a set of interrelated devices on the Internet platform that can receive and send data to make human life more efficient and convenient. Clustering is a useful data collection method in the IoT that selectively cuts energy consumption by forming IoT nodes into some clusters. The cluster head can control all cluster nodes, and all intracluster and intercluster connections are made through it. Due to the NP‐Hard nature of the clustering problem, a moth‐flame optimization algorithm is proposed to select the minimum number of necessary clusters for routing in this article. This scheme is extracted from the life cycle of moths and enables effective communication by creating the optimal number of clusters. The proposed fitness function consists of the sum of the distances, the amount of energy remaining, and the degree of the nodes. The obtained experimental results are compared to different clustering algorithms, such as whale optimization algorithm, novel chemical reaction optimization, and cuckoo search optimization. The simulation using MATLAB clearly showed that the proposed method has a low number of cluster head nodes and the most balanced clusters. It also improves lifetime by at least 14.59% compared to the mentioned techniques. In this paper, a clustering scheme with a moth‐flame optimization algorithm is proposed to select the ideal CH nodes and minimize the number of clusters required for routing. The main criteria of the proposed fitness function include the sum of distances, the amount of energy remaining, and the degree of nodes. The results obtained compared to other algorithms in terms of number of clusters, lifetime, cluster balanced, and running time show more brilliant results.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1074-5351
1099-1131
DOI:10.1002/dac.4964