Outer Bounds on the Secrecy Rate of the 2-User Symmetric Deterministic Interference Channel with Transmitter Cooperation

This paper derives outer bounds for the 2-user symmetric linear deterministic interference channel (SLDIC) with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. Five outer bounds are derived, under different assumptions of providing side information to receivers and partitioning the encoded message/output depending on the relative strength of the signal and the interference. The usefulness of these outer bounds is shown by comparing the bounds with the inner bound on the achievable secrecy rate derived by the authors in a previous work. Also, the outer bounds help to establish that sharing random bits through the cooperative link can achieve the optimal rate in the very high interference regime.

Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks

In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-wake cycling nodes, we are interested in the local decision problem faced by a node that has ``custody'' of a packet and has to choose one among a set of next-hop relay nodes to forward the packet toward the sink. Each relay is associated with a ``reward'' that summarizes the benefit of forwarding the packet through that relay. We seek a solution to this local problem, the idea being that such a solution, if adopted by every node, could provide a reasonable heuristic for the end-to-end forwarding problem. Toward this end, we propose a local relay selection problem consisting of a forwarding node and a collection of relay nodes, with the relays waking up sequentially at random times. At each relay wake-up instant, the forwarder can choose to probe a relay to learn its reward value, based on which the forwarder can then decide whether to stop (and forward its packet to the chosen relay) or to continue to wait for further relays to wake up. The forwarder's objective is to select a relay so as to minimize a combination of waiting delay, reward, and probing cost. The local decision problem can be considered as a variant of the asset selling problem studied in the operations research literature. We formulate the local problem as a Markov decision process (MDP) and characterize the solution in terms of stopping sets and probing sets. We provide results illustrating the structure of the stopping sets, namely, the (lower bound) threshold and the stage independence properties. Regarding the probing sets, we make an interesting conjecture that these sets are characterized by upper bounds. Through simulation experiments, we provide valuable insights into the performance of the optimal local forwarding and its use as an end-to-end forwarding heuristic.

Wireless scheduling with partial channel state information: large deviations and optimality

We consider a server serving a time-slotted queued system of multiple packet-based flows, where not more than one flow can be serviced in a single time slot. The flows have exogenous packet arrivals and time-varying service rates. At each time, the server can observe instantaneous service rates for only a subset of flows ( selected from a fixed collection of observable subsets) before scheduling a flow in the subset for service. We are interested in queue length aware scheduling to keep the queues short. The limited availability of instantaneous service rate information requires the scheduler to make a careful choice of which subset of service rates to sample. We develop scheduling algorithms that use only partial service rate information from subsets of channels, and that minimize the likelihood of queue overflow in the system. Specifically, we present a new joint subset-sampling and scheduling algorithm called Max-Exp that uses only the current queue lengths to pick a subset of flows, and subsequently schedules a flow using the Exponential rule. When the collection of observable subsets is disjoint, we show that Max-Exp achieves the best exponential decay rate, among all scheduling algorithms that base their decision on the current ( or any finite past history of) system state, of the tail of the longest queue. To accomplish this, we employ novel analytical techniques for studying the performance of scheduling algorithms using partial state, which may be of independent interest. These include new sample-path large deviations results for processes obtained by non-random, predictable sampling of sequences of independent and identically distributed random variables. A consequence of these results is that scheduling with partial state information yields a rate function significantly different from scheduling with full channel information. In the special case when the observable subsets are singleton flows, i.e., when there is effectively no a priori channel state information, Max-Exp reduces to simply serving the flow with the longest queue; thus, our results show that to always serve the longest queue in the absence of any channel state information is large deviations optimal.

Inner Bound on the GDOF of the K-User MIMO Gaussian Symmetric Interference Channel

The K-user multiple input multiple output (MIMO) Gaussian symmetric interference channel where each transmitter has M antennas and each receiver has N antennas is studied from a generalized degrees of freedom (GDOF) perspective. An inner bound on the GDOF is derived using a combination of techniques such as treating interference as noise, zero forcing (ZF) at the receivers, interference alignment (IA), and extending the Han-Kobayashi (HK) scheme to K users, as a function of the number of antennas and the log INR/log SNR level. Several interesting conclusions are drawn from the derived bounds. It is shown that when K > N/M + 1, a combination of the HK and IA schemes performs the best among the schemes considered. When N/M < K <= N/M + 1, the HK-scheme outperforms other schemes and is found to be GDOF optimal in many cases. In addition, when the SNR and INR are at the same level, ZF-receiving and the HK-scheme have the same GDOF performance.

Outer Bounds on the Sum Rate of the K-User MIMO Gaussian Interference Channel

This paper derives outer bounds on the sum rate of the K-user MIMO Gaussian interference channel (GIC). Three outer bounds are derived, under different assumptions of cooperation and providing side information to receivers. The novelty in the derivation lies in the careful selection of side information, which results in the cancellation of the negative differential entropy terms containing signal components, leading to a tractable outer bound. The overall outer bound is obtained by taking the minimum of the three outer bounds. The derived bounds are simplified for the MIMO Gaussian symmetric IC to obtain outer bounds on the generalized degrees of freedom (GDOF). The relative performance of the bounds yields insight into the performance limits of multiuser MIMO GICs and the relative merits of different schemes for interference management. These insights are confirmed by establishing the optimality of the bounds in specific cases using an inner bound on the GDOF derived by the authors in a previous work. It is also shown that many of the existing results on the GDOF of the GIC can be obtained as special cases of the bounds, e. g., by setting K = 2 or the number of antennas at each user to 1.

