Interference planning for multicell OFDM downlink

In this paper we consider the downlink of an OFDM cellular system. The objective is to maximise the system utility by means of fractional frequency reuse and interference planning. The problem is a joint scheduling and power allocation problem. Using gradient scheduling scheme, the above problem is transformed to a problem of maximising weighted sum-rate at each time slot. At each slot, an iterative scheduling and power allocation algorithm is employed to address the weighted sum-rate maximisation problem. The power allocation problem in the above algorithm is a nonconvex optimisation problem. We study several algorithms that can tackle this part of the problem. We propose two modifications to the above algorithms to address practical and computational feasibility. Finally, we compare the performance of our algorithm with some existing algorithms based on certain achieved system utility metrics. We show that the practical considerations do not affect the system performance adversely.

Tradeoff of average power and average delay for a point-to-point link with fading

We consider a discrete time system with packets arriving randomly at rate lambda per slot to a fading point-to-point link, for which the transmitter can control the number of packets served in a slot by varying the transmit power. We provide an asymptotic characterization of the minimum average delay of the packets, when average transmitter power is a small positive quantity V more than the minimum average power required for queue stability. We show that the minimum average delay will grow either as log (1/V) or 1/V when V down arrow 0, for certain sets of values of lambda. These sets are determined by the distribution of fading gain, the maximum number of packets which can be transmitted in a slot, and the assumed transmit power function, as a function of the fading gain and the number of packets transmitted. We identify a case where the above behaviour of the tradeoff differs from that obtained from a previously considered model, in which the random queue length process is assumed to evolve on the non-negative real line.

Transmit Power Control Policies for Energy Harvesting Sensors With Retransmissions

This paper addresses the problem of finding outage-optimal power control policies for wireless energy harvesting sensor (EHS) nodes with automatic repeat request (ARQ)-based packet transmissions. The power control policy of the EHS specifies the transmission power for each packet transmission attempt, based on all the information available at the EHS. In particular, the acknowledgement (ACK) or negative acknowledgement (NACK) messages received provide the EHS with partial information about the channel state. We solve the problem of finding an optimal power control policy by casting it as a partially observable Markov decision process (POMDP). We study the structure of the optimal power policy in two ways. First, for the special case of binary power levels at the EHS, we show that the optimal policy for the underlying Markov decision process (MDP) when the channel state is observable is a threshold policy in the battery state. Second, we benchmark the performance of the EHS by rigorously analyzing the outage probability of a general fixed-power transmission scheme, where the EHS uses a predetermined power level at each slot within the frame. Monte Carlo simulation results illustrate the performance of the POMDP approach and verify the accuracy of the analysis. They also show that the POMDP solutions can significantly outperform conventional ad hoc approaches.

Improved perfect space-time block codes

Perfect space-time block codes (STBCs) are based on four design criteria-full-rateness, nonvanishing determinant, cubic shaping, and uniform average transmitted energy per antenna per time slot. Cubic shaping and transmission at uniform average energy per antenna per time slot are important from the perspective of energy efficiency of STBCs. The shaping criterion demands that the generator matrix of the lattice from which each layer of the perfect STBC is carved be unitary. In this paper, it is shown that unitariness is not a necessary requirement for energy efficiency in the context of space-time coding with finite input constellations, and an alternative criterion is provided that enables one to obtain full-rate (rate of complex symbols per channel use for an transmit antenna system) STBCs with larger normalized minimum determinants than the perfect STBCs. Further, two such STBCs, one each for 4 and 6 transmit antennas, are presented and they are shown to have larger normalized minimum determinants than the comparable perfect STBCs which hitherto had the best-known normalized minimum determinants.

Wireless scheduling with partial channel state information: large deviations and optimality

We consider a server serving a time-slotted queued system of multiple packet-based flows, where not more than one flow can be serviced in a single time slot. The flows have exogenous packet arrivals and time-varying service rates. At each time, the server can observe instantaneous service rates for only a subset of flows ( selected from a fixed collection of observable subsets) before scheduling a flow in the subset for service. We are interested in queue length aware scheduling to keep the queues short. The limited availability of instantaneous service rate information requires the scheduler to make a careful choice of which subset of service rates to sample. We develop scheduling algorithms that use only partial service rate information from subsets of channels, and that minimize the likelihood of queue overflow in the system. Specifically, we present a new joint subset-sampling and scheduling algorithm called Max-Exp that uses only the current queue lengths to pick a subset of flows, and subsequently schedules a flow using the Exponential rule. When the collection of observable subsets is disjoint, we show that Max-Exp achieves the best exponential decay rate, among all scheduling algorithms that base their decision on the current ( or any finite past history of) system state, of the tail of the longest queue. To accomplish this, we employ novel analytical techniques for studying the performance of scheduling algorithms using partial state, which may be of independent interest. These include new sample-path large deviations results for processes obtained by non-random, predictable sampling of sequences of independent and identically distributed random variables. A consequence of these results is that scheduling with partial state information yields a rate function significantly different from scheduling with full channel information. In the special case when the observable subsets are singleton flows, i.e., when there is effectively no a priori channel state information, Max-Exp reduces to simply serving the flow with the longest queue; thus, our results show that to always serve the longest queue in the absence of any channel state information is large deviations optimal.

