TS-MUWSN: Time synchronization for mobile underwater sensor networks

Time synchronization is an important, yet challenging, problem in underwater sensor networks (UWSNs). This challenge can be attributed to: 1) messaging timestamping; 2) node mobility; and 3) Doppler scale effect. To mitigate these problems, we present an acoustic-based time-synchronization algorithm for UWSN, where we compare several message time-stamping algorithms in addition to different Doppler scale estimators. A synchronization system is based on a bidirectional message exchange between a reference node and a slave one, which has to be synchronized. Therefore, we take as reference the DA-Sync-like protocol (Liu et al., 2014), which takes into account node's movement by using first-order kinematic equations, which refine Doppler scale factor estimation accuracy, and result in better synchronization performance. In our study, we propose to modify both time-stamping and Doppler scale estimation procedures. Besides simulation, we also perform real tests in controlled underwater communication in a water test tank and a shallow-water test in the Mediterranean Sea.Peer ReviewedPostprint (author's final draft

Synchronization Landscapes in Small-World-Connected Computer Networks

Motivated by a synchronization problem in distributed computing we studied a simple growth model on regular and small-world networks, embedded in one and two-dimensions. We find that the synchronization landscape (corresponding to the progress of the individual processors) exhibits Kardar-Parisi-Zhang-like kinetic roughening on regular networks with short-range communication links. Although the processors, on average, progress at a nonzero rate, their spread (the width of the synchronization landscape) diverges with the number of nodes (desynchronized state) hindering efficient data management. When random communication links are added on top of the one and two-dimensional regular networks (resulting in a small-world network), large fluctuations in the synchronization landscape are suppressed and the width approaches a finite value in the large system-size limit (synchronized state). In the resulting synchronization scheme, the processors make close-to-uniform progress with a nonzero rate without global intervention. We obtain our results by ``simulating the simulations", based on the exact algorithmic rules, supported by coarse-grained arguments.Comment: 20 pages, 22 figure