Neighbor oblivious link reversal over duty-cycled WSNs

We propose partial and full link reversal algorithms to bypass voids during geographic routing over duty-cycled wireless sensor networks. We propose a distributed approach that is oblivious to one-hop neighbor information. Upon termination of the algorithm, the resulting network is guaranteed to be destination-oriented. Further, to reduce the delays incurred under reactive link reversal, we propose the use of `pseudo-events', a preemptive link reversal strategy, that renders the network destination-oriented before the onset of a real event. A simulation study of the effectiveness of pseudo-events is also provided.

Precoding by Pairing Subchannels to Increase MIMO Capacity With Discrete Input Alphabets

We consider Gaussian multiple-input multiple-output (MIMO) channels with discrete input alphabets. We propose a non-diagonal precoder based on the X-Codes in 1] to increase the mutual information. The MIMO channel is transformed into a set of parallel subchannels using singular value decomposition (SVD) and X-Codes are then used to pair the subchannels. X-Codes are fully characterized by the pairings and a 2 x 2 real rotation matrix for each pair (parameterized with a single angle). This precoding structure enables us to express the total mutual information as a sum of the mutual information of all the pairs. The problem of finding the optimal precoder with the above structure, which maximizes the total mutual information, is solved by: i) optimizing the rotation angle and the power allocation within each pair and ii) finding the optimal pairing and power allocation among the pairs. It is shown that the mutual information achieved with the proposed pairing scheme is very close to that achieved with the optimal precoder by Cruz et al., and is significantly better than Mercury/waterfilling strategy by Lozano et al. Our approach greatly simplifies both the precoder optimization and the detection complexity, making it suitable for practical applications.

Evaluation of bearing capacity improvement using composite grids

Recently, composite reinforcements in which combinations of materials and material forms such as strips, grids, and strips and anchors, depending on requirements have proven to be effective in various ground improvement applications. Composite geogrids studied in this paper belong to the category of composite reinforcements and are useful for bearing capacity improvement. The paper presents evaluation of results of bearing capacity tests conducted oil a composite geogrid, made of composite reinforcement consisting of steel and cement mortar. The study shows that the behavior of composite reinforcements follows the general trends observed in the case of conventional geogrids, with reference to the depth of first layer below the footing, number of layers of reinforcement, and vertical spacing of the reinforcement. Results show that the performance is comparable to that of a conventional polymer geogrid.

Seismic bearing capacity factors for spread foundations

The effect of horizontal earthquake body forces on the bearing capacity of foundations has been examined computationally in a rigorous manner by employing the method of stress characteristics. The bearing capacity factors N-c, N-q and N-y, due to the components of soil cohesion, ground surcharge pressure and soil unit weight respectively, have been plotted as a function of earthquake acceleration coefficient (a(h)) for different values of soil friction angle (phi). The inclusion of earthquake body forces causes a considerable reduction in the bearing capacity factors. The bearing capacity factors N-c and N-q are seen to be approximately of the same magnitude as those reported in the literature on the basis of different solution methods. However, the obtained values of N-y are found to be significantly smaller than the available results. The nature of the pressure distribution along the footing base and the geometry of the observed failure patterns vary with the consideration of earthquake body forces.

Seismic horizontal pullout capacity of vertical anchors in sands

The problem of finding the horizontal pullout capacity of vertical anchors embedded in sands with the inclusion of pseudostatic horizontal earthquake body forces, was tackled in this note. The analysis was carried out using an upper bound limit analysis, with the consideration of two different collapse mechanisms: bilinear and composite logarithmic spiral rupture surfaces. The results are presented in nondimensional form to find the pullout resistance with changes in earthquake acceleration for different combinations of embedment ratio of the anchor (lambda), friction angle of the soil (phi), and the anchor-soil interface wall friction angle (delta). The pullout resistance decreases quite substantially with increases in the magnitude of the earthquake acceleration. For values of delta up to about 0.25-0.5phi, the bilinear and composite logarithmic spiral rupture surfaces gave almost identical answers, whereas for higher values of delta, the choice of the logarithmic spiral provides significantly smaller pullout resistance. The results compare favorably with the existing theoretical data.

Analysis of link-layer backoff schemes on point-to-point Markov fading links

Backoff algorithms are typically employed in multiple-access networks (e.g., Ethernet) to recover from packet collisions. In this letter, we propose and carry out the analysis for three types of link-layer backoff schemes, namely, linear backoff, exponential backoff, and geometric backoff, on point-to-point wireless fading links where packet errors occur nonindependently. In such a scenario, the backoff schemes are shown to achieve better energy efficiency without compromising much on the link layer throughput performance.

Experimental investigation of link between growth and decay of fiber Bragg gratings

We report here an experimental investigation for establishing and quantifying a link between the growth and decay characteristics of fiber Bragg gratings. One of the key aspects of our work is the determination of the defect energy distribution from the grating characteristics measured during their fabrication. We observe a strong correlation between the growth-based defect energy distribution and that obtained through accelerated aging experiments, paving the way for predicting the decay characteristics of fiber Bragg gratings from their growth data. Such a prediction is significant in simplifying the postfabrication steps required to enhance the thermal stability of fiber Bragg gratings. (c) 2011 Optical Society of America

Finite Signal-set Capacity of Two-user Gaussian Multiple Access Channel

The capacity region of a two-user Gaussian Multiple Access Channel (GMAC) with complex finite input alphabets and continuous output alphabet is studied. When both the users are equipped with the same code alphabet, it is shown that, rotation of one of the user’s alphabets by an appropriate angle can make the new pair of alphabets not only uniquely decodable, but will result in enlargement of the capacity region. For this set-up, we identify the primary problem to be finding appropriate angle(s) of rotation between the alphabets such that the capacity region is maximally enlarged. It is shown that the angle of rotation which provides maximum enlargement of the capacity region also minimizes the union bound on the probability of error of the sumalphabet and vice-verse. The optimum angle(s) of rotation varies with the SNR. Through simulations, optimal angle(s) of rotation that gives maximum enlargement of the capacity region of GMAC with some well known alphabets such as M-QAM and M-PSK for some M are presented for several values of SNR. It is shown that for large number of points in the alphabets, capacity gains due to rotations progressively reduce. As the number of points N tends to infinity, our results match the results in the literature wherein the capacity region of the Gaussian code alphabet doesn’t change with rotation for any SNR.

End-bearing capacity of driven piles in sand using the stress characteristics method: analysis and implementation

The method of stress characteristics has been employed to compute the end-bearing capacity of driven piles. The dependency of the soil internal friction angle on the stress level has been incorporated to achieve more realistic predictions for the end-bearing capacity of piles. The validity of the assumption of the superposition principle while using the bearing capacity equation based on soil plasticity concepts, when applied to deep foundations, has been examined. Fourteen pile case histories were compiled with cone penetration tests (CPT) performed in the vicinity of different pile locations. The end-bearing capacity of the piles was computed using different methods, namely, static analysis, effective stress approach, direct CPT, and the proposed approach. The comparison between predictions made by different methods and measured records shows that the stress-level-based method of stress characteristics compares better with experimental data. Finally, the end-bearing capacity of driven piles in sand was expressed in terms of a general expression with the addition of a new factor that accounts for different factors contributing to the bearing capacity. The influence of the soil nonassociative flow rule has also been included to achieve more realistic results.

A Multilevel inverter structure with cascaded two level and three level inverters for IM drive with CMV elimination and DC link capacitor voltage balancing

Common mode voltage (CMV) variations in PWM inverter-fed drives generate unwanted shaft and bearing current resulting in early motor failure. Multilevel inverters reduce this problem to some extent, with higher number of levels. But the complexity of the power circuit increases with an increase in the number of inverter voltage levels. In this paper a five-level inverter structure is proposed for open-end winding induction motor (IM) drives, by cascading only two conventional two-level and three-level inverters, with the elimination of the common mode voltage over the entire modulation range. The DC link power supply requirement is also optimized by means of DC link capacitor voltage balancing, with PWM control, using only inverter switching state redundancies. The proposed power circuit gives a simple power bus structure.

Pricing a Shared Access Link for Fair and Efficient Operation with Variable User Data Rates

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data; this leads to variable user data rates. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. User preferences are modelled by concave increasing utility functions. Further, we introduce two additional elements: a convex increasing disutility function and a convex increasing multiplicative congestion-penally function. The disutility function takes the shortfall (contracted rate minus present rate) as its argument, and essentially encourages users to send traffic at their contracted rates, while the congestion-penalty function discourages heavy users from sending excess data when the link is congested. We obtain simple necessary and sufficient conditions on prices for fair and efficient link sharing; moreover, we show that a single price for all users achieves this. We illustrate the ideas using a simple experiment.

Resource Pricing for Fair and Efficient Link Sharing with a Finite Data Model

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. We obtain simple necessary and sufficient conditions on prices such that efficient and fair link sharing is possible. We illustrate the ideas using a simple example

Capacity Optimizing Hop Distance in a Mobile Ad Hoc Network with Power Control

In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a certain throughput measure in bit-metres/sec, subject to average network power constraints. The mobility of nodes is restricted to a circular periphery area centered at the nominal location of nodes. We incorporate only randomly varying path-loss characteristics of channel gain due to the random motion of nodes, excluding any multi-path fading or shadowing effects. Computation of the throughput metric in such a scenario leads us to compute the probability density function of random distance between points in two circles. Using numerical analysis we discover that choosing the nearest node as next hop is not always optimal. Optimal throughput performance is also attained at non-trivial hop distances depending on the available average network power.