Five-level inverter voltage-space phasor generation for an open-end winding induction motor drive

A topology for voltage-space phasor generation equivalent to a five-level inverter for an open-end winding induction motor is presented. The open-end winding induction motor is fed from both ends by two three-level inverters. The three-level inverters are realised by cascading two two-level inverters. This inverter scheme does not experience neutral-point fluctuations. Of the two three-level inverters only one will be switching at any instant in the lower speed ranges. In the multilevel carrier-based SPWM used for the proposed drive, a progressive discrete DC bias depending on the speed range is given to the reference wave to reduce the inverter switchings. The drive is implemented and tested with a 1 HP open-end winding induction motor and experimental results are presented.

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.

Modeling of Ascending/Descending Velocity of Metal Droplet Emulsified in Pb-Salt System

Metal-slag emulsion is an important process to enhance the reaction rate between the two phases; thus, it improves the heat and mass transfer of the process significantly. Various experimental studies have been carried out, and some system specific relations have been proposed by various investigators. A unified, theoretical study is lacking to model this complex phenomenon. Therefore, two simple models based on fundamental laws for metal droplet velocity (both ascending and descending) and bubble velocity, as well as its position at any instant of time, have been proposed. Analytical solutions have been obtained for the developed equations. Analytical solutions have been verified for the droplet velocity, traveling time, and size distribution in slag phase by performing high-temperature experiments in a Pb-salt system and comparing the obtained data with theory. The proposed model has also been verified with published experimental data for various liquid systems with a wide range of physical properties. A good agreement has been found between the analytical solution and the experimental and published data in all cases.

Relay Selection for Geographical Forwarding in Sleep-Wake Cycling Wireless Sensor Networks

Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the hop count or total energy. Our approach is to solve, at each forwarding node enroute to the sink, the local forwarding problem of minimizing one-hop waiting delay subject to a lower bound constraint on a suitable reward offered by the next-hop relay; the constraint serves to tune the tradeoff. The reward metric used for the local problem is based on the end-to-end total cost objective (for instance, when the total cost is hop count, we choose to use the progress toward sink made by a relay as the reward). The forwarding node, to begin with, is uncertain about the number of relays, their wake-up times, and the reward values, but knows the probability distributions of these quantities. At each relay wake-up instant, when a relay reveals its reward value, the forwarding node's problem is to forward the packet or to wait for further relays to wake-up. In terms of the operations research literature, our work can be considered as a variant of the asset selling problem. We formulate our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy. Motivated by the computational complexity involved in the policies derived out of these bounds, we formulate an alternate simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the inner and outer bound policies against the simple policy, and also against the optimal policy when the source knows the exact number of relays. Observing the good performance and the ease of implementation of the simple policy, we apply it to our motivating problem, i.e., local geographical routing of sporadic alarm packets in a large WSN. We compare the end-to-end performance (i.e., average total delay and average total cost) obtained by the simple policy, when used for local geographical forwarding, against that obtained by the globally optimal forwarding algorithm proposed by Kim et al. 1].

Optimal forwarding in delay tolerant networks with multiple destinations

We study the trade-off between delivery delay and energy consumption in a delay tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there are several other nodes in the network that can assist in relaying the message. We first assume that, at every instant, all the nodes know the number of relays carrying the packet and the number of destinations that have received the packet. We formulate the problem as a controlled continuous time Markov chain and derive the optimal closed loop control (i.e., forwarding policy). However, in practice, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this issue, we obtain an ODE (i.e., fluid) approximation for the optimally controlled Markov chain. This fluid approximation also yields an asymptotically optimal open loop policy. Finally, we evaluate the performance of the deterministic policy over finite networks. Numerical results show that this policy performs close to the optimal closed loop policy.

Nucleation dynamics and pool boiling characteristics of high pressure refrigerant using thermochromic liquid crystals

This paper reports an experimental investigation of oscillating temperature field beneath a single isolated nucleation site using a non-invasive TLC (thermochromic liquid crystal) based thermography technique. Empirical correlations are presented to demonstrate the influence of system pressure and wall heat flux on different ebullition characteristics in the nucleate pool boiling regime of refrigerant R-134a. TLC transient response and two-phase flow structure are captured using synchronized, high resolution imaging. It is observed that the area of influence of nucleation site exhibits a two-part distinct transient behavior during the bubble growth period and broadens to a maximum of 1.57 times the bubble diameter at the instant of bubble departure. This is accompanied by a sharp fall of 2.5 degrees C in the local excess temperature at the nucleation site, which results in momentary augmentation (similar to 40%) in the local heat transfer coefficient at the nucleation origin. The enhanced heat transfer rate observed during the bubble peel-off event is primarily due to transient micro-convection in the wake of the retreating bubble. Further, the results indicate that a slight increase in system pressure from 813.6 to 882.5 kPa has no considerable effect on either the wall superheat or the overall heat transfer coefficient and ebullition frequency. In addition, correlations have been obtained for bubble Reynolds number, Jackob number and the dimensionless bubble generation frequency in terms of modified boiling number.

