An optimal energy‐efficient clustering method in wireless sensor networks using multi‐objective genetic algorithm

Abstract

SUMMARY In this study, an optimal method of clustering homogeneous wireless sensor networks using a multi‐objective two‐nested genetic algorithm is presented. The top level algorithm is a multi‐objective genetic algorithm (GA) whose goal is to obtain clustering schemes in which the network lifetime is optimized for different delay values. The low level GA is used in each cluster in order to get the most efficient topology for data transmission from sensor nodes to the cluster head. The presented clustering method is not restrictive, whereas existing intelligent clustering methods impose certain conditions such as performing two‐tiered clustering. A random deployed model is used to demonstrate the efficiency of the proposed algorithm. In addition, a comparison is made between the presented algorithm other GA‐based clustering methods and the Low Energy Adaptive Clustering Hierarchy protocol. The results obtained indicate that using the proposed method, the network's lifetime would be extended much more than it would be when using the other methods. Copyright © 2011 John Wiley & Sons, Ltd.

Lightweight distributed geographical: a lightweight distributed protocol for virtual clustering in geographical forwarding cognitive radio sensor networks

“…Liang and Terzis [29] proposed a general cross-layer approach of decomposing channel switching into two components: the channel allocation component that is integrated with network layer protocols and a shared channel synchronization component at the MAC layer. These cited works and others [30][31][32][33][34][35] clearly do not address dynamic spectrum allocation, which is the main issue LDG seeks to address.…”

Assuming multiobjective metaheuristics to solve a three-objective optimisation problem for Relay Node deployment in Wireless Sensor Networks

“…Perez et al [37] assumed an MO algorithm, optimising both the energy cost and the number of routers in ST-WSNs, considering the C-RNPP. Peiravi et al [38] proposed a method of clustering homogeneous TT-WSNs using an MO two-nested GA, with the aim of obtaining clustering schemes, where the network lifetime was optimised for different delay values.…”

An Optimal Data Gathering Method for Mobile Sinks in WSNs

“…The hotspot problem is minimized as the mobile sink moves higher energy cluster heads. Other numerous techniques, such as multi-hop, virtual MIMO, public transportation marginal value theorem and heuristic algorithms are used for the case when clustering and mobile sink methods are applied to gather data in WSNs [19][20][21][22][23][24].…”