Algorithm 1: Resource Request Forwarding

Input: SourceN, DestN, RIdusreq, Set of RNs, and channel_info_table Output: Route_req_info transmission Begin: 1   if SourceN_route to DestN$!=$valid_route or SCFT(selected channel 2   for fixed duration) == expired then 3   SourceN creates route_req_pkt (RRP) with new id 4   Add id, RIdusreq and channel_info_table to RRP 5   single hop neighbor_node (NN) member of SourceN and Adj_list>0 6     transmit route_req_pkt to all channels 7   end_for 8   end_if 9   for each rn in RNs 10   if info_received= Route_req_info 11              If (info_received$==$info_received from previous channel or 12               Route_req_length$>=$previous Route_req_info then 13               Discard info_received 14              end_if 15   else 16   Compute $T{1}_{rn}^{Flow\_ser}$(t1) as per the Equation (18) 17   Add id, $T{1}_{rn}^{Flow\_ser}$(t1), channel_info_table and Route_req_info 18   single hop neighbor_node (NN) member of RN with Adj_list>0 19              broadcast Route_req_info to all channels 20   end_for 21   end_else 22   end_if 23   end_for End