Tunable Locally-Optimal Geographical Forwarding in Wireless Sensor Networks with Sleep-Wake Cycling Nodes

We consider a wireless sensor network whose main function is to detect certain infrequent alarm events, and to forward alarm packets to a base station, using geographical forwarding. The nodes know their locations, and they sleep-wake cycle, waking up periodically but not synchronously. In this situation, when a node has a packet to forward to the sink, there is a trade-off between how long this node waits for a suitable neighbor to wake up and the progress the packet makes towards the sink once it is forwarded to this neighbor. Hence, in choosing a relay node, we consider the problem of minimizing average delay subject to a constraint on the average progress. By constraint relaxation, we formulate this next hop relay selection problem as a Markov decision process (MDP). The exact optimal solution (BF (Best Forward)) can be found, but is computationally intensive. Next, we consider a mathematically simplified model for which the optimal policy (SF (Simplified Forward)) turns out to be a simple one-step-look-ahead rule. Simulations show that SF is very close in performance to BF, even for reasonably small node density. We then study the end-to-end performance of SF in comparison with two extremal policies: Max Forward (MF) and First Forward (FF), and an end-to-end delay minimising policy proposed by Kim et al. 1]. We find that, with appropriate choice of one hop average progress constraint, SF can be tuned to provide a favorable trade-off between end-to-end packet delay and the number of hops in the forwarding path.

Flap-lag-torsion stability in hover and forward flight with three-dimensional wake

The contributions of full-wake dynamics in trim analysis are demonstrated for finding the control inputs and periodic responses simultaneously, as well as in Floquet eigenanalysis for finding the damping levels. The equations of flap bending, lag bending, and torsion are coupled with a three-dimensional, finite state wake, and low-frequency (<1/rev) to high frequency (>1/rev) multiblade modes are considered. Full blade-wake dynamics is used in trim analysis and Floquet eigenanalysis. A uniform cantilever blade in trimmed flight is investigated over a range of thrust levels, advance ratios, number of blades, and blade torsional frequencies. The investigation includes the convergence characteristics of control inputs, periodic responses, and damping levels with respect to the number of spatial azimuthal harmonics and radial shape functions in the wake representation. It also includes correlation with the measured lag damping of a three-bladed untrimmed rotor. The parametric study shows the dominant influence of wake dynamics on control inputs, periodic responses, and damping levels, and wake theory generally improves the correlation.

Turbulent near-wake development behind a flat plate

An asymptotic analysis of the two-dimensional turbulent near-wake flow behind a Rat plate with sharp trailing edge has been formulated, The feature that the near-wake, which is dominated by the mixing of the oncoming turbulent boundary layers retains, to a large extent, the memory of the turbulent structure of the upstream boundary layer has been exploited to develop the analysis. This analysis leads to two regions of the near-wake flow (the inner near-wake and the outer near-wake) for which the governing equations are derived. The matching conditions among these regions lead to a logarithmic variation in the normal direction in the overlapping region surrounding the inner near-wake. These features are validated by the available experimental data. Similarity solutions for the velocity distribution (which satisfy the required matching conditions) in the inner near-wake and outer near-wake regions have been obtained by making the appropriate eddy-viscosity assumptions, Uniformly valid solutions for velocity distribution have been constructed for the near-wake. The solutions show good agreement with available experimental data. (C) Elsevier, Paris.

Turbulent near-wake studies behind an infinitely swept wing

The three-dimensional asymmetric turbulent near-Rake behind an infinitely swept wing with GAW(2) airfoil has been investigated at low speeds. The near-wake in the present study is asymmetric because the boundary layers on the top and bottom surfaces of the model develop under different streamwise pressure gradients. Distributions of mean velocity, three turbulent normal stresses, and two important Reynolds shear stresses have been measured using hot-wire anemometry. The profiles of mean velocity and Reynolds shear stress exhibit asymmetry near the trailing edge and seem to have become symmetric within a short distance of 6 trailing edge momentum thicknesses. Results of computation using K-epsilon turbulence model with a simple scheme to predict the near-wake behind the swept wing have also been presented and compared with the experimental data. The agreement of the predicted mean How development with the experiment is fair considering the simplicity of the scheme.

