# PACR: Position-Aware Protocol for Connectivity Restoration in Mobile Sensor Networks

Authors: Rab Nawaz Jadoon; Adnan Anwar Awan; Muhammad Amir Khan; WuYang Zhou; Aqdas Naveed Malik
Journal: Wireless Communications and Mobile Computing
 (2020)

---

## Abstract

Wireless Sensor Networks (WSNs) have gained global attention in recent times due to their vast applications in various fields. These networks can face the disruption of data transmission due to sensor node failures when placed in harsh, inaccessible, and adverse environments such as battlefields or monitoring in enemy territory. The specific tasks performed by the collaboration among the sensor nodes in WSNs by internode connectivity may be terminated. Besides this, due to the failure of sensor nodes, the area covered by the network may be limited, which can cause damage to the objectives for such a network, as there might be an unaware danger in the lost area. Connectivity is a big problem in mobile WSNs due to the mobility of nodes. Researchers have developed a lot of algorithms that are capable enough for connectivity problems, but they do not emphasize the loss of coverage. We try to fill these gaps by proposing the new hybrid algorithm PACR (Position-Aware protocol for Connectivity Restoration). The concept behind PACR is the same as a person who writes his will before death on a deathbed. In the same way, when the sensor energy is below the threshold, it is converted into a recovery coordinator and generates a recovery plan. This accelerates the recovery by decreasing the time needed for failure identification. For the recovery process, the neighbor’s nodes do not travel to the exact position of the failed node. Instead, they just move to the distance where they can build communication links with other nodes. This greatly prolongs the network lifetime. The simulation results show that PACR outperforms other techniques present in the literature.


---

## Body

## 1. Introduction

Wireless Sensor Networks (WSNs) are an important topic of research these days. WSNs have densely distributed sensor nodes with low cost, having low power. These nodes send their sensed data to sink nodes located in WSNs [1, 2]. Data like temperature, pressure, light, soil composition, humidity, detection of chemical and biological attacks, sound recording, etc. is sensed by these nodes. The sensed data is collected, organized, and analyzed to perform different necessary actions. The motivation behind the development of Wireless Sensor Networks is to perform necessary actions in battlefield surveillance, monitoring industrial processes, controlling machine health, health care, security, surveillance, etc. [3, 4]. Sensor nodes consist of sensors, a battery, microcontroller, and transceiver for communication of data. These nodes may be mounted on robotic vehicles, and such nodes are known as mobile nodes. The main advantage of WSNs is to sense data in a harsh environment. These harsh environments include battlefields, volcanic mountains, and any other environment where human intervention is impossible. Sensor nodes can be deployed randomly or preplanned in the area of interest (AOI). In some situations, node deployment is preplanned, i.e., they do not need to configure themselves for positioning in the network. On the other hand, in harsh environments, sensor nodes are deployed randomly so that they can configure themselves into a communication network and perform their task. So, various techniques have been proposed for these two kinds of deployments in the literature so far. Details of such techniques are given in the literature review section. The coverage area and connectivity of sensor nodes play a very important role in any network design to perform specific tasks. Coverage area is important because after deployment for performing their task, nodes have to sense data around their surroundings in a specific area. That specific area is known as the coverage area. Connectivity is the ability of the sensor nodes to find out the routes to transmit the sensed data to the sink node. If the connectivity is lost due to any reason, then the sensed node cannot reach the sink node and data processing cannot be done. So, the important task for which the network is deployed cannot be done properly; hence, keeping connectivity is important.Sensor nodes may fail due to battery depletion, malfunction, or destruction in harsh environments. These failures may lead to serious damage to WSNs. A network will lose the coverage area and connectivity in case of failure. Hence, the main objectives of WSNs will be compromised. The topology of the network will also change due to the failure of nodes. Therefore, we need to detect the failure and should adopt some method to restore connectivity. Batteries can be changed and nodes can be replaced for maintaining the connectivity and for lifetime improvement, but in harsh environments, it is difficult or almost impossible to change the batteries of sensor nodes or to replace failed nodes. When a node fails, we have to adopt some methods to recover it. Sometimes, a large number of nodes fail at a time which affects the task being performed by the network and reduces the significance of that network. So, this issue drew the researcher’s attention towards the solution of simultaneous failed node recovery. So far, different strategies have been proposed in the literature for the retrieval of node failures. In the first approach, the topology of the network may be reorganized by the repositioning of sensor nodes to restore the connectivity. Such techniques supported the self-healing of WSNs. These techniques used a distributive manner, whereas the second approach uses multiple-relay sensor nodes to reinstate the multiple split segments. In the third technique, by mobile mules, data is collected and is used to determine the cut vertexes and transmission of that data from one segment of the network to another in WSNs [5].A roaming location secrecy approach for users of position-based services (PBSs) using machine learning techniques is suggested in [6]. The writers propose a triphase method for wandering PBS users. By combining decision trees and k-nearest neighbor, it identifies user location and estimates user destination using hidden Markov models along with the sequence of position tracks. Also, a mobile edge computing service approach that will ensure the timely implementation of PBSs is adopted by the proposed model. The benefits of a mobile edge service strategy provide location anonymity and low latency in the proximity of roaming users through networking and processing facilities.An energy-conscious green adversary model is proposed in [7] for its use in smart industrial environments by preserving secrecy. While it is possible to jointly upgrade the hardware and software elements of cyber-physical networks to reduce their energy consumption, this focuses on issues of place conservation and material secrecy. The authors provide several testimonials to help cyber-physical defence experts and analysts based on literature results (assumptions, adversary priorities, and capabilities). To minimize the expense of communication and computing with each query, the proposed model running on real-time, anticipatory position-based query scheduling facilitates the minimization of energy usage. Furthermore, we calculate the move/approval slots that are needed for each query to prevent degrading slots. Experimental results show that the new approach would minimize energy consumption by up to five times by existing practices.The main purpose explained in [8] is to increase the network lifetime by extending the operating sensor lifespan as well as transferring the data obtained from the super node to the sink. In this article, the Bat Algorithm (BA) is used to select the best node for the monitoring sensor and the effective path to reducing energy consumption. Simulation results and comparison with other algorithms indicate the supremacy of the suggested algorithm. The simulation results of the proposed algorithm reveal that the algorithm proposed was able to decrease the power consumption of the network and improve the service life of the network. The proposed algorithm could also, on average, outperform the comparable algorithms by 27%.The whale optimization algorithm (WOA) in [9] is proposed to solve the problem of resource distribution (RA) in the Internet of Things (IoT) with the aim of optimized RA and to reduce the total cost of connectivity between resources and gateways. Comparing other existing algorithms with the proposed algorithm, the findings show that the algorithm proposed works properly. In terms of the total cost of communication, the planned process is greater than others, depending on various parameters.In the context of the sections referred to above, the main contributions of this paper are as follows:(i)
As mentioned earlier, the notion behind PACR is like a person writing his will on a deathbed before he dies. Similarly, when the energy of the sensor is less than the threshold, this sensor node is considered as an ill node on a deathbed. So, it will become a recovery coordinator and will draw up a recovery plan. It speeds up recovery by reducing the time taken to diagnose a failure, establishing a recovery coordinator and eventually creating a recovery plan(ii)
In addition to the accelerated recovery, PACR’s other contribution is to make the node movement efficient. As a replacement for relocating the recovery sensor node to the exact location of the failed node, it can travel just the distance where it can get near the failed sensor node and be connected to its neighbor. This will reduce the movements of recovery nodes. This kind of recovery strategy plays a key role in saving energy in movement; it decreases the trip distance and the number of neighbors participating in the recoveryThe rest of the paper is organized as follows. Section2 gives the literature review work in a summarized manner, whereas Section 3 has the details of the proposed algorithm. Validation of the proposed algorithm by outcomes of simulations is presented in Section 4, whereas Section 5 concludes the paper and discussion of future work.


