Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project FLoWS Overview and Progress Andrea Goldsmith.

Slides:



Advertisements
Similar presentations
Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.
Advertisements

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.
EE360: Lecture 12 Outline Ad-Hoc Network Optimization and Analysis, Cognitive Radios Announcements HW 1 due today Progress reports due Feb. 24 Network.
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.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project FLoWS Team Update: Andrea Goldsmith ITMANET PI Meeting Jan 27, 2011.
Andrea Goldsmith Stanford University DAWN ARO MURI Program Review U.C. Santa Cruz Oct 5, 2009 Joint work with Y. Chang, R. Dabora, D. Gunduz, I. Maric,
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.
EE360: Lecture 13 Outline Cognitive Radios and their Capacity Announcements March 5 lecture moved to March 7, 12-1:15pm, Packard 364 Poster session scheduling.
Node Cooperation and Cognition in Dynamic Wireless Networks
Joint Multi-Access and Routing as a Stochastic Game for Relay Channel Yalin Evren Sagduyu, Anthony Ephremides Objective and Motivation * Objective: Analyze.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
1 Cross-Layer Design for Wireless Communication Networks Ness B. Shroff Center for Wireless Systems and Applications (CWSA) School of Electrical and Computer.
Cross Layer Design in Wireless Networks Andrea Goldsmith Stanford University Crosslayer Design Panel ICC May 14, 2003.
4/17/2017 UCSC: MIT: Stanford University: UC Berkeley: UCLA: UIUC:
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.
Breaking Spectrum Gridlock through Cognitive and Cooperative Radios Andrea Goldsmith Stanford University Quantenna Communications, Inc MSR Cognitive Wireless.
EE360: Lecture 11 Outline Cross-Layer Design and CR Announcements HW 1 posted, due Feb. 24 at 5pm Progress reports due Feb. 29 at midnight (not Feb. 27)
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
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.
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.
J.J. Garcia-Luna-Aceves (PI) Hamid Sadjadpour Katia Obraczka Muriel Medard Andrea Goldsmith Pravin Varaiya Rajive Bagrodia Mario Gerla Nitin Vaidya Tony.
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 ,
Capacity Scaling with Multiple Radios and Multiple Channels in Wireless Mesh Networks Oguz GOKER.
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
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.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 3 Application Metrics and Network Performance Asu Ozdaglar and Devavrat.
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
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.
Covilhã, 30 June Atílio Gameiro Page 1 The information in this document is provided as is and no guarantee or warranty is given that the information is.
Novel network coding strategy for TDD Use of feedback (ACK) improves delay/energy/ throughput performance, especially for high latency- high errors scenarios.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Overview: Layerless Dynamic Networks Lizhong Zheng.
On the Topology of Wireless Sensor Networks Sen Yang, Xinbing Wang, Luoyi Fu Department of Electronic Engineering, Shanghai Jiao Tong University, China.
EE360: Lecture 9 Outline Announcements Cooperation in Ad Hoc Networks
ITMANET PI Meeting September 2009 ITMANET Nequ-IT Focus Talk (PI Neely): Reducing Delay in MANETS via Queue Engineering.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
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,
Illinois Center for Wireless Systems Wireless Networks: Algorithms and Optimization R. Srikant ECE/CSL.
Myopic and Optimal Distributed Routing Wei Chen and Sean P. Meyn ECE & CSL University of Illinois.
Capacity of Large Scale Wireless Networks with Directional Antenna and Delay Constraint Guanglin Zhang IWCT, SJTU 26 Sept, 2012 INC, CUHK 1.
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.
Scheduling Considerations for Multi-User MIMO
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.
EE360: Lecture 13 Outline Capacity of Cognitive Radios Announcements Progress reports due Feb. 29 at midnight Overview Achievable rates in Cognitive Radios.
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
Ivana Marić, Ron Dabora and Andrea Goldsmith
Resource Allocation in Non-fading and Fading Multiple Access Channel
Unequal Error Protection: Application and Performance Limits
Oblivious Equilibrium for Stochastic Games with Concave Utility
Application Metrics and Network Performance
ACHIEVEMENT DESCRIPTION
Towards characterizing the capacity of the building block of MANETs
Presentation transcript:

Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project FLoWS Overview and Progress Andrea Goldsmith

