MASSIMO FRANCESCHETTI University of California at San Diego Information-theoretic and physical limits on the capacity of wireless networks TexPoint fonts.

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

Energy-Efficient Distributed Algorithms for Ad hoc Wireless Networks Gopal Pandurangan Department of Computer Science Purdue University.
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.
A journey through data rate theorems for communication and control Massimo Franceschetti.
University At Buffalo Capacity Of Ad-Hoc Networks Ajay Kumar.
The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
1 On the Capacity of Ad Hoc Wireless Networks Under General Node Mobility Michele Garetto – Università di Torino Paolo Giaccone - Politecnico di Torino.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Wireless Communication
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
1 Capacity Scaling in Delay Tolerant Networks with Heterogeneous Mobile Nodes Michele Garetto – Università di Torino Paolo Giaccone - Politecnico di Torino.
Network Coding Schemes for Underwater Networks The Benefits of Implicit Acknowledgement Daniel E. Lucani, Muriel Médard, Milica Stojanovic Massachusetts.
Local Computation Algorithms
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.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAAAAAA Antonia Tulino Università degli Studi di Napoli Chautauqua.
Onur G. Guleryuz & Ulas C.Kozat DoCoMo USA Labs, San Jose, CA 95110
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
MASSIMO FRANCESCHETTI University of California at Berkeley Wireless sensor networks with noisy links.
Johannes Schneider –1 A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs Johannes Schneider Roger Wattenhofer TexPoint.
Cooperation / Contention - an Information Theoretic Perspective Syed A. Jafar University of California Irvine What is the optimal form of cooperation?
Size of giant component in Random Geometric Graphs
The double-dimer model and skew Young diagrams Richard W. Kenyon David B. Wilson Brown University Microsoft Research TexPoint fonts used in EMF. Read the.
Conceptual issues in scaling sensor networks Massimo Franceschetti, UC Berkeley.
MASSIMO FRANCESCHETTI University of California at Berkeley The wandering photon, a probabilistic model of wave propagation.
The Capacity of Wireless Ad Hoc Networks
Understanding Radio Irregularity in Wireless Networks Joint work with Patrick Stüdi, Fabian Kuhn and Gustavo Alonso.
Common Properties of Real Networks. Erdős-Rényi Random Graphs.
Towards a theory of large scale networks Massimo Franceschetti.
MASSIMO FRANCESCHETTI University of California at Berkeley Ad-hoc wireless networks with noisy links Lorna Booth, Matt Cook, Shuki Bruck, Ronald Meester.
Cross Layer Adaptive Control for Wireless Mesh Networks (and a theory of instantaneous capacity regions) Michael J. Neely, Rahul Urgaonkar University of.
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
Hierarchical Cooperation Achieves Linear Scaling in Ad Hoc Wireless Networks David Tse Wireless Foundations U.C. Berkeley MIT LIDS May 7, 2007 Joint work.
The role of entropy in wave propagation Stefano Marano Universita’ di Salerno Massimo Franceschetti University of California at Berkeley Francesco Palmieri.
Linear Codes for Distributed Source Coding: Reconstruction of a Function of the Sources -D. Krithivasan and S. Sandeep Pradhan -University of Michigan,
Capacity of Ad Hoc Networks Quality of Wireless links Physical Layer Issues The Channel Capacity Path Loss Model and Signal Degradation MAC for.
MIMO Multiple Input Multiple Output Communications © Omar Ahmad
NETW 707 Modeling and Simulation Amr El Mougy Maggie Mashaly.
The Complex Braid of Communication and Control Massimo Franceschetti.
Hierarchical Cooperation Achieves Linear Scaling in Ad Hoc Wireless Networks David Tse Wireless Foundations U.C. Berkeley AISP Workshop May 2, 2007 Joint.
Joint Physical Layer Coding and Network Coding for Bi-Directional Relaying Makesh Wilson, Krishna Narayanan, Henry Pfister and Alex Sprintson Department.
EE360 PRESENTATION On “Mobility Increases the Capacity of Ad-hoc Wireless Networks” By Matthias Grossglauser, David Tse IEEE INFOCOM 2001 Chris Lee 02/07/2014.
Network Architecture (R02) #4 24/10/2013 Wireless Capacity Jon Crowcroft,
Function Computation over Heterogeneous Wireless Sensor Networks Xuanyu Cao, Xinbing Wang, Songwu Lu Department of Electronic Engineering Shanghai Jiao.
Transmit Diversity with Channel Feedback Krishna K. Mukkavilli, Ashutosh Sabharwal, Michael Orchard and Behnaam Aazhang Department of Electrical and Computer.
Data and Computer Communications Ninth Edition by William Stallings Data and Computer Communications, Ninth Edition by William Stallings, (c) Pearson Education.
Physical Layer Fundamentals Physical MAC Physical LLC Data Link Network Transport Session Presentation Application OSI Ref ModelWireless Network Network.
Scaling Laws for Cognitive Radio Network with Heterogeneous Mobile Secondary Users Yingzhe Li, Xinbing Wang, Xiaohua Tian Department of Electronic Engineering.
Wireless Communication Elec 534 Set I September 9, 2007 Behnaam Aazhang.
1 The Power of Non-Uniform Wireless Power ETH Zurich – Distributed Computing Group Magnus M. Halldorsson Reykjavik University Stephan Holzer ETH Zürich.
Some Networking Aspects of Multiple Access Muriel Medard EECS MIT.
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.
ETH Zurich – Distributed Computing Group Stephan Holzer 1ETH Zurich – Distributed Computing – Stephan Holzer Yvonne Anne Pignolet Jasmin.
ETH Zurich – Distributed Computing Group Stephan Holzer 1ETH Zurich – Distributed Computing – Stephan Holzer Yvonne Anne Pignolet Jasmin.
1 On the Channel Capacity of Wireless Fading Channels C. D. Charalambous and S. Z. Denic School of Information Technology and Engineering, University of.
ETH Zurich – Distributed Computing Group Stephan Holzer 1ETH Zurich – Distributed Computing – Stephan Holzer Yvonne Anne Pignolet Jasmin.
Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,
Bridging the Gap: A Deterministic Model for Wireless Links David Tse Wireless Foundations U.C. Berkeley NSF Wireless Networks Workshop Aug 27, 2007 TexPoint.
Percolation of Clustered Wireless Networks
Capacity region of large wireless networks
Group Multicast Capacity in Large Scale Wireless Networks
Dimension reduction for finite trees in L1
Design of Multiple Antenna Coding Schemes with Channel Feedback
Distributed MIMO Patrick Maechler April 2, 2008.
The Capacity of Wireless Networks
Opportunistic Beam-forming with Limited Feedback
Pradeep Kyasanur Nitin H. Vaidya Presented by Chen, Chun-cheng
Presentation transcript:

