Interference in MANETs: Friend or Foe? Andrea Goldsmith

Slides:



Advertisements
Similar presentations
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 11 Information.
Advertisements

Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 10 User.
Feedback for Interference Mitigation David Tse Wireless Foundations Dept. of EECS U.C. Berkeley CWIT May 20, 2011 TexPoint fonts used in EMF. Read the.
Derives the optimal achievable rate for MISO secondary users under coexistence constraints Proposes practical strategy for cognition and cooperation in.
Cooperative Network Coding
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Relaying in networks with multiple sources has new aspects: 1. Relaying messages to one destination increases interference to others 2. Relays can jointly.
The Impact of Channel Estimation Errors on Space-Time Block Codes Presentation for Virginia Tech Symposium on Wireless Personal Communications M. C. Valenti.
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 13 Outline Cognitive Radios and their Capacity Announcements March 5 lecture moved to March 7, 12-1:15pm, Packard 364 Poster session scheduling.
EE359 – Lecture 16 Outline MIMO Beamforming MIMO Diversity/Multiplexing Tradeoffs MIMO Receiver Design Maximum-Likelihood, Decision Feedback, Sphere Decoder.
June 4, 2015 On the Capacity of a Class of Cognitive Radios Sriram Sridharan in collaboration with Dr. Sriram Vishwanath Wireless Networking and Communications.
Node Cooperation and Cognition in Dynamic Wireless Networks
Three Lessons Learned Never discard information prematurely Compression can be separated from channel transmission with no loss of optimality Gaussian.
Lihua Weng Dept. of EECS, Univ. of Michigan Error Exponent Regions for Multi-User Channels.
Cooperation and Crosslayer Design in Wireless Networks Andrea Goldsmith Stanford University DAWN ARO MURI Program Review U.C. Santa Cruz September 12,
Introduction to Cognitive radios Part two HY 539 Presented by: George Fortetsanakis.
EE360: Lecture 6 Outline MAC Channel Capacity in AWGN
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.
Gaussian Interference Channel Capacity to Within One Bit David Tse Wireless Foundations U.C. Berkeley MIT LIDS May 4, 2007 Joint work with Raul Etkin (HP)
EE359 – Lecture 15 Outline Announcements: HW due Friday MIMO Channel Decomposition MIMO Channel Capacity MIMO Beamforming Diversity/Multiplexing Tradeoffs.
Breaking Spectrum Gridlock through Cognitive and Cooperative Radios Andrea Goldsmith Stanford University Quantenna Communications, Inc MSR Cognitive Wireless.
EE360: Lecture 13 Outline Cognitive Radios and their Capacity Announcements Progress reports due today, HW 2 posted March 5 lecture moved to March 7, 12-1:15pm,
Coding Schemes for Multiple-Relay Channels 1 Ph.D. Defense Department of Electrical and Computer Engineering University of Waterloo Xiugang Wu December.
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.
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
Joint Physical Layer Coding and Network Coding for Bi-Directional Relaying Makesh Wilson, Krishna Narayanan, Henry Pfister and Alex Sprintson Department.
Zukang Shen, Jeffrey Andrews, and Brian Evans
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.
Future Wireless Networks Ubiquitous Communication Among People and Devices Next-generation Cellular Wireless Internet Access Wireless Multimedia Sensor.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 3 Application Metrics and Network Performance Asu Ozdaglar and Devavrat.
Overview of Research Activities Aylin Yener
CODED COOPERATIVE TRANSMISSION FOR WIRELESS COMMUNICATIONS Prof. Jinhong Yuan 原进宏 School of Electrical Engineering and Telecommunications University of.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
EE360: Lecture 8 Outline Intro to Ad Hoc Networks Announcements Proposal feedback by Wed, revision due following Mon HW 1 posted this week, due Feb. 22.
1 Codage avec Information Adjacante (DPC : Dirty paper coding) et certaines de ses applications : Tatouage (Watermarking) MIMO broadcast channels Gholam-Reza.
Cooperative Wireless Networks Hamid Jafarkhani Director Center for Pervasive Communications and Computing
نیمسال اوّل افشین همّت یار دانشکده مهندسی کامپیوتر مخابرات سیّار (626-40) ارتباطات همکارانه.
EE359 – Lecture 15 Outline Introduction to MIMO Communications MIMO Channel Decomposition MIMO Channel Capacity MIMO Beamforming Diversity/Multiplexing.
Cross-Layer Optimization in Wireless Networks under Different Packet Delay Metrics Chris T. K. Ng, Muriel Medard, Asuman Ozdaglar Massachusetts Institute.
Cooperative Communication in Sensor Networks: Relay Channels with Correlated Sources Brian Smith and Sriram Vishwanath University of Texas at Austin October.
Outage-Optimal Relaying In the Low SNR Regime Salman Avestimehr and David Tse University of California, Berkeley.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Overview: Layerless Dynamic Networks Lizhong Zheng.
Superposition encoding A distorted version of is is encoded into the inner codebook Receiver 2 decodes using received signal and its side information Decoding.
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.
MAIN RESULT: Depending on path loss and the scaling of area relative to number of nodes, a novel hybrid scheme is required to achieve capacity, where multihop.
Wireless Networks with Limited Feedback: PHY and MAC Layer Analysis PhD Proposal Ahmad Khoshnevis Rice University.
Cognitive Radios Motivation: scarce wireless spectrum
We aim to exploit cognition to maximize network performance What is the side information at a cognitive node? What is the best encoding scheme given this.
Information Theory for Mobile Ad-Hoc Networks (ITMANET) Thrust I Michelle Effros, Ralf Koetter, & Muriel Médard (and everyone!)
EE359 – Lecture 15 Outline Announcements: HW posted, due Friday MT exam grading done; l Can pick up from Julia or during TA discussion section tomorrow.
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.
Rate Bounds for MIMO Relay Channels Using Precoding Caleb K. Lo, Sriram Vishwanath and Robert W. Heath, Jr. Wireless Networking and Communications Group.
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.
EE360: Lecture 13 Outline Capacity of Cognitive Radios Announcements Progress reports due Feb. 29 at midnight Overview Achievable rates in Cognitive Radios.
The Capacity of Interference Channels with Partial Transmitter Cooperation Ivana Marić Roy D. Yates Gerhard Kramer Stanford WINLAB, Rutgers Bell Labs Ivana.
Multiple Antennas.
EE359 – Lecture 15 Outline Announcements: MIMO Channel Capacity
Joint Source, Channel, and Network Coding in MANETs
Layerless Dynamic Networks
EE359 – Lecture 15 Outline Announcements: MIMO Channel Capacity
Ivana Marić, Ron Dabora and Andrea Goldsmith
Jinhua Jiang, Ivana Marić, Andrea Goldsmith, and Shuguang Cui Summary
ACHIEVEMENT DESCRIPTION
Presentation transcript:

Interference in MANETs: Friend or Foe? Andrea Goldsmith ITMANET FLoWS Focus Talk Interference in MANETs: Friend or Foe? Andrea Goldsmith Joint work with Dabora, Gunduz, Kramer, Liu, Maric, Poor, Shamai

MANET Characteristics Peer-to-peer communications All transmissions interfere due to broadcast nature of radio Highly dynamic Nodes can cooperate to forward data Can introduce feedback to improve performance

Interference in MANETs Radio is a broadcast medium Radios in the same spectrum interfere MANET capacity in unknown for all canonical networks with interference (even when exploited) Z Channel Interference Channel Relay Channel General MANETs

Interference: Friend or Foe? If treated as noise: Foe If decodable or precodable: Neutral Neither friend nor foe Increases BER, Reduces capacity Multiuser detecion (MUD) and precoding can completely remove interference Common coding strategy to approach capacity

If exploited via coding, cooperation, and cognition Interference: Friend or Foe? If exploited via coding, cooperation, and cognition Friend Especially in a network setting

Exploiting Interference through Coding The Z Channel Capacity of Z channel unknown in general We obtain capacity for a class of Z channels Korner/Marton technique applicable Enough to consider superposition encoding Han/Kobayashi achievable region is capacity region Yields capacity for large class of Gaussian interference channels

Exploiting Interference through Cognition Cognitive user has knowledge of other user’s message and/or encoding strategy Used to help noncognitive transmission Used to presubtract noncognitive interference RX1 CR RX2 NCR Joint with Maric, Kramer, Shamai

Proposed Transmission Strategy To allow each receiver to decode part of the other node’s message  reduces interference Cooperation at CR TX Cooperation atCR TX Removes the NCR interference at the CR RX Cooperation at CR TX Precoding against interference at CR TX To help in sending NCR’s message to its RX It is CLEAR that it needs Precoding against interference at CR TX Rate splitting We optimally combine these approaches into one strategy

More Precisely: Transmission for Achievable Rates The NCR uses single-user encoder RX1 RX2 NCR CR The CR uses - Rate-splitting to allow receiver 2 to decode part of cognitive user’s message and thus reduce interference at that receiver - Precoding while treating the codebook for user 2 as interference to improve rate to its own receiver - Cooperation to increase rate to receiver 2 Rate split CR NCR

Upper Bounds Follows from standard approach: Invoke Fano’s inequality Reduces to outer bound for full cooperation for R2=0 Has to be evaluated for specific channels How far are the achievable rates from the outer bound?

Performance Gains from Cognitive Encoding outer bound our scheme prior schemes CR broadcast bound

Exploiting Interference through Relaying TX1 TX2 relay RX2 RX1 X1 X2 Y3=X1+X2+Z3 Y4=X1+X2+X3+Z4 Y5=X1+X2+X3+Z5 X3= f(Y3) Relaying strategies: Relay can forward all or part of the messages Much room for innovation Relay can forward interference To help subtract it out Joint with Maric, Dabora, Medard

Achievable Rates with Interference Forwarding dest1 dest2 encoder 1 encoder 2 relay for any distribution p(p(x1)p(x2,x3)p(y1,y2|x1,x2,x3) The strategy to achieve these rates is: - Single-user encoding at the encoder 1 to send W1 - Decode/forward at encoder 2 and the relay to send message W2 This region equals the capacity region when the interference is strong and the channel is degraded

Capacity Gains from Interference Forwarding

Diversity-Multiplexing Tradeoffs in Multi-Antenna MANETs Focus on (M1, M2, M3) Quasi-static Rayleigh fading channel Channel state known only at the receivers Joint with Gunduz, Poor

Diversity-Multiplexing Tradeoff in Point-to-Point MIMO Channels - Multiplexing gain r: - Diversity gain d

DMT for Full-duplex Relays The relay can receive and transmit simultaneously The DMT for (M1,M2,M3) full-duplex system is The hop with the minimum diversity gain is the bottleneck Achieved by decode-and-forward relaying with block Markov structure Follows easily since DF achieves capacity

Half-duplex Relay Static Protocols: The source transmits during the first aT channel uses, 0<a<1 The relay tries to decode the message and forwards over the remaining (1-a)T channel uses: decode-and-forward with fixed allocation (fDF)‏ The DMT for half-duplex (M1,M2,M3) system with fixed time allocation a Optimize a for each multiplexing gain: decode-and-forward with variable allocation (vDF)‏

Dynamic Decode-and-Forward (DDF) for Half-duplex Relay Introduced by Azarian et al. (IT’05): Relay listens until decoding Transmits only after decoding Achieves the best known DMT for half-duplex relay channels, yet short of the upper bound We show: Achieves optimal DMT in multi-hop relay channels Not piece-wise linear, no general closed form expression Can be cast into a convex optimization problem

Multiple Relay Networks Multiple full-duplex relays: DMT dominated by hop with minimum diversity gain. Multiple half-duplex relays: Odd and even numbered relays transmit in turn. DDF (with time limitation for successive hops) is DMT optimal. DMT dominated by 2 consecutive hops with min. diversity gain

End to End Distortion Use antennas for multiplexing: Use antennas for diversity High-Rate Quantizer ST Code High Rate Decoder We optimize the point on the DMT tradeoff curve to minimize distortion ST Code High Diversity Low-Rate Quantizer Decoder

Exploiting Interference reduces End-to-End Distortion Interference exploitation at the physical layer improves end-to-end distortion We have proved a separation theorem for a class of interference channels Separate source and channel coding optimal We found the operating point on the DMT multihop region for minimal distortion Under delay constraints, optimization needed

Summary Fundamental performance limits of MANETS requires understanding and exploiting interference Interference can be exploited via coding/relaying, cooperation, or cognition The right strategy depends on CSI, dynamics, network topology, and node capabilities. Exploiting interference leads to higher capacity, more robustness, and better end-to-end performance MIMO adds a new degree of freedom at each node Use antennas for multiplexing, diversity, or IC?

Final Comments: Startup Lessons Learned People in industry read our papers and implement our ideas Communication and network theory can be implemented in a real system in 3-9 months Information Theory heavily influences current and next-gen. wireless systems (mainly at the PHY & MAC layers) Idealized assumptions have been liberating Wireless network design above PHY/MAC layer is ad-hoc The most effective way to do tech transfer is to start a company