QoS Aware Trust Metric based Framework for Wireless Sensor Networks

Wireless Sensor Networks have gained popularity due to their real time applications and low-cost nature. These networks provide solutions to scenarios that are critical, complicated and sensitive like military fields, habitat monitoring, and disaster management. The nodes in wireless sensor networks are highly resource constrained. Routing protocols are designed to make efficient utilization of the available resources in communicating a message from source to destination. In addition to the resource management, the trustworthiness of neighboring nodes or forwarding nodes and the energy level of the nodes to keep the network alive for longer duration is to be considered. This paper proposes a QoS Aware Trust Metric based Framework for Wireless Sensor Networks. The proposed framework safeguards a wireless sensor network from intruders by considering the trustworthiness of the forwarder node at every stage of multi-hop routing. Increases network lifetime by considering the energy level of the node, prevents the adversary from tracing the route from source to destination by providing path variation. The framework is built on NS2 Simulator. Experimental results show that the framework provides energy balance through establishment of trustworthy paths from the source to the destination. (C) 2015 The Authors. Published by Elsevier B.V.

An approximation to the QoS aware throughput region of a tree network under IEEE 802.15.4 CSMA/CA with application to wireless sensor network design

In the context of wireless sensor networks, we are motivated by the design of a tree network spanning a set of source nodes that generate packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count, that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive explicit conditions on the packet generation rates at the sources, so that the tree network approximately provides certain quality of service (QoS) such as end-to-end delivery probability and mean delay. The structures of our conditions provide insight on the dependence of the network performance on the arrival rate vector, and the topological properties of the tree network. Our numerical experiments suggest that our approximations are able to capture a significant part of the QoS aware throughput region (of a tree network), that is adequate for many sensor network applications. Furthermore, for the special case of equal arrival rates, default backoff parameters, and for a range of values of target QoS, we show that among all path-length-bounded trees (spanning a given set of sources and the data sink) that meet the conditions derived in the paper, a shortest path tree achieves the maximum throughput. (C) 2015 Elsevier B.V. All rights reserved.

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

Two-Phase Flow With Phase Change in Porous Channels

Phase change heat transfer in porous media finds applications in various geological flows and modern heat pipes. We present a study to show the effect of phase change on heat transfer in a porous channel. We show that the ratio of Jakob numbers based on wall superheat and inlet fluid subcooling governs the liquid-vapor interface location in the porous channel and below a critical value of the ratio, the liquid penetrates all the way to the extent of the channel in the flow direction. In such cases, the Nusselt number is higher due to the proximity of the liquid-vapor interface to the heat loads. For higher heat loads or lower subcooling of the liquid, the liquid-vapor interface is pushed toward the inlet, and heat transfer occurs through a wider vapor region thus resulting in a lower Nusselt number. This study is relevant in the designing of efficient two-phase heat exchangers such as capillary suction based heat pipes where a prior estimation of the interface location for the maximum heat load is required to ensure that the liquid-vapor interface is always inside the porous block for its operation.

QoS Constrained Optimal Sink and Relay Placement in Planned Wireless Sensor Networks

We are given a set of sensors at given locations, a set of potential locations for placing base stations (BSs, or sinks), and another set of potential locations for placing wireless relay nodes. There is a cost for placing a BS and a cost for placing a relay. The problem we consider is to select a set of BS locations, a set of relay locations, and an association of sensor nodes with the selected BS locations, so that the number of hops in the path from each sensor to its BS is bounded by h(max), and among all such feasible networks, the cost of the selected network is the minimum. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard, and is hard to even approximate within a constant factor. For this problem, we propose a polynomial time approximation algorithm (SmartSelect) based on a relay placement algorithm proposed in our earlier work, along with a modification of the greedy algorithm for weighted set cover. We have analyzed the worst case approximation guarantee for this algorithm. We have also proposed a polynomial time heuristic to improve upon the solution provided by SmartSelect. Our numerical results demonstrate that the algorithms provide good quality solutions using very little computation time in various randomly generated network scenarios.

As-You-Go Deployment of a 2-Connected Wireless Relay Network for Sensor-Sink Interconnection