MASSIMO FRANCESCHETTI University of California at San Diego Information-theoretic and physical limits on the capacity of wireless networks TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A AAAA P. Minero (UCSD), M. D. Migliore (U. Cassino)

Standing on the shoulder of giants

The problem Computers equipped with power constrained radios Randomly located Random source-destination pairs Transmit over a common wireless channel Possible cooperation among the nodes Maximum per-node information rate (bit/sec) ?

Scaling approach All pairs must achieve the same rate Consider the limit IEEE Trans-IT (2000)

Information-theoretic limits Provide the ultimate limits of communication Independent of any scheme used for communication

Assume physical propagation model Allow arbitrary cooperation among nodes Xie Kumar IEEE Trans-IT (2004) Xue Xie Kumar IEEE Trans-IT (2005) Leveque, Telatar IEEE Trans-IT (2005) Ahmad Jovicic Viswanath IEEE Trans-IT (2006) Gowaikar Hochwald Hassibi IEEE Trans-IT (2006) Xie Kumar IEEE Trans-IT (2006) Aeron Saligrama IEEE Trans-IT (2007) Franceschetti IEEE Trans-IT (2007) Ozgur Leveque Preissmann IEEE Trans-IT (2007) Ozgur Leveque Tse IEEE Trans-IT (2007) Classic Approach

Information theoretic truths High attenuation regime Low attenuation regime without fading Low attenuation regime with fading No attenuation regime, fading only

Good research should shrink the knowledge tree

There is only one scaling law This is a degrees of freedom limitation dictated by Maxwells physics and by Shannons theory of information. It is independent of channel models and cannot be overcome by any cooperative communication scheme.

Approach

... Approach...

Information flow decomposition A D V

First flow component...

Second flow component...

Second flow component D O M

Singular values have a phase transition at the critical value Hilbert-Schmidt decomposition of operator G

Singular values of operator G

Degrees of freedom theorem O

The finishing touches O

Understanding the space resource Space is a capacity bearing object Geometry plays a fundamental role in determining the number of degrees of freedom and hence the information capacity

Geometrical configurations In 2D the network capacity scales with the perimeter boundary of the network In 3D the network capacity scales with the surface boundary of the network

A different configuration Distribute nodes in a 3D volume of size Nodes are placed uniformly on a 2D surface inside the volume

Different configurations

The endless enigma (Salvador Dali) A hope beyond a shadow of a dream (John Keats) To be continued…