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.

Design, Development and Calibration of HTS Wire Based LOX Level Sensor Probe

For space applications, the weight of the liquid level sensors are of major concern as they affect the payload fraction and hence the cost. An attempt is made to design and test a light weight High Temperature Superconductor (HTS) wire based liquid level sensor for Liquid Oxygen (LOX) tank used in the cryostage of the spacecraft. The total resistance value measured of the HTS wire is inversely proportional to the liquid level. A HTS wire (SF12100) of 12mm width and 2.76m length without copper stabilizer has been used in the level sensor. The developed HTS wire based LOX level sensor is calibrated against a discrete diode array type level sensor. Liquid Nitrogen (LN2) and LOX has been used as cryogenic fluid for the calibration purpose. The automatic data logging for the system has been done using LabVIEW11. The net weight of the developed sensor is less than 1 kg.

MAXIMUM A-POSTERIORI ESTIMATION OF MISSING SAMPLES WITH CONTINUITY CONSTRAINT IN ELECTROMAGNETIC ARTICULOGRAPHY DATA

Electromagnetic Articulography (EMA) technique is used to record the kinematics of different articulators while one speaks. EMA data often contains missing segments due to sensor failure. In this work, we propose a maximum a-posteriori (MAP) estimation with continuity constraint to recover the missing samples in the articulatory trajectories recorded using EMA. In this approach, we combine the benefits of statistical MAP estimation as well as the temporal continuity of the articulatory trajectories. Experiments on articulatory corpus using different missing segment durations show that the proposed continuity constraint results in a 30% reduction in average root mean squared error in estimation over statistical estimation of missing segments without any continuity constraint.

Highly Sensitive Carbon Nanotubes Coated Etched Fiber Bragg Grating Sensor for Humidity Sensing

The sensing of relative humidity (RH) at room temperature has potential applications in several areas ranging from biomedical to horticulture, paper, and textile industries. In this paper, a highly sensitive humidity sensor based on carbon nanotubes (CNTs) coated on the surface of an etched fiber Bragg grating (EFBG) sensor has been demonstrated, for detecting RH over a wide range of 20%-90% at room temperature. When water molecules interact with the CNT coated EFBG, the effective refractive index of the fiber core changes, resulting in a shift in the Bragg wavelength. It has been possible to achieve a high sensitivity of similar to 31 pm/% RH, which is the highest compared with many of the existing FBG-based humidity sensors. The limit of detection in the CNT coated EFBG has been found to be similar to 0.03 RH. The experimental data shows a linear response of Bragg wavelength shift with increase in humidity. This novel method of incorporating CNTs on to the FBG sensor for humidity sensing has not been reported before.

Fabrication and Experimentation of a Cantilever Beam Based Piezoelectric Actuator and Sensor for Vibration Energy Harvesting

In the immediate surroundings of our daily life, we can find a lot of places where the energy in the form of vibration is being wasted. Therefore, we have enormous opportunities to utilize the same. Piezoelectric character of matter enables us to convert this mechanical vibration energy into electrical energy which can be stored and used to power other device, instead of being wasted. This work is done to realize both actuator and sensor in a cantilever beam based on piezoelectricity. The sensor part is called vibration energy harvester. The numerical analyses were performed for the cantilever beam using the commercial package ANSYS and MATLAB. The cantilever beam is realized by taking a plate and fixing its one end between two massive plates. Two PZT patches were glued to the beam on its two faces. Experiments were performed using data acquisition system (DAQ) and LABVIEW software for actuating and sensing the vibration of the cantilever beam.

Energy Sharing for Multiple Sensor Nodes With Finite Buffers

We consider the problem of finding optimal energy sharing policies that maximize the network performance of a system comprising of multiple sensor nodes and a single energy harvesting (EH) source. Sensor nodes periodically sense the random field and generate data, which is stored in the corresponding data queues. The EH source harnesses energy from ambient energy sources and the generated energy is stored in an energy buffer. Sensor nodes receive energy for data transmission from the EH source. The EH source has to efficiently share the stored energy among the nodes to minimize the long-run average delay in data transmission. We formulate the problem of energy sharing between the nodes in the framework of average cost infinite-horizon Markov decision processes (MDPs). We develop efficient energy sharing algorithms, namely Q-learning algorithm with exploration mechanisms based on the epsilon-greedy method as well as upper confidence bound (UCB). We extend these algorithms by incorporating state and action space aggregation to tackle state-action space explosion in the MDP. We also develop a cross entropy based method that incorporates policy parameterization to find near optimal energy sharing policies. Through simulations, we show that our algorithms yield energy sharing policies that outperform the heuristic greedy method.

Action Recognition from Motion Capture Data using Meta-cognitive RBF Network Classifier

Action recognition plays an important role in various applications, including smart homes and personal assistive robotics. In this paper, we propose an algorithm for recognizing human actions using motion capture action data. Motion capture data provides accurate three dimensional positions of joints which constitute the human skeleton. We model the movement of the skeletal joints temporally in order to classify the action. The skeleton in each frame of an action sequence is represented as a 129 dimensional vector, of which each component is a 31) angle made by each joint with a fixed point on the skeleton. Finally, the video is represented as a histogram over a codebook obtained from all action sequences. Along with this, the temporal variance of the skeletal joints is used as additional feature. The actions are classified using Meta-Cognitive Radial Basis Function Network (McRBFN) and its Projection Based Learning (PBL) algorithm. We achieve over 97% recognition accuracy on the widely used Berkeley Multimodal Human Action Database (MHAD).

Physical Layer Data Fusion Via Distributed Co-Phasing With General Signal Constellations

