Analysis of a discrete network synchronization algorithm

Mobile communication systems benefit from synchronous networks. This is especially important if the system also offers positioning services that are often asked nowadays. In this work we analyze a discrete terrestrial network synchronization algorithm. It is analytically shown that the algorithm provides synchronism in its different modes. In the mutual synchronization mode the time varies around the theoretical mean value with an increasing variance, i.e., the system's time intervals vary with time. In the master based mode variations art, limited if the master clock has a high quality. However if the times are compared to a time of a selected reference node, the covariance remains limited which affirms usability of the algorithm. In the simulations the convergence speed of the algorithm is studied for various system parameter values. In addition, also the affects of non-idealities are studied showing, e.g., that the algorithm tends to limit the effects of clock frequency error and drift.