Fast data synchronization in wireless ad hoc networks is a challenging and critical problem. It is fundamental for efficient information fusion, control and decision in distributed systems. Previously, distributed data synchronization was mainly studied in the latency-tolerant distributed databases, or assuming the general model of wireless ad hoc networks. In this paper, we propose a pair of linear network coding (NC) and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator's control. We consider both data block selection and transmitting node selection for exploiting the benefits of NC. Instead of using the store-and-forward protocol as in the conventional uncoded approach, a compute-and-forward protocol is used in our scheme, which improves the transmission efficiency. The performance of the proposed algorithms is studied under different values of network size, network connection degree, and per-hop packet error rate. Simulation results demonstrate that our algorithms significantly reduce the times slots used for data synchronization compared with the baseline that does not use NC.
翻译:在无线特设网络中,快速数据同步是一个具有挑战性和关键的问题。对于在分布式系统中高效的信息聚合、控制和决定来说,这是一个至关重要的问题。以前,分布式数据同步主要在长期耐受性分布式数据库中研究,或者假设无线临时网络的一般模式。在本文中,我们提议为无线临时网络提供一对线性网络编码(NC)和基于全广播的快速数据同步算法,这些网络的地形在操作者控制之下。我们考虑数据区块选择和传输节点选择,以利用NC的好处。在常规的未编码方法中,使用储存和前方协议,而不是使用储存和前方协议,在我们的计划中使用一种计算和前方协议,以提高传输效率。拟议算法的性能是在不同的网络规模、网络连接度和每个波包误差率值下研究的。模拟结果显示,我们的算法大大降低了数据同步使用的时间档,与不使用NC的基线相比。