.png){kind=icon}
.png){kind=icon}
Return
Adaptive SSO based node selection for partial charging in wireless sensor network
.png){kind=icon}
PRE
AI
DOI：10.1007/s12083-021-01282-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Wireless chargers provide dynamic range of power to wireless sensor network (WSN). These chargers may come under the Wireless Rechargeable Sensor Networks (WRSNs) category. The WRSNs are flexible in nature and this is further improved by introducing the mobile chargers (MCs) in WRSNs. MCs perform wireless energy transfer in WSN to replenish the energy minimized nodes. WRSNs offer controllable and predictable energy replacement to maximize the network lifetime. The availability of a single MC fails to maximize the lifetime of whole network. Therefore, multiple MCs are used in this partial charging approach to maximize the lifetime of whole network. To accomplish this partial charging process, initially the whole network is clustered by k-means clustering algorithm. Then, a deer hunting optimization (DHO) algorithm is introduced to select the Cluster Head (CH) for the selected clusters. Through the selected CH, the data transmission is performed between the source node and sink node. Next, the nodes that lost their energy during data transmission is identified using a metaheuristic algorithm namely adaptive social ski-driver optimization (ASSO). Based on the optimal result, the path is planned by multiple MCs to perform partial charging. While compared with single MC, the multiple MCs may face some coordination problems. To avoid this, the multiple MCs are co-ordinate on a distance basis, so that the complex partial charging can be achieved effectively. Partial charging improves the robustness and scalability of the entire network. Experimental results shown by the proposed approach has significantly outperforms the existing methods in terms of efficiency, network lifetime, delay, and complexity. The overall survival rate achieved by the proposed algorithm is 98% for 400 nodes, which is better than other algorithms. This is due to the introduction of an optimization for optimal node selection, whose performance has directly induced an influence in overall survival rate.
Keywords:
Wireless sensor network
Mobile chargers
Partial charging
k-means clustering
Deer hunting optimization
Adaptive social ski-driver optimization
Journal
IF:
2.6
Papers:
2.2K
Citations:
2.9K