Analytical models for capacity estimation of IEEE 802.11 WLANs using DCF for internet applications

We provide analytical models for capacity evaluation of an infrastructure IEEE 802.11 based network carrying TCP controlled file downloads or full-duplex packet telephone calls. In each case the analytical models utilize the attempt probabilities from a well known fixed-point based saturation analysis. For TCP controlled file downloads, following Bruno et al. (In Networking '04, LNCS 2042, pp. 626-637), we model the number of wireless stations (STAs) with ACKs as a Markov renewal process embedded at packet success instants. In our work, analysis of the evolution between the embedded instants is done by using saturation analysis to provide state dependent attempt probabilities. We show that in spite of its simplicity, our model works well, by comparing various simulated quantities, such as collision probability, with values predicted from our model. Next we consider N constant bit rate VoIP calls terminating at N STAs. We model the number of STAs that have an up-link voice packet as a Markov renewal process embedded at so called channel slot boundaries. Analysis of the evolution over a channel slot is done using saturation analysis as before. We find that again the AP is the bottleneck, and the system can support (in the sense of a bound on the probability of delay exceeding a given value) a number of calls less than that at which the arrival rate into the AP exceeds the average service rate applied to the AP. Finally, we extend the analytical model for VoIP calls to determine the call capacity of an 802.11b WLAN in a situation where VoIP calls originate from two different types of coders. We consider N-1 calls originating from Type 1 codecs and N-2 calls originating from Type 2 codecs. For G711 and G729 voice coders, we show that the analytical model again provides accurate results in comparison with simulations.

Optimal sleep-wake scheduling for quickest intrusion detection using 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 on Mk+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 analytical model for the capacity estimation of combined VoIP and TCP file transfers over EDCA in an IEEE 802.11e WLAN

In this paper we develop and numerically explore the modeling heuristic of using saturation attempt probabilities as state dependent attempt probabilities in an IEEE 802.11e infrastructure network carrying packet telephone calls and TCP controlled file downloads, using Enhanced Distributed Channel Access (EDCA). We build upon the fixed point analysis and performance insights in [1]. When there are a certain number of nodes of each class contending for the channel (i.e., have nonempty queues), then their attempt probabilities are taken to be those obtained from saturation analysis for that number of nodes. Then we model the system queue dynamics at the network nodes. With the proposed heuristic, the system evolution at channel slot boundaries becomes a Markov renewal process, and regenerative analysis yields the desired performance measures.The results obtained from this approach match well with ns2 simulations. We find that, with the default IEEE 802.11e EDCA parameters for AC 1 and AC 3, the voice call capacity decreases if even one file download is initiated by some station. Subsequently, reducing the voice calls increases the file download capacity almost linearly (by 1/3 Mbps per voice call for the 11 Mbps PHY).

Performance analysis of a slotted-ALOHA protocol on a capture channel with fading

We consider the slotted ALOHA protocol on a channel with a capture effect. There are M slot, i packets are transmitted, then the probability of a successful reception of a packet is q(i). This model contains the CDMA protocols as special cases. We obtain sufficient rate conditions, which are close to necessary for stability of the system, when the arrival streams are stationary ergodic. Under the same rate conditions, for general regenerative arrival streams, we obtain the rates of convergence to stationarity, finiteness of stationary moments and various functional limit theorems. Our arrival streams contain all the traffic models suggested in the recent literature, including the ones which display long range dependence. We also obtain bounds on the stationary moments of waiting times which can be tight under realistic conditions. Finally, we obtain several results on the transient performance of the system, e.g., first time to overflow and the limits of the overflow process. We also extend the above results to the case of a capture channel exhibiting Markov modulated fading. Most of our results and proofs will be shown to hold also for the slotted ALOHA protocol without capture.

IPCC:accomplishments,controversies and challenges

The Intergovernmental Panel on Climate Change (IPCC) has successfully produced four assessment reports since 1990 along with a number of special reports and greenhouse gas inventory guidelines. It has very rigorous and robust procedures and guidelines for preparing the assessment reports largely based on synthesis of peer-reviewed and published scientific literature. IPCC has attracted controversy since the Second Assessment Report of 1995. The recent controversies surrounding the IPCC reports surfaced nearly two years after the release of the report in 2007, especially in the wake of the crucial Copenhagen Climate Convention. Many of the controversies can be traced to the use of information sourced from reports published outside the scientific journals such as reports of the World Wildlife Fund. It is true that there are a few errors in the IPCC reports, which may have escaped the multilayered rigorous review process. Many of the errors found in the main reports, which are over a thousand page each, have not been quoted in the crucial and most referred Summary for Policy Makers. IPCC may have to develop a more robust policy for sourcing literature published outside the scientific journals. The United Nations Secretary General has requested the prestigious Inter-Academy Council to review the IPCC principles, procedures and guidelines. The controversies raised in the recent past do not in any way change the main conclusions of the IPCC Assessment Report.

Accelerating Waves in Polar Coronal Holes as Seen by EIS and SUMER

We present EIS/Hinode and SUMER/SOHO observations of propagating disturbances detected in coronal lines in inter-plume and plume regions of a polar coronal hole. The observation was carried out on 2007 November 13 as part of the JOP196/HOP045 program. The SUMER spectroscopic observation gives information about fluctuations in radiance and on both resolved (Doppler shift) and unresolved (Doppler width) line-of-sight velocities, whereas EIS 40 `'wide slot images detect fluctuations only in radiance but maximize the probability of overlapping field of view between the two instruments. From distance-time radiance maps, we detect the presence of propagating waves in a polar inter-plume region with a period of 15-20 minutes and a propagation speed increasing from 130 +/- 14 km s(-1) just above the limb to 330 +/- 140 km s(-1) around 160 `' above the limb. These waves can be traced to originate from a bright region of the on-disk part of the coronal hole where the propagation speed is in the range of 25 +/- 1.3 to 38 +/- 4.5 km s(-1), with the same periodicity. These on-disk bright regions can be visualized as the base of the coronal funnels. The adjacent plume region also shows the presence of propagating disturbances with the same range of periodicity but with propagation speeds in the range of 135 +/- 18 to 165 +/- 43 km s(-1) only. A comparison between the distance-time radiance map of the two regions indicates that the waves within the plumes are not observable (may be getting dissipated) far off-limb, whereas this is not the case in the inter-plume region. A correlation analysis was also performed to find out the time delay between the oscillations at several heights in the off-limb region, finding results consistent with those from the analysis of the distance-timemaps. To our knowledge, this result provides first spectroscopic evidence of the acceleration of propagating disturbances in the polar region close to the Sun (within 1.2 R/R-circle dot), which provides clues to the understanding of the origin of these waves. We suggest that the waves are likely either Alfvenic or fast magnetoacoustic in the inter-plume region and slow magnetoacoustic in the plume region. This may lead to the conclusion that inter-plumes are a preferred channel for the acceleration of the fast solar wind.

Improved prediction of plane transverse jets in supersonic crossflows

THE flowfield due to transverse injection of a round sonic jet into a supersonic flowis a configuration of interest in the design of supersonic combustors or thrust vector control of supersonic jets. The flow is also of fundamental interest because it presents separation from a smooth surface, embedded subsonic regions, curved shear layers, strong shocks, an unusual development of the injected jet into a kidney-shaped streamwise vortex pair, and a wake behind the jet. Although the geometry is simple, the flow is complex and is a good candidate for assessing the behavior of turbulence models for high-speed flow, beginning with the corresponding two-dimensional flow shown in Fig. 1. At the slot, an underexpanded sonic jet expands rapidly into the supersonic crossflow. Expansion waves reflect at the jet boundary, coalesce, and give rise to a Mach surface (Mach disk for round jets).

Optimal Sleep-Wake Policies for an Energy Harvesting Sensor Node

We study a sensor node with an energy harvesting source. In any slot,the sensor node is in one of two modes: Wake or Sleep. The generated energy is stored in a buffer. The sensor node senses a random field and generates a packet when it is awake. These packets are stored in a queue and transmitted in the wake mode using the energy available in the energy buffer. We obtain energy management policies which minimize a linear combination of the mean queue length and the mean data loss rate. Then, we obtain two easily implementable suboptimal policies and compare their performance to that of the optimal policy. Next, we extend the Throughput Optimal policy developed in our previous work to sensors with two modes. Via this policy, we can increase the through put substantially and stabilize the data queue by allowing the node to sleep in some slots and to drop some generated packets. This policy requires minimal statistical knowledge of the system. We also modify this policy to decrease the switching costs.

High selectivity miniaturized broadband filter

Design of a compact broadband filter using tightly coupled line sections in defected (A slot is cut in the ground) microstrip medium operating from 3 1-6 8 GHz has been repotted in this article Filter has been designed and analyzed using an equivalent circuit model based on even and odd mock parameters of coupled line sections The proposed filter has attenuation poles on either side of the pass band resulting in improved selectivity This filter features spurious free response up to third harmonic frequency Experimental results of the filter have been validated against the analytical and full wave simulations (C) 2010 Wiley Periodicals Inc Microwave Opt Technol Lett 53 184-187 2011 View this article online at wileyonlinelibrary com DOI 10.1002/mop.25676

Past Queue Length Based Low-Overhead Link Scheduling in Multi-beam Wireless Mesh Networks

Wireless mesh networks with multi-beam capability at each node through the use of multi-antenna beamforming are becoming practical and attracting increased research attention. Increased capacity due to spatial reuse and increased transmission range are potential benefits in using multiple directional beams in each node. In this paper, we are interested in low-complexity scheduling algorithms in such multi-beam wireless networks. In particular, we present a scheduling algorithm based on queue length information of the past slots in multi-beam networks, and prove its stability. We present a distributed implementation of this proposed algorithm. Numerical results show that significant improvement in delay performance is achieved using the proposed multi-beam scheduling compared to omni-beam scheduling. In addition, the proposed algorithm is shown to achieve a significant reduction in the signaling overhead compared to a current slot queue length approach.

Power Management and Data Rate Maximization in Wireless Energy Harvesting Sensors

This paper considers the problem of power management and throughput maximization for energy neutral operation when using Energy Harvesting Sensors (EHS) to send data over wireless links. It is assumed that the EHS are designed to transmit data at a constant rate (using a fixed modulation and coding scheme) but are power-controlled. A framework under which the system designer can optimize the performance of EHS when the channel is Rayleigh fading is developed. For example, the highest average data rate that can be supported over a Rayleigh fading channel given the energy harvesting capability, the battery power storage efficiency and the maximum allowed transmit energy per slot is derived. Furthermore, the optimum transmission scheme that guarantees a particular data throughput is derived. The usefulness of the framework developed is illustrated through simulation results for specific examples.

On the improvement of chimney weirs

This paper is devoted to the improvement in the range of operation (linearity range) of chimney weir (consisting of a rectangular weir or vertical slot over an inward trapezium), A new and more elegant optimization procedure is developed to analyse the discharge-head relationship in the weir. It is shown that a rectangular weir placed over an inverted V-notch of depth 0.90d gives the maximum operating range, where d is the overall depth of the inward trapezoidal weir (from the crest to the vertex). For all flows in the rectangular portion, the discharge is proportional to the linear power of the head, h, measured above a reference plane located at 0.292d below the weir crest, in the range 0.90d less than or equal to h less than or equal to 7.474: within a maximum error of +/-1.5% from the theoretical discharge. The optimum range of operation of the newly designed weir is 200% greater than that in the chimney weir designed by Keshava Murthy and Giridhar, and is nearly 950% greater than that in the inverted V-notch. Experiments with two weirs having half crest widths of 0.10 and 0.12 m yield a constant average coefficient of discharge of 0.634 and confirm the theory. The application of the weir in the design of rectangular grit chamber outlet is emphasized, in that the datum for the linear discharge-head relationship is below the crest level of the weir.

Providing quality of service via opportunistic splitting using stochastic approximation

We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Opportunistic splitting for scheduling via stochastic approximation

We consider the problem of scheduling a wireless channel among multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Turbulence measurements in an ‘equilibrium’ axisymmetric wall jet Journal

This paper reports measurements of turbulent quantities in an axisymmetric wall jet subjected to an adverse pressure gradient in a conical diffuser, in such a way that a suitably defined pressure-gradient parameter is everywhere small. Self-similarity is observed in the mean velocity profile, as well as the profiles of many turbulent quantities at sufficiently large distances from the injection slot. Autocorrelation measurements indicate that, in the region of turbulent production, the time scale of ν fluctuations is very much smaller than the time scale of u fluctuations. Based on the data on these time scales, a possible model is proposed for the Reynolds stress. One-dimensional energy spectra are obtained for the u, v and w components at several points in the wall jet. It is found that self-similarity is exhibited by the one-dimensional wavenumber spectrum of $\overline{q^2}(=\overline{u^2}+\overline{v^2}+\overline{w^2})$, if the half-width of the wall jet and the local mean velocity are used for forming the non-dimensional wavenumber. Both the autocorrelation curves and the spectra indicate the existence of periodicity in the flow. The rate of dissipation of turbulent energy is estimated from the $\overline{q^2}$ spectra, using a slightly modified version of a previously suggested method.