Robust Clustering Routing Method for Wireless Sensor Networks Considering the Locust Search Scheme
Alma Rodríguez,
Marco Pérez-Cisneros,
Julio C. Rosas-Caro,
Carolina Del-Valle-Soto,
Jorge Gálvez and
Erik Cuevas
Additional contact information
Alma Rodríguez: Departamento de Electrónica, Universidad de Guadalajara, CUCEI, Av. Revolución 1500, Guadalajara C.P. 44430, Jalisco, Mexico
Marco Pérez-Cisneros: Departamento de Electrónica, Universidad de Guadalajara, CUCEI, Av. Revolución 1500, Guadalajara C.P. 44430, Jalisco, Mexico
Julio C. Rosas-Caro: Facultad de Ingeniería, Universidad Panamericana, Álvaro del Portillo 49, Zapopan 45010, Jalisco, Mexico
Carolina Del-Valle-Soto: Facultad de Ingeniería, Universidad Panamericana, Álvaro del Portillo 49, Zapopan 45010, Jalisco, Mexico
Jorge Gálvez: Departamento de Electrónica, Universidad de Guadalajara, CUCEI, Av. Revolución 1500, Guadalajara C.P. 44430, Jalisco, Mexico
Erik Cuevas: Departamento de Electrónica, Universidad de Guadalajara, CUCEI, Av. Revolución 1500, Guadalajara C.P. 44430, Jalisco, Mexico
Energies, 2021, vol. 14, issue 11, 1-19
Abstract:
Multiple applications of sensor devices in the form of a Wireless Sensor Network (WSN), such as those represented by the Internet of Things and monitoring dangerous geographical spaces, have attracted the attention by several scientific communities. Despite their interesting properties, sensors present an adverse characteristic: they manage very limited energy. Under such conditions, saving energy represents one of the most important concepts in designing effective protocols for WSNs. The objective of a protocol is to increase the network lifetime through the reduction of energy consumed by each sensor. In this paper, a robust clustering routing protocol for WSNs is introduced. The scheme uses the Locust Search (LS-II) method to determine the number of cluster heads and to identify the optimal cluster heads. Once the cluster heads are recognized, the other sensor elements are assigned to their nearest corresponding cluster head. Numerical simulations exhibit competitive results and demonstrate that the proposed protocol allows for the minimization of the energy consumption, extending the network lifetime in comparison with other popular clustering routing protocols.
Keywords: locust search algorithm; wireless sensor networks; swarm-based algorithms; clustering routing protocol; energy-efficiency; metaheuristic algorithms (search for similar items in EconPapers)
JEL-codes: Q Q0 Q4 Q40 Q41 Q42 Q43 Q47 Q48 Q49 (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
https://www.mdpi.com/1996-1073/14/11/3019/pdf (application/pdf)
https://www.mdpi.com/1996-1073/14/11/3019/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jeners:v:14:y:2021:i:11:p:3019-:d:560576
Access Statistics for this article
Energies is currently edited by Ms. Agatha Cao
More articles in Energies from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().