DARPA’s ITMANET Challenge Develop and exploit a more powerful information theory for mobile wireless networks. Anticipated byproducts include new separation theorems to inform wireless network "layering" as well as new protocol ideas. Hypothesis: A better understanding of MANET capacity limits will lead to better network design and deployment.

MANET Capacity: What we don’t know Capacity of large dynamic networks Capacity of basic network building blocks XiXi Y i-1 p(y i,s i |x i,s i-1 ) S i-1 SiSi D YiYi Tx Rx Capacity of time-varying links (with/without feedback)

Shannon and Wireless Networks Shannon’s capacity definition based on infinite delay and asymptotically small error was brilliant Much progress in finding the Shannon capacity limits of wireless single and multiuser channels Little known about these limits for mobile wireless networks, even for simple (canonical) models –Few fundamental design insights have emerged. –Queuing and capacity theory incompatible if capacity implies infinite delay and no error. –How should capacity be defined for wireless networks?

Limitations in theory of MANETs today –Shannon capacity pessimistic for wireless channels and intractable for large networks Wireless Information Theory Optimization Theory B. Hajek and A. Ephremides, “Information theory and communications networks: An unconsummated union,” IEEE Trans. Inf. Theory, Oct Wireless Network Theory –Large body of wireless (and wired) network theory that is ad-hoc, lacks a basis in fundamentals, and lacks an objective success criteria. –Little cross-disciplinary work spanning these fields –Optimization techniques applied to given network models, which rarely take into account fundamental network capacity or dynamics

Our Approach: Consummating Unions When capacity is not the only metric, a new theory is needed to deal with nonasymptopia (i.e. delay, random traffic) and application requirements –Shannon theory generally breaks down when delay, error, or user/traffic dynamics must be considered Fundamental limits are needed outside asymptotic regimes Optimization provides the missing link to address these issues Wireless Information Theory Wireless Network Theory Optimization Theory Menage a Trois

FLoWS Program Objectives Develop tractable and insightful metrics and models for MANET information theory. Define fundamental performance limits for MANETs in terms of desired objective metrics. Obtain upper and lower performance bounds for these metrics for a given set of MANET models. Define the negotiation between the application and network for resource allocation and performance optimization of our given metrics Bound the cost of using our set of metrics as the interface between the network and applications.

Capacity Delay Power Upper Bound Lower Bound Capacity and Fundamental Limits Application Metrics Capacity Delay Power Utility=U(C,D,E) Application and Network Optimization (C*,D*,E*) Constraints Degrees of Freedom Models and Dynamics Application Metrics and Network Performance Layerless Dynamic Networks New Paradigms for Upper Bounds Models New MANET Theory MANET Metrics Metrics Fundamental Limits of Wireless Systems

Thrust Objectives and Rationale Models and Metrics (Leads: Effros,Goldsmith,Medard): –Objective: Develop a set of metrics for dynamic networks that capture requirements of current and future applications –Rationale: Models for MANETs are needed that are tractable yet lead to general design and performance insights New Paradigms for Upper Bounds (Leads: Effros,Koetter,Medard) –Objective: Obtain bounds on a diversity of objectively-defined metrics for complex interconnected systems. –Rationale: A comprehensive theory for upper bounding the performance limits of MANETs will help guide design Layerless Dynamic Networks (Lead: Zheng) –Objective: Design of networking strategies as a single dynamic probabilistic mapping, without pre-assigned layered structure –Rationale Remove layering and statics from MANET theory. End-to-End Metrics and Performance (Leads: Ozdaglar,Shah) –Objective: Provide an interface between application metrics and network performance –Rationale: A theory of generalized rate distortion, separation, and network optimization will improve application performance

