Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm

Detalhes bibliográficos
Autor(a) principal: Ahmad, Masood
Data de Publicação: 2021
Outros Autores: Shah, Babar, Ullah, Abrar, Alfandi, Omar, Ali, Gohar, Hameed, Abdul, Moreira, Fernando
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/11328/3419
https://doi.org/10.1155/2021/8875950
Resumo: In wireless sensor networks for the Internet of Things (WSN-IoT), the topology deviates very frequently because of the node mobility. The topology maintenance overhead is high in flat-based WSN-IoTs. WSN clustering is suggested to not only reduce the message overhead in WSN-IoT but also control the congestion and easy topology repairs. The partition of wireless mobile nodes (WMNs) into clusters is a multiobjective optimization problem in large-size WSN. Different evolutionary algorithms (EAs) are applied to divide the WSN-IoT into clusters but suffer from early convergence. In this paper, we propose WSN clustering based on the memetic algorithm (MemA) to decrease the probability of early convergence by utilizing local exploration techniques. Optimum clusters in WSN-IoT can be obtained using MemA to dynamically balance the load among clusters. The objective of this research is to find a cluster head set (CH-set) as early as possible once needed. The WMNs with high weight value are selected in lieu of new inhabitants in the subsequent generation. A crossover mechanism is applied to produce new-fangled chromosomes as soon as the two maternities have been nominated. The local search procedure is initiated to enhance the worth of individuals. The suggested method is matched with state-of-the-art methods like MobAC (Singh and Lohani, 2019), EPSO-C (Pathak, 2020), and PBC-CP (Vimalarani, et al. 2016). The proposed technique outperforms the state of the art clustering methods regarding control messages overhead, cluster count, reaffiliation rate, and cluster lifetime.
id RCAP_da1a69229b9d88341832ec8fb8be1b38
oai_identifier_str oai:repositorio.upt.pt:11328/3419
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic AlgorithmWSN-IoTWireless sensor networksmemeWSNInternet of ThingsIn wireless sensor networks for the Internet of Things (WSN-IoT), the topology deviates very frequently because of the node mobility. The topology maintenance overhead is high in flat-based WSN-IoTs. WSN clustering is suggested to not only reduce the message overhead in WSN-IoT but also control the congestion and easy topology repairs. The partition of wireless mobile nodes (WMNs) into clusters is a multiobjective optimization problem in large-size WSN. Different evolutionary algorithms (EAs) are applied to divide the WSN-IoT into clusters but suffer from early convergence. In this paper, we propose WSN clustering based on the memetic algorithm (MemA) to decrease the probability of early convergence by utilizing local exploration techniques. Optimum clusters in WSN-IoT can be obtained using MemA to dynamically balance the load among clusters. The objective of this research is to find a cluster head set (CH-set) as early as possible once needed. The WMNs with high weight value are selected in lieu of new inhabitants in the subsequent generation. A crossover mechanism is applied to produce new-fangled chromosomes as soon as the two maternities have been nominated. The local search procedure is initiated to enhance the worth of individuals. The suggested method is matched with state-of-the-art methods like MobAC (Singh and Lohani, 2019), EPSO-C (Pathak, 2020), and PBC-CP (Vimalarani, et al. 2016). The proposed technique outperforms the state of the art clustering methods regarding control messages overhead, cluster count, reaffiliation rate, and cluster lifetime.Wiley2021-04-13T10:32:19Z2021-04-132021-01-06T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfAhmad, M., Shah, B., Ullah, A., et al. (2021). Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm. Wireless Communications and Mobile Computing, 2021, (1-14). doi: https://doi.org/10.1155/2021/8875950. Disponível no Repositório UPT, http://hdl.handle.net/11328/3419http://hdl.handle.net/11328/3419Ahmad, M., Shah, B., Ullah, A., et al. (2021). Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm. Wireless Communications and Mobile Computing, 2021, (1-14). doi: https://doi.org/10.1155/2021/8875950. Disponível no Repositório UPT, http://hdl.handle.net/11328/3419http://hdl.handle.net/11328/3419https://doi.org/10.1155/2021/8875950eng1530-8669 (Print)1530-8677 (Online)https://doi.org/10.1155/2021/8875950http://creativecommons.org/licenses/by/4.0/info:eu-repo/semantics/openAccessAhmad, MasoodShah, BabarUllah, AbrarAlfandi, OmarAli, GoharHameed, AbdulMoreira, Fernandoreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-07-04T02:54:36Zoai:repositorio.upt.pt:11328/3419Portal AgregadorONGhttps://www.rcaap.pt/oai/openairemluisa.alvim@gmail.comopendoar:71602024-07-04T02:54:36Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm
title Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm
spellingShingle Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm
Ahmad, Masood
WSN-IoT
Wireless sensor networks
memeWSN
Internet of Things
title_short Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm
title_full Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm
title_fullStr Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm
title_full_unstemmed Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm
title_sort Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm
author Ahmad, Masood
author_facet Ahmad, Masood
Shah, Babar
Ullah, Abrar
Alfandi, Omar
Ali, Gohar
Hameed, Abdul
Moreira, Fernando
author_role author
author2 Shah, Babar
Ullah, Abrar
Alfandi, Omar
Ali, Gohar
Hameed, Abdul
Moreira, Fernando
author2_role author
author
author
author
author
author
dc.contributor.author.fl_str_mv Ahmad, Masood
Shah, Babar
Ullah, Abrar
Alfandi, Omar
Ali, Gohar
Hameed, Abdul
Moreira, Fernando
dc.subject.por.fl_str_mv WSN-IoT
Wireless sensor networks
memeWSN
Internet of Things
topic WSN-IoT
Wireless sensor networks
memeWSN
Internet of Things
description In wireless sensor networks for the Internet of Things (WSN-IoT), the topology deviates very frequently because of the node mobility. The topology maintenance overhead is high in flat-based WSN-IoTs. WSN clustering is suggested to not only reduce the message overhead in WSN-IoT but also control the congestion and easy topology repairs. The partition of wireless mobile nodes (WMNs) into clusters is a multiobjective optimization problem in large-size WSN. Different evolutionary algorithms (EAs) are applied to divide the WSN-IoT into clusters but suffer from early convergence. In this paper, we propose WSN clustering based on the memetic algorithm (MemA) to decrease the probability of early convergence by utilizing local exploration techniques. Optimum clusters in WSN-IoT can be obtained using MemA to dynamically balance the load among clusters. The objective of this research is to find a cluster head set (CH-set) as early as possible once needed. The WMNs with high weight value are selected in lieu of new inhabitants in the subsequent generation. A crossover mechanism is applied to produce new-fangled chromosomes as soon as the two maternities have been nominated. The local search procedure is initiated to enhance the worth of individuals. The suggested method is matched with state-of-the-art methods like MobAC (Singh and Lohani, 2019), EPSO-C (Pathak, 2020), and PBC-CP (Vimalarani, et al. 2016). The proposed technique outperforms the state of the art clustering methods regarding control messages overhead, cluster count, reaffiliation rate, and cluster lifetime.
publishDate 2021
dc.date.none.fl_str_mv 2021-04-13T10:32:19Z
2021-04-13
2021-01-06T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv Ahmad, M., Shah, B., Ullah, A., et al. (2021). Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm. Wireless Communications and Mobile Computing, 2021, (1-14). doi: https://doi.org/10.1155/2021/8875950. Disponível no Repositório UPT, http://hdl.handle.net/11328/3419
http://hdl.handle.net/11328/3419
Ahmad, M., Shah, B., Ullah, A., et al. (2021). Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm. Wireless Communications and Mobile Computing, 2021, (1-14). doi: https://doi.org/10.1155/2021/8875950. Disponível no Repositório UPT, http://hdl.handle.net/11328/3419
http://hdl.handle.net/11328/3419
https://doi.org/10.1155/2021/8875950
identifier_str_mv Ahmad, M., Shah, B., Ullah, A., et al. (2021). Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm. Wireless Communications and Mobile Computing, 2021, (1-14). doi: https://doi.org/10.1155/2021/8875950. Disponível no Repositório UPT, http://hdl.handle.net/11328/3419
url http://hdl.handle.net/11328/3419
https://doi.org/10.1155/2021/8875950
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1530-8669 (Print)
1530-8677 (Online)
https://doi.org/10.1155/2021/8875950
dc.rights.driver.fl_str_mv http://creativecommons.org/licenses/by/4.0/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Wiley
publisher.none.fl_str_mv Wiley
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv mluisa.alvim@gmail.com
_version_ 1817546215201439744