To remove the old packets, a node checks the current time of the system (Tcurrent) and deletes those packets that Tcurrent>Tenqueu(p) + Twait(p).
Let us also assume that the velocity v t 1 i, acceleration a t 1 i, and direction ∅ t 1 i at the instant of current time t c (the time node s decides to forward a data packet to i) have remained unchanged since the latest received beacon packet time.
For node S, the current time t, the number of neighbor nodes is N. r i (t) (1 ≤ i ≤ N) is the transmission rate of the link that is formed by S to its neighbor node i, and d i (t) (1 ≤ i ≤ N) represents the distance from the destination to node i. S t) is the distance from the current node to the destination, and r is the required data delivery rate of a single link.
All anchor nodes in the communication radius of mobile node in current time, we call them the inner anchor nodes.
All anchor nodes in the communication radius of all mobile node 's neighbors in current time, we call them the neighbor anchor nodes.
Each node then updates its local clock using the weighted average of the current time differences between itself and its neighboring nodes as well as stored time differences from the previous iteration of the algorithm.
We adopted a modified version of Boolean network used in [ 16] and [ 43], in which the node states in the next time step are determined by the node states of the current time step via the following rules: where F = Σ j a ij S j (t) and i is the target node while j is the parent node.
One is the time interval (T=t_n-t_p), (t_n) presents the current time, and (t_p) presents the time that node k recommends node i.
The priority of the node is calculated based on the node ID, current time and the eligibility function.
In the current round, it is the time shot of node i; if node i and cluster head j have a common channel available, node i will send data to cluster head j ordinarily as long as the sensed value meets the requirements of HT and ST.