A person walks along a line (which could be an idealisation of a forest trail, for example), placing relays as he walks, in order to create a multihop network for connecting a sensor at a point along the line to a sink at the start of the line. The potential placement points are equally spaced along the line, and at each such location the decision to place or not to place a relay is based on link quality measurements to the previously placed relays. The location of the sensor is unknown apriori, and is discovered as the deployment agent walks. In this paper, we extend our earlier work on this class of problems to include the objective of achieving a 2-connected multihop network. We propose a network cost objective that is additive over the deployed relays, and accounts for possible alternate routing over the multiple available paths. As in our earlier work, the problem is formulated as a Markov decision process. Placement algorithms are obtained for two source location models, which yield a discounted cost MDP and an average cost MDP. In each case we obtain structural results for an optimal policy, and perform a numerical study that provides insights into the advantages and disadvantages of multi-connectivity. We validate the results obtained from numerical study experimentally in a forest-like environment.

Near-Optimal Detection Thresholds for Bayesian Spectrum Sensing Under Fading

This paper considers the problem of energy-based, Bayesian spectrum sensing in cognitive radios under various fading environments. Under the well-known central limit theorem based model for energy detection, we derive analytically tractable expressions for near-optimal detection thresholds that minimize the probability of error under lognormal, Nakagami-m, and Weibull fading. For the Suzuki fading case, a generalized gamma approximation is provided, which saves on the computation of an integral. In each case, the accuracy of the theoretical expressions as compared to the optimal thresholds are illustrated through simulations.

Two-Dimensional Noise-Predictive Maximum Likelihood Method for Magnetic Recording Channels

Noise-predictive maximum likelihood (NPML) is a well known signal detection technique used in partial response maximum likelihood (PRML) scheme in 1D magnetic recording channels. The noise samples colored by the partial response (PR) equalizer are predicted/ whitened during the signal detection using a Viterbi detector. In this paper, we propose an extension of the NPML technique for signal detection in 2D ISI channels. The impact of noise prediction during signal detection is studied in PRML scheme for a particular choice of 2D ISI channel and PR targets.

Error exponent analysis of energy-based Bayesian decentralized spectrum sensing under fading

This paper considers decentralized spectrum sensing, i.e., detection of occupancy of the primary users' spectrum by a set of Cognitive Radio (CR) nodes, under a Bayesian set-up. The nodes use energy detection to make their individual decisions, which are combined at a Fusion Center (FC) using the K-out-of-N fusion rule. The channel from the primary transmitter to the CR nodes is assumed to undergo fading, while that from the nodes to the FC is assumed to be error-free. In this scenario, a novel concept termed as the Error Exponent with a Confidence Level (EECL) is introduced to evaluate and compare the performance of different detection schemes. Expressions for the EECL under general fading conditions are derived. As a special case, it is shown that the conventional error exponent both at individual sensors, and at the FC is zero. Further, closed-form lower bounds on the EECL are derived under Rayleigh fading and lognormal shadowing. As an example application, it answers the question of whether to use pilot-signal based narrowband sensing, where the signal undergoes Rayleigh fading, or to sense over the entire bandwidth of a wideband signal, where the signal undergoes lognormal shadowing. Theoretical results are validated using Monte Carlo simulations. (C) 2015 Elsevier B.V. All rights reserved.

Designing Novel Sulphate-based Ceramic Materials as Insertion Host Compounds for Secondary Batteries

Rechargeable batteries have propelled the wireless revolution and automobiles market over the past 25 years. Developing better batteries with improved energy density demands unveiling of new cathode ceramic materials with suitable diffusion channels and open framework structure. In this pursuit of achieving higher energy density, one approach is to realize enhanced redox voltage of insertion of ceramic compounds. This can be accomplished by incorporating highly electronegative anions in the cathode ceramics. Building on this idea, recently various sulphate- based compounds have been reported as high voltage cathode materials. The current article highlights the use of sulphate (SO4) based cathodes to realize the highest ever Fe3+/Fe2+ redox potentials in Li-ion batteries (LiFeSO4F fluorosulphate: 3.9V vs Li/Li+) and Na-ion batteries (Na2Fe2(SO4)(3) polysulphate: 3.8V vs Na/Na+). These sulphate-based cathode ceramic compounds pave way for newer avenues to design better batteries for future applications.

Wireless Network-Coded Accumulate-Compute-and-Forward Two-Way Relaying

