Abstract

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.

Full Text
Paper version not known

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 call

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.