STEP 1: VQ design for a link l can be derived as follows Eq. (1)(1) θl(t)=(zl(t)+yl(t)+α1Cl)θl(t) where (t) is a continuous-time indicator, ‘y_l’ and ‘z_l’ denote the aggregated EL and IEL rates, ‘α₁’ is the virtual queue which controls the total load and ‘c_l’ is the total available bandwidth of link l ∈ L.

STEP 2: The VQ design for link l for IEL flow by Eq. (2)(2) γl(t)=(zl(t)−α2.Cl)γl(t) where α₂ is the VQ which controls the IEL flow load

STEP 3: CC ler for EL flow by Eq. (3)(3) xe(t)=∪et−1⁡(SRc(t)) where SR_c is the summation of the VQ length of the EL flow and U is the utility function

STEP 4: Load balancing is applied for IEL flow

The packets of flow ‘i’ at route ‘r’ are given by, Eq. (4)(4) xi(r)⁡(t)=(μi,(t)−μR⁡i(r)⁡(t))xir⁡(t)

where μi′(t) satisfies ∑r=1|Rl|⁡((μi′(t)−μRi(r)(t))xir(t))=0 and ∑r=1|Rl|⁡xl(r) (0) = a_i, a_i denotes the arrival rate of IEL flows.

Let S_il and S_el denote the number of IEL and EL data packets that begin at t = 1, 2,…, T, respectively. Let S(a_i, c) symbolise a feasible routine, and ‘c’ recognise the broadcast status.

The VQ lengths of EL and IEL flows at link l are given by q_l (k) and d_l (k), respectively, where ‘k’ is the current frame.

STEP 5: CC is performed using Eq. (5)(5) xel∗⁡(k)∈arg⁡max0≤xelXmax∈1∈Ul(xel)−ql(k)xel

The EL arrival rate indicates the number of EL packets admitted in ‘k’.

Let the EL arrival at link l a_el(k) is a random variable, and P_r is the Probability. This satisfies Pr(a_el(k) = 0)>0 and Pr(a_el(k) = 1)>0 for all l∈L and all ‘k’. Let a_i(k) be the number of IEL arrivals and c(k) be the channel state.

STEP 6: Scheduling si performed using Eq. (6)(6) s→ai(k),c(k),d(k),q(k)∈arg⁡max∑{[1∈wt+dl(k)]∑t=1TSil,t+ql(k)∑t=1TSel,t}

Here, the number of IEL arrivals at l(a′_il(k)) has the parameters {a_il(k), 1−p_l}. The scheduler is a function of {a_i(k), c(k), d(k), q(k)}. d_l(k) is the VQ that counts the shortage in service for a link.

An input condition evaluates a control action and feedbacks the gain multipliers that control stability, error, and response. Proportion, integral, and derivative controllers are used in PID. Following Fig. 2 illustrates the PID-based network feedback control.

Here q₀ signifies the expected queue length, ‘q’ is rapid queue length. e = q − q₀ is the error signal that is the PID controller’s input, and the packet loss rate ‘p’ is the output returned from the PID controller. The PID controller determines the dropping probability (p) of each incoming packet based on the difference in queue lengths of the router. It then estimates the congestion level based on ‘p’ and alters its sending rate to control the router length. The source detects’ p’ after a link EED time.

