## 5 Meta Heuristic Strategies for Node Scheduling
### Bio-Inspired Optimal Mechanism for VBNL
The fireflies considered as underwater nodes that are used for simulation purposes. The several stochastic rounds '_N_' applied as meta-heuristics techniques usually follow these rounds by the home of swarm intelligence mechanisms. The plunging of the beacon nodes starts with rounds for continuously updating the fitness of the population of beacon node F\({}^{\text{B}}\)\({}_{\text{POP}}\). To calculate the cost for \(CRM\) using update \(\theta_{i}\left[j,k,l\right]\) according to the current position of \(B_{v}\) and, if needed, re-calculate \(F_{POP}^{\text{B}}\) using Equation (5) (line 6-12). All other neighboring nodes are aggregated, and beacon nodes are plunged in that direction. In the final step, we calculate maximization using Equation (11) and update the \(CRM\) function from line 20, and call the optimal BFA and LFA for beacon node maximum scheduling, as shown in lines (23-28). These nodes have scheduled output and are prepared for transactions with blockchain. In such instances, only the best nodes that can optimize and send data to the destination are rescheduled. The HB\({}^{2}\)NL algorithm is especially used for the data packets forwarding process with several conditions and checks for localization of nodes. The data packets forwarding process only ends when the nodes are localized. In the same way, the localized nodes must be scheduled before data forwarding; therefore, the scheduling process is first undertaken as described in detail in Algorithm 1 and then the process of communication for underwater nodes in undertaken, as described in Algorithm 2. First of all, the _RREQ pkt_ forwarding probability mechanism is used with Casual Flag values of either 0 and 1 for VBN and the totaling of beacon nodes. If any malware-vulnerable beacon node ID is received, it is directly discarded form lines 1-3. It is because these localized nodes can neither be scheduled nor localization oriented. Location is estimated from neighboring beacon nodes as counted from lines 4-9 and its trust ratio for blockchain enabled beacon nodes is estimated from lines 10-12. The blockchain minors' nodes are estimated using 'Knapsack Theory' by (small items with large weights) from Equations (19)-(20) in lines 14-16, respectively. After that, the plunging process of beacon nodes starts and all nodes are localized accordingly following the optimal mechanism of the LFA and the BFA, as shown in lines 20-30. In a special case, if the data packet is from the destination zone, its localized value is calculated accordingly (lines 30-33); otherwise, we broadcast the data packet through (lines 34-36). All the notations that are used in algorithms are listed in the Table 2.

## 7 Simulation Environment

The sensor and relay nodes are deployed uniformly with dimensions of 2000 m \(\times\) 2000 m \(\times\) 2000 m as shown in Figure 4. The connectivity of any ad hoc network is highly dependent on the mobility model it follows. As per the previous study mentioned in [41; 42; 43], the random way mobility model is widely used to simulate the performance of any mobile ad hoc network such as [44; 45; 46], fixing the source and sink nodes at the bottom and surface of the water, respectively, with coordinates (80, 90,100) and (10, 20, 30). To calculate the value of energy consumption, we use the 'Tx' Power 'Rx' Power and 0.007 W, respectively. Each node initially has an energy of 1000 joules which is enough for medium and large-scale networks. The source node will send the data with 58 bytes per two seconds. This mobility model is selected with randomly selected speed and destination from a uniform distribution (f-max speed). After successfully reaching the destination, every node selects the new destination and speed. To build the high mobility scenario, the pause time is set to 0. Phgh = 1.0 and Plow = 0.3, which all are experiment values. Table 3 summarizes the simulation parameters' value. ## 8 Simulation Results

The suggested scheme's performance is validated in this section using simulation data and the results are discussed thereafter.