This paper studies a pilot-assisted physical layer data fusion technique known as Distributed Co-Phasing (DCP). In this two-phase scheme, the sensors first estimate the channel to the fusion center (FC) using pilots sent by the latter; and then they simultaneously transmit their common data by pre-rotating them by the estimated channel phase, thereby achieving physical layer data fusion. First, by analyzing the symmetric mutual information of the system, it is shown that the use of higher order constellations (HOC) can improve the throughput of DCP compared to the binary signaling considered heretofore. Using an HOC in the DCP setting requires the estimation of the composite DCP channel at the FC for data decoding. To this end, two blind algorithms are proposed: 1) power method, and 2) modified K-means algorithm. The latter algorithm is shown to be computationally efficient and converges significantly faster than the conventional K-means algorithm. Analytical expressions for the probability of error are derived, and it is found that even at moderate to low SNRs, the modified K-means algorithm achieves a probability of error comparable to that achievable with a perfect channel estimate at the FC, while requiring no pilot symbols to be transmitted from the sensor nodes. Also, the problem of signal corruption due to imperfect DCP is investigated, and constellation shaping to minimize the probability of signal corruption is proposed and analyzed. The analysis is validated, and the promising performance of DCP for energy-efficient physical layer data fusion is illustrated, using Monte Carlo simulations.

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.

Shock tunnel measurements of surface pressures in shock induced separated flow field using MEMS sensor array

Characterized not just by high Mach numbers, but also high flow total enthalpies-often accompanied by dissociation and ionization of flowing gas itself-the experimental simulation of hypersonic flows requires impulse facilities like shock tunnels. However, shock tunnel simulation imposes challenges and restrictions on the flow diagnostics, not just because of the possible extreme flow conditions, but also the short run times-typically around 1 ms. The development, calibration and application of fast response MEMS sensors for surface pressure measurements in IISc hypersonic shock tunnel HST-2, with a typical test time of 600 mu s, for the complex flow field of strong (impinging) shock boundary layer interaction with separation close to the leading edge, is delineated in this paper. For Mach numbers 5.96 (total enthalpy 1.3 MJ kg(-1)) and 8.67 (total enthalpy 1.6 MJ kg(-1)), surface pressures ranging from around 200 Pa to 50 000 Pa, in various regions of the flow field, are measured using the MEMS sensors. The measurements are found to compare well with the measurements using commercial sensors. It was possible to resolve important regions of the flow field involving significant spatial gradients of pressure, with a resolution of 5 data points within 12 mm in each MEMS array, which cannot be achieved with the other commercial sensors. In particular, MEMS sensors enabled the measurement of separation pressure (at Mach 8.67) near the leading edge and the sharply varying pressure in the reattachment zone.

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.

Fiber Bragg Grating Sensor Package for Submicron Level Displacement Measurements

In this article, the design and development of a Fiber Bragg Grating (FBG) based displacement sensor package for submicron level displacement measurements are presented. A linear shift of 12.12 nm in Bragg wavelength of the FBG sensor is obtained for a displacement of 6 mm with a calibration factor of 0.495 mu m/pm. Field trials have also been conducted by comparing the FBG displacement sensor package against a conventional dial gauge, on a five block masonry prism specimen loaded using three-point bending technique. The responses from both the sensors are in good agreement, up to the failure of the masonry prism. Furthermore, from the real-time displacement data recorded using FBG, it is possible to detect the time at which early creaks generated inside the body of the specimen which then prorogate to the surface to develop visible surface cracks; the respective load from the load cell can be obtained from the inflection (stress release point) in the displacement curve. Thus the developed FBG displacement sensor package can be used to detect failures in structures much earlier and to provide an adequate time to exercise necessary action, thereby avoiding the possible disaster.

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

A novel, sensitive potentiometric hydrocarbon sensor for high-vacuum applications.

A potentiometric device based on interfacing a solid electrolyte oxygen ion conductor with a thin platinum film acts as a robust, reproducible sensor for the detection of hydrocarbons in high- or ultrahigh-vacuum environments. Sensitivities in the order of approximately 5 x 10(-10) mbar are achievable under open circuit conditions, with good selectivity for discrimination between n-butane on one hand and toluene, n-octane, n-hexane, and 1-butene on the other hand. The sensor's sensitivity may be tuned by operating under constant current (closed circuit) conditions; injection of anodic current is also a very effective means of restoring a clean sensing surface at any desired point. XPS data and potentiometric measurements confirm the proposed mode of sensing action: the steady-state coverage of Oa, which sets the potential of the Pt sensing electrode, is determined by the partial pressure and dissociative sticking probability of the impinging hydrocarbon. The principles established here provide the basis for a viable, inherently flexible, and promising means for the sensitive and selective detection of hydrocarbons under demanding conditions.

Streaming covariance selection with applications to adaptive querying in sensor networks

Sensor networks can be naturally represented as graphical models, where the edge set encodes the presence of sparsity in the correlation structure between sensors. Such graphical representations can be valuable for information mining purposes as well as for optimizing bandwidth and battery usage with minimal loss of estimation accuracy. We use a computationally efficient technique for estimating sparse graphical models which fits a sparse linear regression locally at each node of the graph via the Lasso estimator. Using a recently suggested online, temporally adaptive implementation of the Lasso, we propose an algorithm for streaming graphical model selection over sensor networks. With battery consumption minimization applications in mind, we use this algorithm as the basis of an adaptive querying scheme. We discuss implementation issues in the context of environmental monitoring using sensor networks, where the objective is short-term forecasting of local wind direction. The algorithm is tested against real UK weather data and conclusions are drawn about certain tradeoffs inherent in decentralized sensor networks data analysis. © 2010 The Author. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.