Utilization bounds for RM scheduling on uniform multiprocessors

Utilization bounds for Earliest Deadline First(EDF) and Rate Monotonic(RM) scheduling are known and well understood for uniprocessor systems. In this paper, we derive limits on similar bounds for the multiprocessor case, when the individual processors need not be identical. Tasks are partitioned among the processors and RM scheduling is assumed to be the policy used in individual processors. A minimum limit on the bounds for a 'greedy' class of algorithms is given and proved, since the actual value of the bound depends on the algorithm that allocates the tasks. We also derive the utilization bound of an algorithm which allocates tasks in decreasing order of utilization factors. Knowledge of such bounds allows us to carry out very fast schedulability tests although we are constrained by the fact that the tests are sufficient but not necessary to ensure schedulability.

High Rate Capability of a Dual-Porosity LiFePO4/C Composite

Mesoporous intercalation compounds consisting of two differentdistributions of pores represent a potentially attractive material for high-rate cathodes. A mesoporous LiFePO4/C composite with two sizes of pores is prepared for the first time via a solution-based polymer templating technique. The precursor of the LiFePO4/C composite is heated at different temperatures in the range from 600 to 800 degrees C to study the effect of crystallinity, porosity, and morphology on the electrochemical performance. The composite is found to attain reduction in the surface area, carbon content, and porosity upon increasing temperature. Nonetheless, the composite prepared at 700 degrees C with pore-size distributions of around 4 and 50 nm exhibits a high rate capability and stable capacity retention upon cycling.

Rate Control State-of-the-art Survey

The majority of Internet traffic use Transmission Control Protocol (TCP) as the transport level protocol. It provides a reliable ordered byte stream for the applications. However, applications such as live video streaming place an emphasis on timeliness over reliability. Also a smooth sending rate can be desirable over sharp changes in the sending rate. For these applications TCP is not necessarily suitable. Rate control attempts to address the demands of these applications. An important design feature in all rate control mechanisms is TCP friendliness. We should not negatively impact TCP performance since it is still the dominant protocol. Rate Control mechanisms are classified into two different mechanisms: window-based mechanisms and rate-based mechanisms. Window-based mechanisms increase their sending rate after a successful transfer of a window of packets similar to TCP. They typically decrease their sending rate sharply after a packet loss. Rate-based solutions control their sending rate in some other way. A large subset of rate-based solutions are called equation-based solutions. Equation-based solutions have a control equation which provides an allowed sending rate. Typically these rate-based solutions react slower to both packet losses and increases in available bandwidth making their sending rate smoother than that of window-based solutions. This report contains a survey of rate control mechanisms and a discussion of their relative strengths and weaknesses. A section is dedicated to a discussion on the enhancements in wireless environments. Another topic in the report is bandwidth estimation. Bandwidth estimation is divided into capacity estimation and available bandwidth estimation. We describe techniques that enable the calculation of a fair sending rate that can be used to create novel rate control mechanisms.

Use of wetland buffer areas to reduce nitrogen transport from forested catchments: Retention capacity, emissions of N2O and CH4 and vegetation composition dynamics

The use of buffer areas in forested catchments has been actively researched during the last 15 years; but until now, the research has mainly concentrated on the reduction of sediment and phosphorus loads, instead of nitrogen (N). The aim of this thesis was to examine the use of wetland buffer areas to reduce the nitrogen transport in forested catchments and to investigate the environmental impacts involved in their use. Besides the retention capacity, particular attention was paid to the main factors contributing to the N retention, the potential for increased N2O emissions after large N loading, the effects of peatland restoration for use as buffer areas on CH4 emissions, as well as the vegetation composition dynamics induced by the use of peatlands as buffer areas. To study the capacity of buffer areas to reduce N transport in forested catchments, we first used large artificial loadings of N, and then studied the capacity of buffer areas to reduce ammonium (NH4-N) export originating from ditch network maintenance areas in forested catchments. The potential for increased N2O emissions were studied using the closed chamber technique and a large artificial N loading at five buffer areas. Sampling for CH4 emissions and methane-cycling microbial populations were done on three restored buffer areas and on three buffers constructed on natural peatlands. Vegetation composition dynamics was studied at three buffer areas between 1996 and 2009. Wetland buffer areas were efficient in retaining inorganic N from inflow. The key factors contributing to the retention were the size and the length of the buffer, the hydrological loading and the rate of nutrient loading. Our results show that although the N2O emissions may increase temporarily to very high levels after a large N loading into the buffer area, the buffer areas in forested catchments should be viewed as insignificant sources of N2O. CH4 fluxes were substantially higher from buffers constructed on natural peatlands than from the restored buffer areas, probably because of the slow recovery of methanogens after restoration. The use of peatlands as buffer areas was followed by clear changes in plant species composition and the largest changes occurred in the upstream parts of the buffer areas and the wet lawn-level surfaces, where the contact between the vegetation and the through-flow waters was closer than for the downstream parts and dry hummock sites. The changes in the plant species composition may be an undesired phenomenon especially in the case of the mires representing endangered mire site types, and therefore the construction of new buffer areas should be primarily directed into drained peatland areas.

Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna Systems

