An SOx (x = 2, 3) sensor using ?-alumina/Na2SO4 couple

A solid-state sensor for SOx (x = 2, 3) species has been designed using ?-alumina as the solid electrolyte and Na2SO4 as the auxiliary electrode. The measured e.m.f. of the cell Pt, O?2 + SO?2 + SO?3|Na2SO4short parallel?-aluminashort parallelNa2SO4|SO?3 + SO?2 + O?2, PT in the temperature range 700 K to 1150 K agrees well with values calculated using the Nernst equation. The sodium sulphate acts both as a protective covering, preventing direct access of the gaseous SOx species to the ?-alumina electrolyte, and as an auxiliary electrode, converting chemical potentials of SOx species and O2 into an equivalent sodium potential. The open-circuit e.m.f. varies non-linearly with temperature for fixed composition of inlet gas mixtures containing SO2, O2 and Ar. The response time (t0.99) of the cell varies between 1.9 ks at 750 K and 0.06 ks at 1100 K. The e.m.f. response is faster when the partial pressure of SOx at the electrode is increased than when it is decreased.

Simultaneous Measurement of Strain and Temperature using Type I and Pre-strained Fiber Bragg Gratings

Strain and temperature sensitivities of a type I Bragg grating inscribed in a germania doped silica fiber, fabricated under normal conditions and zero strain, are compared with that of a Bragg grating inscribed under pre-strained condition. The results obtained reveal that the strain and temperature sensitivities of the two gratings are different. Based on these results, we demonstrate a technique which enables discrimination of strain and temperature in a Fiber Bragg Grating (FBG) with a linear response. The present technique allows for an easy implementation of the sensor by providing a direct access to the grating region in the fiber and demands only a simple interrogation system.

Catalytic Enantioselective Iodoaminocyclization of Hydrazones

The first catalytic enantioselective iodoaminocyclization of beta,gamma-unsaturated hydrazones has been developed with the help of a trans-1,2-diaminocyclohexane-derived bifunctional thiourea catalyst and allows for the direct access to Delta(2)-pyrazolines containing a quaternary stereogenic center in high yield with good enantioselectivity (up to 95% yield and 95:5 er).

Time-Domain Approach to Estimate Series Capacitance of an Isolated Phase Winding of a Transformer

Information available in frequency response data is equivalently available in the time domain as a response due to an impulse excitation. The idea to pursue this equivalence to estimate series capacitance is linked to the well-known fact that under impulse excitation, the line/neutral current in a transformer has three distinct components, of which, the initial capacitive component is the first to manifest, followed by the oscillatory and inductive components. Of these, the capacitive component is temporally well separated from the rest-a crucial feature permitting its direct access and analysis. Further, the winding initially behaves as a pure capacitive network, so the initial component must obviously originate from only the (series and shunt) capacitances. With this logic, it should therefore be possible to estimate series capacitance, just by measuring the initial capacitive component of line current and the total shunt capacitance. The principle of the method and details of its implementation on two actual isolated transformerwindings (uniformly wound) are presented. For implementation, a low-voltage recurrent surge generator, a current probe, and a digital oscilloscope are all that is needed. The method is simple and requires no programming and needs least user intervention, thus paving the way for its widespread use.

A Slotted Aloha joint MAC-cum-Routing protocol for data gathering sensor network applications

In this paper we have proposed and implemented a joint Medium Access Control (MAC) -cum- Routing scheme for environment data gathering sensor networks. The design principle uses node 'battery lifetime' maximization to be traded against a network that is capable of tolerating: A known percentage of combined packet losses due to packet collisions, network synchronization mismatch and channel impairments Significant end-to-end delay of an order of few seconds We have achieved this with a loosely synchronized network of sensor nodes that implement Slotted-Aloha MAC state machine together with route information. The scheme has given encouraging results in terms of energy savings compared to other popular implementations. The overall packet loss is about 12%. The battery life time increase compared to B-MAC varies from a minimum of 30% to about 90% depending on the duty cycle.

Distributed Transmission of Functions of Correlated Sources over a Fading Multiple Access Channel

In this paper we address the problem of distributed transmission of functions of correlated sources over a fast fading multiple access channel (MAC). This is a basic building block in a hierarchical sensor network used in estimating a random field where the cluster head is interested only in estimating a function of the observations. The observations are transmitted to the cluster head through a fast fading MAC. We provide sufficient conditions for lossy transmission when the encoders and decoders are provided with partial information about the channel state. Furthermore signal side information maybe available at the encoders and the decoder. Various previous studies are shown as special cases. Efficient joint-source channel coding schemes are discussed for transmission of discrete and continuous alphabet sources to recover function values.

Distributed Coding for Multiple Access Communication with Side Information

In a typical sensor network scenario a goal is to monitor a spatio-temporal process through a number of inexpensive sensing nodes, the key parameter being the fidelity at which the process has to be estimated at distant locations. We study such a scenario in which multiple encoders transmit their correlated data at finite rates to a distant, common decoder over a discrete time multiple access channel under various side information assumptions. In particular, we derive an achievable rate region for this communication problem.

A self-supported 40W direct methanol fuel cell system

