Capacity of fading channels with channel side information
The Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone is obtained, analogous to water-pouring in frequency for time-invariant frequency-selective fading channels.
- P. Varaiya
In this paper, we shall give a brief account of the main ideas in the theory of differential games. Our presentation will be limited to two player, zero sum, differential games, except for a few…
Stochastic Systems: Estimation, Identification, and Adaptive Control
The mathematics of filtering and ee/ise 556: stochastic systems fall 2013 usc search identification and system parameter estimation 1991 gbv is described.
Smart cars on smart roads: problems of control
- P. Varaiya
- Computer ScienceIEEE Transactions on Automatic Control
- 1 December 1991
Key features of one automated intelligent vehicle/highway system (IVHS) are outlined, it is shown how core driver decisions are improved, a basic IVHS control system architecture is proposed, and a…
Performance Analysis of Slotted Carrier Sense IEEE 802.15.4 Medium Access Layer
- S. Pollin, M. Ergen, F. Catthoor
- Computer ScienceIEEE Transactions on Wireless Communications
- 1 September 2008
Whether this MAC scheme meets the design constraints of low-power and low-cost sensor networks is analyzed, and a detailed analytical evaluation of its performance in a star topology network, for uplink and acknowledged uplink traffic is provided.
What's decidable about hybrid automata?
- T. Henzinger, P. Kopke, A. Puri, P. Varaiya
- Computer ScienceSymposium on the Theory of Computing
- 29 May 1995
It is proved that the reachability problem is undecidable for timed automata augmented with a single stopwatch, and an (optimal) PSPACE reachability algorithm is given for the case of initialized rectangular automata.
Supervisory control of discrete-event processes with partial observations
Extends certain aspects of the work of P.J. Ramadge and W.M. Wonham on the control of a class of discrete-event processes to the case of decentralized control.
Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards
A lower bound is provided for the regret associated with any uniformly good scheme, and a scheme which attains the lower bound for every configuration C is constructed, given explicitly in terms of the Kullback-Liebler number between pairs of distributions.
Max pressure control of a network of signalized intersections
- P. Varaiya
- 1 November 2013
PEDAMACS: power efficient and delay aware medium access protocol for sensor networks
For the traffic application the authors consider, the PEDAMACS network provides a lifetime of several years compared to several months and days based on random access schemes with and without sleep cycles, respectively, making sensor network technology economically viable.