Algorithm 1: Data-driven secured optimization model using dynamic programming

Step 1: Procedure Sec_data_driven Step 1: Network-setup Step 2: Multistage graphs with nodes and edges Step 3: Compute the traffic by exploring $TL$= $B/P$ Step 4: Compute $Pr\left(LS\right)$= $no. of packets/waiting time$ Step 5: Cost using objective function $C\left(i, j\right)$= $TL$ + $LS$ Step 6: Threshold evaluation for sending route request $e\left(fn\right)$ < $threshold;RREQ=true$ Step 7: If the neighbor state is not equal to the destination then Repeat Steps 3 to 6 End if Step 8: Performs network authentication Step 9: If authenticity is verified then data transmission Else Drop the request packet End if Step 10: Generate random keys and perform a security function Step 11: If all data packets are delivered to the destination then Send ACK to the source device Else Perform incremental encryption End if Step 12: End procedure