For an n(t) transmit, n(r) receive antenna system (n(t) x nr system), a full-rate space time block code (STBC) transmits min(n(t), n(r)) complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for 4 transmit antennas and any n(r), with reduced ML-decoding complexity is presented. The weight matrices of the proposed STBC are obtained from the unitary matrix representations of a Clifford Algebra. By puncturing the symbols of the STBC, full rate designs can be obtained for n(r) < 4. For any value of n(r), the proposed design offers the least ML-decoding complexity among known codes. The proposed design is comparable in error performance to the well known Perfect code for 4 transmit antennas while offering lower ML-decoding complexity. Further, when n(r) < 4, the proposed design has higher ergodic capacity than the punctured Perfect code. Simulation results which corroborate these claims are presented.

High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance

Large MIMO systems with tens of antennas in each communication terminal using full-rate non-orthogonal space-time block codes (STBC) from Cyclic Division Algebras (CDA) can achieve the benefits of both transmit diversity as well as high spectral efficiencies. Maximum-likelihood (ML) or near-ML decoding of these large-sized STBCs at low complexities, however, has been a challenge. In this paper, we establish that near-ML decoding of these large STBCs is possible at practically affordable low complexities. We show that the likelihood ascent search (LAS) detector, reported earlier by us for V-BLAST, is able to achieve near-ML uncoded BER performance in decoding a 32x32 STBC from CDA, which employs 32 transmit antennas and sends 32(2) = 1024 complex data symbols in 32 time slots in one STBC matrix (i.e., 32 data symbols sent per channel use). In terms of coded BER, with a 16x16 STBC, rate-3/4 turbo code and 4-QAM (i.e., 24 bps/Hz), the LAS detector performs close to within just about 4 dB from the theoretical MIMO capacity. Our results further show that, with LAS detection, information lossless (ILL) STBCs perform almost as good as full-diversity ILL (FD-ILL) STBCs. Such low-complexity detectors can potentially enable implementation of high spectral efficiency large MIMO systems that could be considered in wireless standards.

Traffic Profiling for Efficient Network Resource Utilization.

Traffic Engineering has been the prime concern for Internet Service Providers (ISPs), with the main focus being minimization of over-utilization of network capacity even though additional capacity is available which is under-utilized, Furthermore, requirements of timely delivery of digitized audiovisual information raises a new challenge of finding a path meeting these requirements. This paper addresses the issue of (a) distributing load to achieve global efficiency in resource utilization. (b) Finding a path satisfying the real time requirements of, delay and bandwidth requested by the applications. In this paper we do a critical study of the link utilization that varies over time and determine the time interval during which the link occupancy remains constant across days. This information helps in pre-determining link utilization that is useful in balancing load in the network Finally, we run simulations that use a dynamic time interval for profiling traffic and show improvement in terms number of calls admitted/blocked.

High Rate Capability Lithium Iron Phosphate Wired by Carbon Nanotubes and Galvanostatic Transformed to Graphitic Carbon

Lithium iron phosphate (LiFePO4) electronically wired by multi-walled carbon nanotubes (MWCNTs) and in-situ transformed graphitic carbon for lithium-ion batteries are discussed here. Presence of MWCNTs up to a maximum of 0.5% in porous LiFePO4 (abbreviated as LFP-CNT) resulted in remarkable reversible cyclability and rate capability compared to LFP coated with highly disordered carbon (abbreviated as LFP-C). In the current range (30-1500) mAg(-1), specific capacity of LFP-CNT (approximate to 150-50 mAhg(-1)) is observed to be always higher compared to LFP-C (approximate to 120-0 mAhg(-1)). At higher currents of 250-1500 mAg(-1) LFP-C performed poorly compared to LFP-CNT. LFP-C showed considerable decay in capacity with increase in cycle number at intermediate high currents (approximate to 250 mAg(-1)) whereas at very high currents (approximate to 750 mAg(-1)) it is nearly zero. The LFP-CNT showed no such detrimental behavior in battery performance. The exemplary performance of the LFP-CNT is attributed to combination of both enhanced LFP structural stability, as revealed by Raman spectra and formation of an efficient percolative network of carbon nanotubes which during the course of galvanostatic cycling gets gradually transformed to graphitic carbon. (C) 2012 The Electrochemical Society. [DOI: 10.1149/2.015204jes] All rights reserved.

Increasing System Capacity in Uplink Multiuser MIMO Using Sparsity Exploiting Receiver

In multiuser communication on the uplink, all subscribed users may not be active simultaneously. This leads to sparsity in the activity pattern in the users' transmissions, which can be exploited in the multiuser MIMO receiver at the base station (BS). Because of no transmissions from inactive users, joint detection at the BS has to consider an augmented signal set that includes zero. In this paper, we propose a receiver that exploits this inactivity-induced sparsity and considers the zero-augmented signal set. The proposed receiver is based on Markov Chain Monte Carlo techniques. Near-optimal performance and increased system capacity (in terms of number of users in the system) are demonstrated. For example, a multiuser MIMO system with N = 32 receive antennas at the BS and an user activity factor of 0.2 supports 51 uplink users meeting a QoS of 10(-3) coded bit error rate.

