A novel approach based on bio-inspired efficient clustering algorithm for large-scale heterogeneous wireless sensor networks

被引:5
作者
Lohar, Lokesh [1 ]
Agrawal, Navneet Kumar [1 ]
Gupta, Prateek [2 ,6 ]
Kumar, Manoj [3 ,4 ]
Sharma, Ajay Kumar [5 ]
机构
[1] MPUAT, Dept Elect & Commun, CTAE, Udaipur, Rajasthan, India
[2] UPES, Dept Comp Sci, Dehra Dun, Uttaranchal, India
[3] Univ Wollongong Dubai, Fac Engn & Informat Sci, Dubai, U Arab Emirates
[4] Middle East Univ, Fac Informat Technol, Amman, Jordan
[5] NIT, Dept Comp Sci, Delhi, India
[6] UPES, Dept Comp Sci, Dehra Dun 248007, Uttaranchal, India
关键词
clustering; energy efficient; heterogeneous sensor nodes; heterogeneous WSN; network lifetime; OK-MICHB algorithm; optimised K-means algorithm; stability region; wireless sensor network; OPTIMIZED-HEED PROTOCOLS;
D O I
10.1002/dac.5472
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In large-scale heterogeneous wireless sensor networks (WSNs), clustering is particularly significant for lowering sensor nodes (SNs) energy consumption and creating algorithm more energy efficient. The selection of cluster heads (CHs) is a crucial task in the clustering method. In this paper, optimised K-means clustering algorithm and optimised K-means based modified intelligent CH selection based on BFOA for large-scale network (lar-OK-MICHB) is hybridised for CH selection process. Here, we utilised the extended capabilities of OK-MICHB algorithm for large-scale network. Furthermore, in many applications where energy is a primary constraint, such as military surveillance and natural disaster prediction, the stability region is also a significant factor, with a longer network lifespan being a primary requirement. In the proposed approach, only the CH selection is made after every round in place of cluster and CH change as done in conventional hierarchical algorithm. The simulation results reveal that, while keeping the distributive structure of WSNs, suggested lar-OKMIDEEC can locate real greater leftover energy nodes for selection of CH without utilising randomise or estimated procedures. Furthermore, as compared with the multi-level MIDEEC protocol, this offers a larger stability region with 68.96% increment, more consistent selection of CH in every round, and greater packets (i.e., in numbers) received at the base station (BS) with a longer network lifetime with 327% increment.
引用
收藏
页数:13
相关论文
共 34 条
[1]   Clustering in sensor networks: A literature survey [J].
Afsar, M. Mehdi ;
Tayarani-N, Mohammad-H. .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2014, 46 :198-226
[2]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[3]   Energy conservation in wireless sensor networks: A survey [J].
Anastasi, Giuseppe ;
Conti, Marco ;
Di Francesco, Mario ;
Passarella, Andrea .
AD HOC NETWORKS, 2009, 7 (03) :537-568
[4]  
Dorigo M., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1470, DOI 10.1109/CEC.1999.782657
[5]   An enhanced energy proficient clustering (EEPC) algorithm for relay selection in heterogeneous WSNs [J].
Guleria, Kalpna ;
Verma, Anil Kumar ;
Goyal, Nitin ;
Sharma, Ajay Kumar ;
Benslimane, Abderrahim ;
Singh, Aman .
AD HOC NETWORKS, 2021, 116
[6]   GA-UCR: Genetic Algorithm Based Unequal Clustering and Routing Protocol for Wireless Sensor Networks [J].
Gunjan ;
Sharma, Ajay K. ;
Verma, Karan .
WIRELESS PERSONAL COMMUNICATIONS, 2023, 128 (01) :537-558
[7]  
Gupta P., 2012, 1 INT C INNOVATIONS, P1
[8]   Clustering-based heterogeneous optimized-HEED protocols for WSNs [J].
Gupta, Prateek ;
Sharma, Ajay K. .
SOFT COMPUTING, 2020, 24 (03) :1737-1761
[9]   Energy efficient clustering protocol for WSNs based on bio-inspired ICHB algorithm and fuzzy logic system [J].
Gupta, Prateek ;
Sharma, Ajay K. .
EVOLVING SYSTEMS, 2019, 10 (04) :659-677
[10]   Designing of energy efficient stable clustering protocols based on BFOA for WSNs [J].
Gupta, Prateek ;
Sharma, Ajay K. .
JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2019, 10 (02) :681-700