Joint Routing, Scheduling and Power Control in Multihop MIMO Networks with MAC and Broadcast Links

We consider the problem of joint routing, scheduling and power control in a multihop wireless network when the nodes have multiple antennas. We focus on exploiting the multiple degrees-of-freedom available at each transmitter and receiver due to multiple antennas. Specifically we use multiple antennas at each node to form multiple access and broadcast links in the network rather than just point to point links. We show that such a generic transmission model improves the system performance significantly. Since the complexity of the resulting optimization problem is very high, we also develop efficient suboptimal solutions for joint routing, scheduling and power control in this setup.

Low Complexity Power and Scheduling Policies for Wireless Networks to Provide Quality of Service

We consider optimal power allocation policies for a single server, multiuser system. The power is consumed in transmission of data only. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity.

Optimal Power Allocation Policies for Low Powered Wireless Communication Systems

We consider optimal average power allocation policies in a wireless channel in the presence of individual delay constraints on the transmitted packets. Power is consumed in transmission of data only. We consider the case when the power used in transmission is a linear function of the data transmitted. The transmission channel may experience multipath fading. We have developed a computationally efficient online algorithm, when there is same hard delay constraint for all packets. Later on, we generalize it to the case when there are multiple real time streams with different hard deadline constraints. Our algorithm uses linear programming and has very low complexity.

GROUND COOLING SYSTEM FOR IMPROVING THE EFFICIENCY OF LOW TEMPERATURE POWER GENERATION

This paper presents an analysis of an organic Rankine cycle (ORC) with dry cooling system aided by an earth-coupled passive cooling system. Several organic fluids were considered as working fluids in the ORC in the temperature range of 125-200 degrees C. An earth-air-heat-exchanger (EMU) is studied for a location in the United States (Las Vegas) and another in India (New Delhi), to pre cool the ambient air before entering an air-cooled condenser (ACC). It was observed that the efficiency of the system improved by 1-3% for the system located in Las Vegas and fluctuations associated with temperature variations of the ambient air were also reduced when the EAHE system was used. A ground-coupled heat pump (GCHP) is also studied for these locations where cooling water is pre cooled in an underground buried pipe before entering a condenser heat exchanger in a closed loop. The area of the buried pipe and the condenser size are calculated per kW of power generation for various working fluids.

ADVANCED LOW PRESSURE CYCLE FOR CONCENTRATED SOLAR POWER GENERATION

Turbine inlet pressures of similar to 300 bar in case of CO2 based cycles call for redesigning the cycle in such a way that the optimum high side pressures are restricted to the discharge pressure limits imposed by currently available commercial compressors (similar to 150 bar) for distributed power generation. This leads to a cycle which is a combination of a transcritical condensing and a subcritical cycle with an intercooler and a bifurcation system in it. Using a realistic thermodynamic model, it is predicted that the cycle with the working fluid as a non-flammable mixture of 48.5 % propane and rest CO2 delivers similar to 37.2 % efficiency at 873 K with a high and a low side pressure of 150 and 26 bar respectively. This is in contrast to the best efficiency of similar to 36.1 % offered by a transcritical condensing cycle with the same working fluid at a high side pressure of similar to 300 bar

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.

Efficient Low Complexity Power Allocation Policies for Wireless Communication Systems Guaranteeing QoS

We consider near-optimal policies for a single user transmitting on a wireless channel which minimize average queue length under average power constraint. The power is consumed in transmission of data only. We consider the case when the power used in transmission is a linear function of the data transmitted. The transmission channel may experience multipath fading. Later, we also extend these results to the multiuser case. We show that our policies can be used in a system with energy harvesting sources at the transmitter. Next we consider data users which require minimum rate guarantees. Finally we consider the system which has both data and real time users. Our policies have low computational complexity, closed form expression for mean delays and require only the mean arrival rate with no queue length information.