The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
These Proceedings contain papers that were presented at the Fifty-First Annual Allerton Conference on Communication, Control, and Computing which was held at Allerton House, Monticello, Illinois, on October 2–4, 2013. As in past years, the Conference was sponsored by the Coordinated Science Laboratory and the Department of Electrical and Computer Engineering of the University of Illinois at Urbana-Champaign.
Copyright and Reprint Permission: Abstracting is permitted with credit to the source. Libraries are permitted to photocopy beyond the limit of U.S. copyright law for private use of patrons those articles in this volume that carry a code at the bottom of the first page, provided the per-copy fee indicated in the code is paid through Copyright Clearance Center, 222 Rosewood Drive, Danvers, MA 01923...
We consider the generation of a secret key (SK) by the inputs and the output of a secure multipleaccess channel (MAC) that additionally have access to a noiseless public communication channel. Under specific restrictions on the protocols, we derive various upper bounds on the rate of such SKs. Specifically, if the public communication consists of only the feedback from the output terminal, then the...
Protocols are currently being designed where a connection can simultaneously send traffic across multiple routes (or paths) of a communication network; for example, the IETF's MP-TCP protocol. Traditional single-path congestioncontrol protocols, which increase and decrease transmission rates depending on the level of congestion, can be argued to implicitly solve a network-wide utility optimization...
Whether the information complexity of any interactive problem is close to its communication complexity is an important open problem. In this note we give an example of a sampling problem whose information and communication complexity we conjecture to be as much as exponentially far apart.
Hypercontractivity has had many successful applications in mathematics, physics, and theoretical computer science. In this work we use recently established properties of the hypercontractivity ribbon of a pair of random variables to study a recent conjecture regarding the mutual information between binary functions of the individual marginal sequences of a sequence of pairs of random variables drawn...
This paper studies a class of channels obtained by combining a graph and a memoryless channel. A particular example is a memoryless channel pre-coded with a graph-based codes. Other examples are planted constrained satisfaction problems, and probabilistic network models with communities. In an earlier work by the authors, concentration results are obtained for such channels when the graphs is a sparse...
Code for a compound discrete memoryless channel (DMC) is required to have small probability of error regardless of which channel in the collection perturbs the codewords. Capacity of the compound DMC has been derived classically: it equals the maximum (over input distributions) of the minimal (over channels in the collection) mutual information. In this paper the expression for the channel dispersion...
This paper describes a novel approach to online convex programming in dynamic settings. Many existing online learning methods are characterized via regret bounds that quantify the gap between the performance of the online algorithm relative to a comparator. In previous work, this comparator was either considered static over time, or admitted sublinear tracking regret bounds only when the comparator...
This paper is concerned with the long-standing optimal decentralized control (ODC) problem. The objective is to design a fixed-order decentralized controller for a discrete-time system to minimize a given finite-time cost function subject to norm constraints on the input and output of the system. We cast this NP-hard problem as a quadratically-constrained quadratic program, and then reformulate it...
In this paper, we consider an aggregator that manages a large number of Electrical Vehicle (EV) charging jobs, each of which requests a certain amount of energy that needs to be charged before a deadline. The goal of the aggregator is to minimize the peak consumption at any time by planning the charging schedules in order. A key challenge that the aggregator faces in the planning is that there exists...
Risky power contracts are introduced for enabling wind power aggregation. First, the problem of optimal risky and firm power contract offering in the forward market is formulated in the single wind farm setting. Analytical solutions are obtained, and the concepts of fair price of wind power and price of unitized risk are introduced. The more general setting of two wind farms both trading risky and...
Driven by the national policy to expand renewable generation, as well as the advances in renewable technologies that reduce the cost of small-scale renewable generation units, distributed generation at end users will comprise a significant fraction of electricity generation in the future. We study the problem faced by a social planner who seeks to minimize the long-term discounted costs (associated...
The paper studies a harbor defense situation where an intruder attempts to out-maneuver defenders and destroy a target. The purpose of this paper is to construct a feedback, receding horizon control law for the defenders based on a max-min optimal control problem which we believe captures the essence of the intruder goals.
We consider the problem of approximating optimal stationary control policies by quantized control. Stationary quantizer policies are introduced and it is shown that such policies are “-optimal among stationary policies under mild technical conditions. Quantitative bounds on the approximation error in terms of the rate of the approximating quantizers are also derived. Thus, one can search for”-optimal...
We develop a novel design framework for spectrum sharing among distributed users with heterogeneous delay-sensitivity (e.g. users with video streaming that requires low delay, and users with video conferencing that requires very low delay). Most existing spectrum sharing policies are stationary, i.e. users transmit at constant power levels simultaneously. Under stationary policies, the users have...
We consider the problem of synthesizing optimal linear feedback policies subject to arbitrary convex constraints on the feedback matrix. This is known to be a hard problem in the usual formulations (ℋ2;ℋ∞;LQR) and previous works have focussed on characterizing classes of structural constraints that allow efficient solution through convex optimization or dynamic programming techniques. In this paper,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.