p can be assessed by Eq. (7)(7) P = {0p<0p0≤p≤11p>1 p ranges from 0 and 1.

Algorithm For Priority Dropping

Step 1. Receive (pkt)

Step 2. P = Esimate_p(pkt)

Step 3. IF pkt = dropped THEN

Step 4. IF prior(pkt) = 0, THEN

Step 5. PLR (pkt)

Step 6. ELSE

Step 7. L_pkt = LOOK FOR _Low_Priority (queues)

Step 8. IF pkt = L_pkt THEN

Step 9. PLR (L_pkt)

Step 10. Enque(pkt)

Step 11. ELSE

Step 12. PLR (pkt)

Step 13. END IF

Step 14. END IF

Step 15. END IF

The packet priority is assigned whenever data is received and stored in the packet’s priority field. The priority for the background flows is assigned to ‘0’. The packet drop probability of the incoming packet is computed using Eq. (7). If a packet is to be dropped, then the packet with lower priority than the current packet is dropped, and the current packet is admitted. If no such lower priority packet exists, the current packet will be dropped [14–20].

The bandwidth needs for every TF can be expressed in the session’s capacity needs on a link estimated using the contention count formula.

Step 1: Estimation of the channel time engaged by the MAC layer overhead is determined using the conventional standards. Let N_CS be every Carrier Sensing neighbour set of the present node on the route, R is the set of forwarding nodes on the current routing session. Hence, the contention count for these components is estimated according to Eq. (8).(8) ccont=|∑j=0|Ncs∩R|α0αj|,∀j∈Ncs∩R

All links originating at transmitters which belong to both NCS and R are included.

Step 2: Session’s capacity requirement on a link j is given by Eq. (9)(9) Breq=breqTIPhdr+TSRhdr+TDataTData(∑j=0|Ncs∩R|α0αj)+breqTMAChdr+TDIFS+TRTS+TAck+3TSIFS+TbkoffTData|Ncs∩R|

Here α0 indicates the introductory rate and αj indicates the rate of link ‘j’, which is under consideration. ‘Tx’ represents the transmission times of the respective headers.

Step 3: The current link rate for that hop approximates the channel occupation time at the BS of a session’s traffic.

Step 4: Hence the bandwidth requirement BW_req is given by, Eq. (10)(10) BWreq=Breq

Step 1. Admission_Control (BW_req, Dest_IP, HC)

Step 2. {

Step 3. HC = 0

Step 4. IF (Dest_IP is FNT)

Step 5. {

Step 6. IF (BW_{avai_inter} > BW_req)

Step 7. Broadcast RREQ with HC + 1

Step 8. ELSE IF (BW_{avai_inter} > 2 BW_req && HC == 1)

Step 9. Broadcast RREQ with HC + 1

Step 10. ELSE IF (BW_{avai_inter} > 3 BW_req && HC > 1)

Step 11. Broadcast RREQ with HC + 1

Step 12. Else

Step 13. Discard RREQ

Step 14. }

Step 15. ELSE IF (Dest_IP is SNT)

Step 16. {

Step 17. IF (BW_{avai_inter} > 2 BW_req)

Step 18. Broadcast RREQ with HC + 1

Step 19. ELSE IF (BW_{avai_inter} > 3 BW_req && HC == 1)

Step 20. Broadcast RREQ = HC + 1

Step 21. ELSE

Step 22. Discard RREQ

Step 23. }

Step 24. ELSE IF ((BW_{avai_inter} > 3 BW_req) || (BW_{avai_inter} > 4 BW_req))

Step 25. Broadcast RREQ with HC+1

Step 26. Else If ((BW_{avai_inter} > 2 BW_req) && (HC == 1))

Step 27. Discard RREQ

Step 28. ELSE

Step 29. Discard RREQ

Step 30. }

Step 31. End

Step 1. BW_Reservation(BW_TRAN, Total_HC, Reverse_HC)

Step 2. {

Step 3. Reverse_HC = 0

Step 4. IF (total_HC == 1)

Step 5. {

Step 6. BW_{avai_dest} = BW_req + 1

Step 7. Reverse_HC = Reverse_HC + 1

Step 8. Unicast RREP with BW_req, Reverse_HC, Total_HC

Step 9. BW_{avai_src} = BW_req + 1

Step 10. }

Step 11. ELSE IF (Total_HC = 1)

Step 12. {

Step 13. BWavai_dest  = 2 BW_req + 1

Step 14. Reverse_HC = Reverse_HC + 1

Step 15. Unicast RREP with BW_req, Reverse_HC and total_HC

Step 16. }

Step 17. ELSE IF (Total_HC == 2)

Step 18. BWavai_src  = 2 BW_req + 1

Step 19. ELSE IF (total_HC 2)

Step 20. BWavai_src  = 3 BW_req + 1

Step 21. ELSE IF (( total_HC== 2) && (Reverse_HC == 1))

Step 22. {

Step 23. BWavai_inter  = 2 BW_req + 1

Step 24. Reverse_HC = Reverse_HC + 1

Step 25. Unicast RREP with BW_req, Reverse_HC, Total_HC

Step 26. }

Step 27. ELSE IF (( total_HC≠ 2) && (Reverse_HC == 1))

Step 28. {

Step 29. BWavai_inter  = 3 BW_req + 1

Step 30. Reverse_HC = Reverse_HC + 1

Step 31. Unicast RREP with BW_req, Reverse_HC, Total_HC

Step 32. }

Step 33. ELSE IF ((Reverse_HC == 1) && (Total_HC == 3))

Step 34. {

Step 35. BWavai_inter  = 3 BW_req + 1

Step 36. Reverse_HC = Reverse_HC + 1

Step 37. Unicast RREP with BW_req, Reverse_HC, Total_HC

Step 38. }

Step 39. ELSE IF ((Reverse_HC == 1) && (Total_HC == 3))

Step 40. {

Step 41. BWavai_inter  = 4 BW_req + 1

Step 42. Reverse_HC = Reverse_HC + 1

Step 43. Unicast RREP with BW_req, Reverse_HC, Total_HC

Step 44. }

Step 45. }

Step 46. END IF

Step 47. END

   Step 1. IF N_i To Transmit DATA_inel Then

   Step 2. REREQ: [ID_i| D_exp| SNR| Re_req]

   Step 3. ELSE IF N_i To Transmit DATA_el

   Step 4. REREQ: [ID_i |R_Tx| SNR| Re_req]

   Step 5. END IF

   Step 6. N_i Forwards REREQ to ES State

   Step 7. ScH Checks the type of REREQ

   Step 8. IF REREQ is DATA_inel Then

   Step 9. QUEUE_inel

   Step 10. ELSE

   Step 11. Queue_el

   Step 12. END IF

   Step 1. IF TH in CS state leaves the current resource

   Step 2. IF the type of TH is QUEUE_ine

   Step 3. TH chooses node with priority High, Very High

   Step 4. DO

   Step 5. {

   Step 6. IF AvB > Re_req THEN

   Step 7. ScH allocates the IEL service matching the remaining AvB

   Step 8. END IF

   Step 9. } WHILE (IEL queue = empty)

   Step 10. ELSE

   Step 11. A token to QUEUE_el

   Step 12. END IF

   Step 13. END

Fig. 4 shows the fuzzy controller architecture, a non-linear MF system with four main components. The admitted IEL flows are prioritized over EL M-SF by utilizing the Fuzzy Logic System (FLS). FLS encompass two sub FLS as FLS1 and FLS2 for IEL and EL M-SF.

In FLS1, for IEL M-SF, the two-input metrics are fuzzified, such as EEE and Signal to Noise Ratio (SNR) [36–38]. The MF such as “LOW”, “MEDIUM”, “HIGH” are utilized to describe SNR. The “LOW” value means a high lossy channel among the nodes. The “HIGH” value demonstrates a low error-prone channel. The “MEDIUM” value is obtained during the motion of nodes. The “HIGH” SNR is given higher priority. Similarly, the MF such as “LOW”, “MEDIUM”, “HIGH” are utilized to describe EED. The channel with minimum EED is given higher priority. The MF such as “VERY HIGH”, “HIGH”, “MEDIUM”, “LOW”, “VERY LOW” are used to describe the outputs. Using these outputs, ScH sets the priority. In FLS2, for EL M-SF, the two-input metrics are fuzzified, such as transmission rate and SNR. Transmission rates are presented using MFs such as “LOW”, “MEDIUM”, “HIGH”. Long transmission intervals result in low throughput and energy requirements when the “Low” value is used. RTx is prioritised according to its “HIGH” value. SNR’s MF is comparable to FLS1’s MF. ScH assigns EL M-SF priority depending on the outcomes of FLS2. Figs. 5–7 showed the MF of SNR, EED and transmission rate, respectively.