Abstract
Abstract The lost connectivity due to failure of large-scale nodes plays major role to degrade the system performance by generating unnecessary overhead or sometimes totally collapse the active network. There are many issues and challenges to restore the lost connectivity in an unattended scenario, i.e. how many recovery nodes will be sufficient and on which locations these recovery nodes have to be placed. A very few centralized and distributed approaches have been proposed till now. The centralized approaches are good for a scenario where information about the disjoint network, i.e. number of disjoint segments and their locations are well known in advance. However, for a scenario where such information is unknown due to the unattended harsh environment, a distributed approach is a better solution to restore the partitioned network. In this paper, we have proposed and implemented a semi-distributed approach called Relay node Placement using Fermat Point. The proposed approach is capable of restoring lost connectivity with small number of recovery relay nodes and it works for any number of disjoint segments. The simulation experiment results show effectiveness of our approach as compared to existing benchmark approaches.
Highlights
The use of wireless sensor networks (WSNs) has become very common in the real life in recent years due to tremendous advancement in its wireless and sensing technologies
We have proposed and implemented a semi-distributed approach called Relay node Placement using Fermat Point (RPFP)
Conclusion and future scope The performance of unattended WSNs depends upon the connectivity among the backbone connected dominating set (CDS) of sensor nodes
Summary
The use of wireless sensor networks (WSNs) has become very common in the real life in recent years due to tremendous advancement in its wireless and sensing technologies. Placement of RRNs to rehabilitate the lost connectivity of partitioned network After the identification of a point P on which the gradient vanishes inside Δi, our proposed approach RPFP will deploy RRNs towards that point to restore lost connectivity. (6) Each RRN will repeat steps 2–5 until it reaches its calculated destination and marks its position as occupied Before start of actual deployment of RRNs in the partitioned network, our proposed approach forms a convex hull polygon of the outer disjoint segments and computes Rps as shown in procedure Failure_detection(). In this approach, it is assumed that all nodes know the complete topology of the network before the partition occurs in the network. Where X and Y are the coordinates of the CoD and m is the number of disjoint segments occurs in the network
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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
