36,471 research outputs found
Linear Network Coding Based Fast Data Synchronization for Wireless Ad Hoc Networks with Controlled Topology
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.Comment: 9 pages, 9 figures, published on China Communications, vol. 19, no.
5, May 202
Synchronization service integrated into routing layer in wireless sensor networks
The time synchronization problem needs to be considered in a distributed system. In Wireless Sensor Networks (WSNs) this issue must be solved with limited computational, communication and energy resources. Many synchronization protocols exist for WSNs. However, in most cases these protocols are independent entities with specific packets, communication scheme and network hierarchy. This solution is not energy efficient. Because it is very rare for synchronization not to be necessary in WSNs, we advocate integrating the synchronization service into the routing layer. We have implemented this approach in a new synchronization protocol called Routing Integrated Synchronization Service (RISS). Our tests show that RISS is very time and energy efficient and also is characterized by a small overhead. We have compared its performance experimentally to that of the FTSP synchronization protocol and it has proved to offer better time precision than the latter protocol
Mean-Field-Type Games in Engineering
A mean-field-type game is a game in which the instantaneous payoffs and/or
the state dynamics functions involve not only the state and the action profile
but also the joint distributions of state-action pairs. This article presents
some engineering applications of mean-field-type games including road traffic
networks, multi-level building evacuation, millimeter wave wireless
communications, distributed power networks, virus spread over networks, virtual
machine resource management in cloud networks, synchronization of oscillators,
energy-efficient buildings, online meeting and mobile crowdsensing.Comment: 84 pages, 24 figures, 183 references. to appear in AIMS 201
Cooperative Synchronization in Wireless Networks
Synchronization is a key functionality in wireless network, enabling a wide
variety of services. We consider a Bayesian inference framework whereby network
nodes can achieve phase and skew synchronization in a fully distributed way. In
particular, under the assumption of Gaussian measurement noise, we derive two
message passing methods (belief propagation and mean field), analyze their
convergence behavior, and perform a qualitative and quantitative comparison
with a number of competing algorithms. We also show that both methods can be
applied in networks with and without master nodes. Our performance results are
complemented by, and compared with, the relevant Bayesian Cram\'er-Rao bounds
E-MAC: an evolutionary solution for collision avoidance in wireless ad hoc networks
Transmission collision is a main cause of throughput degradation and non-deterministic latency in wireless networks. Existing collision-avoidance mechanisms for distributed wireless networks are mostly based on the random backoff strategy, which cannot guarantee collision-free accesses. In this paper, we design a simple collision-avoidance MAC (E-MAC) for distributed wireless networks that can iteratively achieve collision-free access. In E-MAC, each transmitter will adjust its next transmission time according to which part of its packets suffering from the collision. And the iteration of this adjustment will quickly lead group of nodes converging to a collision-free network. E-MAC does not require any central coordination or global time synchronization. It is scalable to new entrants to the network and variable packet lengths. And it is also robust to system errors, such as inaccurate timing.Transmission collision is a main cause of throughput degradation and non-deterministic latency in wireless networks. Existing collision-avoidance mechanisms for distributed wireless networks are mostly based on the random backoff strategy, which cannot guarantee collision-free accesses. In this paper, we design a simple collision-avoidance MAC (E-MAC) for distributed wireless networks that can iteratively achieve collision-free access. In E-MAC, each transmitter will adjust its next transmission time according to which part of its packets suffering from the collision. And the iteration of this adjustment will quickly lead group of nodes converging to a collision-free network. E-MAC does not require any central coordination or global time synchronization. It is scalable to new entrants to the network and variable packet lengths. And it is also robust to system errors, such as inaccurate timing
Synchronization in Random Geometric Graphs
In this paper we study the synchronization properties of random geometric
graphs. We show that the onset of synchronization takes place roughly at the
same value of the order parameter that a random graph with the same size and
average connectivity. However, the dependence of the order parameter with the
coupling strength indicates that the fully synchronized state is more easily
attained in random graphs. We next focus on the complete synchronized state and
show that this state is less stable for random geometric graphs than for other
kinds of complex networks. Finally, a rewiring mechanism is proposed as a way
to improve the stability of the fully synchronized state as well as to lower
the value of the coupling strength at which it is achieved. Our work has
important implications for the synchronization of wireless networks, and should
provide valuable insights for the development and deployment of more efficient
and robust distributed synchronization protocols for these systems.Comment: 5 pages, 4 figure
- …