Learn More
— In this paper, we consider a network where each user is charged a fixed price per unit of bandwidth used, but where there is no congestion-dependent pricing. However, the transmission rate of each user is assumed to be a function of network congestion (like TCP), and the price per unit bandwidth. We are interested in answering the following question: how(More)
We introduce a new congestion control algorithm, called TCP-Illinois, which has many desirable properties for implementation in (very) high-speed networks. TCP-Illinois is a sender side protocol, which modifies the AIMD algorithm of the standard TCP (Reno, NewReno or SACK) by adjusting the increment/decrement amounts based on delay information. By using(More)
— Collaborative spectrum sensing among secondary users (SUs) in cognitive networks is shown to yield a significant performance improvement. However, there exists an inherent trade off between the gains in terms of probability of detection of the primary user (PU) and the costs in terms of false alarm probability. In this paper, we study the impact of this(More)
A decentralized sequential detection problem is considered in which each one of a set of sensors receives a sequence of observations about the hypothesis. Each sensor sends a sequence of summary messages to the fusion center where a sequential test is carried out to determine the true hypothesis. A Bayesian framework for this problem is introduced, and for(More)
Game theoretical techniques have recently become prevalent in many engineering applications, notably in communications. With the emergence of cooperation as a new communication paradigm, and the need for self-organizing, decentralized, and autonomic networks, it has become imperative to seek suitable game theoretical tools that allow to analyze and study(More)
We consider a zero-sum mutual information game on multiple-input multiple-output (MIMO) Gaussian Rayleigh-fading channels. The players are an encoder-decoder pair as the maximizer, and a jammer as the minimizer, of the mutual information between the input and the output of the channel. There are total power constraints on both the jammer and the encoder.(More)
AImtraetuWe consider stochastic dynamic decision problems where at each step two consecutive decisions must be taken, one being what information bearing signal(s) to transmit and the other what control action(s) to exert. For finite-horizon problems involving first-order ARMA models with Gaussian statistics and a quadratic cost criterion, we show that the(More)
This paper introduces and analyzes a decentralized network congestion control algorithm which has dynamic adaptations at both user ends and link ends, a so-called general primal-dual algorithm. We obtain sufficient conditions for local stability of this algorithm in a general topology network with heterogeneous round-trip delays. Then, as an implementation(More)
In today's landscape of distributed and autonomous computing, there is a challenge to construct mechanisms which can induce selfish agents to act in a way that satisfies a global goal. In the domain for the allocation of computational and network resources, proportionally fair schemes are commonly advocated. In this paper, we investigate the efficiency of(More)