An Eigen Approach to Transmit Beamforming in Wireless Networks With Single Antenna Receivers

In this paper, we propose an eigen framework for transmit beamforming for single-hop and dual-hop network models with single antenna receivers. In cases where number of receivers is not more than three, the proposed Eigen approach is vastly superior in terms of ease of implementation and computational complexity compared with the existing convex-relaxation-based approaches. The essential premise is that the precoding problems can be posed as equivalent optimization problems of searching for an optimal vector in the joint numerical range of Hermitian matrices. We show that the latter problem has two convex approximations: the first one is a semi-definite program that yields a lower bound on the solution, and the second one is a linear matrix inequality that yields an upper bound on the solution. We study the performance of the proposed and existing techniques using numerical simulations.

High-conductance states and A-type K+ channels are potential regulators of the conductance-current balance triggered by HCN channels

An increase in the hyperpolarization-activated cyclic nucleotide-gated (HCN) channel conductance reduces input resistance, whereas the consequent increase in the inward h current depolarizes the membrane. This results in a delicate and unique conductance-current balance triggered by the expression of HCN channels. In this study, we employ experimentally constrained, morphologically realistic, conductance-based models of hippocampal neurons to explore certain aspects of this conductance-current balance. First, we found that the inclusion of an experimentally determined gradient in A-type K+ conductance, but not in M-type K+ conductance, tilts the HCN conductance-current balance heavily in favor of conductance, thereby exerting an overall restorative influence on neural excitability. Next, motivated by the well-established modulation of neuronal excitability by synaptically driven high-conductance states observed under in vivo conditions, we inserted thousands of excitatory and inhibitory synapses with different somatodendritic distributions. We measured the efficacy of HCN channels, independently and in conjunction with other channels, in altering resting membrane potential (RMP) and input resistance (R-in) when the neuron received randomized or rhythmic synaptic bombardments through variable numbers of synaptic inputs. We found that the impact of HCN channels on average RMP, R in, firing frequency, and peak-to-peak voltage response was severely weakened under high-conductance states, with the impinging synaptic drive playing a dominant role in regulating these measurements. Our results suggest that the debate on the role of HCN channels in altering excitability should encompass physiological and pathophysiological neuronal states under in vivo conditions and the spatiotemporal interactions of HCN channels with other channels.

Energy-efficient, delay-constrained, QoS-aware broadcast for cooperative wireless sensor networks

The problem of delay-constrained, energy-efficient broadcast in cooperative wireless networks is NP-complete. While centralised setting allows some heuristic solutions, designing heuristics in distributed implementation poses significant challenges. This is more so in wireless sensor networks (WSNs) where nodes are deployed randomly and topology changes dynamically due to node failure/join and environment conditions. This paper demonstrates that careful design of network infrastructure can achieve guaranteed delay bounds and energy-efficiency, and even meet quality of service requirements during broadcast. The paper makes three prime contributions. First, we present an optimal lower bound on energy consumption for broadcast that is tighter than what has been previously proposed. Next, iSteiner, a lightweight, distributed and deterministic algorithm for creation of network infrastructure is discussed. iPercolate is the algorithm that exploits this structure to cooperatively broadcast information with guaranteed delivery and delay bounds, while allowing real-time traffic to pass undisturbed.

Driving force of water entry into hydrophobic channels of carbon nanotubes: entropy or energy?

Spontaneous entry of water molecules inside single-wall carbon nanotubes (SWCNTs) has been confirmed by both simulations and experiments. Using molecular dynamics simulations, we have studied the thermodynamics of filling of a (6,6) carbon nanotube in a temperature range from 273 to 353K and with different strengths of the nanotube-water interaction. From explicit energy and entropy calculations using the two-phase thermodynamics method, we have presented a thermodynamic understanding of the filling behaviour of a nanotube. We show that both the energy and the entropy of transfer decrease with increasing temperature. On the other hand, scaling down the attractive part of the carbon-oxygen interaction results in increased energy of transfer while the entropy of transfer increases slowly with decreasing the interaction strength. Our results indicate that both energy and entropy favour water entry into (6,6) SWCNTs. Our results are compared with those of several recent studies of water entry into carbon nanotubes.

Space-Time Coded Spatial Modulated Physical Layer Network Coding for Two-Way Relaying

Using the spatial modulation approach, where only one transmit antenna is active at a time, we propose two transmission schemes for two-way relay channel using physical layer network coding with space time coding using coordinate interleaved orthogonal designs (CIODs). It is shown that using two uncorrelated transmit antennas at the nodes, but using only one RF transmit chain and space-time coding across these antennas can give a better performance without using any extra resources and without increasing the hardware implementation cost and complexity. In the first transmission scheme, two antennas are used only at the relay, adaptive network coding (ANC) is employed at the relay and the relay transmits a CIOD space time block code (STBC). This gives a better performance compared to an existing ANC scheme for two-way relay channel which uses one antenna each at all the three nodes. It is shown that for this scheme at high SNR the average end-to-end symbol error probability (SEP) is upper bounded by twice the SEP of a point-to-point fading channel. In the second transmission scheme, two transmit antennas are used at all the three nodes, CIOD STBCs are transmitted in multiple access and broadcast phases. This scheme provides a diversity order of two for the average end-to-end SEP with an increased decoding complexity of O(M-3) for an arbitrary signal set and O(M-2 root M) for square QAM signal set. Simulation results show that the proposed schemes performs better than the existing ANC schemes under perfect and imperfect channel state information.

