Design and development of Fiber Bragg Grating sensing plate for plantar strain measurement and postural stability analysis

This paper describes an ab initio design and development of a novel Fiber Bragg Grating (FBG) sensor based strain sensing plate for the measurement of plantar strain distribution in human foot. The primary aim of this work is to study the feasibility of usage of FBG sensors in the measurement of plantar strain in the foot; in particular, to spatially resolve the strain distribution in the foot at different regions such as fore-foot, mid-foot and hind-foot. This study also provides a method to quantify and compare relative postural stability of different subjects under test; in addition, traditional accelerometers have been used to record the movements of center of gravity (second lumbar vertebra) of the subject and the results obtained have been compared against the outcome of the postural stability studies undertaken using the developed FBG plantar strain sensing plate. (C) 2013 Elsevier Ltd. All rights reserved.

Joint Scheduling & Jamming for Data Secrecy in Wireless Networks

The broadcast nature of the wireless medium jeopardizes secure transmissions. Cryptographic measures fail to ensure security when eavesdroppers have superior computational capability; however, it can be assured from information theoretic security approaches. We use physical layer security to guarantee non-zero secrecy rate in single source, single destination multi-hop networks with eavesdroppers for two cases: when eavesdropper locations and channel gains are known and when their positions are unknown. We propose a two-phase solution which consists of finding activation sets and then obtaining transmit powers subject to SINR constraints for the case when eavesdropper locations are known. We introduce methods to find activation sets and compare their performance. Necessary but reasonable approximations are made in power minimization formulations for tractability reasons. For scenarios with no eavesdropper location information, we suggest vulnerability region (the area having zero secrecy rate) minimization over the network. Our results show that in the absence of location information average number of eavesdroppers who have access to data is reduced.

Power and delay optimal policies for wireless systems

In this paper we consider a single discrete time queue with infinite buffer. The channel may experience fading. The transmission rate is a linear function of power used for transmission. In this scenario we explicitly obtain power control policies which minimize mean power and/or mean delay. There may also be peak power constraint.

Performance analysis of beacon-less IEEE 802.15.4 multi-hop networks

We develop an approximate analytical technique for evaluating the performance of multi-hop networks based on beacon-less CSMA/CA as standardised in IEEE 802.15.4, a popular standard for wireless sensor networks. The network comprises sensor nodes, which generate measurement packets, and relay nodes which only forward packets. We consider a detailed stochastic process at each node, and analyse this process taking into account the interaction with neighbouring nodes via certain unknown variables (e.g., channel sensing rates, collision probabilities, etc.). By coupling these analyses of the various nodes, we obtain fixed point equations that can be solved numerically to obtain the unknown variables, thereby yielding approximations of time average performance measures, such as packet discard probabilities and average queueing delays. Different analyses arise for networks with no hidden nodes and networks with hidden nodes. We apply this approach to the performance analysis of tree networks rooted at a data sink. Finally, we provide a validation of our analysis technique against simulations.

Optimal Timer-Based Best Node Selection for Wireless Systems with Unknown Number of Nodes

The distributed, low-feedback, timer scheme is used in several wireless systems to select the best node from the available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal metric-to-timer mappings for the practical scenario where the number of nodes is unknown. We consider two cases in which the probability distribution of the number of nodes is either known a priori or is unknown. In the first case, the optimal mapping maximizes the success probability averaged over the probability distribution. In the second case, a robust mapping maximizes the worst case average success probability over all possible probability distributions on the number of nodes. Results reveal that the proposed mappings deliver significant gains compared to the mappings considered in the literature.

Measurement of in-plane and out-of-plane displacements and strains using digital holographic moire