Performance of New Dynamic Benefit-Weighted Scheduling Scheme in DiffServ Networks

In this paper, we design a new dynamic packet scheduling scheme suitable for differentiated service (DiffServ) network. Designed dynamic benefit weighted scheduling (DBWS) uses a dynamic weighted computation scheme loosely based on weighted round robin (WRR) policy. It predicts the weight required by expedited forwarding (EF) service for the current time slot (t) based on two criteria; (i) previous weight allocated to it at time (t-1), and (ii) the average increase in the queue length of EF buffer. This prediction provides smooth bandwidth allocation to all the services by avoiding overbooking of resources for EF service and still providing guaranteed services for it. The performance is analyzed for various scenarios at high, medium and low traffic conditions. The results show that packet loss is minimized, end to end delay is minimized and jitter is reduced and therefore meet quality of service (QoS) requirement of a network.

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

RD-TDMA: A Randomized and Distributed TDMA Scheduling for Correlated Contention in WSNs

In wireless sensor networks (WSNs), contention occurs when two or more nodes in a proximity simultaneously try to access the channel. The contention causes collisions, which are very likely to occur when traffic is correlated. The excessive collision not only affects the reliability and the QoS of the application, but also the lifetime of the network. It is well-known that random access mechanisms do not efficiently handle correlated-contention, and therefore, suffer from high collision rate. Most of the existing TDMA scheduling techniques try to find an optimal or a sub-optimal schedule. Usually, the situation of correlated-contention persists only for a short duration, and therefore, it is not worthwhile to take a long time to generate an optimal or a sub-optimal schedule. We propose a randomized distributed TDMA scheduling (RD-TDMA) algorithm to quickly generate a feasible schedule (not necessarily optimal) to handle correlated-contention in WSNs. In RD-TDMA, a node in the network negotiates a slot with its neighbors using the message exchange mechanism. The proposed protocol has been simulated using the Castalia simulator to evaluate its runtime performance. Simulation results show that the RD-TDMA algorithm considerably reduces the time required to schedule.

BIOCARDS AND LEVEL OF ABSTRACTION

Biocards are formal descriptions of biological phenomena and their underlying functional principles. They are used in bioinspired design to document search results and to communicate the findings for use in the further design process. The present study explored the effect of abstraction level used in biocards. This was done in two workshops conducted with design students in Denmark and India. Students were given a design assignment and instructions for how to perform the BID ideation work. Half of the students were given biocards with abstract descriptions while the other half got biocards with concrete descriptions. The novelty of found solutions was evaluated by the students by rating novelty of each solution on a scale from 1 to 5. Mean values for abstract descriptions were 0,3 higher than for concrete descriptions indicating that more innovative solutions were found when students used biocards with abstract descriptions compared to concrete descriptions. The difference in mean value is significant with a confidence level better than 1%. It seems likely that more abstract descriptions in biocards helps avoiding design fixation in biomimetic design work.

火焰稳定器射流喷口形状对燃烧性能的影响

为了探讨层缘吹气式火焰稳定器的射流喷口形状对燃烧性能的影响，在来流50m/s，573K条件下，分别对连续长缝、不连续宽缝、均布圆孔三种不同喷口形状的火焰稳定器的燃烧性能进行了实验研究，对比了它们的贫熄特性、燃烧效率和流阻损失。研究发现，在实验条件范围内，连续长缝形喷口稳定器的燃烧性能较其他两种不连续喷口稳定器优越，具有较高的燃烧效率、较宽的贫熄边界和较小的流阻损失。

Evaluación del rendimiento agronómico de doce cultivares de repollo (Brassica oleracea L) y la incidencia de Plutella xylostella L, en la Estación experimental Raul González, valle de Sébaco, Matagalpa

