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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Business Information Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