The paper proposes a non-destructive method for simultaneous measurement of in-plane and out-of-plane displacements and strains undergone by a deformed specimen from a single moire fringe pattern obtained on the specimen in a dual beam digital holographic interferometry setup. The moire fringe pattern encodes multiple interference phases which carry the information on multidimensional deformation. The interference field is segmented in each column and is modeled as multicomponent quadratic/cubic frequency-modulated signal in each segment. Subsequently, the product form of modified cubic phase function is used for accurate estimation of phase parameters. The estimated phase parameters are further utilized for direct estimation of the unwrapped interference phases and phase derivatives. The simulation and experimental results are provided to validate the effectiveness of the proposed method.

A Low-Cost System for Measurement and Spectral Analysis of Motor Acoustic Noise

Workplace noise has become one of the major issues in industry not only because of workers’ health but also due to safety. Electric motors, particularly, inverter fed induction motors emit objectionably high levels of noise. This has led to the emergence of a research area, concerned with measurement and mitigation of the acoustic noise. This paper presents a lowcost option for measurement and spectral analysis of acoustic noise emitted by electric motors. The system consists of an electret microphone, amplifier and filter. It makes use of the windows sound card and associated software for data acquisition and analysis. The measurement system is calibrated using a professional sound level meter. Acoustic noise measurements are made on an induction motor drive using the proposed system as per relevant international standards. These measurements are seen to match closely with those of a professional meter.

Performance Analysis of a Cooperative MAC Protocol of Wireless Ad Hoc Networks

Different medium access control (MAC) layer protocols, for example, IEEE 802.11 series and others are used in wireless local area networks. They have limitation in handling bulk data transfer applications, like video-on-demand, videoconference, etc. To avoid this problem a cooperative MAC protocol environment has been introduced, which enables the MAC protocol of a node to use its nearby nodes MAC protocol as and when required. We have found on various occasions that specified cooperative MAC establishes cooperative transmissions to send the specified data to the destination. In this paper we propose cooperative MAC priority (CoopMACPri) protocol which exploits the advantages of priority value given by the upper layers for selection of different paths to nodes running heterogeneous applications in a wireless ad hoc network environment. The CoopMACPri protocol improves the system throughput and minimizes energy consumption. Using a Markov chain model, we developed a model to analyse the performance of CoopMACPri protocol; and also derived closed-form expression of saturated system throughput and energy consumption. Performance evaluations validate the accuracy of the theoretical analysis, and also show that the performance of CoopMACPri protocol varies with the number of nodes. We observed that the simulation results and analysis reflects the effectiveness of the proposed protocol as per the specifications.

Joint Approximately Sparse Channel Estimation and Data Detection in OFDM Systems Using Sparse Bayesian Learning

It is well known that the impulse response of a wide-band wireless channel is approximately sparse, in the sense that it has a small number of significant components relative to the channel delay spread. In this paper, we consider the estimation of the unknown channel coefficients and its support in OFDM systems using a sparse Bayesian learning (SBL) framework for exact inference. In a quasi-static, block-fading scenario, we employ the SBL algorithm for channel estimation and propose a joint SBL (J-SBL) and a low-complexity recursive J-SBL algorithm for joint channel estimation and data detection. In a time-varying scenario, we use a first-order autoregressive model for the wireless channel and propose a novel, recursive, low-complexity Kalman filtering-based SBL (KSBL) algorithm for channel estimation. We generalize the KSBL algorithm to obtain the recursive joint KSBL algorithm that performs joint channel estimation and data detection. Our algorithms can efficiently recover a group of approximately sparse vectors even when the measurement matrix is partially unknown due to the presence of unknown data symbols. Moreover, the algorithms can fully exploit the correlation structure in the multiple measurements. Monte Carlo simulations illustrate the efficacy of the proposed techniques in terms of the mean-square error and bit error rate performance.

Top Yukawa coupling measurement with indefinite CP Higgs in e(+)e(-) -> t(t)over-bar Phi