## 2. Related Work

This section includes a survey on the recent work done in the domain of coverage and connectivity restoration issues in WSNs. The survey demonstrates that recovery policies opted by researchers in this regard broadly focus on sustaining network connectivity while maintaining prefailure network topology. The restoration policies work in two main steps: first is the detection of failure node and second is the implementation of the recovery plan.In [10], the authors proposed an algorithm under the name of Partition Detection and Recovery Algorithm (PADRA) which predetermines the critical nodes that can potentially segment the network. After the identification of cut vertexes, a suitable neighbor is appointed as a recovery node. When such a node fails, the selected neighbor replaces it whose relocation does not break the network into disjoint regions. Cascaded movement is initiated by such repositioning which consumes a lot of energy.In [11], the authors proposed an algorithm under the name of Coverage Conscious Connectivity Restoration (C3R). The technique assures connectivity restoration while maintaining the prefailure network coverage by temporarily relocating the neighboring node at the position of the failed node. After the detection of failure, a schedule is generated by a recovery coordinator which holds the information about the participating neighboring node in the recovery process along with their turns. Each node on its predefined turn will be relocated at the location of the failed node, and after staying there for some time, it will be sent to its original position. After that, the other node on the schedule list will be repositioned to the failed node, and it will repeat the same process. The adopted back and forth movement will restore connectivity but at the cost of more energy loss and message overhead.In [12], the authors proposed the technique Volunteer-instigated Connectivity Restoration (VCR) which is aimed at limiting the cascaded movement of nodes. The failure of a node like any other protocol is detected through missing heartbeat signals. The nearest neighbor of the failed node is selected for the recovery based on the vicinity, as only the closest neighbor performs the restoration which aids in restricting the movement of all the neighbors towards the failed node. The approach might be helpful in the case of a static environment; however, there is no guarantee of restricting cascaded movement in a dynamic environment. Another limitation of VCR is the selection of the nearest neighbor for recovery irrespective of its energy level which might end up choosing a neighbor with a low energy level which will eventually lead to further node failure and reducing the life of the network.In [13], the authors proposed an algorithm that focuses on two issues: first is the connectivity restoration by node repositioning and second is the reduction in coverage holes created by node relocation which is named as the Minimum Movement Technique (MMT). First of all, the critical nodes of the network are identified using an algorithm named cut vertex determination. After the identification of the cut vertex, these cut vertexes will allocate a node from its neighbor to replace it in case of failure and it will be called dominant. In case of failure, the cascaded movement takes place starting from the dominant position until it reaches the failed node. MMT is used to reduce the coverage holes caused by cascaded movement by placing the failure handler close to the failed node without losing its connectivity.In [14], the authors proposed a connectivity restoration algorithm called Least-Disruptive topology Repair (LeDiR) for WSANs. The failure of a node is identified through a missing heartbeat signal. In case of a node failure, each neighbor based on the routing table will define the suitable measures to be taken and their role in it. However, in case of critical node failure, LeDiR is aimed at finding out the smallest block; therefore, only neighbors belonging to the smallest block will participate in the recovery plan. The repositioning of the smallest block encourages the relocation of a minimum number of nodes which will reduce the overhead along with the guarantee of not extending lengths of paths between nodes. LeDir exploits already existing activities of routing and hence does not add on any communication overhead.In [15], the authors presented an approach called RAM which extends the DCR algorithm. The technique focuses on handling multiple node failures simultaneously. The objective is achieved by selecting a backup node that is noncritical, and it can have only one primary. Another constraint in this regard was that two inline critical actors cannot serve as each other’s backup. Finally, if a critical node selects a noncritical node as a backup, the backup node also has to select a backup node for itself to handle multiple adjacent node failures.In [16], the authors present a technique called Incremental Optimization based on Delaunay Triangulation (IO-DT) which is a relay node placement issue. The algorithm solves three-terminal problems and identifies the least number of relay nodes by making use of subsets of terminals. The objective is accomplished by calculating the Delaunay triangulation (DT) of terminals, and it is repeated on the triangles. Consider this, if choosing this triangle to reduce the number of relay nodes as compared to most-based solution then it will transform the triangle into final topology. The disadvantage of such an approach is its complexity.In [17], the authors proposed an algorithm that is aimed at controlling energy utilization and also reconnecting the network in case of failure of a node. The methodology makes use of a multichannel to communicate so that they can reduce the number of neighboring nodes sharing the same channel which aids in reducing the collision. In case of a node failure, the network performs the connectivity, and the restoration plan is executed in two steps. The first step involves reorganizing the nodes to reconnect the lost connection created due to the failure of a node. The second step is to recolor the repositioned nodes without disturbing the entire network. Performance evaluation is done using simulation.In [18], the authors proposed a technique called Optimal Relay Node Placement (ORNP) for the restoration of lost connectivity while effectively reducing the number of relay nodes in WSNs. ORNP segments the entire region of interest into subregions by using the Voronoi partition. Each segment is the Voronoi cell which consists of cluster heads along with their cluster members. When the network gets partitioned, a node sharing two or more cluster heads will become a relay node. The assigned task of this node is to link broken segments. Furthermore, 3-star technology will reduce the number of disjoint regions by repeatedly deploying a relay node in each of the three disconnected regions. Lastly, all the leftover disjoint regions are identified by calculating the center of mass. The connectivity of a network is restored by relocating the relay nodes which are located towards the center of mass.In [19], the authors proposed a technique called Recovery through Inward Motion (RIM) to deal with connectivity gaps created due to node failure. The missing hello messages provide information about the failure of the node. After the detection of failure, all the neighboring nodes start in an inward motion towards the failed node, hence participating in the recovery process. Although RIM is a noncomplex approach, cascaded relocation of the neighboring nodes towards failed nodes results in two major drawbacks. Firstly, the movement will cause a reduction in the coverage area, and secondly, it will lead to more energy consumption which might decrease the lifespan of the network.In [20], the authors devise a technique to develop a path from the region of interest to the base station with the focus of encountering the least number of hops. It will enable us to find out a minimum distance in such a way that the network remains connected. Their opted strategy comprises of two other algorithms. The first algorithm will search for the robot which is at the minimum distance to the required location, and then it will be allocated to that area. Afterward, the algorithm looks for the closest disjoint robot and directs it in the transmission range of a robot that is already linked with the assigned robot. The process is repeated to rejoin the whole network. In the second algorithm, the goal is to find out those areas where it can optimally deduct the number of hops from the base station to the location of the event.In [21], the authors aim to devise a technique to deal with the issue of connectivity restoration while taking into consideration the significance of the affected area. The strategy is based on relocating the nodes to the area of high importance while rejoining the detached clusters. The algorithm is built upon a round table technique in which a negotiator from each cluster travels and negotiates with others by interchanging information and determining the path for reconnection. In addition to the basic round table, the proposed technique also replaces the failed nodes. Recovery and reconnection are implemented in three modules: reconnection, recover and reconnect, and, lastly, reconnect and recover.In [22], the authors proposed an algorithm for connected p-percent coverage problems in Wireless Sensor Networks (WSNs) to boost overall network life. In this work, they investigate the p-percent coverage problem (PCP) in WSNs that need p-percent of the region to be monitored correctly and to find out any additional criteria for the related p-percent coverage problem. They suggest a pDCDS algorithm that is a PCP-based learning automation algorithm. PDCDS is a degree-restricted connected dominating set-based algorithm that detects the minimum number of nodes to control the field. The simulation results show that pDCDS can dramatically improve the existence of the network.In [23], the authors presented PCLA, an efficient learning automation algorithm that is aimed at reducing the number of sensors to be enabled, so that a certain portion of the area of interest is protected and the communication between the sensors is maintained. Simulation results show how PCLA can efficiently pick sensors to meet the constraints imposed, thus ensuring better output in terms of both the working-node ratio and the WSN lifetime. They also demonstrate how PCLA outperforms state-of-the-art partial-cover algorithms.In [24], the authors suggest an abnormal cellular learning automation- (ICLA-) based algorithm, called SPLA, to maintain the safety of sensors. The goal of learning automation at each ICLA cell with proper rules is to investigate the minimum possible number of nodes to guarantee the self-protection requirements of the network. To test the efficiency of SPLA, several simulation experiments have been carried out, and the results obtained show that SPLA performs on average 50 percent better than the maximum independent set and the minimum connected dominant set algorithms in terms of the active node ratio and can provide a twofold reduction in energy consumption. Table1 shows the characteristics of different techniques.Table 1
Characteristics of techniques based on multiple parameters.
ReferenceAlgorithmTechniqueFault toleranceNeighbor informationSensor typeCentralizedDistributedControlled movementDeployment of new nodesSingle node/multiple nonadjacent nodesMultiple adjacent node1 hop2 hopSM[7]✔✔✔✔✔[8]✔✔✔✔✔[9]✔✔✔✔✔[10]✔✔✔✔✔✔[11]✔✔✔✔✔✔[12]✔✔✔✔✔✔✔[13]✔✔✔✔✔✔[14]✔✔✔✔✔[15]✔✔✔✔✔[16]✔✔✔✔[17]✔✔✔✔✔The above approaches for solving the connectivity problem have been suggested in the literature. While all these strategies have the potential to regain connectivity, these techniques do not address the coverage problem. Only C3R [7] gives a solution for connectivity and coverage. C3R gives the solution, by moving neighboring nodes towards the direction of the failed node. This motion can result in energy dissipation. Besides, after the diagnosis of failure, the recovery process will begin, which will introduce a time delay, rendering it ineffective for mission-critical scenarios. By proposing a novel Position-Aware protocol for Connectivity Restoration (PACR) algorithm, we aim to fill these loopholes. In our technique, if a sensor node’s energy is less than a threshold, it will become a recovery coordinator and will establish a recovery strategy. By taking out the time required to diagnose a loss, making a recovery coordinator, and eventually generating a recovery plan, it makes the recovery fast.The other strength of PACR, in addition to the quick recovery, is to make the network energy efficient. First of all, instead of pushing the recovery sensor to the exact location of the failed node, it can just travel that much distance where it can get close to the failed sensor and become linked to its neighbor. Along with it, if there is a sensor that can be repositioned without losing any connections of its own, and in this situation, only the neighbors can do the recovery in touch with neighbors of the failed node. This design of the recovery strategy plays a critical role in reducing the resources involved during transportation by limiting the distance of travel and the number of neighbors participating in the recovery process.