Diversity-Rate Trade-off for Fading Channels with Power Control

We consider a complex, additive, white Gaussian noise channel with flat fading. We study its diversity order vs transmission rate for some known power allocation schemes. The capacity region is divided into three regions. For one power allocation scheme, the diversity order is exponential throughout the capacity region. For selective channel inversion (SCI) scheme, the diversity order is exponential in low and high rate region but polynomial in mid rate region. For fast fading case we also provide a new upper bound on block error probability and a power allocation scheme that minimizes it. The diversity order behaviour of this scheme is same as for SCI but provides lower BER than the other policies.

Capacity of fading gaussian channel with an energy harvesting sensor node

Network life time maximization is becoming an important design goal in wireless sensor networks. Energy harvesting has recently become a preferred choice for achieving this goal as it provides near perpetual operation. We study such a sensor node with an energy harvesting source and compare various architectures by which the harvested energy is used. We find its Shannon capacity when it is transmitting its observations over a fading AWGN channel with perfect/no channel state information provided at the transmitter. We obtain an achievable rate when there are inefficiencies in energy storage and the capacity when energy is spent in activities other than transmission.

Information capacity of energy harvesting sensor nodes

Sensor nodes with energy harvesting sources are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting `green communication'. We study such a sensor node with an energy harvesting source and compare various architectures by which the harvested energy is used. We find its Shannon capacity when it is transmitting its observations over an AWGN channel and show that the capacity achieving energy management policies are related to the throughput optimal policies. We also obtain the capacity when energy conserving sleep-wake modes are supported and an achievable rate for the system with inefficiencies in energy storage.

On the capacity of quantized gaussian MAC channels with finite input alphabet

In this paper, we investigate the achievable rate region of Gaussian multiple access channels (MAC) with finite input alphabet and quantized output. With finite input alphabet and an unquantized receiver, the two-user Gaussian MAC rate region was studied. In most high throughput communication systems based on digital signal processing, the analog received signal is quantized using a low precision quantizer. In this paper, we first derive the expressions for the achievable rate region of a two-user Gaussian MAC with finite input alphabet and quantized output. We show that, with finite input alphabet, the achievable rate region with the commonly used uniform receiver quantizer has a significant loss in the rate region compared. It is observed that this degradation is due to the fact that the received analog signal is densely distributed around the origin, and is therefore not efficiently quantized with a uniform quantizer which has equally spaced quantization intervals. It is also observed that the density of the received analog signal around the origin increases with increasing number of users. Hence, the loss in the achievable rate region due to uniform receiver quantization is expected to increase with increasing number of users. We, therefore, propose a novel non-uniform quantizer with finely spaced quantization intervals near the origin. For a two-user Gaussian MAC with a given finite input alphabet and low precision receiver quantization, we show that the proposed non-uniform quantizer has a significantly larger rate region compared to what is achieved with a uniform quantizer.

Full-rate full-diversity achieving MIMO precoding with partial CSIT

In this paper, we consider a slow-fading nt ×nr multiple-input multiple-output (MIMO) channel subjected to block fading. Reliability (in terms of achieved diversity order) and rate (in number of symbols transmitted per channel use) are of interest in such channels. We propose a new precoding scheme which achieves both full diversity (nt ×nrth order diversity) as well as full rate (nt symbols per channel use) using partial channel state information at the transmitter (CSIT). The proposed scheme achieves full diversity and improved coding gain through an optimization over the choice of constellation sets. The optimization maximizes dmin2 for our precoding scheme subject to an energy constraint. The scheme requires feedback of nt - 1 angle parameter values, compared to 2ntnr real coefficients in case of full CSIT. Further, for the case of nt × 1 system, we prove that the capacity achieved by the proposed scheme is same as that achieved with full CSIT. Error rate performance results for nt = 3,4,8 show that the proposed scheme performs better than other precoding schemes in the literature; the better performance is due to the choice of the signal sets and the feedback angles in the proposed scheme.

Bearing capacity of piles in soft clay underlaid by cohesive frictional soil

By using the axisymmetric quasi-lower bound finite-element limit analysis, the bearing capacity factors N-c(p) and N-gamma q(p) have been computed for axially loaded piles, with the shaft embedded in a fully cohesive soil medium and the tip placed over cohesive frictional soil strata. The results were obtained for various combinations of L/D, phi(l), and c(l)/c(u); the subscripts l and u refer to lower and upper soil strata, respectively. The factors N-c(p) and N-gamma q(p) increase continuously with increases in L/D and phi(l); the rate of increase of N-c(p) and N-gamma q(p) with L/D, however, decreases with an increase in L/D. For c(l)/c(u) > 100, the factor N-c(p) hardly depends on L/D.