19,140 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
Self-Synchronization in Duty-cycled Internet of Things (IoT) Applications
In recent years, the networks of low-power devices have gained popularity.
Typically these devices are wireless and interact to form large networks such
as the Machine to Machine (M2M) networks, Internet of Things (IoT), Wearable
Computing, and Wireless Sensor Networks. The collaboration among these devices
is a key to achieving the full potential of these networks. A major problem in
this field is to guarantee robust communication between elements while keeping
the whole network energy efficient. In this paper, we introduce an extended and
improved emergent broadcast slot (EBS) scheme, which facilitates collaboration
for robust communication and is energy efficient. In the EBS, nodes
communication unit remains in sleeping mode and are awake just to communicate.
The EBS scheme is fully decentralized, that is, nodes coordinate their wake-up
window in partially overlapped manner within each duty-cycle to avoid message
collisions. We show the theoretical convergence behavior of the scheme, which
is confirmed through real test-bed experimentation.Comment: 12 Pages, 11 Figures, Journa
Recommended from our members
A survey of handover algorithms in DVB-H
Digital Video Broadcasting for Handhelds (DVB-H) is a standard for
broadcasting IP Datacast (IPDC) services to mobile handheld terminals.
Based on the DVB-T standard, DVB-H adds new features such as time
slicing, MPE-FEC, in-depth interleavers, mandatory cell id identifier,
optional 4K-modulation mode and the use of 5 MHz bandwidth in addition
to the usually used 6, 7, or 8 MHz raster. IPDC over DVB-H is proposed
for ETSI to complement the DVB-H standard by combining IPDC and
DVB-H in an end-to-end system. Handover in such unidirectional broadcasting
networks is a novel issue. In the last few years since the birth of
DVB-H technology, great attention has been given to the performance
analysis of DVB-H mobile terminals. Handover is one of the main research
topics for DVB-H in mobile scenarios. Better reception quality and greater
power efficiency are considered to be the main targets of handover
research for DVB-H. New algorithms for different handover stages in
DVB-H have been the subject of recent research and are currently being
studied. Further novel algorithms need to be designed to improve the
mobile reception quality. This article provides a comprehensive survey of
the handover algorithms in DVB-H. A systematic evaluation and categorization
approach is proposed based on the problems the algorithms solve
and the handover stages being focused on. Criteria are proposed and analyzed
to facilitate designing better handover algorithms for DVB-H that
have been identified from the research conducted by the author
Lightweight Synchronization Algorithm with Self-Calibration for Industrial LORA Sensor Networks
Wireless sensor and actuator networks are gaining momentum in the era of
Industrial Internet of Things IIoT. The usage of the close-loop data from
sensors in the manufacturing chain is extending the common monitoring scenario
of the Wireless Sensors Networks WSN where data were just logged. In this paper
we present an accurate timing synchronization for TDMA implemented on the state
of art IoT radio, such as LoRa, that is a good solution in industrial
environments for its high robustness. Experimental results show how it is
possible to modulate the drift correction and keep the synchronization error
within the requirements
Adaptive Synchronization of Robotic Sensor Networks
The main focus of recent time synchronization research is developing
power-efficient synchronization methods that meet pre-defined accuracy
requirements. However, an aspect that has been often overlooked is the high
dynamics of the network topology due to the mobility of the nodes. Employing
existing flooding-based and peer-to-peer synchronization methods, are networked
robots still be able to adapt themselves and self-adjust their logical clocks
under mobile network dynamics? In this paper, we present the application and
the evaluation of the existing synchronization methods on robotic sensor
networks. We show through simulations that Adaptive Value Tracking
synchronization is robust and efficient under mobility. Hence, deducing the
time synchronization problem in robotic sensor networks into a dynamic value
searching problem is preferable to existing synchronization methods in the
literature.Comment: First International Workshop on Robotic Sensor Networks part of
Cyber-Physical Systems Week, Berlin, Germany, 14 April 201
FastPay: High-Performance Byzantine Fault Tolerant Settlement
FastPay allows a set of distributed authorities, some of which are Byzantine,
to maintain a high-integrity and availability settlement system for pre-funded
payments. It can be used to settle payments in a native unit of value
(crypto-currency), or as a financial side-infrastructure to support retail
payments in fiat currencies. FastPay is based on Byzantine Consistent Broadcast
as its core primitive, foregoing the expenses of full atomic commit channels
(consensus). The resulting system has low-latency for both confirmation and
payment finality. Remarkably, each authority can be sharded across many
machines to allow unbounded horizontal scalability. Our experiments demonstrate
intra-continental confirmation latency of less than 100ms, making FastPay
applicable to point of sale payments. In laboratory environments, we achieve
over 80,000 transactions per second with 20 authorities---surpassing the
requirements of current retail card payment networks, while significantly
increasing their robustness
- …