## 3. System Model and Problem Formulation of PACR

PACR is true for a network of mobile sensor nodes. Mobile nodes in a hierarchical network architecture can be part of a flat network topology or form a second level, such as a community of actors or aggregation and forwarding units. Sensors in a field of interest are deployed randomly. In the network, no spare nodes are given, however, whether either there is a node harm coverage void in the network or the number of active nodes is below three nodes. We consider, however, only one loss at a time. PACR does not cope with node errors that are overlapping.Separate sensing and communication ranges for a node may occur. No relation is presumed between the two ranges. It is believed that during network booting, trap nodes discover each other and form a connected network [7]. To plug a void in coverage and/or address a connection error, a node is believed to be able to travel on request. While absolute anode position coordinates are not required, PACR assumes that its location can be determined by a mobile node relative to its neighbors [8]. Each node is believed to maintain a list of its direct (1-hop) neighbors.The loss of a node due to malfunction may also impact network access, in addition to impacting network coverage. This paper focuses on retaining network connectivity when a node fails while ensuring coverage for prefailure. Consider the network topology seen in Figure1(a), for instance. Nodes n1, n2, n7, n6, and n8 are contiguous with n5. The loss of n6 would disconnect n4 and n8 from their neighbors from the rest of the network and leave a vacuum in coverage since no other node has its sensing spectrum overlapping with n5. It just shifts the coverage void to another part of the sector, either in the inner part of the network or at the periphery, whereas replacing n5 with another node would restore the connection. PACR opts to solve this problem by momentarily replacing the failing node with one or more of its neighbors. The concerned nodes switch back and forth so that the network topology and coverage remain largely identical to their prefailure status.Figure 1
(a) PACR; (b)n5 energy running low; (c) n1 changes its position; (d) n7 changes its position; (e) n6 changes its position; (f) n2 changes its position.
(a)(b)(c)(d)(e)(f)


## 4. Position-Aware Connectivity Restoration (PACR) Protocol

### 4.1. Prefailure Operation

The only prefailure information needed by PACR for each node is to have a list of 1-hop neighbors. With each node transmitting a Hello message to introduce itself to its neighbors, this list is created postdeployment [7]. The node’s location and the ID of all its neighbors will also be tabulated by each node. Absolute GPS-based coordinates are not required for the position; for PACR, relative positions will suffice. If there is a failed neighboring node, this information will be used. When a node A does not receive a preset number of Heartbeat messages from a neighboring node, F, it assumes that F has failed. When a node moves, it forms its neighbors to avoid being wrongly interpreted as defective. When a node moves, it forms its neighbors to avoid being mistaken. In other words, each time one of them changes its location, the list of neighbors can be changed.Node A conducts the recovery process after detecting a neighbor F failure. It is important to remember that there are two general strategies. The first is to determine whether the absence of F would partition the network and respond only if F is a cut vertex. This option, adopted by [11], prevents overreacting to a failure that does not prevent nodes from accessing each other.


### 4.2. PACR Working

The proposed PACR makes use of mobile sensors and requires the nodes to maintain knowledge of their 2-hop neighbors. Each node will keep in check its energy level, and whenever it drops below a threshold, it will become a recovery coordinator and design the recovery plan. The major steps involved in PACR are as follows.


#### 4.2.1. Status Table for 2-Hop Neighbor

In the postdeployment phase, each sensor will broadcast a Hello message to its immediate neighbors. After the introduction, every node must maintain a status table of its 2-hop neighbor to cater to the changes in the network topology. The parameters of the list involve {Node_ID, Distance}. The information about the distance of 2-hop neighbors will aid to reduce the energy consumption by restraining the far sensors from getting involved in the recovery process. When the energy of a sensor falls below a predefined value, then it will initiate its recovery plan.


#### 4.2.2. Distance Measurement