Performance of OFDM Systems With Best-m Feedback, Scheduling, and Delays for Uniformly Correlated Subchannels

Contemporary cellular standards, such as Long Term Evolution (LTE) and LTE-Advanced, employ orthogonal frequency-division multiplexing (OFDM) and use frequency-domain scheduling and rate adaptation. In conjunction with feedback reduction schemes, high downlink spectral efficiencies are achieved while limiting the uplink feedback overhead. One such important scheme that has been adopted by these standards is best-m feedback, in which every user feeds back its m largest subchannel (SC) power gains and their corresponding indices. We analyze the single cell average throughput of an OFDM system with uniformly correlated SC gains that employs best-m feedback and discrete rate adaptation. Our model incorporates three schedulers that cover a wide range of the throughput versus fairness tradeoff and feedback delay. We show that, for small m, correlation significantly reduces average throughput with best-m feedback. This result is pertinent as even in typical dispersive channels, correlation is high. We observe that the schedulers exhibit varied sensitivities to correlation and feedback delay. The analysis also leads to insightful expressions for the average throughput in the asymptotic regime of a large number of users.

HCN channels enhance spike phase coherence and regulate the phase of spikes and LFPs in the theta-frequency range

What are the implications for the existence of subthreshold ion channels, their localization profiles, and plasticity on local field potentials (LFPs)? Here, we assessed the role of hyperpolarization-activated cyclic-nucleotide-gated (HCN) channels in altering hippocampal theta-frequency LFPs and the associated spike phase. We presented spatiotemporally randomized, balanced theta-modulated excitatory and inhibitory inputs to somatically aligned, morphologically realistic pyramidal neuron models spread across a cylindrical neuropil. We computed LFPs from seven electrode sites and found that the insertion of an experimentally constrained HCN-conductance gradient into these neurons introduced a location- dependent lead in the LFP phase without significantly altering its amplitude. Further, neurons fired action potentials at a specific theta phase of the LFP, and the insertion of HCN channels introduced large lags in this spike phase and a striking enhancement in neuronal spike-phase coherence. Importantly, graded changes in either HCN conductance or its half-maximal activation voltage resulted in graded changes in LFP and spike phases. Our conclusions on the impact of HCN channels on LFPs and spike phase were invariant to changes in neuropil size, to morphological heterogeneity, to excitatory or inhibitory synaptic scaling, and to shifts in the onset phase of inhibitory inputs. Finally, we selectively abolished the inductive lead in the impedance phase introduced by HCN channels without altering neuronal excitability and found that this inductive phase lead contributed significantly to changes in LFP and spike phase. Our results uncover specific roles for HCN channels and their plasticity in phase-coding schemas and in the formation and dynamic reconfiguration of neuronal cell assemblies.

Optimal power allocation for protective jamming in wireless networks: A flow based model

We address the problem of passive eavesdroppers in multi-hop wireless networks using the technique of friendly jamming. The network is assumed to employ Decode and Forward (DF) relaying. Assuming the availability of perfect channel state information (CSI) of legitimate nodes and eavesdroppers, we consider a scheduling and power allocation (PA) problem for a multiple-source multiple-sink scenario so that eavesdroppers are jammed, and source-destination throughput targets are met while minimizing the overall transmitted power. We propose activation sets (AS-es) for scheduling, and formulate an optimization problem for PA. Several methods for finding AS-es are discussed and compared. We present an approximate linear program for the original nonlinear, non-convex PA optimization problem, and argue that under certain conditions, both the formulations produce identical results. In the absence of eavesdroppers' CSI, we utilize the notion of Vulnerability Region (VR), and formulate an optimization problem with the objective of minimizing the VR. Our results show that the proposed solution can achieve power-efficient operation while defeating eavesdroppers and achieving desired source-destination throughputs simultaneously. (C) 2015 Elsevier B.V. All rights reserved.

Wireless Aircraft Fuel Quantity Indication System

A wireless fuel quantity indication system (FQIS) has been developed using an RFID-enabled sensing platform. The system comprises a fully passive tag, modified reader protocol, capacitive fuel probe, and auxiliary antenna for additional energy harvesting. Results of fluid testing show sensitivity to changes in fluid height of less than 0.25in. An RF-DC harvesting circuit was developed, which delivers up to 5dBm of input power through a remote radio frequency (RF) source. Testing was conducted in a loaded reverberation chamber to emulate the fuel tank environment. Results demonstrate feasibility of the remote source to power the sensor with less than 1W of maximum transmit power and under 100ms dwell time (100mW average power) into the tank. This indicates adequate coverage for large transport aircraft at safe operating levels with a sample rate of up to 1 sample/s.

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.