El estudio se realizó en la Estación experimental Raúl González del valle de Sébaco de Junio a Septiembre de 1994. Con el objetivo de determinar las características agronómicas de cada cultivar de repollo (Brasica olearacea L), para resolver algunos problemas de pequeños y medianos productores que demandan cultivares con buen rendimiento y resistente a plagas y enfermedades. Se evaluaron las variedades: Gluckstadter Mittelfrüher, Yeshen, Migthy YR, Copenhagen Market, Conquest, Izalco, Fortuna, Grenadier, Discovery, Giant, Superette YR y Glory of Enkhuizen. El diseño utilizado fue de Bloques Completos al Azar (B.C.A) con cuatro repeticiones, evaluándose las variables de crecimiento y desarrollo del cultivo, así como lo relacionado al rendimiento agronómico y la incidencia de Plutella xylostella L. Los datos obtenidos se sometieron al análisis de varianza y a la prueba de Tukey. Las variedades de mejor crecimiento y desarrollo fueron: Yeshen, Migthy YR, Superette YR, Fortuna e Izalco. En las variables de calidad no se obtuvo diferencia significativa., sin embargo, los cultivares Superette YR, Izalco y Fortuna resultaron con el mayor índice de compactación. Respecto al rendimiento los cultivares Grenadier, Izalco y Fortuna obtuvieron el mayor porcentaje de formación de cabezas así como, el mayor peso de cabeza por hectárea. Los insecticidas utilizados para el manejo de P xylostella no lograron reducir sus poblaciones durante las etapas de preformación y llenado de cabezas. Al finalizar el ciclo del cultivo se presentó Xanthomonas campestris p. y campestris resultando tolerantes los cultivares Grenadier, Discovery, Izalco, Migthy YR y Fortuna; perdiendo casi la totalidad de su población las variedades: Glory of Enkhuizen, Copenhagen Market y Conquest.

A general design method for electric machines using magnetic circuit model considering the flux saturation problem

This paper proposes an analytical approach that is generalized for the design of various types of electric machines based on a physical magnetic circuit model. Conventional approaches have been used to predict the behavior of electric machines but have limitations in accurate flux saturation analysis and hence machine dimensioning at the initial design stage. In particular, magnetic saturation is generally ignored or compensated by correction factors in simplified models since it is difficult to determine the flux in each stator tooth for machines with any slot-pole combinations. In this paper, the flux produced by stator winding currents can be calculated accurately and rapidly for each stator tooth using the developed model, taking saturation into account. This aids machine dimensioning without the need for a computationally expensive finite element analysis (FEA). A 48-slot machine operated in induction and doubly-fed modes is used to demonstrate the proposed model. FEA is employed for verification.

Probe for Measurements of Density/Conductivity in Flows of Conducting Fluids

A probe utilizing the bipolar pulse method to measure the density of a conducting fluid has been developed. The probe is specially designed such that the concentration of a stream tube can be sampled continuously. The density was determined indirectly from the measurement of solution conductivity. The probe was calibrated using standard NaCl solutions of varying molarity and was able to rapidly determine the density of a fluid with continuously varying conductance. Measurements of the conductivity profiles, corresponding density profiles, and their fluctuation levels are demonstrated in a channel flow with an electrolyte injected from a slot in one wall.

Tolerancia de diferentes variedades de repollo (Brassica oleracea L.) a la bacteriosis causada por Xanthomonas campestris pv. campestris P.

Con el objetivo determinar el grado de tolerancia de diferentes variedades de repollo a la bacteriosis (xanthomonas campestri pv. Campestri) y evaluar su adaptabilidad y rendimiento en la zona de la concepción , Masaya, se establecieron ensayos en invernadero y campo en el periodo comprendido entre el 17 de abril al 17 de noviembre de 1989. Se evaluaron 10 variedades de repollo bajo las condiciones de inoculación artificial en el invernadero de las cuales la variedad superette resulto la más susceptible a la bacteriosis; las variedades yasseng e izalco resultaron las más tolerantes. Otras variedades como King kole, Premium y potye resultaron menos susceptibles. A nivel de campo se evaluaron 5 variedades seleccionadas de acuerdo a su grado de tolerancia a bacteriosis y representatividad en el país de las cuales fueron superette, izalco resulto más tolerante a la bacteriosis mientras que la variedad superette mostro alta susceptibilidad seguido por King kole, Premium y copenhagen. Los rendimientos en las variedades susceptibles a la bacteriosis resultaron bajos comparados con izalco.