Performance analysis of local algorithms in large-scale disconnected networks

In pre-planned large-scale mobile networks, nodes cooperate to achieve the missions assigned to the networks. Due to the mobility of nodes, the common assumption that the contemporaneous path between any two nodes always exists cannot be made. Local algorithms, with the characteristics locality and simplicity, can make the disconnected systems robust and reliable. The recently proposed work [1] provides simple, local algorithms to let nodes perform local tasks while achieving global information delivery. In this paper, we study these algorithms by investigating the properties of node trajectories, such as their distribution and length. We also examine the performance of these algorithms under different networks and failure scenarios. The results reveal that the properties of the trajectories are critical indicators of the performance of the algorithms.