Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project FLoWS Team Update: Andrea Goldsmith ITMANET PI Meeting Jan 27, 2011.

Slides:



Advertisements
Similar presentations
EE360: Lecture 10 Outline Capacity and Optimization of Ad Hoc Nets Announcements Revised proposals due Monday HW 1 posted, due Feb. 19 Lecture Wed will.
Advertisements

CROWN “Thales” project Optimal ContRol of self-Organized Wireless Networks WP1 Understanding and influencing uncoordinated interactions of autonomic wireless.
Relaying in networks with multiple sources has new aspects: 1. Relaying messages to one destination increases interference to others 2. Relays can jointly.
EE360: Lecture 11 Outline Cross-Layer Design and CR Announcements HW 1 due Feb. 19 Progress reports due Feb. 24 Interference alignment Feedback MIMO in.
1 Network Coding: Theory and Practice Apirath Limmanee Jacobs University.
Node Cooperation and Cognition in Dynamic Wireless Networks
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
Cross Layer Design in Wireless Networks Andrea Goldsmith Stanford University Crosslayer Design Panel ICC May 14, 2003.
1 Simple Network Codes for Instantaneous Recovery from Edge Failures in Unicast Connections Salim Yaacoub El Rouayheb, Alex Sprintson Costas Georghiades.
Cross Layer Adaptive Control for Wireless Mesh Networks (and a theory of instantaneous capacity regions) Michael J. Neely, Rahul Urgaonkar University of.
4/17/2017 UCSC: MIT: Stanford University: UC Berkeley: UCLA: UIUC:
1 40 th Annual CISS 2006 Conference on Information Sciences and Systems Some Optimization Trade-offs in Wireless Network Coding Yalin E. Sagduyu Anthony.
How to Turn on The Coding in MANETs Chris Ng, Minkyu Kim, Muriel Medard, Wonsik Kim, Una-May O’Reilly, Varun Aggarwal, Chang Wook Ahn, Michelle Effros.
01/16/2002 Reliable Query Reporting Project Participants: Rajgopal Kannan S. S. Iyengar Sudipta Sarangi Y. Rachakonda (Graduate Student) Sensor Networking.
Multiple-access Communication in Networks A Geometric View W. Chen & S. Meyn Dept ECE & CSL University of Illinois.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project FLoWS Overview and Update Andrea Goldsmith.
NSF Workshop on Bridging the Gap between Networking and Physical Layer Research Breakout Group #2 Reston, VA Aug 27-28, 2007.
Exploiting Physical Layer Advances in Wireless Networks Michael Honig Department of EECS Northwestern University.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project FLoWS Progress and Next Steps Andrea Goldsmith Phase 3 Kickoff Sept ,
Low Complexity Virtual Antenna Arrays Using Cooperative Relay Selection Aggelos Bletsas, Ashish Khisti, and Moe Z. Win Laboratory for Information and Decision.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Layerless Dynamic Networks Lizhong Zheng, Todd Coleman.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 3 Application Metrics and Network Performance Asu Ozdaglar and Devavrat.
A Game Approach for Multi-Channel Allocation in Multi-Hop Wireless Networks Lin Gao, Xinbing Wang Dept. of Electronic Engineering Shanghai Jiao Tong University.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 3 Application Metrics and Network Performance Asu Ozdaglar and Devavrat.
How to start research V. Jayalakshmi. Why do we research? – To solve a problem – To satisfy an itch – To gain more market share/ Develop and improve –
1 Network Coding and its Applications in Communication Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
Overview of Research Activities Aylin Yener
Three-layer scheme dominates previous double-layer schemes Distortion-diversity tradeoff provides useful comparison in different operating regions Layered.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project FLoWS Overview and Update Andrea Goldsmith.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2: Layerless Dynamic Networks Lizhong Zheng.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrusts 0 and 1 Metrics and Upper Bounds Muriel Medard, Michelle Effros and.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Overview: Layerless Dynamic Networks Lizhong Zheng.
Some Networking Aspects of Multiple Access Muriel Medard EECS MIT.
Superposition encoding A distorted version of is is encoded into the inner codebook Receiver 2 decodes using received signal and its side information Decoding.
Transmission over composite channels with combined source-channel outage: Reza Mirghaderi and Andrea Goldsmith Work Summary STATUS QUO A subset Vo (with.
EE360: Lecture 9 Outline Announcements Cooperation in Ad Hoc Networks
Local Phy + Global Routing: A Fundamental Layering Principle for Wireless Networks Pramod Viswanath, University of Illinois July, 2011.
Interference in MANETs: Friend or Foe? Andrea Goldsmith
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project FLoWS Program and Thrust Updates Andrea Goldsmith Phase 4 Kickoff May 24-25,
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project FLoWS Overview and Progress Andrea Goldsmith.
Illinois Center for Wireless Systems Wireless Networks: Algorithms and Optimization R. Srikant ECE/CSL.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 1.
Myopic and Optimal Distributed Routing Wei Chen and Sean P. Meyn ECE & CSL University of Illinois.
Information Theory for Mobile Ad-Hoc Networks (ITMANET) Thrust I Michelle Effros, Ralf Koetter, & Muriel Médard (and everyone!)
A Perspective on Network Interference and Multiple Access Control Michael J. Neely University of Southern California May 2008 Capacity Region 
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrusts 0 and 1 Metrics and Upper Bounds Muriel Medard, Michelle Effros and.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 3 Application Metrics and Network Performance Asu Ozdaglar and Devavrat.
Using Feedback in MANETs: a Control Perspective Todd P. Coleman University of Illinois DARPA ITMANET TexPoint fonts used.
Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
Asymptotic Analysis for Large Scale Dynamic Stochastic Games Sachin Adlakha, Ramesh Johari, Gabriel Weintraub and Andrea Goldsmith DARPA ITMANET Meeting.
Algorithms and Optimization Aravind Srinivasan University of Maryland.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project A Distributed Newton Method for Network Optimization Ali Jadbabaie and Asu Ozdaglar.
Joint Source, Channel, and Network Coding in MANETs
Delay Efficient Wireless Networking
Q-Learning for Policy Improvement in Network Routing
Layerless Dynamic Networks
ACHIEVEMENT DESCRIPTION
User Interference Effect on Routing of Cognitive Radio Ad-Hoc Networks
Ivana Marić, Ron Dabora and Andrea Goldsmith
Resource Allocation in Non-fading and Fading Multiple Access Channel
Cross layer design is wireless multi-hop network
Unequal Error Protection: Application and Performance Limits
Oblivious Equilibrium for Stochastic Games with Concave Utility
EEL 6935 Wireless Ad Hoc Networks
Application Metrics and Network Performance
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
ACHIEVEMENT DESCRIPTION
ACHIEVEMENT DESCRIPTION
Presentation transcript:

Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project FLoWS Team Update: Andrea Goldsmith ITMANET PI Meeting Jan 27, 2011

New Theory and Insights

Key New Theory and Insights Thrust 0 –New definitions of reliable communications in the face of uncertainty –Performance over finite time windows Thrust 1 –Network Equivalence –Network Coding in Noise/Loss –Multiterminal Strong Converses Thrust 2 –Layered and structured codes –Control/capacity connections for time-varying channels with noisy and/or rate- constrained feedback –Generalized capacity and separation Thrust 3 –Stochastic Multi-period Network Utility Maximization –Relaxation and distributed techniques for network optimization –Mean Field Equilibrium for Stochastic games –Learning in dynamic environments Interthrust –Coordination via Communication –Relaying, cooperation and cognition –Network coding –Capacity regions for more than 3 users

Recent Accomplishments

Thrust 0 Recent Achievements Metrics Effros, Goldsmith: Expectation and Outage in Capacity and Distortion Models Goldsmith: Diversity/multiplexing/delay tradeoffs Effros: networks with side information Shah: multicast capacity Moulin: Mobility Medard: delay/energy minimization Zheng: UEP Medard, Zheng: Distortion-Outage tradeoff Coleman, Effros, Goldsmith, Medard, Zheng: Channels and Networks with Feedback Goldsmith: Cognitive Nodes Cover: Coordinated Networks Medard: Stability Regions El Gamal: More than 3 users

New bounding techniques Thrust 1 Recent Achievements Code construction Network information theory Networking and optimization Combinatorial Tools Metrics Koetter, Medard: On the stability region of networks with instantaneous decoding Goldsmith: multicasting with a relay Effros: linear code construction Effros: continuity of network coding regions Zheng, Medard : distortion-outage tradeoff Medard: effect of coding versus routing Goldsmith: capacity and interference rates for the interference channel Goldsmith: multi -way relay channel Goldsmith: joint source-channel coding with limited feedback Cover : Capacity of coordinated actions El Gamal: Noisy network coding Effros: Network equivalence Cover: Martingale lattices

Dynamic Network Information Theory CSI, feedback, and robustness Structured coding Thrust 2 Recent Achievements Effros: two stage polar codes Coleman: Control principle for feedback channels Zheng: tilted matching for feedback channels Medard, Zheng: Diversity-distortion tradeoff Goldsmith: Joint source channel coding / outage Effros: linear representation of network coding Cover: coordination capacity El Gamal: Noisy Network Coding Effros: distributed network coding with coded side information Goldsmith: Multicast with relay; BC with cognitive relay Moulin: exploiting mobility of relay networks Medard, Goldsmith: Wireless network coding Moulin: finite-blocklength codes Zheng: Instantaneous Efficiency Shah: Positive Recurrent Medium Access

Thrust 3 Recent Achievements Shah: Distributed MAC using queue based feedback Johari: Large network games Meyn: Q-learning for network optimization Boyd, Goldsmith: Wireless network utility maximization as stochastic control Optimization Distributed and dynamic algorithms for resource allocation Stochastic Network Analysis Flow-based models and queuing dynamics Game Theory New resource allocation paradigm that focuses on hetereogeneity and competition Ozdaglar: Distributed second order methods for network optimization Ozdaglar: Noncooperative power control using potential games Effros: Noncooperative network coding Medard: Decoding and network scheduling for increased capacity Ozdaglar: Near potential games for network analysis Johari: Supermodular games El Gamal: Overhead in distributed algorithms Boyd: Distributed optimization Johari: Mean field equilibrium Ozdaglar: State-dependent distributed optimization

Publications to date 5 books or book chapters; 1 more under development 46 published/accepted journal papers, 28 submitted 169 conference papers (published or to appear) SciAM paper appeared Comm. Magazine paper to appear this month Publications website: –

Phase 4 Progress Criteria –Demonstrate the consummated union between information theory, networks, and control; and why all three are necessary ingredients in this union. –Write a monograph to be published by NOW jointly in Foundations and Trends in Information Theory and in Foundations and Trends in Networks on our new information theory for MANETs. Also publish a shorter version in IEEE Proceedings. –Use our results to provide challenges and solutions for the broader community that designs and builds MANETs

Work Products (possibly merged with Nequit) How to maximize ITMANET impact Community Website –“go-to” website for network information theory –Merging of two current websites, with hooks? –Get feedback at ITA IEEE Proceedings special issue –Survey paper on FLoWS results and conclusions –Invited papers on all major topics within/between thrust areas Survey paper –Part of Proceedings Special Issue Tutorials and Short Courses –(for web and IT school) –In each thrust area/across thrust areas –Link to website Position paper about follow-on programs (ITMANET 2.0) –DC Govt/Industry Day for our last meeting

Transitions via DC Day Transition to other DARPA programs Transition to and synergies with other government research programs Transitions to and synergies with corporate research programs/investments

Tech Transfer Standards Patents Company Workshops Commercial Transfer