Decentralized sequential change detection using physical layer fusion

The problem of decentralized sequential detection with conditionally independent observations is studied. The sensors form a star topology with a central node called fusion center as the hub. The sensors make noisy observations of a parameter that changes from an initial state to a final state at a random time where the random change time has a geometric distribution. The sensors amplify and forward the observations over a wireless Gaussian multiple access channel and operate under either a power constraint or an energy constraint. The optimal transmission strategy at each stage is shown to be the one that maximizes a certain Ali-Silvey distance between the distributions for the hypotheses before and after the change. Simulations demonstrate that the proposed analog technique has lower detection delays when compared with existing schemes. Simulations further demonstrate that the energy-constrained formulation enables better use of the total available energy than the power-constrained formulation in the change detection problem.Comment: 10 pages, two-column, 10 figures, revised based on feedback from reviewers, accepted for publication in IEEE Trans. on Wireless Communication

Random Access Channel Coding in the Finite Blocklength Regime

Consider a random access communication scenario over a channel whose operation is defined for any number of possible transmitters. Inspired by the model recently introduced by Polyanskiy for the Multiple Access Channel (MAC) with a fixed, known number of transmitters, we assume that the channel is invariant to permutations on its inputs, and that all active transmitters employ identical encoders. Unlike Polyanskiy, we consider a scenario where neither the transmitters nor the receiver know which transmitters are active. We refer to this agnostic communication setup as the Random Access Channel, or RAC. Scheduled feedback of a finite number of bits is used to synchronize the transmitters. The decoder is tasked with determining from the channel output the number of active transmitters ($k$) and their messages but not which transmitter sent which message. The decoding procedure occurs at a time $n_t$ depending on the decoder's estimate $t$ of the number of active transmitters, $k$, thereby achieving a rate that varies with the number of active transmitters. Single-bit feedback at each time $n_i, i \leq t$, enables all transmitters to determine the end of one coding epoch and the start of the next. The central result of this work demonstrates the achievability on a RAC of performance that is first-order optimal for the MAC in operation during each coding epoch. While prior multiple access schemes for a fixed number of transmitters require $2^k - 1$ simultaneous threshold rules, the proposed scheme uses a single threshold rule and achieves the same dispersion.Comment: Presented at ISIT18', submitted to IEEE Transactions on Information Theor

Gaussian Multiple and Random Access in the Finite Blocklength Regime

This paper presents finite-blocklength achievabil- ity bounds for the Gaussian multiple access channel (MAC) and random access channel (RAC) under average-error and maximal-power constraints. Using random codewords uniformly distributed on a sphere and a maximum likelihood decoder, the derived MAC bound on each transmitter’s rate matches the MolavianJazi-Laneman bound (2015) in its first- and second-order terms, improving the remaining terms to ½ log n/n + O(1/n) bits per channel use. The result then extends to a RAC model in which neither the encoders nor the decoder knows which of K possible transmitters are active. In the proposed rateless coding strategy, decoding occurs at a time n t that depends on the decoder’s estimate t of the number of active transmitters k. Single-bit feedback from the decoder to all encoders at each potential decoding time n_i, i ≤ t, informs the encoders when to stop transmitting. For this RAC model, the proposed code achieves the same first-, second-, and third-order performance as the best known result for the Gaussian MAC in operation

The SILCC (SImulating the LifeCycle of molecular Clouds) project: I. Chemical evolution of the supernova-driven ISM

The SILCC project (SImulating the Life-Cycle of molecular Clouds) aims at a more self-consistent understanding of the interstellar medium (ISM) on small scales and its link to galaxy evolution. We simulate the evolution of the multi-phase ISM in a 500 pc x 500 pc x 10 kpc region of a galactic disc, with a gas surface density of $\Sigma_{_{\rm GAS}} = 10 \;{\rm M}_\odot/{\rm pc}^2$. The Flash 4.1 simulations include an external potential, self-gravity, magnetic fields, heating and radiative cooling, time-dependent chemistry of H$_2$ and CO considering (self-) shielding, and supernova (SN) feedback. We explore SN explosions at different (fixed) rates in high-density regions (peak), in random locations (random), in a combination of both (mixed), or clustered in space and time (clustered). Only random or clustered models with self-gravity (which evolve similarly) are in agreement with observations. Molecular hydrogen forms in dense filaments and clumps and contributes 20% - 40% to the total mass, whereas most of the mass (55% - 75%) is in atomic hydrogen. The ionised gas contributes <10%. For high SN rates (0.5 dex above Kennicutt-Schmidt) as well as for peak and mixed driving the formation of H$_2$ is strongly suppressed. Also without self-gravity the H$_2$ fraction is significantly lower ($\sim$ 5%). Most of the volume is filled with hot gas ($\sim$90% within $\pm$2 kpc). Only for random or clustered driving, a vertically expanding warm component of atomic hydrogen indicates a fountain flow. Magnetic fields have little impact on the final disc structure. However, they affect dense gas ($n\gtrsim 10\;{\rm cm}^{-3}$) and delay H$_2$ formation. We highlight that individual chemical species, in particular atomic hydrogen, populate different ISM phases and cannot be accurately accounted for by simple temperature-/density-based phase cut-offs.Comment: 30 pages, 23 figures, submitted to MNRAS. Comments welcome! For movies of the simulations and download of selected Flash data see the SILCC website: http://www.astro.uni-koeln.de/silc

Strongly Secure Communications Over the Two-Way Wiretap Channel

We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the eavesdropper's terminal and cooperation between legitimate users. We leverage the notion of channel resolvability for the multiple-access channel to analyze cooperative jamming and we show that the artificial noise created by cooperative jamming induces a source of common randomness that can be used for secret-key agreement. We illustrate the gain provided by this coding technique in the case of the Gaussian two-way wiretap channel, and we show significant improvements for some channel configurations.Comment: 11 pages, 7 figures, submitted to IEEE Transactions on Information Forensics and Security, Special Issue: "Using the Physical Layer for Securing the Next Generation of Communication Systems

On the formation of dwarf galaxies and stellar halos

Using analytic arguments and a suite of very high resolution (10^3 Msun per particle) cosmological hydro-dynamical simulations, we argue that high redshift, z ~ 10, M ~ 10^8 Msun halos, form the smallest `baryonic building block' (BBB) for galaxy formation. These halos are just massive enough to efficiently form stars through atomic line cooling and to hold onto their gas in the presence of supernovae winds and reionisation. These combined effects, in particular that of the supernovae feedback, create a sharp transition: over the mass range 3-10x10^7 Msun, the BBBs drop two orders ofmagnitude in stellar mass. Below ~2x10^7 Msun, galaxies will be dark with almost no stars and no gas. Above this scale is the smallest unit of galaxy formation: the BBB. A small fraction (~100) of these gas rich BBBs fall in to a galaxy the size of the Milky Way. Ten percent of these survive to become the observed LG dwarf galaxies at the present epoch. Those in-falling halos on benign orbits which keep them far away from the Milky Way or Andromeda manage to retain their gas and slowly form stars - these become the smallest dwarf irregular galax ies; those on more severe orbits lose their gas faster than they can form stars and become the dwarf spheroidals. The remaining 90% of the BBBs will be accreted. We show that this gives a metallicity and total stellar mass consistent with the Milky Way old stellar halo (abridged).Comment: 15 pages, 7 figures, one figure added to match accepted version. Some typos fixed. MNRAS in pres

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial