Algorithm 2: ABC Route Optimization

1.   Input: Final Route from S to D and Mobile Sensor Nodes Properties 2.   Output: Optimized Mobile Sensor Nodes Properties 3.  Start Properties Optimization 4.  To optimized the FR, ABC Algorithm is used 5.  Set up basic parameters of ABC: Population of Bee (${\mathrm{P}}_{\mathrm{b}}$)—Number of Sensor Nodes 6.   Final Route (FR)—Route from NS to ND 7.   Fitness Function: $\mathrm{F}\left(\mathrm{f}\right)=\{\begin{array}{c}1; \mathrm{if} {\mathrm{N}}_{\mathrm{PROP}}<{\mathrm{Threshold}}_{\mathrm{PROP}}\\ 0; \mathrm{Otherwise}\end{array}$ 8.   Where ${\mathrm{N}}_{\mathrm{PROP}}$ are the properties of the node such as energy consumption, delay, etc. 9.   In the fitness function, ${\mathrm{N}}_{\mathrm{PROP}}$: are properties of current sensor nodes which are in FR and ${\mathrm{Threshold}}_{\mathrm{PROP}}$ is the threshold properties of all communicating sensor nodes which are defined based on energy and distance 10. Calculate Length of Route in terms of R Length 11. Set, Optimized Nodes Properties, ONPROP= [] 12. For i in rang of R Length 13.  EBEE = FR (i) = ${\mathrm{N}}_{\mathrm{PROP}}$ // Current Bee from ${\mathrm{P}}_{\mathrm{b}}$ 14.  OBEE = ${\mathrm{Threshold}}_{\mathrm{PROP}}$ // // Mean of all ${\mathrm{P}}_{\mathrm{b}}$ 15.  $\mathrm{F}\left(\mathrm{f}\right)=\mathrm{Fit}\mathrm{Fun}\left({\mathrm{E}}_{\mathrm{BEE}},{\mathrm{O}}_{\mathrm{BEE}}\right)$ 16.  ON PROP = ABC (F(f), FR (i)) 17. End—For 18. Returns: ONPROP as an Optimized Mobile Sensor Nodes Properties 19. End—Function