Skip to main content
. 2024 Mar 21;24(6):2004. doi: 10.3390/s24062004
Algorithm 1: Parameter Configuration Method
Input: Number of repetitions Nrepmin, Nrepmax; Back-off Window size WBO; Random Access Occasion TRAO; Restraint condition INF; Population size POP.
Output: Pareto optimal solution set Ctar
 Set NSGA-II iteration counter it=0
 Set maximum number of iterations MAX
 %NSGA-II algorithm to find the Pareto solution set for the service scenario %
C=fast-non-dominated-sort(C)
for i=1 to gen do
Pi=tournament-selection(C)
 Get Qi=make-new-pop(Pi)
 Get Ri=PiQi
F=fast-non-dominated-sort(Ri)
 Set Ci+1= and t=1
 Until |Ci+1|+|Fi|pop:
  crowding-distance-assignment(Ft)
  Ci+1=Ci+1Ft
  t=t+1
 Set C=Ci+1Ft[1:(pop|Ci+1|)]
end for
%Find the parameters Ctar that match the business scenario%
Set INF(Nrepmax,Tmax,WBO)
for i=1 to POP do
if Ctar[Nrep,WBO]MAX then
  if Ctar[Nrep,WBO]MIN then
   MIN=Ctar[Nrep,WBO]
   Ctar=Ctar[Nrep,WBO]
  end if
end if
end for