Learn More
In this article, we discuss distributed resource allocation schemes in which each transmitter determines its allocation autonomously, based on the exchange of interference prices. These schemes have been primarily motivated by the common model for spectrum sharing in which a user or service provider may transmit in a designated band provided that they abide(More)
We consider a distributed power control scheme in a spread spectrum (SS) wireless ad hoc network, in which each user announces a price that reflects his current interference level. Given these prices, we present an asynchronous distributed algorithm for updating power levels, and provide conditions under which this algorithm converges to an optimal power(More)
A fundamental problem in networking is the allocation of limited resources among the users of the network. In a traditional layered network architecture, the resource to be allocated at the medium access control (MAC) and network layers utilizes communication links, viewed as "bit pipes" that deliver data at a fixed rate with occasional random errors.(More)
We consider the capacity of a downlink orthogonal frequency division multiple access (OFDMA) system with limited feedback rate R<sub>F</sub> per sub-channel and finite coherence time T. The feedback is used to relay channel state information (CSI) from K users to the base station. The order-optimal capacity growth with Rayleigh fading sub-channels is(More)
We study a distributed algorithm for adapting transmit beamforming vectors in a multi-antenna peer-to-peer wireless network. The algorithm attempts to maximize a sum of per-user utility functions, where each user's utility is a function of his transmission rate, or equivalently the received signal-to-interference plus noise ratio (SINR). This is(More)
We consider allocation of sub-channels to users in a downlink OFDMA system. Each user feeds back one bit per sub-channel, which indicates whether or not the gain exceeds a threshold. Users are assigned priority weights, and the thresholds are selected to maximize the weighted sum capacity. We analyze the behavior of the optimal thresholds and growth in(More)
  • E. Yeh, R. Berry
  • 2007 IEEE International Symposium on Information…
  • 2007
We consider cooperative relay networks with multiple stochastically varying end-to-end flows. For such networks, we study throughput optimal network control policies which stabilize the network's queues for any arrival rate in its stability region. In earlier work, we have developed such a policy for a simple four-node parallel relay network. In this paper,(More)
We consider the problem of exchanging packets from the individual queues at multiple wireless terminals with the assistance of a single relay node. In an earlier paper, we studied this for a backlogged traffic model, where each node always had packets to transmit. Here, we consider stochastically varying packet traffic and compare the stable operation under(More)
This paper is concerned with a vehicle-to-vehicle based traveler information system. The system relies on information exchanged by the vehicles themselves in a peer-to-peer manner; it does not involve any public investment from government agencies to build, manages and maintains the necessary infrastructure. This paper discusses the prototype design that(More)
We consider medium access control (MAC) protocols for mobile ad hoc networks that are designed for MAC layer broadcasts. For example, such protocols could be used to transmit traffic information among vehicles. We analyze the performance of two simple MAC protocols, when multi-user interference is explicitly modeled via the received signal-to-interference(More)