## 7 Proposed Technique and Algorithm  
Our novel path-protecting technique uses a mesh topology with our heuristic algorithm to make at least one path available between the source and its destination in the network design (Figure 4). There are two approaches for network stability: protection and restoration. Protection provides a full guarantee of recovery from any problem occurred during the transmission, while the restoration method may outperform in terms of resource utilization efficiency by using other methods to keep the quality always up. The significant advantage of mesh topology-based path protection over link protection is the node failure recovery capability, and the ability to find many other available paths between all nodes on the network. In addition, our proposed technique guarantees that the network will not be affected if we have booked one path between the source and its destination during the surgery. The case mesh topology was used to study the optimal path performance with the network design. Mesh topology is useful for finding an optimal solution for large or medium networks with high traffic volume passing through them. For smaller networks there are many obstacles, such as excessive time consumption and the need for a large number of variables and constraints for path protection. Hence, these reasons function as strong incentives to develop faster path protection for smaller numbers of nodes, and limited numbers of edges between nodes. In the case of a path failing, the objective is to find the total spare capacity. The main intention is to select the most efficient mesh topology among all the candidate ones, such as bus, star, or even p-cycle topologies. There are two kinds of path:  
* Full path relationship check, which determines that the path span is disjointed for a given primary one or it might be used as the primary one, with the guarantee that  
Figure 3: Modern IoT networks [27]. there is another full path that can be used for the traffic which needs to be passed to other destinations without affecting the QoS network. * The path mutual relation check, which determines if paths lack common spans but have common nodes other than end nodes, and whether the paths are mutually and fully disjointed. Figure 4 presents an s-RCA algorithm to detect and determine the required path to open the session between HP and patients during the surgery. The s-RCA algorithm identifies the path with the lowest congestion, which is usually the shortest path, but once we book the lowest congestion path and keep it ready for the emergency traffic then the delay will not be very significant, as revealed in our results. The s-RCA algorithm uses LSDB for each node, to make sure nodes are capable to be used during the session without any undue disturbance or noise. This is based on the history of each node by relying on the information from Link State DataBase (LSDB) in the routing protocol and the fault tolerance capacity, provided by the routing protocol, such as OSPF or link state. As displayed in Figure 4, the algorithm starts to work before the HP opens the session between the sender and the destination, because the algorithm takes time to provide its services. Naturally, any surgery will be decided long before the HP begins dealing with the tele-surgery interface, and the algorithm will be ready before the HP commences procedures. Algorithm 1 shows how the nodes are selected after the main routing table is created by the routing protocol; our algorithm can be applied for pre-active or pro-active protocols. Subsequently, the algorithm works on the network before starting the surgery and keeps monitoring adjacent nodes in order to provide the required information about each node in the network, and keeps a record once the inquiry packets start to be distributed. The IoT  
Figure 4: Flowchart of the proposed algorithm.