Distributed connectivity restoration in networks of movable sensor nodes. (November 2016)

• Record Type: Journal Article
• Authors: Sharma, Krishna P.; Sharma, T.P.
• Is Part Of: Computers & electrical engineering. Volume 56(2016)
• Page Start: 608
• Page End: 629
• Publication Date: 2016-11
• Subjects: Wireless sensor network -- Restoring connectivity -- Fault tolerance -- Node failure -- Topology repair; Computer engineering -- Periodicals; Electrical engineering -- Periodicals; Electrical engineering -- Data processing -- Periodicals; Ordinateurs -- Conception et construction -- Périodiques; Électrotechnique -- Périodiques; Électrotechnique -- Informatique -- Périodiques; Computer engineering; Electrical engineering; Electrical engineering -- Data processing; Periodicals; Electronic journals; 621.302854
• DOI: 10.1016/j.compeleceng.2016.10.014
• Languages: English
• ISSNs: 0045-7906

Abstract

Highlights: A distributed strategy is proposed for finding relocation overhead associated with movement of each node during cascaded relocation process. A criteria is given for selecting suitable node to relocate during cascaded movement. The performance of the scheme is evaluated and compared with other baseline approaches through example networks. The approach is validated analytically and through ns-2 based simulation. Abstract: In wireless sensor networks, hostile deployment terrains make resource constrained sensor nodes vulnerable to failures. Sometimes, even a single node failure can partition a network into many disjoint segments and can fail the application mission completely. Since, in most scenarios manual intervention is not possible and hence network must have self-healing capability by detecting and recovering faults at its own. In this paper, a distributed connectivity restoration (DCR) scheme is proposed which on node failure(s) reconstructs the network topology by using cascaded node movements enabling self-healing capability in the network. The DCR is based on partial network information including topological overhead associated with each node. The selection of befitting nodes to be relocated during cascaded movement is done strategically by using partial network information such that the relocation and message overheads are reduced. Ns-2 based simulation experiments are performed to evaluate the performance of the proposed scheme and is compared with other baseline approaches. Graphical abstract: