Random Access for Machine-Type Communication based on Bloom Filtering

We present a random access method inspired on Bloom filters that is suited for Machine-Type Communications (MTC). Each accessing device sends a \emph{signature} during the contention process. A signature is constructed using the Bloom filtering method and contains information on the device identity and the connection establishment cause. We instantiate the proposed method over the current LTE-A access protocol. However, the method is applicable to a more general class of random access protocols that use preambles or other reservation sequences, as expected to be the case in 5G systems. We show that our method utilizes the system resources more efficiently and achieves significantly lower connection establishment latency in case of synchronous arrivals, compared to the variant of the LTE-A access protocol that is optimized for MTC traffic. A dividend of the proposed method is that it allows the base station (BS) to acquire the device identity and the connection establishment cause already in the initial phase of the connection establishment, thereby enabling their differentiated treatment by the BS.Comment: Accepted for presentation on IEEE Globecom 201

The thermodynamics of creating correlations: Limitations and optimal protocols

We establish a rigorous connection between fundamental resource theories at the quantum scale. Correlations and entanglement constitute indispensable resources for numerous quantum information tasks. However, their establishment comes at the cost of energy, the resource of thermodynamics, and is limited by the initial entropy. Here, the optimal conversion of energy into correlations is investigated. Assuming the presence of a thermal bath, we establish general bounds for arbitrary systems and construct a protocol saturating them. The amount of correlations, quantified by the mutual information, can increase at most linearly with the available energy, and we determine where the linear regime breaks down. We further consider the generation of genuine quantum correlations, focusing on the fundamental constituents of our universe: fermions and bosons. For fermionic modes, we find the optimal entangling protocol. For bosonic modes, we show that while Gaussian operations can be outperformed in creating entanglement, their performance is optimal for high energies.Comment: 12 pages, 6 figure

Formal modeling and analysis of a narrow bandwidth protocol for establishing and terminating connections

International audienceThe paper presents a formal modeling and analysis of a protocol for narrow bandwidth channels of service connection establishment and termination. The protocol is characterized by state traces and formally verified by a theorem proving system PVS. Relevant properties are specified and verified in terms of inductive principles. The effectiveness of the proposed method is evidenced by the elaborate analysis which unveils a subtle bug in the initial protocol implementation. The approach is scalable for an arbitrary number of agents

The New Grid

The New Grid seeks to provide mobile users with an additional method for off-grid communication, or communication without connection to Internet infrastructure. The motivation for this project was to find another alternative to Internet-dependent communication. Current Internet infrastructure is antiquated; it is expensive to maintain and expand, it has numerous vulnerabilities and high-impact points of failure, and can be rendered unusable for lengthy periods of time by natural disasters or other catastrophes. This current grid will eventually need to be replaced by a more modern, scalable, and adaptive infrastructure. The results of the projects research showed that implementing a library to allow for the creation of mobile peer-to-peer mesh networks could serve as a starting point for a transition from current Internet infrastructure to a more scalable, adaptive, and reliable Internet- independent network grid. Development of The New Grid largely followed the Rational Unified Process, in which the development process is split into four phases: requirements gathering, system design, implementation, and testing. Most of fall quarter was spent outlining functional requirements for the system, designing possible methods of implementation, and researching similar solutions that seek to transition mass mobile communication to a newer, more modern network grid. The New Grid differs from similar solutions because it has been implemented as a modular library. Current systems that allow for off-grid mobile connection exist as independent applications with a defined context and predetermined usability scope. We, the design team, found that implementing the system in the form of a modular library has multiple benefits. Primarily, this implementation would allow The New Grid to be deployed as widely as possible. Developers can both write applications around our library as well as include specific modules into existing applications without impacting other modules or introducing additional overhead into a system. Another benefit of deploying the system as a modular library is adaptability. The current, initial stable build of The New Grid uses Bluetooth Low Energy as its backbone for facilitating communication within large networks of mobile devices; however, this library could use any existing or future communication protocol to facilitate connection as long as a hook is written to allow The New Grid to interface with that protocol. Thus, The New Grid is not limited by which connection protocols currently exist, a property that other similar systems do not possess. The New Grid can be used in any application that requires connection between users. The most common applications would likely be messaging, file sharing, or social networking. While developers may find a variety of uses for The New Grid, its primary purpose is to facilitate reliable connection and secure data transfer in an environment with a large user base. Achieving this goal was proven feasible through research and testing the library with a small cluster of Android devices communicating solely with Bluetooth Low Energy. Expanding this group of a few phones to a larger mesh network of hundreds of devices was shown to be feasible through testing the librarys algorithms and protocols on a large network of virtual devices. As long as developers seek to create applications that allow users to communicate independent of Internet infrastructure, The New Grid will allow smartphone users to communicate off-grid and hopefully spur a switch from infrastructure-dependent mobile communication to user-centric, adaptive, and flexible connection

Simple and Efficient Local Codes for Distributed Stable Network Construction

In this work, we study protocols so that populations of distributed processes can construct networks. In order to highlight the basic principles of distributed network construction we keep the model minimal in all respects. In particular, we assume finite-state processes that all begin from the same initial state and all execute the same protocol (i.e. the system is homogeneous). Moreover, we assume pairwise interactions between the processes that are scheduled by an adversary. The only constraint on the adversary scheduler is that it must be fair. In order to allow processes to construct networks, we let them activate and deactivate their pairwise connections. When two processes interact, the protocol takes as input the states of the processes and the state of the their connection and updates all of them. Initially all connections are inactive and the goal is for the processes, after interacting and activating/deactivating connections for a while, to end up with a desired stable network. We give protocols (optimal in some cases) and lower bounds for several basic network construction problems such as spanning line, spanning ring, spanning star, and regular network. We provide proofs of correctness for all of our protocols and analyze the expected time to convergence of most of them under a uniform random scheduler that selects the next pair of interacting processes uniformly at random from all such pairs. Finally, we prove several universality results by presenting generic protocols that are capable of simulating a Turing Machine (TM) and exploiting it in order to construct a large class of networks.Comment: 43 pages, 7 figure

Glassy Phase of Optimal Quantum Control

We study the problem of preparing a quantum many-body system from an initial to a target state by optimizing the fidelity over the family of bang-bang protocols. We present compelling numerical evidence for a universal spin-glass-like transition controlled by the protocol time duration. The glassy critical point is marked by a proliferation of protocols with close-to-optimal fidelity and with a true optimum that appears exponentially difficult to locate. Using a machine learning (ML) inspired framework based on the manifold learning algorithm t-SNE, we are able to visualize the geometry of the high-dimensional control landscape in an effective low-dimensional representation. Across the transition, the control landscape features an exponential number of clusters separated by extensive barriers, which bears a strong resemblance with replica symmetry breaking in spin glasses and random satisfiability problems. We further show that the quantum control landscape maps onto a disorder-free classical Ising model with frustrated nonlocal, multibody interactions. Our work highlights an intricate but unexpected connection between optimal quantum control and spin glass physics, and shows how tools from ML can be used to visualize and understand glassy optimization landscapes.Comment: Modified figures in appendix and main text (color schemes). Corrected references. Added figures in SI and pseudo-cod

The Effect of Slow Electrical Stimuli to Achieve Learning in Cultured Networks of Rat Cortical Neurons

Learning, or more generally, plasticity may be studied using cultured networks of rat cortical neurons on multi electrode arrays. Several protocols have been proposed to affect connectivity in such networks. One of these protocols, proposed by Shahaf and Marom, aimed to train the input-output relationship of a selected connection in a network using slow electrical stimuli. Although the results were quite promising, the experiments appeared difficult to repeat and the training protocol did not serve as a basis for wider investigation yet. Here, we repeated their protocol, and compared our ‘learning curves’ to the original results. Although in some experiments the protocol did not seem to work, we found that on average, the protocol showed a significantly improved stimulus response indeed. Furthermore, the protocol always induced functional connectivity changes that were much larger than changes that occurred after a comparable period of random or no stimulation. Finally, our data shows that stimulation at a fixed electrode induces functional connectivity changes of similar magnitude as stimulation through randomly varied sites; both larger than spontaneous connectivity fluctuations. We concluded that slow electrical stimulation always induced functional connectivity changes, although uncontrolled. The magnitude of change increased when we applied the adaptive (closed-loop) training protocol. We hypothesize that networks develop an equilibrium between connectivity and activity. Induced connectivity changes depend on the combination of applied stimulus and initial connectivity. Plain stimuli may drive networks to the nearest equilibrium that accommodates this input, whereas adaptive stimulation may direct the space for exploration and force networks to a new balance, at a larger distance from the initial state