Detecting and repairing network partition in wireless sensor networks

Devi, E. Anna; Manickam, J.

doi:10.1109/iccpct.2014.7054901

Cited by 4 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, they presented an Obstacle-avoiding Connectivity Restoration Strategy for mobile nodes to achieve connectivity. Anna Devi and Manickam 49 present a relocation mechanism for mobile sensor nodes to repair a partitioned network. They discussed the relocation of the mobile node to fill in the void space among separated segments of the network, by taking into account its degree of connectivity with the neighboring nodes.…”

Section: Mobility-based Solutionsmentioning

confidence: 99%

Toward connectivity of a disconnected cluster in partitioned wireless sensor network for time-critical data collection

Nasr

Khan

2020

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Reliable network connectivity is one of the major design issues in the context of wireless sensor networks. These networks have diverse communication patterns due to non-uniform sensing activities at various locations in the environment being monitored. In such scenarios, some nodes lying in high-traffic zones may consume more energy and eventually die out resulting in network partitioning. This gives rise to a situation in which alive nodes are trapped in a disconnected cluster, and they do not have enough radio range to communicate their data to the destination (i.e. a sink or a relay node connected to the main part of the network). This phenomenon may deprive a large number of alive nodes of sending their important time-critical data to the sink. In this article, we propose a virtual antenna–based cooperative beamforming approach for retrieving valuable data from these disconnected nodes. In the proposed approach, the sensor nodes in an isolated partition work together to form a directional beam. This directional beam significantly increases their overall communication range to reach out to a distant relay node which is connected to the main part of the network. The proposed approach of cooperative beamforming–based partition connectivity is more effective when a cluster with a favorably large number of nodes gets partitioned. Furthermore, a beamforming-based mechanism is proposed for a disconnected cluster to locate the nearest relay node which is still connected to the sink and to reconnect itself to the main part of the network via the most adjacent relay node for time-critical data transmission. The proposed mechanism is then evaluated through simulation results.

show abstract

Section: Mobility-based Solutionsmentioning

confidence: 99%

Toward connectivity of a disconnected cluster in partitioned wireless sensor network for time-critical data collection

Nasr

Khan

2020

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Hence, the network nodes should be mobile in case of failure. The self‐healing approaches are further divided into two parts: reactive and hybrid 1,22–24 In reactive approaches, the solution for reconnecting the partitions employs existing nodes to detect and recover the failure by relocating candidate nodes towards the failed node location, that is, node relocation 1 .…”

Section: Introductionmentioning

confidence: 99%

Network partition detection and recovery with the integration of unmanned aerial vehicle

Zear,

Ranga,

Gola

2024

Concurrency and Computation

View full text Add to dashboard Cite

SummaryWireless sensor and actor networks (WSANs) consist of nodes associated in an ad hoc manner to perform sensing tasks for information gathering and acting functions on the basis of gathered information. Connectivity is an essential requirement of large‐scale wireless networks, and WSANs are supposed to stay connected. The nodes in hostile environments are prone to failures such as battery depletion, physical damage, or hardware malfunction. The failure of some nodes, like cut vertex nodes, can partition the network into multiple network segments. Most of the solutions for network partition recovery proposed in the literature depend on the assumption that the network is obstacle‐free. However, an obstacle‐free environment is not possible in real‐life situations. In the last few decades, UAVs or drones have been engaged in various applications such as industrial inspections, remote sensing, agriculture, military, disaster relief, and so forth, UAVs can be employed to strengthen the connections in wireless networks by coordinating with ground nodes since they can render services in rough areas where ground nodes cannot provide services. Thus, our research is based on using UAVs as relay nodes to reconnect the disjoint partitions. This paper proposes two algorithms: Drone assisted partition recovery algorithm (DAPRA) and drone assisted detection and partition recovery algorithm (DADPRA). In both algorithms, partitions are detected by the sink node. In DAPRA sink node determines the failed cut‐vertex node and sends UAV to the location of the failed cut‐vertex node. In DADPRA algorithm, UAV identifies the failed cut‐vertex node and reconnects the disjoint network segments. DAPRA and DADPRA are analyzed according to the state‐of‐the‐art parameters, that is, recovery and detection time, UAV's travel distance, and the total messages transmitted. The proposed algorithms are compared with similar Distributed Partition Detection and Recovery using UAV (DPDRU) approach. The simulation results show the proposed algorithms detect network partitioning in less time as compared to DPDRU approach.

show abstract

“…It is the most popular and efficient mechanism where existing and additional nodes are deployed to re-establish connection among nodes (Jha et al, 2019;Joshi & Younis, 2016;Ranga et al, 2016b;Chouikhi et al, 2017). Finding an optimal relay count required to restore links is an optimization problem and requires complete information about the number of partitions and locations of nodes in them (Younis et al, 2014;Shriwastav & Ghose, 2018;Senturk et al, 2014;Chouikhi et al, 2017;Alfadhly et al, 2011;Cheng et al, 2017;Nikolov & Haas, 2016;Devi & Manickam, 2014;Zahid et al, 2018;Liu et al, 2018;Lee et al, 2016;Kumar & Amgoth, 2019;Lalouani et al, 2017;Ranga et al, 2016a).…”

Section: Introductionmentioning

confidence: 99%

Distributed partition detection and recovery using UAV in wireless sensor and actor networks

Zear¹,

Ranga

2021

KJS publishes peer-review articles in Mathematics, Computer Sci

View full text Add to dashboard Cite

Wireless Sensor and Actor Networks (WSANs) have been extensively employed in various domains ranging from elementary data collection to real-time control and monitoring for critical applications. Network connectivity is a vital robustness measure for overall network performance. Different network functions such as routing, scheduling, and QoS provisioning depends on network connectivity. The failure of articulation points in the network disassociates the network into disjoint segments. We proposed Distributed Partition Detection and Recovery using Unmanned Aerial Vehicle (UAV) (DPDRU) algorithm, as an optimal solution to recover the partitioned network. It consists of three steps: Initialization, Operational and Detection, and Recovery. In the Initialization phase sink node collects all the information about the network. In the Operational and Detection phase, network nodes communicate regularly by exchanging HEARTBEATS, detects failure if some nodes do not get a message from the neighbor node and send failure reports, and sink node identifies network partition. In the recovery phase, the sink node sends UAV at the positional coordinates of the failed node and examines network recovery after UAV reaches the desired location. Our approach primarily focuses on reducing message overhead by sending few update messages to sink node and energy consumption by engaging network nodes only for communication. The requirements of the recovery process (physical movement and communication) are fulfilled by UAV. The algorithm is tested according to the following parameters: Detection Time, Recovery Time, message overhead, and distance traveled by UAV. Simulation results validate the efficacy of the proposed algorithm based on these parameters to provide reliable results. The minimum and the maximum number of messages transmitted are 11 for 10 nodes and 24 for 100 nodes respectively. Hence these results demonstrate that the message overhead in our proposed solution is less as compared to other techniques when the number of nodes increases.

show abstract

Detecting and repairing network partition in wireless sensor networks

Cited by 4 publications

References 9 publications

Toward connectivity of a disconnected cluster in partitioned wireless sensor network for time-critical data collection

Toward connectivity of a disconnected cluster in partitioned wireless sensor network for time-critical data collection

Network partition detection and recovery with the integration of unmanned aerial vehicle

Distributed partition detection and recovery using UAV in wireless sensor and actor networks

Contact Info

Product

Resources

About