Sentence examples for moving node is from inspiring English sources

Step 5: After that, the neighbour with SNF value 0 is removed, and high-speed moving node is filtered from CN for route reconstruction.

If the moving node is a non-leader node, it needs to update the information of ID and distances with its neighbors, then algorithm restarts to execute the new leader election in the new area.

Assuming that the initial distance between the static sensor node and the moving track is d 0=100 m, the effective interval is L 0=625 m, and the velocity of the moving node is v=20 m/s; thus, the time interval of the transmission is T s =62.5 s.

In the process of new leader election, if the moving node is a leader, the node who has the largest ID and the remaining energy is larger than 10% E will change the state to leader, or we can find a leader that meets the conditions according to the descending order of ID and energy constraint.

Otherwise, if the routes along this moving node are broken down, then the network manager considers the maintenance mechanisms below.

When the moving time is 80 s and the number of moving nodes is 10, energy consumption has the maximum, since the larger number of moving nodes can result in more energy consumption.

Energy consumption increases significantly, when the moving time is about 60 s and the number of moving nodes is about 6, but it drops when the number of moving nodes decreases or increases.

In order to understand the impact of moving time and the number of moving nodes on energy consumption, their relationship is shown in Fig. 5. Figure 5 shows that, on the one hand, when the number of moving nodes is less than 4, energy consumption is small for any moving time, and when the moving time is less than 40 s, energy consumption has similar result.

This is because that, on the one hand, more the number of moving nodes is, more energy consumption is.

Compared with Fig. 4, when the number of moving nodes is 7, execution rounds of Algorithm 1 decreases 31.1 %, and execution rounds for 10 moving nodes is less than that of 7 moving nodes.

The probability of completing a transmission of a data packet between two moving nodes is derived by Cho and Hayes [10].