In the proposed algorithm, recovery nodes will move a minimum distance so that they cover the connectivity and coverage of the failure node. So, for the recovery process, every recovery node will calculate the overlap area with its neighbor nodes and the minimum distance for the movement. Letr0 be the coverage radius of N0 and N1 nodes and “d” is the distance between nodes as shown in Figure 2(a). The maximum distance N0 or N1 can move is
(1)l1=2r0−d2.Figure 2
(a) Overlapped region of nodesnoand n1; (b) illustration of the calculation of the required distance.
(a)(b)Now, for the calculation of the required distance for the coverage and connectivity of the failure node, each recovery node calculates the distance that it moves in the direction of the failure node to cover the connectivity. Each node has 2-hop information, so it calculates the distance with the node which has a maximum distance from it.d0,d1, and d2 in Figure 2(b) are the known distances for θ.
(2)sinθ=d0d2d1.For the required distance,θ and d1 are known and dris
(3)dr=2r0,wherer0 is the radius of the coverage area. Now, the distance a node will move for the coverage and connectivity is
(4)dn=d0−d1∗d2sinθ.


#### 4.2.3. Crafting Recovery Plan

As mentioned above, when the energy level of the sensor is less than 70% of its initial energy value, it will become a recovery coordinator, and its charge now is to identify the most competent backup neighbors. It will shortlist five of the neighbors with the least distance and with their energy above 30%. Afterward, a ranking list will be generated based on overlapping coverage, distance, and energy level of the node. This list will be holding the information about the number on which each node will be relocated along with the distance it has to travel to get near the failing node. After the list is broadcasted to the backup neighbors, each participating neighbor will examine its demanded repositioning distance. If a node is in the admissible moving range while staying connected to its neighbor, in this case, only that node will be the backup node. This message will be broadcasted to the failing node which in return will inform the other recovery neighbors by a broadcasting message about a change in the recovery plan. If two of such nodes are available, then the one with the higher energy will be selected. In case no node has overlapping coverage, then recovery will be done according to the set ranking list. Another important case to study will be the sudden failure of a node. Here, we will exploit the information about the 2-hop neighbor. As each surrounding neighbor has the information about the distance of two neighbors, so the one with the least distance will become a recovery coordinator again restraining the movement of all neighbors and eventually saving the energy of the network.


#### 4.2.4. Illustrative Example

The operation of PACR is demonstrated under consideration of the network topology in Figure1. The scenario of the failure of n5 node is shown in Figure 1. The following steps will be done.
(1)
This failure is detected by the neighboring nodes ofn5(2)
According to the ranked list, the first one for recovery in the illustration isn1 being the closest(3)
Before repositioning, it will broadcast the message to its neighbors to avoid its incorrect assumption of failure(4)
Another point to notice here is that the original position ofn5 is shown in the red circle whereas the new position of the recovery node n1 is in blue to explain the phenomenon that n1 will not be relocated at the exact position of n5(5)
After being there for its allocated time, it will move back to its original position and all the backup nodes will repeat the same procedure asn1(6)
Figure3 illustrates the scenario when the coverage hole can be filled by a slight repositioning of a single node(7)
After the detection ofn5 failure, n2 will be the only relocated backup node staying in contact with its neighbors and making new contacts with the neighbors of the failed node n5Figure 3
(a) PACR one node recovery; (b)n5 energy running low; (c) n2 permanent relocation; (d) new topology.The next section will discuss the pseudocode of PACR. The pseudocode will describe how a single node will tackle the following situations by using PACR(1)
when a node has less than 70% energy (coordinator)(2)
when it becomes a recovery nodeAlgorithm 1: PACR algorithm.
Input: AOI andRc1.Begin2.Check: If (node, A,Energy<30%)3.Broadcast (Node ID of A “Coordinator”)4.Check: the level of energy supply (maximum of 5 nodes)5.Make Recovery nodes having maximum energy6.Send message (“Recovery node”)//message will be sent to selected recovery nodes7.Generate (recovery plan basis on the energy level)8.Broadcast (recovery plan)9.End if10.If Received (Some node ID “Coordinator”) & (“Recovery node”)//messages11.Receive (Recovery Plan)12.Calculate (the area of the overlapped region).//Recovery nodes will calculate the area of the overlapped region13.Calculate (the required distance for movement).14.If (distance<length)15.Broadcast (“permanent relocation”)//Node will relocate16.End program17.End If18.Else19.If (Neighbor node B have alternate route)20.Send (data)//towards node B21.Else22.Buffer (data)23.End if24.Broadcast (“temporary relocation”)//message to neighbors25.Move (towards a failure node)26.End if27.If (Relocated Back to original position)28.If (data is buffering)29.then send data through original neighbors30.End if31.End if32.Else33.End Program34.If (Node A abrupt fail)35.Neighbor nodes will not receive a heartbeat message36.The first node will take responsibility37.Go to step 4


### 4.3. Complexity Analysis

PACR’s time complexity depends on the number of slave keepers, sensor nodes, and the energy measurement process for each node of the sensor.The number of coordinators is represented byc, the number of nodes of the sensor connected to each coordinator is represented by n, and the energy measurement method for each node of a sensor is represented by E.After the coordinator sends the signal to the recovery sensor nodes, the signal is sent to the sensor nodes involved. Now residual energies are correlated with threshold energy by sensor nodes. If each recovery sensor node has sufficient resources, the total number of iterations (best score) required to run the algorithm isn∗E. If the number of recovery sensor nodes is c, then n∗E∗c would be the total executions needed. In the worst case, if each sensor node’s energy is less than the threshold energy, n∗E∗n−1∗c is the total number of iterations (worst score) required to execute the algorithm.The essence of our proposed algorithm is polynomial. For each slave keeper, the external loop executes, and for each sensor node allocated to the new slave keeper, the nested loop is executed. The complexity of Algorithm1 is O (n2) in terms of the Big-O notation.


### 4.4. Energy Model

An energy model that is used for this research article is presented in [23]. A “B” bit data packet over distance “d” is transmitted and received by the sensor nodes. The energy expended per bit by the receiver is given by (5). The residual energy can be calculated by Equation (7).
(5)ETxB,d=Eelec+εfsd2Bd<d0,Eelec+εmpd4Bd≥d0,(6)ERxB=ERx‐elecB,(7)Erengn=Emax−ETxB,d−ERxB.The terms used in this energy model are explained in Table2.Table 2
Different variables used in the energy model.
VariableDefinitionETxEnergy consumption to transmit dataERxEnergy consumption to receive dataErengResidual energyEelecEnergy consumed by a transmitter per bitEmaxThe initial energy of nodes (maximum energy)ERx‐elecEnergy consumed by a receiver per bitεfsThe energy required by an amplifier in free spaceεmpThe energy required by an amplifier in multipathd0Threshold distance for sensor nodes


## 4.1. Prefailure Operation

The only prefailure information needed by PACR for each node is to have a list of 1-hop neighbors. With each node transmitting a Hello message to introduce itself to its neighbors, this list is created postdeployment [7]. The node’s location and the ID of all its neighbors will also be tabulated by each node. Absolute GPS-based coordinates are not required for the position; for PACR, relative positions will suffice. If there is a failed neighboring node, this information will be used. When a node A does not receive a preset number of Heartbeat messages from a neighboring node, F, it assumes that F has failed. When a node moves, it forms its neighbors to avoid being wrongly interpreted as defective. When a node moves, it forms its neighbors to avoid being mistaken. In other words, each time one of them changes its location, the list of neighbors can be changed.Node A conducts the recovery process after detecting a neighbor F failure. It is important to remember that there are two general strategies. The first is to determine whether the absence of F would partition the network and respond only if F is a cut vertex. This option, adopted by [11], prevents overreacting to a failure that does not prevent nodes from accessing each other.


