Research Area:  Wireless Sensor Networks
Wireless sensor networks (WSNs) have a large number of existing applications and is continuously increasing. Thus it is envisioned that WSN will become an integral part of our life in the near future. Direct propagation, chain formation, cluster creation are various techniques by which data is communicated by sensor nodes to the sink. It has been proved that Clustering is an efficient and scalable method to utilize the energy of sensor nodes efficiently. Optimal election of cluster heads is an NP (non deterministic polynomial time)-Hard problem. In our proposed work, a multi-objective optimization algorithm, non dominated sorting genetic algorithm-II based clustering in wireless sensor networks has been proposed. Energy conservation, network lifetime, coverage and load balancing are the four conflicting objective functions used. Our proposed algorithm handles all of these multiple objectives simultaneously. To reduce the computational complexity of the algorithm, efficient non-dominated level update mechanism for sorting has been used, which eliminates the need of applying non dominated sorting from scratch every time. The algorithm returns a solution set consisting of multiple non dominated solutions, wherein every solution is a best solution according to some objective function, in a single run, from which any solution can be chosen based on user preferences. According to our simulation carried on MATLAB, the proposed approach outperforms the established clustering algorithms in terms of network characteristics such as network lifetime, energy consumption and number of packets received.
Author(s) Name:  Gunjan, Ajay K Sharma & Karan Verma
Journal name:  Wireless Networks
Publisher name:  Springer
Volume Information:  volume 26, pages 3637–3655 (2020)
Paper Link:   https://link.springer.com/article/10.1007/s11276-020-02281-8