## 3 Proposed Technique
Until it receives a new message from another sensor node or base station, the mobile entity will remain in its current location. As a result, it will only use energy if it has to move. Sensor nodes will send a message to the base station if they are nearing the energy threshold, and there is no mobile entity to charge them. To find a free mobile entity, the base station looks for the jumping node, which is used to transmit data from the sensor nodes. It then locates the nearest jumping node, notifies the node of its location, and the node moves toward the failing node. It is like having a sensor node on a leash, except that when it gets to its destination, it turns into one. The jumping node will continue to function in the same manner as the failing sensor node until the base station locates a mobile creature that is capable of charging the sensor node. The base station will communicate with a mobile entity to instruct it to charge the sensor node once it has arrived. After the sensor node has been fixed, all of the sensors will begin to function normally, and the jumping node will be available for use whenever it is necessary for travel to other nodes. Figure 1: _Cont._  
Figure 1: An example that illustrates overall operation of proposed methodology: (**a**) proposed system; (**b**) ME in neighbouring nodes; (**c**) ME awaited arrival at station charge; (**d**) sensor node send message to base station; (**e**) sensor node being charge; (**f**) failure of many nodes; (**g**) jumping nodes being alerted; (**h**) backup received. As shown in Figure 1, Figure 1a explains overall proposed system. Figure 1b depicts that ME in neighbouring nodes is being checked by the node. Here it should also be mentioned that the yellow sensor node scouring its 1-hop neighbour for the mobile object seen is as shown in Figure 1a. Figure 1c shows ME awaited arrival at the charging station. Further, its shows that a mobile entity arrives and charges the sensor node before moving on to another sensor node or base station. A sensor node sends a message to the base station as shown in Figure 1d. When no ME could be found in Figure 1d, the sensor node contacted the base station, which was able to detect and route the nearest ME to SN. The sensor node was charged as it got closer to ME as shown in Figure 1e. It shows the ME arriving at the failing sensor node and charging it. Figure 1f depicts the failure of many nodes. Multiple nodes failed at the same time as shown in Figure 1f, and there was no ME available; thus, the sensor node contacted the base station. The jumping node has been alerted as depicted in Figure 1g. It also shows how base stations find jumping nodes and guide them towards failing nodes. Figure 1h shows that backup has been received. Here we can see how jumping nodes arrive at failing nodes and replace them, allowing the failing nodes to resume operation. Algorithm 1 explains the overall recovery process of the proposed technique. ```
Step 1: Initialization: Sensor node: SN, Mobile entity: ME, Hopping node: JN, Base station: BS, Zone: ZN Step 2: Input: 3 zones over 150 m, 120 SN deployed, 25 MEs, 15 JNs 2.1: Zone 1: from BS Up to 50 m, 40 SN, 12 MEs, 10 JN 2.2: Zone 2: from 50m to 100 m, 40 SN, 8 MEs, 5 JN 2.3: Zone 3: from 100m to 150 m, 40 SN, 5 MEs  Main Working Algorithm Step 3: If (E_SN <= TH1)  Msg_1 hop_N0 Step 4: Else If (ME == true)  ME charge SN Step 5: Else  Wait till TH2 Step 6: End Step 7: End Step 8: If (E_SN <= TH2)  Msg_2 hop_N Step 9: Else If (ME == true)  ME charge SN Step 10: Else  MsgtoBS(0  BS notifies nearer ME ME charges SN Step 11: End Step 12: If (ME not available)  BS locate near JN  JN transmit SN data  Till nearer ME is free to charge SN Step 13: End Step 14: End Step 15: Output: Life time increased
```  
**Algorithm 1** Propose Technique