Cognitive radio implementation for a frequency hopping primary signal

Frequency hopping communications, used in the military present significant opportunities for spectrum reuse via the cognitive radio technology. We propose a MAC which incorporates hop instant identification, and supports network discovery and formation, QOS Scheduling and secondary communications. The spectrum sensing algorithm is optimized to deal with the problem of spectral leakage. The algorithms are implemented in a SDR platform based test bed and measurement results are presented.

A transform approach to linear network coding for acyclic networks with delay

The algebraic formulation for linear network coding in acyclic networks with each link having an integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes at any given time instant is a Fq-linear combination of the input symbols across different generations, where Fq denotes the field over which the network operates. We use finite-field discrete Fourier transform (DFT) to convert the output symbols at the sink nodes at any given time instant into a Fq-linear combination of the input symbols generated during the same generation. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (non-transform) approach if and only if there exists a network code satisfying sink demands in the transform approach. Furthermore, assuming time invariant local encoding kernels, we show that the transform method can be employed to achieve half the rate corresponding to the individual source-destination mincut (which are assumed to be equal to 1) for some classes of three-source three-destination multiple unicast network with delays using alignment strategies when the zero-interference condition is not satisfied.

Epoch extraction based on integrated linear prediction residual using plosion index

Epoch is defined as the instant of significant excitation within a pitch period of voiced speech. Epoch extraction continues to attract the interest of researchers because of its significance in speech analysis. Existing high performance epoch extraction algorithms require either dynamic programming techniques or a priori information of the average pitch period. An algorithm without such requirements is proposed based on integrated linear prediction residual (ILPR) which resembles the voice source signal. Half wave rectified and negated ILPR (or Hilbert transform of ILPR) is used as the pre-processed signal. A new non-linear temporal measure named the plosion index (PI) has been proposed for detecting `transients' in speech signal. An extension of PI, called the dynamic plosion index (DPI) is applied on pre-processed signal to estimate the epochs. The proposed DPI algorithm is validated using six large databases which provide simultaneous EGG recordings. Creaky and singing voice samples are also analyzed. The algorithm has been tested for its robustness in the presence of additive white and babble noise and on simulated telephone quality speech. The performance of the DPI algorithm is found to be comparable or better than five state-of-the-art techniques for the experiments considered.

Optimal Forwarding in Delay-Tolerant Networks With Multiple Destinations

We study the tradeoff between delivery delay and energy consumption in a delay-tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there are several other nodes in the network that can assist in relaying the message. We first assume that, at every instant, all the nodes know the number of relays carrying the message and the number of destinations that have received the message. We formulate the problem as a controlled continuous-time Markov chain and derive the optimal closed-loop control (i.e., forwarding policy). However, in practice, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this issue, we obtain an ordinary differential equation (ODE) (i.e., a deterministic fluid) approximation for the optimally controlled Markov chain. This fluid approximation also yields an asymptotically optimal open-loop policy. Finally, we evaluate the performance of the deterministic policy over finite networks. Numerical results show that this policy performs close to the optimal closed-loop policy.

Spectral response of a droplet in pulsating external flow field

A droplet introduced in an external convective flow field exhibits significant multimodal shape oscillations depending upon the intensity of the aerodynamic forcing. In this paper, a theoretical model describing the temporal evolution of normal modes of the droplet shape is developed. The fluid is assumed to be weakly viscous and Newtonian. The convective flow velocity, which is assumed to be incompressible and inviscid, is incorporated in the model through the normal stress condition at the droplet surface and the equation of motion governing the dynamics of each mode is derived. The coupling between the external flow and the droplet is approximated to be a one-way process, i.e., the external flow perturbations effect the droplet shape oscillations and the droplet oscillation itself does not influence the external flow characteristics. The shape oscillations of the droplet with different fluid properties under different unsteady flow fields were simulated. For a pulsatile external flow, the frequency spectra of the normal modes of the droplet revealed a dominant response at the resonant frequency, in addition to the driving frequency and the corresponding harmonics. At driving frequencies sufficiently different from the resonant frequency of the prolate-oblate oscillation mode of the droplet, the oscillations are stable. But at resonance the oscillation amplitude grows in time leading to breakup depending upon the fluid viscosity. A line vortex advecting past the droplet, simulated as an isotropic jump in the far field velocity, leads to the resonant excitation of the droplet shape modes if and only if the time taken by the vortex to cross the droplet is less than the resonant period of the P-2 mode of the droplet. A train of two vortices interacting with the droplet is also analysed. It shows clearly that the time instant of introduction of the second vortex with respect to the droplet shape oscillation cycle is crucial in determining the amplitude of oscillation. (C) 2014 AIP Publishing LLC.

Scaling of pressure spectrum in turbulent boundary layers

Scaling of pressure spectrum in zero-pressure-gradient turbulent boundary layers is discussed. Spatial DNS data of boundary layer at one time instant (Re-theta = 4500) are used for the analysis. It is observed that in the outer regions the pressure spectra tends towards the -7/3 law predicted by Kolmogorov's theory of small-scale turbulence. The slope in the pressure spectra varies from -1 close to the wall to a value close to -7/3 in the outer region. The streamwise velocity spectra also show a -5/3 trend in the outer region of the flow. The exercise carried out to study the amplitude modulation effect of the large scales on the smaller ones in the near-wall region reveals a strong modulation effect for the streamwise velocity, but not for the pressure fluctuations. The skewness of the pressure follows the same trend as the amplitude modulation coefficient, as is the case for the velocity. In the inner region, pressure spectra were seen to collapse better when normalized with the local Reynolds stress (-(u'v') over bar) than when scaled with the local turbulent kinetic energy (q(2) = (u'(2)) over bar + (v'(2)) over bar + (w'(2)) over bar)

Strength and fatigue life evaluation of composite laminate with embedded sensors

Prognosis regarding durability of composite structures using various Structural Health Monitoring (SHM) techniques is an important and challenging topic of research. Ultrasonic SHM systems with embedded transducers have potential application here due to their instant monitoring capability, compact packaging potential toward unobtrusiveness and non-invasiveness as compared to non-contact ultrasonic and eddy current techniques which require disassembly of the structure. However, embedded sensors pose a risk to the structure by acting as a flaw thereby reducing life. The present paper focuses on the determination of strength and fatigue life of the composite laminate with embedded film sensors like CNT nanocomposite, PVDF thin films and piezoceramic films. First, the techniques of embedding these sensors in composite laminates is described followed by the determination of static strength and fatigue life at coupon level testing in Universal Testing Machine (UTM). Failure mechanisms of the composite laminate with embedded sensors are studied for static and dynamic loading cases. The coupons are monitored for loading and failure using the embedded sensors. A comparison of the performance of these three types of embedded sensors is made to study their suitability in various applications. These three types of embedded sensors cover a wide variety of applications, and prove to be viable in embedded sensor based SHM of composite structures.

Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay

The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F(p)m-linear combination of the input symbols across different generations, where F(p)m denotes the field over which the network operates (p is prime and m is a positive integer). We use finite-field discrete Fourier transform to convert the output symbols at the sink nodes, at any given time instant, into a F(p)m-linear combination of the input symbols generated during the same generation without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (nontransform) approach if and only if there exists a network code satisfying sink demands in the transform approach. When the zero-interference conditions are not satisfied, we propose three precoding-based network alignment (PBNA) schemes for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D) termed as PBNA using transform approach and time-invariant local encoding coefficients (LECs), PBNA using time-varying LECs, and PBNA using transform approach and block time-varying LECs. We derive sets of necessary and sufficient conditions under which throughputs close to n' + 1/2n' + 1, n'/2n' + 1, and n'/2n' + 1 are achieved for the three source-destination pairs in a 3-S 3-D MUN-D employing PBNA using transform approach and time-invariant LECs, and PBNA using transform approach and block time-varying LECs, where n' is a positive integer. For PBNA using time-varying LECs, we obtain a sufficient condition under which a throughput demand of n(1)/n, n(2)/n, and n(3)/n can be met for the three source-destination pairs in a 3-S 3-D MUN-D, where n(1), n(2), and n(3) are positive integers less than or equal to the positive integer n. This condition is also necessary when n(1) + n(3) = n(1) + n(2) = n where n(1) >= n(2) >= n(3).

A model for the classification and survey of clock synchronization protocols in WSNs

Clock synchronization in wireless sensor networks (WSNs) assures that sensor nodes have the same reference clock time. This is necessary not only for various WSN applications but also for many system level protocols for WSNs such as MAC protocols, and protocols for sleep scheduling of sensor nodes. Clock value of a node at a particular instant of time depends on its initial value and the frequency of the crystal oscillator used in the sensor node. The frequency of the crystal oscillator varies from node to node, and may also change over time depending upon many factors like temperature, humidity, etc. As a result, clock values of different sensor nodes diverge from each other and also from the real time clock, and hence, there is a requirement for clock synchronization in WSNs. Consequently, many clock synchronization protocols for WSNs have been proposed in the recent past. These protocols differ from each other considerably, and so, there is a need to understand them using a common platform. Towards this goal, this survey paper categorizes the features of clock synchronization protocols for WSNs into three types, viz, structural features, technical features, and global objective features. Each of these categories has different options to further segregate the features for better understanding. The features of clock synchronization protocols that have been used in this survey include all the features which have been used in existing surveys as well as new features such as how the clock value is propagated, when the clock value is propagated, and when the physical clock is updated, which are required for better understanding of the clock synchronization protocols in WSNs in a systematic way. This paper also gives a brief description of a few basic clock synchronization protocols for WSNs, and shows how these protocols fit into the above classification criteria. In addition, the recent clock synchronization protocols for WSNs, which are based on the above basic clock synchronization protocols, are also given alongside the corresponding basic clock synchronization protocols. Indeed, the proposed model for characterizing the clock synchronization protocols in WSNs can be used not only for analyzing the existing protocols but also for designing new clock synchronization protocols. (C) 2014 Elsevier B.V. All rights reserved.