## 4.2. PACR Working

The proposed PACR makes use of mobile sensors and requires the nodes to maintain knowledge of their 2-hop neighbors. Each node will keep in check its energy level, and whenever it drops below a threshold, it will become a recovery coordinator and design the recovery plan. The major steps involved in PACR are as follows.


### 4.2.1. Status Table for 2-Hop Neighbor

In the postdeployment phase, each sensor will broadcast a Hello message to its immediate neighbors. After the introduction, every node must maintain a status table of its 2-hop neighbor to cater to the changes in the network topology. The parameters of the list involve {Node_ID, Distance}. The information about the distance of 2-hop neighbors will aid to reduce the energy consumption by restraining the far sensors from getting involved in the recovery process. When the energy of a sensor falls below a predefined value, then it will initiate its recovery plan.


### 4.2.2. Distance Measurement

In the proposed algorithm, recovery nodes will move a minimum distance so that they cover the connectivity and coverage of the failure node. So, for the recovery process, every recovery node will calculate the overlap area with its neighbor nodes and the minimum distance for the movement. Letr0 be the coverage radius of N0 and N1 nodes and “d” is the distance between nodes as shown in Figure 2(a). The maximum distance N0 or N1 can move is
(1)l1=2r0−d2.Figure 2
(a) Overlapped region of nodesnoand n1; (b) illustration of the calculation of the required distance.
(a)(b)Now, for the calculation of the required distance for the coverage and connectivity of the failure node, each recovery node calculates the distance that it moves in the direction of the failure node to cover the connectivity. Each node has 2-hop information, so it calculates the distance with the node which has a maximum distance from it.d0,d1, and d2 in Figure 2(b) are the known distances for θ.
(2)sinθ=d0d2d1.For the required distance,θ and d1 are known and dris
(3)dr=2r0,wherer0 is the radius of the coverage area. Now, the distance a node will move for the coverage and connectivity is
(4)dn=d0−d1∗d2sinθ.


### 4.2.3. Crafting Recovery Plan

As mentioned above, when the energy level of the sensor is less than 70% of its initial energy value, it will become a recovery coordinator, and its charge now is to identify the most competent backup neighbors. It will shortlist five of the neighbors with the least distance and with their energy above 30%. Afterward, a ranking list will be generated based on overlapping coverage, distance, and energy level of the node. This list will be holding the information about the number on which each node will be relocated along with the distance it has to travel to get near the failing node. After the list is broadcasted to the backup neighbors, each participating neighbor will examine its demanded repositioning distance. If a node is in the admissible moving range while staying connected to its neighbor, in this case, only that node will be the backup node. This message will be broadcasted to the failing node which in return will inform the other recovery neighbors by a broadcasting message about a change in the recovery plan. If two of such nodes are available, then the one with the higher energy will be selected. In case no node has overlapping coverage, then recovery will be done according to the set ranking list. Another important case to study will be the sudden failure of a node. Here, we will exploit the information about the 2-hop neighbor. As each surrounding neighbor has the information about the distance of two neighbors, so the one with the least distance will become a recovery coordinator again restraining the movement of all neighbors and eventually saving the energy of the network.


### 4.2.4. Illustrative Example

The operation of PACR is demonstrated under consideration of the network topology in Figure1. The scenario of the failure of n5 node is shown in Figure 1. The following steps will be done.
(1)
This failure is detected by the neighboring nodes ofn5(2)
According to the ranked list, the first one for recovery in the illustration isn1 being the closest(3)
Before repositioning, it will broadcast the message to its neighbors to avoid its incorrect assumption of failure(4)
Another point to notice here is that the original position ofn5 is shown in the red circle whereas the new position of the recovery node n1 is in blue to explain the phenomenon that n1 will not be relocated at the exact position of n5(5)
After being there for its allocated time, it will move back to its original position and all the backup nodes will repeat the same procedure asn1(6)
Figure3 illustrates the scenario when the coverage hole can be filled by a slight repositioning of a single node(7)
After the detection ofn5 failure, n2 will be the only relocated backup node staying in contact with its neighbors and making new contacts with the neighbors of the failed node n5Figure 3
(a) PACR one node recovery; (b)n5 energy running low; (c) n2 permanent relocation; (d) new topology.The next section will discuss the pseudocode of PACR. The pseudocode will describe how a single node will tackle the following situations by using PACR(1)
when a node has less than 70% energy (coordinator)(2)
when it becomes a recovery nodeAlgorithm 1: PACR algorithm.
Input: AOI andRc1.Begin2.Check: If (node, A,Energy<30%)3.Broadcast (Node ID of A “Coordinator”)4.Check: the level of energy supply (maximum of 5 nodes)5.Make Recovery nodes having maximum energy6.Send message (“Recovery node”)//message will be sent to selected recovery nodes7.Generate (recovery plan basis on the energy level)8.Broadcast (recovery plan)9.End if10.If Received (Some node ID “Coordinator”) & (“Recovery node”)//messages11.Receive (Recovery Plan)12.Calculate (the area of the overlapped region).//Recovery nodes will calculate the area of the overlapped region13.Calculate (the required distance for movement).14.If (distance<length)15.Broadcast (“permanent relocation”)//Node will relocate16.End program17.End If18.Else19.If (Neighbor node B have alternate route)20.Send (data)//towards node B21.Else22.Buffer (data)23.End if24.Broadcast (“temporary relocation”)//message to neighbors25.Move (towards a failure node)26.End if27.If (Relocated Back to original position)28.If (data is buffering)29.then send data through original neighbors30.End if31.End if32.Else33.End Program34.If (Node A abrupt fail)35.Neighbor nodes will not receive a heartbeat message36.The first node will take responsibility37.Go to step 4


## 4.2.1. Status Table for 2-Hop Neighbor

In the postdeployment phase, each sensor will broadcast a Hello message to its immediate neighbors. After the introduction, every node must maintain a status table of its 2-hop neighbor to cater to the changes in the network topology. The parameters of the list involve {Node_ID, Distance}. The information about the distance of 2-hop neighbors will aid to reduce the energy consumption by restraining the far sensors from getting involved in the recovery process. When the energy of a sensor falls below a predefined value, then it will initiate its recovery plan.


## 4.2.2. Distance Measurement

In the proposed algorithm, recovery nodes will move a minimum distance so that they cover the connectivity and coverage of the failure node. So, for the recovery process, every recovery node will calculate the overlap area with its neighbor nodes and the minimum distance for the movement. Letr0 be the coverage radius of N0 and N1 nodes and “d” is the distance between nodes as shown in Figure 2(a). The maximum distance N0 or N1 can move is
(1)l1=2r0−d2.Figure 2
(a) Overlapped region of nodesnoand n1; (b) illustration of the calculation of the required distance.
(a)(b)Now, for the calculation of the required distance for the coverage and connectivity of the failure node, each recovery node calculates the distance that it moves in the direction of the failure node to cover the connectivity. Each node has 2-hop information, so it calculates the distance with the node which has a maximum distance from it.d0,d1, and d2 in Figure 2(b) are the known distances for θ.
(2)sinθ=d0d2d1.For the required distance,θ and d1 are known and dris
(3)dr=2r0,wherer0 is the radius of the coverage area. Now, the distance a node will move for the coverage and connectivity is
(4)dn=d0−d1∗d2sinθ.


## 4.2.3. Crafting Recovery Plan

