## 4 Proposed Model
The Nodes after receiving the \(RIT\) message, will get their neighbour IDs and transmit to \(NHN\) node as:  
\[array(NHN)=\sum_{i\in N_{i}}\sum_{l,j}\frac{NID^{i}}{DID^{j}}+mittime[N(i)]^{l} _{j}+Z \tag{1}\]  
\[Z=neighbour[NID]^{i}_{j}. \tag{2}\]  
The distance between the node \(n(i)\) and neighbour node is calculated as:  
\[\text{Min}(N(i),N(i+1))=\sqrt{P+Q} \tag{3}\]  
\[P=\left(X_{N(i+1)(t)}-X_{N(i)(t)}\right)^{2} \tag{4}\]  
\[Q=\left(Y_{N(i+1)(t)}-Y_{N(i)(t)}\right)^{2}. \tag{5}\]  
The neighbour node \(N(i+1)\) will send the feedback about the node \(N(i)\) to the \(NHN\) node as:  
\[Feedback[NID(i)]=\sum_{i=0,j=i+1}^{N}\frac{W}{totalnodes} \tag{6}\]  
\[W=PDR(N(i))+\sum_{i=0,j=i+1}^{N}engelevel[N(i)_{(i,j)}]+U \tag{7}\]  
\[U=min(Xi,Yi). \tag{8}\]  
Figure 3: Routing Process in Network. Here, \(PDR\) is the packet delivery rate, \(min(Xi,Yi)\) is the neighbour node at nearest position. Based on the calculated neighbour feedback, the neighbour node will authenticate the node \(N(i)\) and mark with label. The Feedback\((NID(i)>Th)\), so all Nodes will be authenticated and labelled as \(SID++\) and update this to \(NHN\) node. The node that is authenticated will send the label to the \(NHN\) node. The \(NHN\) node will verify and again authenticate with an extra label calculated as:  
\[array(NHN)=\sum_{i\in N_{i}}\sum_{l,j}\frac{NID^{i}}{DID^{j}}+mittime[N(i)]^{l} _{j}+Z \tag{1}\]0  
The \(NHN\) node calculates every node's mobility speed '\(S\)' to calculate a new route if any failure occurs. The node speed is calculated as:  
\[array(NHN)=\sum_{i\in N_{i}}\sum_{l,j}\frac{NID^{i}}{DID^{j}}+mittime[N(i)]^{l} _{j}+Z \tag{1}\]1  
where \(S[N(i)]\) is the speed of a node, and \(t\) is the time instance and is the change in the time in T seconds, where T is the threshold time. The process of route identification is performed using Algorithm 1. ```
Input: Total node count, node, Source ID, Destination ID initialization; Step 1:Perform node labelling. Step 2: Initialise node deployment for each node. Step 3: Broadcast node position Co-ordinates to network. Step 4: When a network is established, every node will send its node ID Source to Destination node. Step 5: The Destination node will broad cast the Route Identification Token to all the nodes which are considered to involve in data communication. Step 6: The Nodes after receiving the RIT message will get its neighbour IDs and transmit to Destination node. Step 7: The Destination node will analyse the neighbour IDs and finalise the route and update it in the routing table. Step 8: The distance between the node and neighbour node is calculated and store in table. Step 9: The neighbour node will send the feedback about the previous node to the Destination node. Step 10: Based on the calculated neighbour feedback, the neighbour node will authenticate the node and mark with label.Node will be authenticated and labelled. Else Node will be discarded from the route and go to step 5; Step 11: The node which is authenticated will send the label to the Destination node. The Destination node will verify and again authenticate with extra label calculated. Step 12: The node which is authenticated in multiple levels are updated in the routing table and then the Destination node will initiate the data transmission. Step 13: The node mobility speed of every node is calculated by the Destination node to calculate a new route if any failure occurs. ```  
**Algorithm 1**Route Identification