101 111 Using Feedback in MANETs: a Control Perspective Todd P. Coleman University of Illinois DARPA ITMANET TexPoint fonts used.

Slides:



Advertisements
Similar presentations
Noise-Predictive Turbo Equalization for Partial Response Channels Sharon Aviran, Paul H. Siegel and Jack K. Wolf Department of Electrical and Computer.
Advertisements

Dialogue Policy Optimisation
TOWARDS a UNIFIED FRAMEWORK for NONLINEAR CONTROL with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer.
Information theory Multi-user information theory A.J. Han Vinck Essen, 2004.
Relaying in networks with multiple sources has new aspects: 1. Relaying messages to one destination increases interference to others 2. Relays can jointly.
Information Theory EE322 Al-Sanie.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project FLoWS Team Update: Andrea Goldsmith ITMANET PI Meeting Jan 27, 2011.
Paul Cuff THE SOURCE CODING SIDE OF SECRECY TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA.
1 Finite-Length Scaling and Error Floors Abdelaziz Amraoui Andrea Montanari Ruediger Urbanke Tom Richardson.
 CpG is a pair of nucleotides C and G, appearing successively, in this order, along one DNA strand.  CpG islands are particular short subsequences in.
Bayes Filters Pieter Abbeel UC Berkeley EECS Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics TexPoint fonts used in EMF. Read the.
Chapter 6 Information Theory
Achilleas Anastasopoulos (joint work with Lihua Weng and Sandeep Pradhan) April A Framework for Heterogeneous Quality-of-Service Guarantees in.
June 4, 2015 On the Capacity of a Class of Cognitive Radios Sriram Sridharan in collaboration with Dr. Sriram Vishwanath Wireless Networking and Communications.
TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA A.
Lihua Weng Dept. of EECS, Univ. of Michigan Error Exponent Regions for Multi-User Channels.
Fundamental limits in Information Theory Chapter 10 :
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
Information Theory of Wireless Networks: A Deterministic Approach David Tse Wireless Foundations U.C. Berkeley CISS 2008 March 21, 2008 TexPoint fonts.
Code and Decoder Design of LDPC Codes for Gbps Systems Jeremy Thorpe Presented to: Microsoft Research
ECE 776 Information Theory Capacity of Fading Channels with Channel Side Information Andrea J. Goldsmith and Pravin P. Varaiya, Professor Name: Dr. Osvaldo.
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
USAFrance OCEAN. Control and Communication: an overview Jean-Charles Delvenne CMI, Caltech May 5, 2006.
Channel Polarization and Polar Codes
Coding Schemes for Multiple-Relay Channels 1 Ph.D. Defense Department of Electrical and Computer Engineering University of Waterloo Xiugang Wu December.
©2003/04 Alessandro Bogliolo Background Information theory Probability theory Algorithms.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
Communication over Bidirectional Links A. Khoshnevis, D. Dash, C Steger, A. Sabharwal TAP/WARP retreat May 11, 2006.
Multiple-access Communication in Networks A Geometric View W. Chen & S. Meyn Dept ECE & CSL University of Illinois.
Review of modern noise proof coding methods D. Sc. Valeri V. Zolotarev.
An algorithm for dynamic spectrum allocation in shadowing environment and with communication constraints Konstantinos Koufos Helsinki University of Technology.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Layerless Dynamic Networks Lizhong Zheng, Todd Coleman.
Channel Capacity
Function Computation over Heterogeneous Wireless Sensor Networks Xuanyu Cao, Xinbing Wang, Songwu Lu Department of Electronic Engineering Shanghai Jiao.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 3 Application Metrics and Network Performance Asu Ozdaglar and Devavrat.
CODED COOPERATIVE TRANSMISSION FOR WIRELESS COMMUNICATIONS Prof. Jinhong Yuan 原进宏 School of Electrical Engineering and Telecommunications University of.
Threshold Phenomena and Fountain Codes Amin Shokrollahi EPFL Joint work with M. Luby, R. Karp, O. Etesami.
Uri Zwick Tel Aviv University Simple Stochastic Games Mean Payoff Games Parity Games TexPoint fonts used in EMF. Read the TexPoint manual before you delete.
Toward a Secure Data-Rate Theorem Paul Cuff. Control Setting Controller Encoder System (Plant) Sensors Rate R UiUi XiXi YiYi.
EE 6332, Spring, 2014 Wireless Communication Zhu Han Department of Electrical and Computer Engineering Class 11 Feb. 19 th, 2014.
§2 Discrete memoryless channels and their capacity function
Cooperative Communication in Sensor Networks: Relay Channels with Correlated Sources Brian Smith and Sriram Vishwanath University of Texas at Austin October.
Communication System A communication system can be represented as in Figure. A message W, drawn from the index set {1, 2,..., M}, results in the signal.
A Mathematical Theory of Communication Jin Woo Shin Sang Joon Kim Paper Review By C.E. Shannon.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Overview: Layerless Dynamic Networks Lizhong Zheng.
ON THE INTERMEDIATE SYMBOL RECOVERY RATE OF RATELESS CODES Ali Talari, and Nazanin Rahnavard IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 60, NO. 5, MAY 2012.
Interference in MANETs: Friend or Foe? Andrea Goldsmith
1 Lecture 7 System Models Attributes of a man-made system. Concerns in the design of a distributed system Communication channels Entropy and mutual information.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Occam’s Razor No Free Lunch Theorem Minimum.
The Finite-state channel was introduced as early as 1953 [McMillan'53]. Memory captured by channel state at end of previous symbol's transmission: - S.
Raptor Codes Amin Shokrollahi EPFL. BEC(p 1 ) BEC(p 2 ) BEC(p 3 ) BEC(p 4 ) BEC(p 5 ) BEC(p 6 ) Communication on Multiple Unknown Channels.
Smart Sleeping Policies for Wireless Sensor Networks Venu Veeravalli ECE Department & Coordinated Science Lab University of Illinois at Urbana-Champaign.
Source Encoder Channel Encoder Noisy channel Source Decoder Channel Decoder Figure 1.1. A communication system: source and channel coding.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Channel Coding Theorem (The most famous in IT) Channel Capacity; Problem: finding the maximum number of distinguishable signals for n uses of a communication.
CDC Control over Wireless Communication Channel for Continuous-Time Systems C. D. Charalambous ECE Department University of Cyprus, Nicosia, Cyprus.
Channel Capacity.
UNIT I. Entropy and Uncertainty Entropy is the irreducible complexity below which a signal cannot be compressed. Entropy is the irreducible complexity.
UNIT –V INFORMATION THEORY EC6402 : Communication TheoryIV Semester - ECE Prepared by: S.P.SIVAGNANA SUBRAMANIAN, Assistant Professor, Dept. of ECE, Sri.
Towards Robust Revenue Management: Capacity Control Using Limited Demand Information Michael Ball, Huina Gao, Yingjie Lan & Itir Karaesmen Robert H Smith.
Information Theory of High-throughput Shotgun Sequencing David Tse Dept. of EECS U.C. Berkeley Tel Aviv University June 4, 2012 Research supported by NSF.
Hidden Markov Models – Concepts 1 2 K … 1 2 K … 1 2 K … … … … 1 2 K … x1x1 x2x2 x3x3 xKxK 2 1 K 2.
1 Lecture 06 EEE 441: Wireless And Mobile Communications BRAC University.
Layerless Dynamic Networks
Tilted Matching for Feedback Channels
General Strong Polarization
Latent Variables, Mixture Models and EM
COT 5611 Operating Systems Design Principles Spring 2012
COT 5611 Operating Systems Design Principles Spring 2014
Theory of Information Lecture 13
Presentation transcript:

Using Feedback in MANETs: a Control Perspective Todd P. Coleman University of Illinois DARPA ITMANET TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A AAAA A A A

Current Uses of Feedback Theory Feedback modeled noiseless Point-to-point: capacity unchanged Significantly improved error exponents Reduction in complexity MANETs: Enlargement of capacity region

Current Uses of Feedback Practice Feedback is noisy, used primarily for Robustness to channel uncertainty Estimation of channel parameters ARQ-style communication w/ erasures

Current Uses of Feedback Practice Feedback is noisy, used primarily for Robustness to channel uncertainty Estimation of channel parameters ARQ-style communication w/ erasures But: Burnashev-style “forward error correction+ARQ” schemes are extremely fragile w/ noisy feedback (Kim, Lapidoth, Weissman 07)

Instantiate network feedback control algorithms for MANETs Develop iterative practical schemes for noisy feedback? Coding w/ feedback over statistically unknown channels? Develop fundamental limits of error exponents with feedback w/ fixed block length Applicability of Feedback in MANETs

Communication w/ Noiseless Feedback

Communication w/ Noiseless Feedback Given an encoder’s Tx strategy, decoding is almost trivial (Baye’s rule)

Communication w/ Noiseless Feedback Given an encoder’s Tx strategy, decoding is almost trivial (Baye’s rule) How do we select a (recursive) encoder strategy for an arbitrary memoryless channel?

A Control Interpretation of the Dynamics of the Posterior Coleman ’09: “A Stochastic Control Approach to ‘Posterior Matching’-style Feedback Communication Schemes”

A Control Interpretation of the Dynamics of the Posterior Coleman ’09: “A Stochastic Control Approach to ‘Posterior Matching’-style Feedback Communication Schemes”

F k-1 Controller Z -1 P(F k |F k-1, u k ) ukuk FkFk reference signal Fw*Fw* A Control Interpretation of the Dynamics of the Posterior Coleman ’09: “A Stochastic Control Viewpoint on ‘Posterior Matching’-style Feedback Communication Schemes”

XkXk FkFk F k+1 Fw*Fw* D(F w * ||F k+1 ) D(F w * ||F k ) Reward at any stage k is the reduction in “distance” to target Stochastic Control: Reward Coleman ’09

Maximum Long-Term Average Reward Coleman ’09

Maximum Long-Term Average Reward (1),(2) hold w/ equality if: a) Y’s all independent b) Each X i drawn according to P*(x) Coleman ’09