We consider the issue of the top quark Yukawa coupling measurement in a model-independent and general case with the inclusion of CP violation in the coupling. Arguably the best process to study this coupling is the associated production of the Higgs boson along with a t (t) over bar pair in a machine like the International Linear Collider (ILC). While detailed analyses of the sensitivity of the measurement-assuming a Standard Model (SM)-like coupling is available in the context of the ILC-conclude that the coupling could be pinned down to about a 10% level with modest luminosity, our investigations show that the scenario could be different in the case of a more general coupling. The modified Lorentz structure resulting in a changed functional dependence of the cross section on the coupling, along with the difference in the cross section itself leads to considerable deviation in the sensitivity. Our studies of the ILC with center-of-mass energies of 500 GeV, 800 GeV, and 1000 GeV show that moderate CP mixing in the Higgs sector could change the sensitivity to about 20%, while it could be worsened to 75% in cases which could accommodate more dramatic changes in the coupling. Detailed considerations of the decay distributions point to a need for a relook at the analysis strategy followed for the case of the SM, such as for a model-independent analysis of the top quark Yukawa coupling measurement. This study strongly suggests that a joint analysis of the CP properties and the Yukawa coupling measurement would be the way forward at the ILC and that caution must be exercised in the measurement of the Yukawa couplings and the conclusions drawn from it.

Diffusing-wave spectroscopy in an inhomogeneous object: Local viscoelastic spectra from ultrasound-assisted measurement of correlation decay arising from the ultrasound focal volume

We demonstrate diffusing-wave spectroscopy (DWS) in a localized region of a viscoelastically inhomogeneous object by measurement of the intensity autocorrelation g(2)(tau)] that captures only the decay introduced by the temperature-induced Brownian motion in the region. The region is roughly specified by the focal volume of an ultrasound transducer which introduces region specific mechanical vibration owing to insonification. Essential characteristics of the localized non-Markovian dynamics are contained in the decay of the modulation depth M(tau)], introduced by the ultrasound forcing in the focal volume selected, on g(2)(tau). The modulation depth M(tau(i)) at any delay time tau(i) can be measured by short-time Fourier transform of g(2)(tau) and measurement of the magnitude of the spectrum at the ultrasound drive frequency. By following the established theoretical framework of DWS, we are able to connect the decay in M(tau) to the mean-squared displacement (MSD) of scattering centers and the MSD to G*(omega), the complex viscoelastic spectrum. A two-region composite polyvinyl alcohol phantom with different viscoelastic properties is selected for demonstrating local DWS-based recovery of G*(omega) corresponding to these regions from the measured region specific M(tau(i))vs tau(i). The ultrasound-assisted measurement of MSD is verified by simulating, using a generalized Langevin equation (GLE), the dynamics of the particles in the region selected as well as by the usual DWS experiment without the ultrasound. It is shown that whereas the MSD obtained by solving the GLE without the ultrasound forcing agreed with its experimental counterpart covering small and large values of tau, the match was good only in the initial transients in regard to experimental measurements with ultrasound.

Optimal sequential wireless relay placement on a random lattice path

Our work is motivated by impromptu (or ``as-you-go'') deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control center), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each step, the path can, randomly, either continue in the same direction or take a turn, or come to an end, at which point a data source (e.g., a sensor) has to be placed, that will send packets to the data sink. A decision has to be made at each step whether or not to place a wireless relay node. Assuming that the packet generation rate by the source is very low, and simple link-by-link scheduling, we consider the problem of sequential relay placement so as to minimize the expectation of an end-to-end cost metric (a linear combination of the sum of convex hop costs and the number of relays placed). This impromptu relay placement problem is formulated as a total cost Markov decision process. First, we derive the optimal policy in terms of an optimal placement set and show that this set is characterized by a boundary (with respect to the position of the last placed relay) beyond which it is optimal to place the next relay. Next, based on a simpler one-step-look-ahead characterization of the optimal policy, we propose an algorithm which is proved to converge to the optimal placement set in a finite number of steps and which is faster than value iteration. We show by simulations that the distance threshold based heuristic, usually assumed in the literature, is close to the optimal, provided that the threshold distance is carefully chosen. (C) 2014 Elsevier B.V. All rights reserved.

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.