—We consider connection-level models of resource allocation in the Internet, where files arrive into the network according to a Poisson process and the size of each file is exp...
— This paper presents an algorithm for distributed power control and scheduling over wireless ad hoc-networks, where the data rate on each link depends on the transmission power ...
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Abstract— Costas array enumeration is an NP-complete problem with a highly parallelize-able solution. This paper examines the implementation of a solution to this problem on an F...
—In this paper, transmission over time-selective, flat fading relay channels is studied. It is assumed that channel fading coefficients are not known a priori. Transmission tak...
— In this paper, two different feedback configurations of the relay channel are investigated. Specifically, in our first configuration, the source node in a relay channel is ...
— In this paper, we revisit the problem of determining the minimum-length schedule that satisfies certain traffic demands in a wireless network. Traditional approaches for the ...
Sastry Kompella, Jeffrey E. Wieselthier, Anthony E...
— In this paper we consider a K transmitter and K receiver single-hop wireless network. We obtain a rate control policy that provides proportional fair rate allocation to the tra...
—In this paper we estimate the end-to-end total bandwidth (BW) and available bandwidth (ABW) of a path between a pair of nodes in an IEEE 802.11b ad hoc network, both as function...