Maximum Long-Term Average Reward (1),(2) hold w/ equality if: a) Y’s all independent b) Each X i drawn according to P*(x) Horstein ’63 (BSC) Schalwijk-Kailath ’66 (AWGN) Shayevitz-Feder ‘07, ‘08 (DMC) Coleman ’09

The Posterior Matching Scheme: an Optimal Solution Next input indep of everything decoder has seen so far, with capacity-achieving marginal distribution No forward error correction. Adapt on the fly. Coleman ’09 Posterior matching scheme

The Posterior Matching Scheme: an Optimal Solution Coleman ’09 Next input indep of everything decoder has seen so far, with capacity-achieving marginal distribution No forward error correction. Adapt on the fly. Posterior matching scheme

Implications for Demonstrating Achievable Rates 01 1 Coleman ’09

Lyapunov Function Posterior matching scheme: Coleman ’09

Lyapunov Function (cont’d) Coleman ’09

Control Theory Information Theory Symbiotic Relationship Converse Thms Give Upper Bounds on Average Long-Term Rewards for Stochastic Control Problem Coleman ’09: “A Stochastic Control Viewpoint on ‘Posterior Matching’-style Feedback Communication Schemes”

Control Theory Information Theory Symbiotic Relationship Converse Thms Give Upper Bounds on Average Long-Term Rewards for Stochastic Control Problem KL Divergence Lyapunov functions guarantee all rates achievable Coleman ’09: “A Stochastic Control Viewpoint on ‘Posterior Matching’-style Feedback Communication Schemes”