As mentioned above, when the energy level of the sensor is less than 70% of its initial energy value, it will become a recovery coordinator, and its charge now is to identify the most competent backup neighbors. It will shortlist five of the neighbors with the least distance and with their energy above 30%. Afterward, a ranking list will be generated based on overlapping coverage, distance, and energy level of the node. This list will be holding the information about the number on which each node will be relocated along with the distance it has to travel to get near the failing node. After the list is broadcasted to the backup neighbors, each participating neighbor will examine its demanded repositioning distance. If a node is in the admissible moving range while staying connected to its neighbor, in this case, only that node will be the backup node. This message will be broadcasted to the failing node which in return will inform the other recovery neighbors by a broadcasting message about a change in the recovery plan. If two of such nodes are available, then the one with the higher energy will be selected. In case no node has overlapping coverage, then recovery will be done according to the set ranking list. Another important case to study will be the sudden failure of a node. Here, we will exploit the information about the 2-hop neighbor. As each surrounding neighbor has the information about the distance of two neighbors, so the one with the least distance will become a recovery coordinator again restraining the movement of all neighbors and eventually saving the energy of the network.


## 4.2.4. Illustrative Example

The operation of PACR is demonstrated under consideration of the network topology in Figure1. The scenario of the failure of n5 node is shown in Figure 1. The following steps will be done.
(1)
This failure is detected by the neighboring nodes ofn5(2)
According to the ranked list, the first one for recovery in the illustration isn1 being the closest(3)
Before repositioning, it will broadcast the message to its neighbors to avoid its incorrect assumption of failure(4)
Another point to notice here is that the original position ofn5 is shown in the red circle whereas the new position of the recovery node n1 is in blue to explain the phenomenon that n1 will not be relocated at the exact position of n5(5)
After being there for its allocated time, it will move back to its original position and all the backup nodes will repeat the same procedure asn1(6)
Figure3 illustrates the scenario when the coverage hole can be filled by a slight repositioning of a single node(7)
After the detection ofn5 failure, n2 will be the only relocated backup node staying in contact with its neighbors and making new contacts with the neighbors of the failed node n5Figure 3
(a) PACR one node recovery; (b)n5 energy running low; (c) n2 permanent relocation; (d) new topology.The next section will discuss the pseudocode of PACR. The pseudocode will describe how a single node will tackle the following situations by using PACR(1)
when a node has less than 70% energy (coordinator)(2)
when it becomes a recovery nodeAlgorithm 1: PACR algorithm.
Input: AOI andRc1.Begin2.Check: If (node, A,Energy<30%)3.Broadcast (Node ID of A “Coordinator”)4.Check: the level of energy supply (maximum of 5 nodes)5.Make Recovery nodes having maximum energy6.Send message (“Recovery node”)//message will be sent to selected recovery nodes7.Generate (recovery plan basis on the energy level)8.Broadcast (recovery plan)9.End if10.If Received (Some node ID “Coordinator”) & (“Recovery node”)//messages11.Receive (Recovery Plan)12.Calculate (the area of the overlapped region).//Recovery nodes will calculate the area of the overlapped region13.Calculate (the required distance for movement).14.If (distance<length)15.Broadcast (“permanent relocation”)//Node will relocate16.End program17.End If18.Else19.If (Neighbor node B have alternate route)20.Send (data)//towards node B21.Else22.Buffer (data)23.End if24.Broadcast (“temporary relocation”)//message to neighbors25.Move (towards a failure node)26.End if27.If (Relocated Back to original position)28.If (data is buffering)29.then send data through original neighbors30.End if31.End if32.Else33.End Program34.If (Node A abrupt fail)35.Neighbor nodes will not receive a heartbeat message36.The first node will take responsibility37.Go to step 4


## 4.3. Complexity Analysis

PACR’s time complexity depends on the number of slave keepers, sensor nodes, and the energy measurement process for each node of the sensor.The number of coordinators is represented byc, the number of nodes of the sensor connected to each coordinator is represented by n, and the energy measurement method for each node of a sensor is represented by E.After the coordinator sends the signal to the recovery sensor nodes, the signal is sent to the sensor nodes involved. Now residual energies are correlated with threshold energy by sensor nodes. If each recovery sensor node has sufficient resources, the total number of iterations (best score) required to run the algorithm isn∗E. If the number of recovery sensor nodes is c, then n∗E∗c would be the total executions needed. In the worst case, if each sensor node’s energy is less than the threshold energy, n∗E∗n−1∗c is the total number of iterations (worst score) required to execute the algorithm.The essence of our proposed algorithm is polynomial. For each slave keeper, the external loop executes, and for each sensor node allocated to the new slave keeper, the nested loop is executed. The complexity of Algorithm1 is O (n2) in terms of the Big-O notation.


## 4.4. Energy Model

An energy model that is used for this research article is presented in [23]. A “B” bit data packet over distance “d” is transmitted and received by the sensor nodes. The energy expended per bit by the receiver is given by (5). The residual energy can be calculated by Equation (7).
(5)ETxB,d=Eelec+εfsd2Bd<d0,Eelec+εmpd4Bd≥d0,(6)ERxB=ERx‐elecB,(7)Erengn=Emax−ETxB,d−ERxB.The terms used in this energy model are explained in Table2.Table 2
Different variables used in the energy model.
VariableDefinitionETxEnergy consumption to transmit dataERxEnergy consumption to receive dataErengResidual energyEelecEnergy consumed by a transmitter per bitEmaxThe initial energy of nodes (maximum energy)ERx‐elecEnergy consumed by a receiver per bitεfsThe energy required by an amplifier in free spaceεmpThe energy required by an amplifier in multipathd0Threshold distance for sensor nodes


## 5. Simulation Setup

The OMNeT++ platform is used for all the simulations. A comparative analysis is done between Survivability-Aware Connectivity Restoration (SACR) and Connected Dominating Set (CDS) algorithm [21, 22].


### 5.1. Settings of Simulation

In the experiments, to form WSNs, a set of mobile sensor nodes are initially randomly placed in a900×900m2 area. The communication and sensing ranges of all nodes are assumed to be the same. Performance is evaluated by the following metrics.


#### 5.1.1. Total Distance Moved

This records the cumulative distance jointly traveled after recuperation by the nodes concerned. This can be envisaged as a networkwide review of the success of the recovery schemes used. The optimization formulation opts to find the best length and relocation frequency for each sensor nodesi∈S, where i=1,2,⋯⋯N number of sensor nodes present in set S. Assume that node A is at a distance from failed node F. Suppose A will travel at a constant speed, Sp. Therefore, during one migration, the time and distance that node A will take to switch back and forth to F is provided by
(8)τ=2∗distanceASp,distanceA=τ∗Sp2.


#### 5.1.2. No. of Nodes Relocated

This tracks the number of mobile nodes (M) that have been shifted during recovery. This metric tests the scope of the method of repairing network links.


#### 5.1.3. No. of Exchanged Messages

This records the cumulative number of exchanged messages (EM) between the nodes. This calculation tests the communication overhead imposed by the recovery process.


#### 5.1.4. Communication Range (Rc)

All nodes of the experiment have the same communication range. The importance ofRc affects the initial WSN topology. Although a small Rc provides a sparse topology, a large Rc improves overall network connectivity. In strongly connected WSNs, very few nodes need to be included in the cascaded movement, and the reconstruction process would converge easily with little overhead; a big Rc value will increase the number of failed node neighbors and thus increase the overhead experienced by these neighbors.