Optimal Sleep-Wake Scheduling for Quickest Intrusion Detection using wireless sensor Networks

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active. By using a minimal number of sensor devices,we ensure that the energy expenditure for sensing, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: 1) optimal control of Mk+1, the number of sensors in the wake state in time slot k + 1, 2) optimal control of qk+1, the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which 3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time),based on the sensor observations obtained until time slot k.Our results show that an optimum closed loop control onMk+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on Mk+1 and is maximum for the optimum open loop control on q.

An experimental study of boundary layer transition induced by a cylinder wake

Boundary layer transition induced by the wake of a circular cylinder in the free stream has been investigated using the particle image velocimetry technique. Some differences between simulation and experimental studies have been reported in the literature, and these have motivated the present study. The appearance of spanwise vortices in the early stage is further confirmed here. Lambda spanwise vortex appears to evolve into a Lambda/hairpin vortex; the flow statistics also confirm such vortices. With increasing Reynolds number, based on the cylinder diameter, and with decreasing cylinder height from the plate, the physical size of these hairpin-like structures is found to decrease. Some mean flow characteristics, including the streamwise growth of the disturbance energy, in a wake-induced transition resemble those in bypass transition induced by free stream turbulence. Streamwise velocity streaks that are eventually generated in the late stage often undergo sinuous-type oscillations. Similar to other transitional flows, an inclined shear layer in the wall-normal plane is often seen to oscillate and shed vortices. The normalized shedding frequency of these vortices, estimated from the spatial spacing and the convection velocity of these vortices, is found to be independent of the Reynolds number, similar to that in ribbon-induced transition. Although the nature of free stream disturbance in a wake-induced transition and that in a bypass transition are different, the late-stage features including the flow breakdown characteristics of these two transitions appear to be similar.

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].

Dynamics of a flexible splitter plate in the wake of a circular cylinder

Rigid splitter plates in the wake of bluff bodies are known to suppress the primary vortex shedding. In the present work, we experimentally study the problem of a flexible splitter plate in the wake of a circular cylinder. In this case, the splitter plate is free to continuously deform along its length due to the fluid forces acting on it; the flexural rigidity (EI) of the plate being an important parameter. Direct visualizations of the splitter plate motions, for very low values of flexural rigidity (EI), indicate periodic traveling wave type deformations of the splitter plate with maximum tip amplitudes of the order of I cylinder diameter. As the Reynolds number based on cylinder diameter is varied, two regimes of periodic splitter plate motions are found that are referred to as mode I and mode II, with a regime of aperiodic motions between them. The frequency of plate motions in both periodic modes is found to be close to the plane cylinder Strouhal number of about 0.2, while the average frequencies in the non-periodic regime are substantially lower. The measured normalized phase speed of the traveling wave for both periodic modes is also close to the convection speed of vortices in the plane cylinder wake. As the flexural rigidity of the plate (EI) is increased, the response of the plate was found to shift to the right when plotted with flow speed or Re. To better capture the effect of varying EI, we define and use a non-dimensional bending stiffness, K*, similar to the ones used in the flag flutter problem, K*=EI/(0.5 rho(UL3)-L-2), where U is the free-stream velocity and L is the splitter plate length. Amplitude data for different EI cases when plotted against this parameter appear to collapse on to a single curve for a given splitter plate length. Measurements of the splitter plate motions for varying splitter plate lengths indicate that plates that are substantially larger than the formation length of the plane cylinder wake have similar responses, while shorter plates show significant differences.

Effect of angle of incidence on mixed convective wake dynamics and heat transfer past a square cylinder in cross flow at Re=100

In this paper, a numerical investigation is performed to study the mixed convective flow and heat transfer characteristics past a square cylinder in cross flow at incidence. Utilizing air (Pr = 0.71) as an operating fluid, computations are carried out at a representative Reynolds number (Re) of 100. Angles of incidences are varied as, 0 degrees <= alpha <= 45 degrees. Effect of superimposed positive and negative cross-flow buoyancy is brought about by varying the Richardson number (RI) in the range -1.0 <= Ri <= 1.0. The detail features of flow topology and heat transport are analyzed critically for different angles of incidences. The thermo fluidic forces acting on the cylinder during mixed convection are captured in terms of the drag (C-D), lift (C-L), and moment (C-M) coefficients. The results show that the lateral width of the cylinder wake reduces with increasing alpha and the isotherms spread out far wide. In the range 0 degrees < alpha < 45 degrees, C-D reduces with increasing Ri. The functional dependence of C-M with Ri reveals a linear relationship. Thermal boundary layer thickness reduces with increasing angle of incidences. The global rate of heat transfer from the cylinder increases with increasing alpha. (C) 2014 Elsevier Ltd. All rights reserved.