Joint Channel Estimation and Data Detection in MIMO-OFDM Systems: A Sparse Bayesian Learning Approach

The impulse response of wireless channels between the N-t transmit and N-r receive antennas of a MIMO-OFDM system are group approximately sparse (ga-sparse), i.e., NtNt the channels have a small number of significant paths relative to the channel delay spread and the time-lags of the significant paths between transmit and receive antenna pairs coincide. Often, wireless channels are also group approximately cluster-sparse (gac-sparse), i.e., every ga-sparse channel consists of clusters, where a few clusters have all strong components while most clusters have all weak components. In this paper, we cast the problem of estimating the ga-sparse and gac-sparse block-fading and time-varying channels in the sparse Bayesian learning (SBL) framework and propose a bouquet of novel algorithms for pilot-based channel estimation, and joint channel estimation and data detection, in MIMO-OFDM systems. The proposed algorithms are capable of estimating the sparse wireless channels even when the measurement matrix is only partially known. Further, we employ a first-order autoregressive modeling of the temporal variation of the ga-sparse and gac-sparse channels and propose a recursive Kalman filtering and smoothing (KFS) technique for joint channel estimation, tracking, and data detection. We also propose novel, parallel-implementation based, low-complexity techniques for estimating gac-sparse channels. Monte Carlo simulations illustrate the benefit of exploiting the gac-sparse structure in the wireless channel in terms of the mean square error (MSE) and coded bit error rate (BER) performance.

Effect of Channel Confinement on Mixed Convective Flow Past an Equilateral Triangular Cylinder

The present work investigates the mixed convective flow and heat transfer characteristics past a triangular cylinder placed symmetrically in a vertical channel. At a representative Reynolds number, Re = 100, simulations are carried out for the blockage ratios beta = 1/3; 1/4; and 1/6. Effect of aiding and opposing buoyancy is brought about by varying the Richardson number in the range -1.0 <= Ri <= 1.0. At a blockage ratio of 1/3, suppression of vortex shedding is found at Ri = 1, whereas von Karman vortex street is seen both at beta = 1/4 and 1/6, respectively. This is the first time that such behavior of blockage ratio past a triangular cylinder in the present flow configuration is reported. Drag coefficient increases progressively with increasing Ri and a slightly higher value is noticed at beta = 1/3. For all b, heat transfer increases with increasing Ri. Flattening of Nu(avg)-Ri curve beyond Ri > 0: 75 is observed at beta = 1/3.

Power Allocation in MIMO Wiretap Channel with Statistical CSI and Finite-Alphabet Input

In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical knowledge of the eavesdroppers CSI are assumed. We first consider the MIMO wiretap channel with Gaussian input. Using Jensen's inequality, we transform the secrecy rate max-min optimization problem to a single maximization problem. We use generalized singular value decomposition and transform the problem to a concave maximization problem which maximizes the sum secrecy rate of scalar wiretap channels subject to linear constraints on the transmit covariance matrix. We then consider the MIMO wiretap channel with finite-alphabet input. We show that the transmit covariance matrix obtained for the case of Gaussian input, when used in the MIMO wiretap channel with finite-alphabet input, can lead to zero secrecy rate at high transmit powers. We then propose a power allocation scheme with an additional power constraint which alleviates this secrecy rate loss problem, and gives non-zero secrecy rates at high transmit powers.

Ischaemic concentrations of lactate increase TREK1 channel activity by interacting with a single histidine residue in the carboxy terminal domain

