9,605 research outputs found
A survey on subjecting electronic product code and non-ID objects to IP identification
Over the last decade, both research on the Internet of Things (IoT) and
real-world IoT applications have grown exponentially. The IoT provides us with
smarter cities, intelligent homes, and generally more comfortable lives.
However, the introduction of these devices has led to several new challenges
that must be addressed. One of the critical challenges facing interacting with
IoT devices is to address billions of devices (things) around the world,
including computers, tablets, smartphones, wearable devices, sensors, and
embedded computers, and so on. This article provides a survey on subjecting
Electronic Product Code and non-ID objects to IP identification for IoT
devices, including their advantages and disadvantages thereof. Different
metrics are here proposed and used for evaluating these methods. In particular,
the main methods are evaluated in terms of their: (i) computational overhead,
(ii) scalability, (iii) adaptability, (iv) implementation cost, and (v) whether
applicable to already ID-based objects and presented in tabular format.
Finally, the article proves that this field of research will still be ongoing,
but any new technique must favorably offer the mentioned five evaluative
parameters.Comment: 112 references, 8 figures, 6 tables, Journal of Engineering Reports,
Wiley, 2020 (Open Access
Effect of Local Population Uncertainty on Cooperation in Bacteria
Bacteria populations rely on mechanisms such as quorum sensing to coordinate
complex tasks that cannot be achieved by a single bacterium. Quorum sensing is
used to measure the local bacteria population density, and it controls
cooperation by ensuring that a bacterium only commits the resources for
cooperation when it expects its neighbors to reciprocate. This paper proposes a
simple model for sharing a resource in a bacterial environment, where knowledge
of the population influences each bacterium's behavior. Game theory is used to
model the behavioral dynamics, where the net payoff (i.e., utility) for each
bacterium is a function of its current behavior and that of the other bacteria.
The game is first evaluated with perfect knowledge of the population. Then, the
unreliability of diffusion introduces uncertainty in the local population
estimate and changes the perceived payoffs. The results demonstrate the
sensitivity to the system parameters and how population uncertainty can
overcome a lack of explicit coordination.Comment: 5 pages, 6 figures. Will be presented as an invited paper at the 2017
IEEE Information Theory Workshop in November 2017 in Kaohsiung, Taiwa
An Algebraic Model For Quorum Systems
Quorum systems are a key mathematical abstraction in distributed
fault-tolerant computing for capturing trust assumptions. A quorum system is a
collection of subsets of all processes, called quorums, with the property that
each pair of quorums have a non-empty intersection. They can be found at the
core of many reliable distributed systems, such as cloud computing platforms,
distributed storage systems and blockchains. In this paper we give a new
interpretation of quorum systems, starting with classical majority-based quorum
systems and extending this to Byzantine quorum systems. We propose an algebraic
representation of the theory underlying quorum systems making use of
multivariate polynomial ideals, incorporating properties of these systems, and
studying their algebraic varieties. To achieve this goal we will exploit
properties of Boolean Groebner bases. The nice nature of Boolean Groebner bases
allows us to avoid part of the combinatorial computations required to check
consistency and availability of quorum systems. Our results provide a novel
approach to test quorum systems properties from both algebraic and algorithmic
perspectives.Comment: 15 pages, 3 algorithm
Unidirectional Quorum-based Cycle Planning for Efficient Resource Utilization and Fault-Tolerance
In this paper, we propose a greedy cycle direction heuristic to improve the
generalized redundancy quorum cycle technique. When applied using
only single cycles rather than the standard paired cycles, the generalized
redundancy technique has been shown to almost halve the necessary
light-trail resources in the network. Our greedy heuristic improves this
cycle-based routing technique's fault-tolerance and dependability.
For efficiency and distributed control, it is common in distributed systems
and algorithms to group nodes into intersecting sets referred to as quorum
sets. Optimal communication quorum sets forming optical cycles based on
light-trails have been shown to flexibly and efficiently route both
point-to-point and multipoint-to-multipoint traffic requests. Commonly cycle
routing techniques will use pairs of cycles to achieve both routing and
fault-tolerance, which uses substantial resources and creates the potential for
underutilization. Instead, we use a single cycle and intentionally utilize
redundancy within the quorum cycles such that every point-to-point
communication pairs occur in at least cycles. Without the paired
cycles the direction of the quorum cycles becomes critical to the fault
tolerance performance. For this we developed a greedy cycle direction heuristic
and our single fault network simulations show a reduction of missing pairs by
greater than 30%, which translates to significant improvements in fault
coverage.Comment: Computer Communication and Networks (ICCCN), 2016 25th International
Conference on. arXiv admin note: substantial text overlap with
arXiv:1608.05172, arXiv:1608.05168, arXiv:1608.0517
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
ARPA Whitepaper
We propose a secure computation solution for blockchain networks. The
correctness of computation is verifiable even under malicious majority
condition using information-theoretic Message Authentication Code (MAC), and
the privacy is preserved using Secret-Sharing. With state-of-the-art multiparty
computation protocol and a layer2 solution, our privacy-preserving computation
guarantees data security on blockchain, cryptographically, while reducing the
heavy-lifting computation job to a few nodes. This breakthrough has several
implications on the future of decentralized networks. First, secure computation
can be used to support Private Smart Contracts, where consensus is reached
without exposing the information in the public contract. Second, it enables
data to be shared and used in trustless network, without disclosing the raw
data during data-at-use, where data ownership and data usage is safely
separated. Last but not least, computation and verification processes are
separated, which can be perceived as computational sharding, this effectively
makes the transaction processing speed linear to the number of participating
nodes. Our objective is to deploy our secure computation network as an layer2
solution to any blockchain system. Smart Contracts\cite{smartcontract} will be
used as bridge to link the blockchain and computation networks. Additionally,
they will be used as verifier to ensure that outsourced computation is
completed correctly. In order to achieve this, we first develop a general MPC
network with advanced features, such as: 1) Secure Computation, 2) Off-chain
Computation, 3) Verifiable Computation, and 4)Support dApps' needs like
privacy-preserving data exchange
- …