Adaptive Sleep-Wake Control using Reinforcement Learning in Sensor Networks

The aim in this paper is to allocate the `sleep time' of the individual sensors in an intrusion detection application so that the energy consumption from the sensors is reduced, while keeping the tracking error to a minimum. We propose two novel reinforcement learning (RL) based algorithms that attempt to minimize a certain long-run average cost objective. Both our algorithms incorporate feature-based representations to handle the curse of dimensionality associated with the underlying partially-observable Markov decision process (POMDP). Further, the feature selection scheme used in our algorithms intelligently manages the energy cost and tracking cost factors, which in turn assists the search for the optimal sleeping policy. We also extend these algorithms to a setting where the intruder's mobility model is not known by incorporating a stochastic iterative scheme for estimating the mobility model. The simulation results on a synthetic 2-d network setting are encouraging.

Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks

In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-wake cycling nodes, we are interested in the local decision problem faced by a node that has ``custody'' of a packet and has to choose one among a set of next-hop relay nodes to forward the packet toward the sink. Each relay is associated with a ``reward'' that summarizes the benefit of forwarding the packet through that relay. We seek a solution to this local problem, the idea being that such a solution, if adopted by every node, could provide a reasonable heuristic for the end-to-end forwarding problem. Toward this end, we propose a local relay selection problem consisting of a forwarding node and a collection of relay nodes, with the relays waking up sequentially at random times. At each relay wake-up instant, the forwarder can choose to probe a relay to learn its reward value, based on which the forwarder can then decide whether to stop (and forward its packet to the chosen relay) or to continue to wait for further relays to wake up. The forwarder's objective is to select a relay so as to minimize a combination of waiting delay, reward, and probing cost. The local decision problem can be considered as a variant of the asset selling problem studied in the operations research literature. We formulate the local problem as a Markov decision process (MDP) and characterize the solution in terms of stopping sets and probing sets. We provide results illustrating the structure of the stopping sets, namely, the (lower bound) threshold and the stage independence properties. Regarding the probing sets, we make an interesting conjecture that these sets are characterized by upper bounds. Through simulation experiments, we provide valuable insights into the performance of the optimal local forwarding and its use as an end-to-end forwarding heuristic.

Generation of large-scale vortex dislocations in a three-dimensional wake-type flow

Numerical study of three-dimensional evolution of wake-type flow and vortex dislocations is performed by using a compact finite diffenence-Fourier spectral method to solve 3-D incompressible Navier-Stokes equations. A local spanwise nonuniformity in momentum defect is imposed on the incoming wake-type flow. The present numerical results have shown that the flow instability leads to three-dimensional vortex streets, whose frequency, phase as well as the strength vary with the span caused by the local nonuniformity. The vortex dislocations are generated in the nonuniform region and the large-scale chain-like vortex linkage structures in the dislocations are shown. The generation and the characteristics of the vortex dislocations are described in detail.

Experimental investigation on the chaotic phenomena in the wake of a natural thermal convection flow

Chaotic phenomena in the wake of thermal convection flow fields above a heating flat plate were investigated experimentally. A newly developed electron beam fluorescence technique (EBF) was used to simultaneously measure density fluctuation at 7 points in a cross section above the plate. Correlation dimensions, intermittence coefficients, Fourier spectrum have been obtained for different Grashof numbers. Spatial distribution of correlation dimensions are presented. The experimental result shows that there is a certain relationship between the density fluctuation and the Gr number. And time-spacial characteristic of chaos evolution is also given.

Structure of Vortex Dislocations in a Wake-type Flow

Structure and dynamical processes of vortex dislocations in a kind of wake-type flow are described clearly by vortex lines, which are directly constructed from data of three-dimensional direct numerical simulations of the flow evolution.

Effects of the Spanwise Characteristic Length on the Transition Feature in the Wake of a Cylinder

The transition features of the wake behind a uniform circular cylinder at Re = 200, which is just beyond the critical Reynolds number of 3-D transition, are investigated in detail by direct numerical simulations of 3-D incompressible Navier-Stokes equations. The spanwise characteris-tic length determines the transition features and global properties of the wake.