#### 5.1.5. The Network Lifetime

This metric compares the time for the first rehabilitation participant to run out of energy. From the beginning of the network to the first sensor node, the network lifetime (NL) is measured as the number of tours carried out by the mobile node, such that its energy is completely dissipated. The network lifetime can be computed as
(9)NL=Einitialλ,whereEinitial is the initial energy and λ is the maximum energy consumed by a node
(10)λ=maxiϵSEi,where i=1,2,⋯⋯N.


#### 5.1.6. Sensing Range (Rs)

This impacts the coverage of the node. Short ranges make PACR a favorable framework for recovery. Ifψ denotes the number of migration rounds made by a node A to F, abA denotes the cumulative time A spends away from its home area, letting “t” be the time node that A spends at F over one round and PreA be the time it spends at its original site. Therefore, abA can be calculated as
(11)abA=ψ+t+τ.The goal of the optimization model is to maximize F coverage, i.e., to maximize the time spent by all replacements covering the F region.(12)Max∑AϵSt∗ψ.


#### 5.1.7. Throughput

Throughput is the degree of efficient transmission of messages over a medium of communication. It is calculated as the ratio of the number of messages sent bySi=s1s2,⋯⋯sN, where N is number of nodes present in Si to Sj, and the number of messages received by Sj=s1s2,⋯⋯sM, where M is number of nodes present in Sj from Si. Here, M=N, Si∈SandSj∈S. Throughput is given as
(13)Throughput=No.ofmessagessendbySitoSjNo.ofmessagesrecivedbySjfromSi.Given the fixed scale of the deployment area, the number of nodes in the network will influence the node density. The low node density reduces the coverage and considers our methods indispensable.At first, the OMNeT++ simulator is designed for distributed systems. Then, simulation artifacts are generated (sensor nodes). By exchanging signals, virtual objects communicate with each other at distinct moments. For these simulations, the environment is OMNeT++. Simulations are independently performed for each algorithm in OMNeT++, and their data is then imported for plotting in MATLAB. Within 10 percent of the basic average, all simulation outcomes are taken, whereas for other simulations, the confidence analysis interval is taken as 90%. The following steps are followed to test the efficiency of the proposed and baseline algorithms:The success of the proposed PACR is validated through simulations carried in OMNeT++. The simulation setup, performance metrics, and results are presented in this section. Table3 gives details of the simulation setup.Table 3
Simulation setup.
Simulation parametersValuesArea of simulation900×900m2No. of nodes50~250Size of the data packet800 bitsEelec70 nanojoule/bitEmax50 Jεfs30 picojoule/bit/m2εmp0.0015 picojoule/bit/m2d080 mRc25–150 mSimulation toolOMNeT++


## 5.1. Settings of Simulation

In the experiments, to form WSNs, a set of mobile sensor nodes are initially randomly placed in a900×900m2 area. The communication and sensing ranges of all nodes are assumed to be the same. Performance is evaluated by the following metrics.


### 5.1.1. Total Distance Moved

This records the cumulative distance jointly traveled after recuperation by the nodes concerned. This can be envisaged as a networkwide review of the success of the recovery schemes used. The optimization formulation opts to find the best length and relocation frequency for each sensor nodesi∈S, where i=1,2,⋯⋯N number of sensor nodes present in set S. Assume that node A is at a distance from failed node F. Suppose A will travel at a constant speed, Sp. Therefore, during one migration, the time and distance that node A will take to switch back and forth to F is provided by
(8)τ=2∗distanceASp,distanceA=τ∗Sp2.


### 5.1.2. No. of Nodes Relocated

This tracks the number of mobile nodes (M) that have been shifted during recovery. This metric tests the scope of the method of repairing network links.


### 5.1.3. No. of Exchanged Messages

This records the cumulative number of exchanged messages (EM) between the nodes. This calculation tests the communication overhead imposed by the recovery process.


### 5.1.4. Communication Range (Rc)

All nodes of the experiment have the same communication range. The importance ofRc affects the initial WSN topology. Although a small Rc provides a sparse topology, a large Rc improves overall network connectivity. In strongly connected WSNs, very few nodes need to be included in the cascaded movement, and the reconstruction process would converge easily with little overhead; a big Rc value will increase the number of failed node neighbors and thus increase the overhead experienced by these neighbors.


### 5.1.5. The Network Lifetime

This metric compares the time for the first rehabilitation participant to run out of energy. From the beginning of the network to the first sensor node, the network lifetime (NL) is measured as the number of tours carried out by the mobile node, such that its energy is completely dissipated. The network lifetime can be computed as
(9)NL=Einitialλ,whereEinitial is the initial energy and λ is the maximum energy consumed by a node
(10)λ=maxiϵSEi,where i=1,2,⋯⋯N.


### 5.1.6. Sensing Range (Rs)

This impacts the coverage of the node. Short ranges make PACR a favorable framework for recovery. Ifψ denotes the number of migration rounds made by a node A to F, abA denotes the cumulative time A spends away from its home area, letting “t” be the time node that A spends at F over one round and PreA be the time it spends at its original site. Therefore, abA can be calculated as
(11)abA=ψ+t+τ.The goal of the optimization model is to maximize F coverage, i.e., to maximize the time spent by all replacements covering the F region.(12)Max∑AϵSt∗ψ.


### 5.1.7. Throughput

Throughput is the degree of efficient transmission of messages over a medium of communication. It is calculated as the ratio of the number of messages sent bySi=s1s2,⋯⋯sN, where N is number of nodes present in Si to Sj, and the number of messages received by Sj=s1s2,⋯⋯sM, where M is number of nodes present in Sj from Si. Here, M=N, Si∈SandSj∈S. Throughput is given as
(13)Throughput=No.ofmessagessendbySitoSjNo.ofmessagesrecivedbySjfromSi.Given the fixed scale of the deployment area, the number of nodes in the network will influence the node density. The low node density reduces the coverage and considers our methods indispensable.At first, the OMNeT++ simulator is designed for distributed systems. Then, simulation artifacts are generated (sensor nodes). By exchanging signals, virtual objects communicate with each other at distinct moments. For these simulations, the environment is OMNeT++. Simulations are independently performed for each algorithm in OMNeT++, and their data is then imported for plotting in MATLAB. Within 10 percent of the basic average, all simulation outcomes are taken, whereas for other simulations, the confidence analysis interval is taken as 90%. The following steps are followed to test the efficiency of the proposed and baseline algorithms:The success of the proposed PACR is validated through simulations carried in OMNeT++. The simulation setup, performance metrics, and results are presented in this section. Table3 gives details of the simulation setup.Table 3
Simulation setup.
Simulation parametersValuesArea of simulation900×900m2No. of nodes50~250Size of the data packet800 bitsEelec70 nanojoule/bitEmax50 Jεfs30 picojoule/bit/m2εmp0.0015 picojoule/bit/m2d080 mRc25–150 mSimulation toolOMNeT++


## 5.1.1. Total Distance Moved

This records the cumulative distance jointly traveled after recuperation by the nodes concerned. This can be envisaged as a networkwide review of the success of the recovery schemes used. The optimization formulation opts to find the best length and relocation frequency for each sensor nodesi∈S, where i=1,2,⋯⋯N number of sensor nodes present in set S. Assume that node A is at a distance from failed node F. Suppose A will travel at a constant speed, Sp. Therefore, during one migration, the time and distance that node A will take to switch back and forth to F is provided by
(8)τ=2∗distanceASp,distanceA=τ∗Sp2.


