Backup node selection using particle swarm optimisation algorithm for cut node recovery in wireless sensor network

E. Anna Devi and J. Martin Leo Manickam

International Journal of Business Information Systems, 2020, vol. 35, issue 3, 340-362

Abstract: Due to the failure or cut of a node, the performance of the network is affected. So cut node detection and recovery are presented in this paper. Initially, sensor nodes in the search area are clustered using the node weight of the sensor nodes. The node with maximum weight is selected as a cluster head (CH) and this CH performs as a monitor node which monitors all non-CH members in a cluster. Backup nodes (BNs) are selected in each cluster using particle swarm optimisation (PSO) algorithm. A cut node in the network is detected based on its hop-count and link cost value. This cut node is recovered by the selected backup nodes and mobile nodes (MNs) in the network. Simulation results show that the performance of the proposed approach outperforms that of the existing approach in terms of overhead, energy efficiency, network lifetime and BN selection time.

Keywords: wireless sensor network; WSN; node weight; backup node; BN; particle swarm optimisation; PSO; cut node recovery. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=111422 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijbisy:v:35:y:2020:i:3:p:340-362

Access Statistics for this article

More articles in International Journal of Business Information Systems from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().