For the physical-layer network-coded wireless two-way relaying, it was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay according to channel conditions greatly reduces the impact of multiple-access interference, which occurs at the relay, and all these network coding maps should satisfy a requirement called exclusive law. We extend this approach to an accumulate-compute-and-forward protocol, which employs two phases: a multiple access (MA) phase consisting of two channel uses with independent messages in each channel use and a broadcast (BC) phase having one channel use. Assuming that the two users transmit points from the same 4-phase-shift keying (PSK) constellation, every such network coding map that satisfies the exclusive law can be represented by a Latin square of side 16, and conversely, this relationship can be used to get the network coding maps satisfying the exclusive law. Two methods of obtaining this network coding map to be used at the relay are discussed. Using the structural properties of the Latin squares for a given set of parameters, the problem of finding all the required maps is reduced to finding a small set of maps for the case. Having obtained all the Latin squares, a criterion is provided to select a Latin square for a given realization of fade state. This criterion turns out to be the same as the one used byMuralidharan et al. for two-stage bidirectional relaying.

Fabrication of Microfluidic-Nanofluidic Channels with Integrated Electrodes

We report on the fabrication of microfluidc-nanofluidic channels on Si incorporated with embedded metallic interconnects. The device aids the study of motion of dispersed particles relative to the fluid under the influence of spatially uniform electric field. Optical lithography in combination with focused ion beam technique was used to fabricate the microfluidic-nanofluidic channels, respectively. Focused ion beam technique was also used for embedding the electrodes in the nanochannel. Gold contact pads were deposited using sputtering. The substrate was finally anodically bonded to a glass substrate.

RPRDC: Reliable Proliferation Routing with low Duty-Cycle in Wireless Sensor Networks

Ensuring reliable energy efficient data communication in resource constrained Wireless Sensor Networks (WSNs) is of primary concern. Traditionally, two types of re-transmission have been proposed for the data-loss, namely, End-to-End loss recovery (E2E) and per hop. In these mechanisms, lost packets are re-transmitted from a source node or an intermediate node with a low success rate. The proliferation routing(1) for QoS provisioning in WSNs low End-to-End reliability, not energy efficient and works only for transmissions from sensors to sink. This paper proposes a Reliable Proliferation Routing with low Duty Cycle RPRDC] in WSNs that integrates three core concepts namely, (i) reliable path finder, (ii) a randomized dispersity, and (iii) forwarding. Simulation results demonstrates that packet successful delivery rate can be maintained upto 93% in RPRDC and outperform Proliferation Routing(1). (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

Transient potassium channels augment degeneracy in hippocampal active dendritic spectral tuning

Hippocampal pyramidal neurons express an intraneuronal map of spectral tuning mediated by hyperpolarization-activated cyclic-nucleotide-gated nonspecific-cation channels. Modeling studies have predicted a critical regulatory role for A-type potassium (KA) channels towards augmenting functional robustness of this map. To test this, we performed patch-clamp recordings from soma and dendrites of rat hippocampal pyramidal neurons, and measured spectral tuning before and after blocking KA channels using two structurally distinct pharmacological agents. Consistent with computational predictions, we found that blocking KA channels resulted in a significant reduction in resonance frequency and significant increases in input resistance, impedance amplitude and action-potential firing frequency across the somato-apical trunk. Furthermore, across all measured locations, blocking KA channels enhanced temporal summation of postsynaptic potentials and critically altered the impedance phase profile, resulting in a significant reduction in total inductive phase. Finally, pair-wise correlations between intraneuronal percentage changes (after blocking KA channels) in different measurements were mostly weak, suggesting differential regulation of different physiological properties by KA channels. Our results unveil a pivotal role for fast transient channels in regulating theta-frequency spectral tuning and intrinsic phase response, and suggest that degeneracy with reference to several coexisting functional maps is mediated by cross-channel interactions across the active dendritic arbor.

Rarefied Gas Flows in Micro-Channels

利用基于分子模型的统计模拟方法--信息保存方法(IP)统计模拟了实验条件下微槽道气体流动,仔细讨论了用IP方法模拟长槽道稀薄气流时遇到的问题,并给出了解决的方法,即采取守恒形式的控制方程避免质量流量计算误差积累,并利用超松弛方法使收敛过程加速。将IP计算结果与压力分布和质量流量实验数据进行了比较。