1,196 research outputs found
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
An algorithm for clock synchronization with the gradient property in sensor networks
We introduce a distributed algorithm for clock synchronization in sensor
networks. Our algorithm assumes that nodes in the network only know their
immediate neighborhoods and an upper bound on the network's diameter.
Clock-synchronization messages are only sent as part of the communication,
assumed reasonably frequent, that already takes place among nodes. The
algorithm has the gradient property of [2], achieving an O(1) worst-case skew
between the logical clocks of neighbors. As in the case of [3,8], the
algorithm's actions are such that no constant lower bound exists on the rate at
which logical clocks progress in time, and for this reason the lower bound of
[2,5] that forbids constant skew between neighbors does not apply
Modelling Clock Synchronization in the Chess gMAC WSN Protocol
We present a detailled timed automata model of the clock synchronization
algorithm that is currently being used in a wireless sensor network (WSN) that
has been developed by the Dutch company Chess. Using the Uppaal model checker,
we establish that in certain cases a static, fully synchronized network may
eventually become unsynchronized if the current algorithm is used, even in a
setting with infinitesimal clock drifts
Estimation of communication-delays through adaptive synchronization of chaos
This paper deals with adaptive synchronization of chaos in the presence of
time-varying communication-delays. We consider two bidirectionally coupled
systems that seek to synchronize through a signal that each system sends to the
other one and is transmitted with an unknown time-varying delay. We show that
an appropriate adaptive strategy can be devised that is successful in
dynamically identifying the time-varying delay and in synchronizing the two
systems. The performance of our strategy with respect to the choice of the
initial conditions and the presence of noise in the communication channels is
tested by using numerical simulations. Another advantage of our approach is
that in addition to estimating the communication-delay, the adaptive strategy
could be used to simultaneously identify other parameters, such as e.g., the
unknown time-varying amplitude of the received signal.Comment: Accepted for publication in Chaos, Solitons & Fractal
- âŠ