Connectivity restoration in disjoint Wireless Sensor Networks using centrality measures

Abstract

In Mobile Sensor Networks (MSNs), connectivity of the sensor nodes with the sink node must be maintained at all times in order to sustain network operations. However, due to the depletion of limited on-board batteries and the exposure of the nodes to harsh environmental conditions, network can be subject to random node failures. While some of the failures can be compensated with redundancy, failure of the cut-vertex nodes renders the network partitioned. In order to restore connectivity with the sink, network structure can be updated through mobility of the nodes. However, mobility incurs excessive energy consumption and therefore, movement cost must be limited so that the network lifetime can be extended. In this paper, we present two approaches based on centrality metrics, which are commonly used in social network analysis. By applying these algorithms, we assess the relative importance of the nodes in a partition and use their centrality score while picking a node for movement. The first approach is based on closeness centrality where the less central nodes are favored for movement. The second approach is based on betweenness centrality where the nodes with the lower centrality scores are preferred for movement. The proposed approaches are implemented and tested against the currently used techniques.

Efficient Opportunistic Routing Protocol for Sensor Network in Emergency Applications

“…In this section, we analyze the energy efficiency of the proposed ODCR protocol, well-known clustering protocols LEACH [18] and TEEN [19] and a very recent opportunistic routing protocol, called LORA [21].…”

“…Though edge computing supports decentralized data processing, routing data is signification in such networks for disaster recovery. However, designing an efficient opportunistic routing protocol [8,[11][12][13][14][15][16][17][18][19][20][21][22] in terms of energy efficiency, reliability and successful message transmission is a major challenge because of the mobility of nodes (i.e., rescue team members), the low transmission ranges of devices (i.e., smartphones, sensors, Bluetooth). Hence, this paper introduces an opportunistic density cluster-based routing protocol (ODCR) for emergency/disastrous situations.…”

Self‐healing and energy‐efficient restoration in machine‐to‐machine networks

“…Considerable algorithms have been proposed for restoring a faulty network in literature [11][12][13][14][15][16][17][18][19][20][21]. However, most of these existing algorithms are based on wireless sensor networks, and few of researches focus on the recovery of an M2M network.…”

“…However, network coverage and energy consumption are also important for a network. To solve this problem, energy-centric optimised recovery plan (ECR) is proposed in [15]. ECR tries the best to maintain the original network coverage area and decrease the energy consumption.…”

“…Many schemes [11][12][13][14][15] are proposed to recover a damaged network from a critical node failure. However, most of them purely pursue to restore network connectivity rather than take a comprehensive consideration of network connectivity, coverage and energy consumption, which are also important to a network.…”