Structured Coding Thrust Synergies and New Intellectual Tools New Bounding Techniques Optimization Code Construction Combinatorial Tools Dynamic Network IT Thrust 1 Thrust 2 Game Theory Thrust 3 Optimization Stochastic Network Analysis CSI, Feedback, and Robustness

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: Diversity-distortion tradeoff Coleman, Effros, Goldsmith, Medard, Zheng: Channels and Networks with Feedback Goldsmith: Cognitive Nodes

New bounding techniques Thrust 1 Recent Achievements Code construction Network information theory Networking and Optimization Combinatorial Tools Medard: coded time-division duplex for delay or energy minimization Goldsmith: multiple sender interference channel Moulin: converse for Gelfand-Pinsker MAC Effros: networks with side information Effros: effect of feedback in networks Shah: multicast capacity of large wireless networks Koetter, Medard: joint coding and scheduling in wireless networks Zheng: unequal error protection converse Moulin: mobility for interference mitigation Effros: game-theoretic approaches to network coding Koetter, Medard: Distributed scheduling for network coded multicast

Dynamic Network Information Theory CSI, feedback, and robustness Structured coding Thrust 2 Recent Achievements Goldsmith: cognitive interference/Z channel Goldsmith: Interference Forwarding Goldsmith: MIMO cognitive network Goldsmith: Finite State (BC) channels with Feedback Medard, Zheng: Diversity-distortion tradeoff Zheng: UEP and applications Effros: Network coding and distributed Source coding Medard: Network coding with FB in TDD Effros: Contents Feedback for Network Coding Zheng: Message-wise UEP and Feedback Coleman: Control Principle for feedback designs Moulin: Mobility to mitigate interference Shah: Scaling of heterogeneous networks Medard Koetter: Hypergraph scheduling Goldsmith: MIMO-ARQ Diversity/Multiplexing/Delay

Thrust 3 Recent Achievements Shah, Medard: Queueing analysis for coded networks with feedback Johari: Fluid limits for gossip Meyn: Relaxation techniques for network optimization Goldsmith, Johari: Oblivious equilibrium for stochastic games with concave utility Boyd, Goldsmith: Wireless network utility maximization as stochastic optimal control Optimization Stochastic Network Analysis Game Theory Ozdaglar: Distributed second order methods for network optimization Ozdaglar: Noncooperative scheduling with correlated channel states Effros: Noncooperative network coding Moulin: Interference mitigating mobility

Progress on what we don’t know XiXi Y i-1 p(y i,z i,s i |x i,s i-1 ) S i-1 SiSi D YiYi Tx Rx Capacity of time-varying links (with/without feedback) Capacity of finite-state Markov channels with feedback Converses under unequal error protection Multiplexing-diversity-delay-distortion tradeoffs in MIMO Generalized capacity and separation Capacity of basic network building blocks Capacity region/bounds for Z channel and interference channels Capacity bounds for cognitive interference/MIMO channels Upper bounds and converses for interference channels with a relay (via interference and message forwarding)

Capacity of dynamic networks Network equivalence Scaling laws for arbitrary node placement and demand Multicast capacity Effect of feedback and side information Dynamic/multiperiod network utility maximization Generalized Max-Weight policies Game-theoretic approaches Mobility for interference mitigation Delay or energy minimization Distributed optimization

FLoWS progress since last September New breakthroughs in upper bounds, feedback and CSI, cognitive techniques, interference forwarding, multicast traffic, and dynamic/distributed network optimization, New synergies within and between our thrust areas New and ongoing collaborations among PIs Overview paper for Scientific American –Co-authors: Effros, Goldsmith, Medard –Paper accepted for publication Magazine paper with overview of FLoWS –Paper near completion – will be submitted within 3 weeks All Phase 2 progress criteria have been met Website updated with Sept. PI meeting slides, recent publications, and recent results.

Focus Talks and Posters Thrust 1: –Moulin: Towards strong converses for MANETs Thrust 2: –Coleman: A dynamic approach to feedback coding strategies in MANETs Thrusts 2 and 3: –Effros: The cost of selfishness in network coding capacity Thrust 3: –Boyd and Goldsmith: Optimizing wireless network performance in stochastic environments Posters on all recent results