Research Results with This Methodology Interpret feedback communication encoder design as stochastic control of posterior towards certainty Converse theorems specify fundamental performance bounds on a stochastic control problem related to controlling posterior. An optimal policy implies the existence of a Lyapunov function, which is in essence a KL divergence Lyapunov function directly implies achievability for all R < C Coleman ’09

Research Results with This Methodology Gorantla and Coleman ‘09: Encoders that achieve El Gamal 78: “Physically degraded broadcast channels w/ feedback“ capacity region in an iterative fashion w/ low complexity Interpret feedback communication encoder design as stochastic control of posterior towards certainty Converse theorems specify fundamental performance bounds on a stochastic control problem related to controlling posterior. An optimal policy implies the existence of a Lyapunov function, which is in essence a KL divergence Lyapunov function directly implies achievability for all R < C Coleman ’09

New Important Directions this Approach Enables Control Theory Information Theory Develop iterative low-complexity encoders/decoders for noisy feedback? Partially Observed Markov Decision Process

New Important Directions this Approach Enables Control Theory Information Theory Develop iterative low-complexity encoders/decoders for noisy feedback? Partially Observed Markov Decision Process Optimal coding w/ feedback over statistically unknown channels? Reinforcement learning from control literature

New Important Directions this Approach Enables Control Theory Information Theory Develop iterative low-complexity encoders/decoders for noisy feedback? Partially Observed Markov Decision Process Optimal coding w/ feedback over statistically unknown channels? Reinforcement learning from control literature Develop fundamental limits of error exponents with feedback w/ fixed block length Lyapunov function enables a fundamental Martingale condition

New Important Directions this Approach Enables Control Theory Information Theory Develop iterative low-complexity encoders/decoders for noisy feedback? Partially Observed Markov Decision Process Optimal coding w/ feedback over statistically unknown channels? Reinforcement learning from control literature Develop fundamental limits of error exponents with feedback w/ fixed block length Lyapunov function enables a fundamental Martingale condition Also: stochastic control approach provides a rubric to check tightness of converses via structure of optimal solution