## 5.1.2. No. of Nodes Relocated

This tracks the number of mobile nodes (M) that have been shifted during recovery. This metric tests the scope of the method of repairing network links.


## 5.1.3. No. of Exchanged Messages

This records the cumulative number of exchanged messages (EM) between the nodes. This calculation tests the communication overhead imposed by the recovery process.


## 5.1.4. Communication Range (Rc)

All nodes of the experiment have the same communication range. The importance ofRc affects the initial WSN topology. Although a small Rc provides a sparse topology, a large Rc improves overall network connectivity. In strongly connected WSNs, very few nodes need to be included in the cascaded movement, and the reconstruction process would converge easily with little overhead; a big Rc value will increase the number of failed node neighbors and thus increase the overhead experienced by these neighbors.


## 5.1.5. The Network Lifetime

This metric compares the time for the first rehabilitation participant to run out of energy. From the beginning of the network to the first sensor node, the network lifetime (NL) is measured as the number of tours carried out by the mobile node, such that its energy is completely dissipated. The network lifetime can be computed as
(9)NL=Einitialλ,whereEinitial is the initial energy and λ is the maximum energy consumed by a node
(10)λ=maxiϵSEi,where i=1,2,⋯⋯N.


## 5.1.6. Sensing Range (Rs)

This impacts the coverage of the node. Short ranges make PACR a favorable framework for recovery. Ifψ denotes the number of migration rounds made by a node A to F, abA denotes the cumulative time A spends away from its home area, letting “t” be the time node that A spends at F over one round and PreA be the time it spends at its original site. Therefore, abA can be calculated as
(11)abA=ψ+t+τ.The goal of the optimization model is to maximize F coverage, i.e., to maximize the time spent by all replacements covering the F region.(12)Max∑AϵSt∗ψ.


## 5.1.7. Throughput

Throughput is the degree of efficient transmission of messages over a medium of communication. It is calculated as the ratio of the number of messages sent bySi=s1s2,⋯⋯sN, where N is number of nodes present in Si to Sj, and the number of messages received by Sj=s1s2,⋯⋯sM, where M is number of nodes present in Sj from Si. Here, M=N, Si∈SandSj∈S. Throughput is given as
(13)Throughput=No.ofmessagessendbySitoSjNo.ofmessagesrecivedbySjfromSi.Given the fixed scale of the deployment area, the number of nodes in the network will influence the node density. The low node density reduces the coverage and considers our methods indispensable.At first, the OMNeT++ simulator is designed for distributed systems. Then, simulation artifacts are generated (sensor nodes). By exchanging signals, virtual objects communicate with each other at distinct moments. For these simulations, the environment is OMNeT++. Simulations are independently performed for each algorithm in OMNeT++, and their data is then imported for plotting in MATLAB. Within 10 percent of the basic average, all simulation outcomes are taken, whereas for other simulations, the confidence analysis interval is taken as 90%. The following steps are followed to test the efficiency of the proposed and baseline algorithms:The success of the proposed PACR is validated through simulations carried in OMNeT++. The simulation setup, performance metrics, and results are presented in this section. Table3 gives details of the simulation setup.Table 3
Simulation setup.
Simulation parametersValuesArea of simulation900×900m2No. of nodes50~250Size of the data packet800 bitsEelec70 nanojoule/bitEmax50 Jεfs30 picojoule/bit/m2εmp0.0015 picojoule/bit/m2d080 mRc25–150 mSimulation toolOMNeT++


## 6. Results and Discussion

The distance that the nodes moved during relocation is shown in Figure4. The distance a node should move depends upon the distance of one node to another node. There is an increase in the communication range as there was an increase in the distance of sensor nodes. This was not good for SACR and CDS because the increase in the distance is very rapid. When SACR and CDS are compared with the proposed PACR, the sensor node participation is limited in the recovery process in the case of PACR. The reason is only some neighbors of the failed sensor nodes take part. Cascaded relocation is avoided in PACR, which is initiated in SACR and CDS. The proposed technique must show the progress in the connectivity of the WSNs very well.Figure 4
The total distance of all nodes in meters vs. distance moved during relocation.The received and delivered packets that were exchanged during the restoration of connectivity using SACR, CDS, and PACR methods are presented in Figure5. The single broadcast message is used for these three techniques. In PACR, the messaging overhead is very less. In SACR, packets exchanged are maximum. The reason behind lesser message overhead in the proposed technique is that only neighbor nodes are involved in the recovery of the failed node, whereas in SACR and CDS techniques, the number of nodes that were relocated for the recovery process needs messages for their coordination.Figure 5
Total packet exchanged vs. communication range.During the recovery process, the average number of nodes moved to the number of nodes of said techniques is shown in Figure6. The total distance travelled will increase with the increase in relocating nodes for these techniques. From Figure 6, the result shows that the node relocation of SACR is greater than the CDS technique. However, for the proposed technique, there is a smaller number of node relocation. The reason is because the proposed algorithm limits the recovery process to specific neighbor nodes.Figure 6
The average number of nodes moved vs. number of nodes.In these figures, the impact of the number of nodes relocated in the said techniques on communication and sensing ranges is presented in Figures7 and 8. The overall impact on communication and sensing ranges is limited reasonably by our proposed algorithm. Furthermore, for the networks that are not so dense, which are evenly distributed, the overlap ranges are at their minimal level for the proposed PACR. A greater increase in communication and sensing ranges was observed in SCAR.Figure 7
Number of nodes moved vs communication range.Figure 8
Number of nodes moved vs sensing ranges.For various communication and sensing ranges, the percentage reduction of the field coverage is shown in Figure9. When Rs is dominated by Rc, reasonable coverage reduction is perceived, because longer distances are needed for recovery nodes to travel between their original position and the position of the failed node.Figure 9
Number of nodes moved vs. communication ranges.The efficiency comparisons between the proposed PACR, SACR, and CDS protocols are shown in Figure10. The total lifetime is increased by reducing the overhead of protocols in the network. The proposed protocol, therefore, has better performance in enhancing the lifetime of the network than the other baseline protocols. The main reason is that there is a perfect recovery plan for the neighbors of failed nodes, as only limited neighbors are given the role to recover the connectivity and coverage of failed nodes and there is a restriction on neighboring nodes that their energy must be 70%. So, the chances of neighboring nodes participating in the recovery process to die sooner are lesser as compared to those of baseline approaches.Figure 10
Overhead vs. network lifetime of Wireless Sensor Network.Figure11 indicates that the proposed PACR is upgraded relative to the baseline algorithms. The number of nodes increases, which also increases the throughput.Figure 11
No. of nodes vs. throughput.


## 7. Conclusions

A novel algorithm known as the Position-Aware Connectivity is presented in this paper. The PACR resolves not only connectivity issues but also the issue of coverage. The proposed algorithm offers a solution in such a way that it does not permanently relocate the nodes. For recovery of the failure node, only neighboring nodes are responsible for the proposed technique. Selected neighboring nodes will make the restoration process very rapid as compared to other approaches. After spending their due duration of time at the position of the failed node, each recovery node came back to its previous original location. The stability assurance in connectivity and coverage is the main feature of the proposed algorithm. This assurance enhanced the overall lifetime of the network. The proposed method is a fusion of both localized and distributed algorithms. The overall messaging overhead for the proposed technique is minor for small networks. The success of the proposed scheme is proven by various simulations.



---

*Source: 8859256-2020-12-31.xml*