A self-supported 40W Direct Methanol Fuel Cell (DMFC) system has been developed and performance tested. The auxiliaries in the DMFC system comprise a methanol sensor, a liquid-level indicator, and fuel and air pumps that consume a total power of about 5W. The system has a 15-cell DMFC stack with active electrode-area of 45 cm(2). The self-supported DMFC system addresses issues related to water recovery from the cathode exhaust, and maintains a constant methanol-feed concentration with thermal management in the system. Pure methanol and water from cathode exhaust are pumped to the methanol-mixing tank where the liquid level is monitored and controlled with the help of a liquid-level indicator. During the operation, methanol concentration in the feed solution at the stack outlet is monitored using a methanol sensor, and pure methanol is added to restore the desired methanol concentration in the feed tank by adding the product water from the cathode exhaust. The feed-rate requirements of fuel and oxidant are designed for the stack capacity of 40W. The self-supported DMFC system is ideally suited for various defense and civil applications and, in particular, for charging the storage batteries.

Optimizing Delay in Sequential Change Detection on Ad Hoc Wireless Sensor Networks

We consider the classical problem of sequential detection of change in a distribution (from hypothesis 0 to hypothesis 1), where the fusion centre receives vectors of periodic measurements, with the measurements being i.i.d. over time and across the vector components, under each of the two hypotheses. In our problem, the sensor devices ("motes") that generate the measurements constitute an ad hoc wireless network. The motes contend using a random access protocol (such as CSMA/CA) to transmit their measurement packets to the fusion centre. The fusion centre waits for vectors of measurements to accumulate before taking decisions. We formulate the optimal detection problem, taking into account the network delay experienced by the vectors of measurements, and find that, under periodic sampling, the detection delay decouples into network delay and decision delay. We obtain a lower bound on the network delay, and propose a censoring scheme, where lagging sensors drop their delayed observations in order to mitigate network delay. We show that this scheme can achieve the lower bound. This approach is explored via simulation. We also use numerical evaluation and simulation to study issues such as: the optimal sampling rate for a given number of sensors, and the optimal number of sensors for a given measurement rate

Delay Optimal Event Detection on Ad Hoc Wireless Sensor Networks

We consider a small extent sensor network for event detection, in which nodes periodically take samples and then contend over a random access network to transmit their measurement packets to the fusion center. We consider two procedures at the fusion center for processing the measurements. The Bayesian setting, is assumed, that is, the fusion center has a prior distribution on the change time. In the first procedure, the decision algorithm at the fusion center is network-oblivious and makes a decision only when a complete vector of measurements taken at a sampling instant is available. In the second procedure, the decision algorithm at the fusion center is network-aware and processes measurements as they arrive, but in a time-causal order. In this case, the decision statistic depends on the network delays, whereas in the network-oblivious case, the decision statistic does not. This yields a Bayesian change-detection problem with a trade-off between the random network delay and the decision delay that is, a higher sampling rate reduces the decision delay but increases the random access delay. Under periodic sampling, in the network-oblivious case, the structure of the optimal stopping rule is the same as that without the network, and the optimal change detection delay decouples into the network delay and the optimal decision delay without the network. In the network-aware case, the optimal stopping problem is analyzed as a partially observable Markov decision process, in which the states of the queues and delays in the network need to be maintained. A sufficient decision statistic is the network state and the posterior probability of change having occurred, given the measurements received and the state of the network. The optimal regimes are studied using simulation.

Theory and Algorithms for Hop-Count-Based Localization with Random Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.

A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis

In this paper, we study a problem of designing a multi-hop wireless network for interconnecting sensors (hereafter called source nodes) to a Base Station (BS), by deploying a minimum number of relay nodes at a subset of given potential locations, while meeting a quality of service (QoS) objective specified as a hop count bound for paths from the sources to the BS. 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. For this problem, we propose a polynomial time approximation algorithm based on iteratively constructing shortest path trees and heuristically pruning away the relay nodes used until the hop count bound is violated. Results show that the algorithm performs efficiently in various randomly generated network scenarios; in over 90% of the tested scenarios, it gave solutions that were either optimal or were worse than optimal by just one relay. We then use random graph techniques to obtain, under a certain stochastic setting, an upper bound on the average case approximation ratio of a class of algorithms (including the proposed algorithm) for this problem as a function of the number of source nodes, and the hop count bound. To the best of our knowledge, the average case analysis is the first of its kind in the relay placement literature. Since the design is based on a light traffic model, we also provide simulation results (using models for the IEEE 802.15.4 physical layer and medium access control) to assess the traffic levels up to which the QoS objectives continue to be met. (C) 2014 Elsevier B.V. All rights reserved.

A non-resonant mass sensor to eliminate the ``missing mass'' effect during mass measurement of biological materials

Resonant sensors and crystal oscillators for mass detection need to be excited at very high natural frequencies (MHz). Use of such systems to measure mass of biological materials affects the accuracy of mass measurement due to their viscous and/or viscoelastic properties. The measurement limitation of such sensor system is the difficulty in accounting for the ``missing mass'' of the biological specimen in question. A sensor system has been developed in this work, to be operated in the stiffness controlled region at very low frequencies as compared to its fundamental natural frequency. The resulting reduction in the sensitivity due to non-resonant mode of operation of this sensor is compensated by the high resolution of the sensor. The mass of different aged drosophila melanogaster (fruit fly) is measured. The difference in its mass measurement during resonant mode of operation is also presented. That, viscosity effects do not affect the working of this non-resonant mass sensor is clearly established by direct comparison. (C) 2014 AIP Publishing LLC.

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.

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/).