Non-deterministic transducer models of retransmission protocols over noisy channels

Retransmission protocols such as HDLC and TCP are designed to ensure reliable communication over noisy channels (i.e., channels that can corrupt messages). Thakkar et al. 15] have recently presented an algorithmic verification technique for deterministic streaming string transducer (DSST) models of such protocols. The verification problem is posed as equivalence checking between the specification and protocol DSSTs. In this paper, we argue that more general models need to be obtained using non-deterministic streaming string transducers (NSSTs). However, equivalence checking is undecidable for NSSTs. We present two classes where the models belong to a sub-class of NSSTs for which it is decidable. (C) 2015 Elsevier B.V. All rights reserved.

Imaging Flow Cytometry With Femtosecond Laser-Micromachined Glass Microfluidic Channels

Microfluidic/optofluidic microscopy is a versatile modality for imaging and analyzing properties of cells/particles while they are in flow. In this paper, we demonstrate the integration of fused silica microfluidics fabricated using femtosecond laser machining into optofluidic imaging systems. By using glass for the sample stage of our microscope, we have exploited its superior optical quality for imaging and bio-compatibility. By integrating these glass microfluidic devices into a custom-built bright field microscope, we have been able to image red blood cells in flow with high-throughputs and good fidelity. In addition, we also demonstrate imaging as well as detection of fluorescent beads with these microfluidic devices.

Algorithm for Autonomous Reorganization of Mobile Wireless Camera Sensor Networks to Improve Coverage

In this paper, sensing coverage by wireless camera-embedded sensor networks (WCSNs), a class of directional sensors is studied. The proposed work facilitates the autonomous tuning of orientation parameters and displacement of camera-sensor nodes in the bounded field of interest (FoI), where the network coverage in terms of every point in the FoI is important. The proposed work is first of its kind to study the problem of maximizing coverage of randomly deployed mobile WCSNs which exploits their mobility. We propose an algorithm uncovered region exploration algorithm (UREA-CS) that can be executed in centralized and distributed modes. Further, the work is extended for two special scenarios: 1) to suit autonomous combing operations after initial random WCSN deployments and 2) to improve the network coverage with occlusions in the FoI. The extensive simulation results show that the performance of UREA-CS is consistent, robust, and versatile to achieve maximum coverage, both in centralized and distributed modes. The centralized and distributed modes are further analyzed with respect to the computational and communicational overheads.

Minimum-Error-Probability CFO Estimation for Multiuser MIMO-OFDM Systems

We consider carrier frequency offset (CFO) estimation in the context of multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems over noisy frequency-selective wireless channels with both single- and multiuser scenarios. We conceived a new approach for parameter estimation by discretizing the continuous-valued CFO parameter into a discrete set of bins and then invoked detection theory, analogous to the minimum-bit-error-ratio optimization framework for detecting the finite-alphabet received signal. Using this radical approach, we propose a novel CFO estimation method and study its performance using both analytical results and Monte Carlo simulations. We obtain expressions for the variance of the CFO estimation error and the resultant BER degradation with the single- user scenario. Our simulations demonstrate that the overall BER performance of a MIMO-OFDM system using the proposed method is substantially improved for all the modulation schemes considered, albeit this is achieved at increased complexity.

Experimental studies on the flow through soft tubes and channels

Experiments conducted in channels/tubes with height/diameter less than 1 mm with soft walls made of polymer gels show that the transition Reynolds number could be significantly lower than the corresponding value of 1200 for a rigid channel or 2100 for a rigid tube. Experiments conducted with very viscous fluids show that there could be an instability even at zero Reynolds number provided the surface is sufficiently soft. Linear stability studies show that the transition Reynolds number is linearly proportional to the wall shear modulus in the low Reynolds number limit, and it increases as the 1/2 and 3/4 power of the shear modulus for the `inviscid' and `wall mode' instabilities at high Reynolds number. While the inviscid instability is similar to that in the flow in a rigid channel, the mechanisms of the viscous and wall mode instabilities are qualitatively different. These involve the transfer of energy from the mean flow to the fluctuations due to the shear work done at the interface. The experimental results for the viscous instability mechanism are in quantitative agreement with theoretical predictions. At high Reynolds number, the instability mechanism has characteristics similar to the wall mode instability. The experimental transition Reynolds number is smaller, by a factor of about 10, than the theoretical prediction for the parabolic flow through rigid tubes and channels. However, if the modification in the tube shape due to the pressure gradient, and the consequent modification in the velocity profile and pressure gradient, are incorporated, there is quantitative agreement between theoretical predictions and experimental results. The transition has important practical consequences, since there is a significant enhancement of mixing after transition.