Key points The physiological metabolite, lactate and the two-pore domain leak potassium channel, TREK1 are known neuroprotectants against cerebral ischaemia. However, it is not known whether lactate interacts with TREK1 channel to provide neuroprotection. In this study we show that lactate increases TREK1 channel activity and hyperpolarizes CA1 stratum radiatum astrocytes in hippocampal slices. Lactate increases open probability and decreases longer close time of the human (h)TREK1 channel in a concentration dependent manner. Lactate interacts with histidine 328 (H328) in the carboxy terminal domain of hTREK1 channel to decrease its dwell time in the longer closed state. This interaction was dependent on the charge on H328. Lactate-insensitive mutant H328A hTREK1 showed pH sensitivity similar to wild-type hTREK1, indicating that the effect of lactate on hTREK1 is independent of pH change. AbstractA rise in lactate concentration and the leak potassium channel TREK1 have been independently associated with cerebral ischaemia. Recent literature suggests lactate to be neuroprotective and TREK1 knockout mice show an increased sensitivity to brain and spinal cord ischaemia; however, the connecting link between the two is missing. Therefore we hypothesized that lactate might interact with TREK1 channels. In the present study, we show that lactate at ischaemic concentrations (15-30mm) at pH7.4 increases TREK1 current in CA1 stratum radiatum astrocytes and causes membrane hyperpolarization. We confirm the intracellular action of lactate on TREK1 in hippocampal slices using monocarboxylate transporter blockers and at single channel level in cell-free inside-out membrane patches. The intracellular effect of lactate on TREK1 is specific since other monocarboxylates such as pyruvate and acetate at pH7.4 failed to increase TREK1 current. Deletion and point mutation experiments suggest that lactate decreases the longer close dwell time incrementally with increase in lactate concentration by interacting with the histidine residue at position 328 (H328) in the carboxy terminal domain of the TREK1 channel. The interaction of lactate with H328 is dependent on the charge on the histidine residue since isosteric mutation of H328 to glutamine did not show an increase in TREK1 channel activity with lactate. This is the first demonstration of a direct effect of lactate on ion channel activity. The action of lactate on the TREK1 channel signifies a separate neuroprotective mechanism in ischaemia since it was found to be independent of the effect of acidic pH on channel activity. Key points The physiological metabolite, lactate and the two-pore domain leak potassium channel, TREK1 are known neuroprotectants against cerebral ischaemia. However, it is not known whether lactate interacts with TREK1 channel to provide neuroprotection. In this study we show that lactate increases TREK1 channel activity and hyperpolarizes CA1 stratum radiatum astrocytes in hippocampal slices. Lactate increases open probability and decreases longer close time of the human (h)TREK1 channel in a concentration dependent manner. Lactate interacts with histidine 328 (H328) in the carboxy terminal domain of hTREK1 channel to decrease its dwell time in the longer closed state. This interaction was dependent on the charge on H328. Lactate-insensitive mutant H328A hTREK1 showed pH sensitivity similar to wild-type hTREK1, indicating that the effect of lactate on hTREK1 is independent of pH change.

The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint

The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1, infinity)-RLL constraint. We derive the capacity for this setting, which can be expressed as C-is an element of = max(0 <= p <= 0.5) (1-is an element of) H-b (p)/1+(1-is an element of) p, where is an element of is the erasure probability and Hb(.) is the binary entropy function. Moreover, we prove that a priori knowledge of the erasure at the encoder does not increase the feedback capacity. The feedback capacity was calculated using an equivalent dynamic programming (DP) formulation with an optimal average-reward that is equal to the capacity. Furthermore, we obtained an optimal encoding procedure from the solution of the DP, leading to a capacity-achieving, zero-error coding scheme for our setting. DP is, thus, shown to be a tool not only for solving optimization problems, such as capacity calculation, but also for constructing optimal coding schemes. The derived capacity expression also serves as the only non-trivial upper bound known on the capacity of the input-constrained erasure channel without feedback, a problem that is still open.

On the Gaussian Many-to-One X Channel

In this paper, the Gaussian many-to-one X channel (XC), which is a special case of general multiuser XC, is studied. In the Gaussian many-to-one XC, communication links exist between all transmitters and one of the receivers, along with a communication link between each transmitter and its corresponding receiver. As per the XC assumption, transmission of messages is allowed on all the links of the channel. This communication model is different from the corresponding manyto- one interference channel (IC). Transmission strategies, which involve using Gaussian codebooks and treating interference from a subset of transmitters as noise, are formulated for the above channel. Sum-rate is used as the criterion of optimality for evaluating the strategies. Initially, a 3 x 3 many-to-one XC is considered and three transmission strategies are analyzed. The first two strategies are shown to achieve sum-rate capacity under certain channel conditions. For the third strategy, a sum-rate outer bound is derived and the gap between the outer bound and the achieved rate is characterized. These results are later extended to the K x K case. Next, a region in which the many-to-one XC can be operated as a many-to-one IC without the loss of sum-rate is identified. Furthermore, in the above region, it is shown that using Gaussian codebooks and treating interference as noise achieve a rate point that is within K/2 -1 bits from the sum-rate capacity. Subsequently, some implications of the above results to the Gaussian many-to-one IC are discussed. Transmission strategies for the many-to-one IC are formulated, and channel conditions under which the strategies achieve sum-rate capacity are obtained. A region where the sum-rate capacity can be characterized to within K/2 -1 bits is also identified. Finally, the regions where the derived channel conditions are satisfied for each strategy are illustrated for a 3 x 3 many-to-one XC and the corresponding many-to-one IC.

High-throughput miniaturized microfluidic microscopy with radially parallelized channel geometry

In this article, we present a novel approach to throughput enhancement in miniaturized microfluidic microscopy systems. Using the presented approach, we demonstrate an inexpensive yet high-throughput analytical instrument. Using the high-throughput analytical instrument, we have been able to achieve about 125,880 cells per minute (more than one hundred and twenty five thousand cells per minute), even while employing cost-effective low frame rate cameras (120 fps). The throughput achieved here is a notable progression in the field of diagnostics as it enables rapid quantitative testing and analysis. We demonstrate the applicability of the instrument to point-of-care diagnostics, by performing blood cell counting. We report a comparative analysis between the counts (in cells per mu l) obtained from our instrument, with that of a commercially available hematology analyzer.