Progress Criteria: Phase 2 –Evolve results in all thrust areas to examine more complex models, robustness/security, more challenging dynamics, and larger networks. Network equivalence Multihop networks with interference forwarding Interference mitigation via mobility Unequal error protection Control principles for feedback designs Capacity scaling laws for arbitrary node placement and arbitrary demand Distributed second order methods for network optimization Generalized Max-Weight policies with optimal distributed implementations Local dynamics for topology formation Oblivous equilibrium –Demonstrate synergies between thrust areas: compare and tighten upper bounds and achievability results for specific models and metrics; apply generalized theory of distortion and utility based on performance regions developed in Thrusts 1-2. Capacity of finite-state broadcast channels w/wout feedback and Z channel (1-2) Bounds on capacity of cognitive radio and interference channel w/relay (1-2) New approach to optimize coding and scheduling (1-3 ) New game-theoretic approach to network coding (1-3 ) Multiperiod NUM applicable to any underlying network capacity region (1-2-3)

Progress Criteria: Phase 2 –Demonstrate that key synergies between information theory, network theory, and optimization/control lead to at least an order of magnitude performance gain for key metrics. Coding-based TDD has order of magnitude throughput increase versus uncoded Unbounded gain in network capacity with feedback Order of magnitude throughput gain in hyperarc scheduling Orders of magnitude BER reduction in wireless NUM Order of magnitude utility improvement for generalized Maxweight –Pose clearly defined community challenges related to evolving our theory that inspires other researchers to collectively make breakthrough progress. Community challenges posed in plenary talks and tutorials, as well as invited papers and vision papers. Proposed book will define FLoWS ITMANET theory. –Publish 2 vision papers, one for the community (e.g. in the IEEE Wireless Communications Magazine) and one for the broader technical community (e.g. in Nature or Science) illuminating our ideas, results, and their potential impact Scientific American paper accepted. Iteration with publisher ongoing. Magazine paper near completion, will be submitted within 3 weeks. Book proposal has been discussed with Cambridge University Press.

Project Impact To Date Plenary Talks –Boyd: Dysco’07, S. Stevun Lecture’08, CNLS’08, ETH’08 –Effros: ISIT’07 –Goldsmith: ACC’07, Gomachtech’08, ISWPC’08, Infocom’08, RAWC’09, WCNC’09 –Koetter: ITW’07, WiOPT’08 –Medard: Gretsi’07, CISS’07, Gilbreth Lecture (NAE)’07, IT Winter School’08, UIUC Student Conference’08, Wireless Network Coding’08, –Meyn: Erlang Centennial’09 –Ozdaglar: ACC 2009, NecSys'09, ASMD’08 –Johari: World Congress of the Game Theory Society’08 –Shah: Plenary talk at the Interperf/Valuetools 2007 Recent Tutorials –Boyd: MOCCS’08, WOSP’08 –Ozdaglar: ISIT’08, CDC’08 –Medard/Koetter: PIMRC’08 –Meyn: Mathematics of OR’08 –Shah: ACM Sigmetrics/Performance ’08, CDC’09, Conference Session/Program Chairs –ISIT’07, CTW’08, WiOpt’08, CTW’09, ITW’09, ITW’10, ISMP’09, INFORMS’09 Invited journal papers –“Breaking spectrum gridlock through cognitive radios: an information-theoretic approach”, IEEE Proc’09 (w/ Jafar, Maric, and Srinivasa)

Publications to date 16 accepted journal papers, 13 more submitted 89 conference papers (published or to appear) SciAM paper to appear –Magazine paper to be submitted shortly –Book on FLoWS vision and results under development Publications website: –

Summary Significant progress on all thrust areas Significant progress on synergies between thrust areas Ongoing and fruitful collaborations between PIs Phase 2 goals met Significant impact of FLoWS research on the broader research community (IT, communications, networking, and control/optimization)