Cooperation / Contention - an Information Theoretic Perspective Syed A. Jafar University of California Irvine What is the optimal form of cooperation?

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

MASSIMO FRANCESCHETTI University of California at San Diego Information-theoretic and physical limits on the capacity of wireless networks TexPoint fonts.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Interference.
Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Interference: An Information Theoretic View David Tse Wireless Foundations U.C. Berkeley ISIT 2009 Tutorial June 28 TexPoint fonts used in EMF: AAA A AA.
Dirty RF Impact on Interference Alignment
Interference Alignment and Cancellation EE360 Presentation Omid Aryan Shyamnath Gollakota, Samuel David Perli and Dina Katabi MIT CSAIL.
R2 R3 R4 R5 AP The throughput does not grow in the same way as wireless demands Limited wireless spectrum & unlimited user demands AP R1 R6.
Breaking the Interference Barrier David Tse Wireless Foundations University of California at Berkeley Mobicom/Mobihoc Plenary Talk September 13, 2007 TexPoint.
Relaying in networks with multiple sources has new aspects: 1. Relaying messages to one destination increases interference to others 2. Relays can jointly.
BBN: Throughput Scaling in Dense Enterprise WLANs with Blind Beamforming and Nulling Wenjie Zhou (Co-Primary Author), Tarun Bansal (Co-Primary Author),
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Authors: David N.C. Tse, Ofer Zeitouni. Presented By Sai C. Chadalapaka.
Cooperative Interference Management in Wireless Networks I-Hsiang Wang École Polytechnique Fédérale de Lausanne (EPFL) IE/INC Seminar Chinese University.
© 2004 Qualcomm Flarion Technologies 1 + Lessons Unlearned in Wireless Data Rajiv Laroia Qualcomm Flarion Technologies.
Cooperative Multiple Input Multiple Output Communication in Wireless Sensor Network: An Error Correcting Code approach using LDPC Code Goutham Kumar Kandukuri.
The Capacity of Wireless Ad Hoc Networks
Information Theory of Wireless Networks: A Deterministic Approach David Tse Wireless Foundations U.C. Berkeley CISS 2008 March 21, 2008 TexPoint fonts.
UCBC UCSC Broadband Communications (UCBC) Research Group Hamid R. Sadjadpour April 2004 Space-Time Signal Processing for Wireless Ad-hoc Networks.
Network Coding and Reliable Communications Group Algebraic Network Coding Approach to Deterministic Wireless Relay Networks MinJi Kim, Muriel Médard.
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
Tracey Ho Sidharth Jaggi Tsinghua University Hongyi Yao California Institute of Technology Theodoros Dikaliotis California Institute of Technology Chinese.
Hierarchical Cooperation Achieves Linear Scaling in Ad Hoc Wireless Networks David Tse Wireless Foundations U.C. Berkeley MIT LIDS May 7, 2007 Joint work.
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.
Mobility Increases The Capacity of Ad-hoc Wireless Networks By Grossglauser and Tse Gautam Pohare Heli Mehta Computer Science University of Southern California.
2002 MURI Minisymposium Cooperative Control of Distributed Autonomous Vehicles in Adversarial Environments 2002 MURI Minisymposium Ameesh Pandya Prof.
MIMO WIRELESS COMMUNICATION SYSTEMS Bhaskar D. Rao University of California, San Diego La Jolla, CA
Practical Performance of MU- MIMO Precoding in Many-Antenna Base Stations Clayton Shepard Narendra Anand Lin Zhong.
Coding Schemes for Multiple-Relay Channels 1 Ph.D. Defense Department of Electrical and Computer Engineering University of Waterloo Xiugang Wu December.
Network Alignment: Treating Networks as Wireless Interference Channel Chun Meng Univ. of California, Irvine.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
Hierarchical Cooperation Achieves Linear Scaling in Ad Hoc Wireless Networks David Tse Wireless Foundations U.C. Berkeley AISP Workshop May 2, 2007 Joint.
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Layerless Dynamic Networks Lizhong Zheng, Todd Coleman.
BBN: Throughput Scaling in Dense Enterprise WLANs with Blind Beamforming and Nulling Wenjie Zhou (Co-Primary Author), Tarun Bansal (Co-Primary Author),
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
Network Architecture (R02) #4 24/10/2013 Wireless Capacity Jon Crowcroft,
1 Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser, David Tse IEEE Infocom 2001 (Best paper award) Oct 21, 2004 Som C.
MD-based scheme could outperform MR-based scheme while preserving the source- channel interface Rate is not sufficient as source- channel interface, ordering.
1 Energy Efficiency of MIMO Transmissions in Wireless Sensor Networks with Diversity and Multiplexing Gains Wenyu Liu, Xiaohua (Edward) Li and Mo Chen.
MARCH : A Medium Access Control Protocol For Multihop Wireless Ad Hoc Networks 성 백 동
Scaling Laws for Cognitive Radio Network with Heterogeneous Mobile Secondary Users Yingzhe Li, Xinbing Wang, Xiaohua Tian Department of Electronic Engineering.
Congestion Control in CSMA-Based Networks with Inconsistent Channel State V. Gambiroza and E. Knightly Rice Networks Group
Wireless Communication Elec 534 Set I September 9, 2007 Behnaam Aazhang.
Distributed Routing Schemes with Accessibility Consideration in Multi-Hop Wireless Networks Presented By Junghwi, Jeon 2010/02/01.
A Distributed Relay-Assignment Algorithm for Cooperative Communications in Wireless Networks ICC 2006 Ahmed K. Sadek, Zhu Han, and K. J. Ray Liu Department.
Outage-Optimal Relaying In the Low SNR Regime Salman Avestimehr and David Tse University of California, Berkeley.
Some Networking Aspects of Multiple Access Muriel Medard EECS MIT.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
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.
The High, the Low and the Ugly Muriel Médard. Collaborators Nadia Fawaz, Andrea Goldsmith, Minji Kim, Ivana Maric 2.
A Perspective on Network Interference and Multiple Access Control Michael J. Neely University of Southern California May 2008 Capacity Region 
USC-TPWN, May 20-21, What constitutes a useful experimental result? Bhaskar Krishnamachari Ming Hsieh Department of Electrical Engineering USC Viterbi.
Multicast Scaling Laws with Hierarchical Cooperation Chenhui Hu, Xinbing Wang, Ding Nie, Jun Zhao Shanghai Jiao Tong University, China.
Andrew Lippman October, 2004 Viral Radio.
1 Post Lunch Session Cooperative Strategies and Optimal Scheduling for Tree Networks Alexandre de Baynast †, Omer Gurewitz ‡, Edward W. Knightly ‡ † RWTH.
1 Cooperation vs. Contention the wireless sandbox Mihaela van der Schaar (UCLA) application layer/games Srikanth Krishnamurthy (UCR) integration of cooperation.
SYNERGY: A Game-Theoretical Approach for Cooperative Key Generation in Wireless Networks Jingchao Sun, Xu Chen, Jinxue Zhang, Yanchao Zhang, and Junshan.
Bridging the Gap: A Deterministic Model for Wireless Links David Tse Wireless Foundations U.C. Berkeley NSF Wireless Networks Workshop Aug 27, 2007 TexPoint.
Impact of Interference on Multi-hop Wireless Network Performance
Capacity region of large wireless networks
Network Coding Beyond Network Coding
Reasoning about Performance in Competition and Cooperation
Layerless Dynamic Networks
Ivana Marić, Ron Dabora and Andrea Goldsmith
Distributed MIMO Patrick Maechler April 2, 2008.
Intelligent Antenna Sharing in Wireless Networks
Presentation transcript:

Cooperation / Contention - an Information Theoretic Perspective Syed A. Jafar University of California Irvine What is the optimal form of cooperation? How much does it help ? At what cost (overhead) ?

What is the Optimal form of Cooperation? To answer the question, we need to know the capacity of wireless networks. We know: Large network scaling laws [Gupta, Kumar ‘00,…, Ozgur, Johari, Leveque, Tse 08] 2 node interference channel capacity within one bit. [Etkin, Tse, Wang 07] For any no. of nodes, the capacity of wireless networks with accuracy approaching 100% as local noise at each node becomes small [Cadambe, Jafar 07, 08] –Regardless of the number of users, every user achieves half his interference-free rate over the same channel (Interference Alignment)

R1 R3 Interference Alignment: Everyone gets half the cake. T2 Propagation Delay T3 R2 T1

Capacity of Interference Networks As local noise becomes small, regardless of the number of interferers each user achieves half of the capacity he would achieve if there was NO interference. Optimal : innerbound = outerbound Random time-varying channels. No Propagation Delays. Any number of users. Any number of antennas. At high SNR, capacity higher than prior belief by 50%, 900% and 4900% for 3,20,100 users. Relays, Feedback, Cooperation do not help beyond o(log(SNR))

Contention (hurt) –Access divided like a cake. –K users, each gets 1/K of the cake. –Low overhead. Cooperation (help) –Nodes relay messages. –Hierarchical Cooperation, Network Coding, Mobile Relays. –Primarily helpful to counter propagation path loss (multihop). –Overhead can be significant. Neutral (do no harm) –Interference Alignment Everyone gets half of their interference free rate at high SNR. –Capacity Optimal at high SNR. –Primarily the solution to interference problem. –Global channel knowledge will constitute huge overhead. –Distributed algorithms based on channel reciprocity reduce overhead.

Conclusion New tools expected to lead to more accurate capacity characterizations –Deterministic Channel Models [Avestimehr, Diggavi, Tse] –Interference Alignment [Cadambe, Jafar] –Structured Codes [Nazer, Gastpar] –Generalized Degrees of Freedom [Etkin,Tse, Wang] Fundamental characterization of overhead seems more distant.