On the Scalability and Message Count of Trickle-based Broadcasting Schemes

As the use of wireless sensor networks increases, the need for efficient and reliable broadcasting algorithms grows. Ideally, a broadcasting algorithm should have the ability to quickly disseminate data, while keeping the number of transmissions low. In this paper, we analyze the popular Trickle algorithm, which has been proposed as a suitable communication protocol for code maintenance and propagation in wireless sensor networks. We show that the broadcasting process of a network using Trickle can be modeled by a Markov chain and that this chain falls under a class of Markov chains, closely related to residual lifetime distributions. It is then shown that this class of Markov chains admits a stationary distribution of a special form. These results are used to analyze the Trickle algorithm and its message count. Our results prove conjectures made in the literature concerning the effect of a listen-only period. Besides providing a mathematical analysis of the algorithm, we propose a generalized version of Trickle, with an additional parameter defining the length of a listen-only period.Comment: arXiv admin note: substantial text overlap with arXiv:1407.603

Data Dissemination Performance in Large-Scale Sensor Networks

As the use of wireless sensor networks increases, the need for (energy-)efficient and reliable broadcasting algorithms grows. Ideally, a broadcasting algorithm should have the ability to quickly disseminate data, while keeping the number of transmissions low. In this paper we develop a model describing the message count in large-scale wireless sensor networks. We focus our attention on the popular Trickle algorithm, which has been proposed as a suitable communication protocol for code maintenance and propagation in wireless sensor networks. Besides providing a mathematical analysis of the algorithm, we propose a generalized version of Trickle, with an additional parameter defining the length of a listen-only period. This generalization proves to be useful for optimizing the design and usage of the algorithm. For single-cell networks we show how the message count increases with the size of the network and how this depends on the Trickle parameters. Furthermore, we derive distributions of inter-broadcasting times and investigate their asymptotic behavior. Our results prove conjectures made in the literature concerning the effect of a listen-only period. Additionally, we develop an approximation for the expected number of transmissions in multi-cell networks. All results are validated by simulations

A mass spectrometer observation of NO in an auroral arc

NO measurement in auroral arc by mass spectrometer onboard Aerobee rocke

Fluorescence Lifetime Imaging Microscopy (FLIM) Data Analysis with TIMP

Fluorescence Lifetime Imaging Microscopy (FLIM) allows fluorescence lifetime images of biological objects to be collected at 250 nm spatial resolution and at (sub-)nanosecond temporal resolution. Often n_comp kinetic processes underlie the observed fluorescence at all locations, but the intensity of the fluorescence associated with each process varies per-location, i.e., per-pixel imaged. Then the statistical challenge is global analysis of the image: use of the fluorescence decay in time at all locations to estimate the n_comp lifetimes associated with the kinetic processes, as well as the amplitude of each kinetic process at each location. Given that typical FLIM images represent on the order of 10^2 timepoints and 10^3 locations, meeting this challenge is computationally intensive. Here the utility of the TIMP package for R to solve parameter estimation problems arising in FLIM image analysis is demonstrated. Case studies on simulated and real data evidence the applicability of the partitioned variable projection algorithm implemented in TIMP to the problem domain, and showcase options included in the package for the visual validation of models for FLIM data.

A stochastic network with mobile users in heavy traffic

We consider a stochastic network with mobile users in a heavy-traffic regime. We derive the scaling limit of the multi-dimensional queue length process and prove a form of spatial state space collapse. The proof exploits a recent result by Lambert and Simatos which provides a general principle to establish scaling limits of regenerative processes based on the convergence of their excursions. We also prove weak convergence of the sequences of stationary joint queue length distributions and stationary sojourn times.Comment: Final version accepted for publication in Queueing Systems, Theory and Application

Trading interactions for topology in scale-free networks

Scale-free networks with topology-dependent interactions are studied. It is shown that the universality classes of critical behavior, which conventionally depend only on topology, can also be explored by tuning the interactions. A mapping, $\gamma' = (\gamma - \mu)/(1-\mu)$, describes how a shift of the standard exponent $\gamma$ of the degree distribution $P(q)$ can absorb the effect of degree-dependent pair interactions $J_{ij} \propto (q_iq_j)^{-\mu}$. Replica technique, cavity method and Monte Carlo simulation support the physical picture suggested by Landau theory for the critical exponents and by the Bethe-Peierls approximation for the critical temperature. The equivalence of topology and interaction holds for equilibrium and non-equilibrium systems, and is illustrated with interdisciplinary applications.Comment: 4 pages, 5 figure

Production and characterization of monoclonal antibodies raised against recombinant human granzymes A and B and showing cross reactions with the natural proteins

The human serine proteases granzymes A and B are expressed in cytotoplasmic granules of activated cytotoxic T lymphocytes and natural killer cells. Recombinant granzyme A and granzyme B proteins were produced in bacteria, purified and then used to raise specific mouse monoclonal antibodies. Seven monoclonal antibodies (mAb) were raised against granzyme A, which all recognized the same or overlapping epitopes. They reacted specifically in an immunoblot of interleukin-2 (IL-2) stimulated PBMNC with a disulfide-linked homodimer of 43 kDa consisting of 28 kDa subunits. Seven mAb against granzyme B were obtained, which could be divided into two groups, each recognizing a different epitope. On an immunoblot, all mAb reacted with a monomer of 33 kDa protein. By immunohistochemistry, these mAb could be used to detect granzymes A and B expression in activated CTL and NK cells. The availability of these mAb may facilitate studies on the role of human cytotoxic cells in various immune reactions and may contribute to a better understanding of the role of granzmes A and B in the cytotoxic response in vivo