1 The Power of Non-Uniform Wireless Power ETH Zurich – Distributed Computing Group Magnus M. Halldorsson Reykjavik University Stephan Holzer ETH Zürich.

Slides:

Advertisements

Similar presentations

Impact of Interference on Multi-hop Wireless Network Performance

Advertisements

Ad Hoc and Sensor Networks – Roger Wattenhofer –11/1Ad Hoc and Sensor Networks – Roger Wattenhofer – Capacity Chapter 11 TexPoint fonts used in EMF. Read.

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.

Approximations for Min Connected Sensor Cover Ding-Zhu Du University of Texas at Dallas.

Chorus: Collision Resolution for Efficient Wireless Broadcast Xinyu Zhang, Kang G. Shin University of Michigan 1.

ETH Zurich – Distributed Computing Group Raphael Eidenbenz, INFOCOM ETH Zurich – Distributed Computing Group Raphael Eidenbenz, Thomas Locher, Roger.

Johannes Schneider –1 A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs Johannes Schneider Roger Wattenhofer TexPoint.

Does Topology Control Reduce Interference? Martin Burkhart Pascal von Rickenbach Roger Wattenhofer Aaron Zollinger.

XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks

Routing, Anycast, and Multicast for Mesh and Sensor Networks Roland Flury Roger Wattenhofer RAM Distributed Computing Group.

Department of Computer Science, University of Maryland, College Park, USA TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 18th Lecture Christian Schindelhauer.

A Robust Interference Model for Wireless Ad-Hoc Networks Pascal von Rickenbach Stefan Schmid Roger Wattenhofer Aaron Zollinger.

ETH Zurich – Distributed Computing Group Roger Wattenhofer 1ETH Zurich – Distributed Computing – Christoph Lenzen Roger Wattenhofer Exponential.

NCKU CSIE CIAL1 How Optimal are Wireless Scheduling Protocols? Authors: Thomas Moscibroda, Yvonne Anne Oswald and Roger Wattenhofer Publisher: IEEE INFOCOM.

Understanding Radio Irregularity in Wireless Networks Joint work with Patrick Stüdi, Fabian Kuhn and Gustavo Alonso.

Understanding Radio Irregularity in Wireless Networks Torsten Mütze, ETH Zürich joint work with Patrick Stüdi, Fabian Kuhn and Gustavo Alonso.

$ Spectrum Aware Load Balancing for WLANs Victor Bahl Ranveer Chandra Thomas Moscibroda Yunnan Wu.

1 Enhancing Cellular Multicast Performance Using Ad Hoc Networks Jun Cheol Park Sneha Kumar Kasera School of.

Geometric Spanners for Routing in Mobile Networks Jie Gao, Leonidas Guibas, John Hershberger, Li Zhang, An Zhu.

On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.

ETH Zurich – Distributed Computing Group Roger Wattenhofer 1ETH Zurich – Distributed Computing – Roger Wattenhofer TexPoint fonts used.

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Theory of Data Flow and Random Placement.

Uniform Power Connectivity University of the Negev

ETH Zurich – Distributed Computing Group Jasmin Smula 1ETH Zurich – Distributed Computing – Stephan Holzer Yvonne Anne Pignolet Jasmin.

Let’s get Physical! ETH Zurich – Distributed Computing – ICALP 2010 – Roger Wattenhofer.

Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.

Roger WISARD 2008 –1 The Complexity of Connectivity in Wireless Networks TexPoint fonts used in EMF. Read the TexPoint manual before you.

Roger ALGOSENSORS 2008 –1 …What Is It Good For?! TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA A.

CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.

An Efficient Location Service for Mobile Ad Hoc Networks Roland Flury Roger Wattenhofer Distributed Computing Group MLS.

Modeling Per-flow Throughput and Capturing Starvation in CSMA Multi-hop Wireless Networks M. Garetto, T. Salonidis, E. W. Knightly Rice University, Houston,

Algorithmic Models for Sensor Networks Stefan Schmid and Roger Wattenhofer WPDRTS, Island of Rhodes, Greece, 2006.

CS Dept, City Univ.1 The Complexity of Connectivity in Wireless Networks Presented by LUO Hongbo.

Adaptive Instantiation of the Protocol Interference Model in Mission-Critical Wireless Networks Xin Che, Xiaohui Liu, Xi Ju, Hongwei Zhang Computer Science.

STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.

Roger RAWNET 2008 –1 The Worst-Case Capacity of Wireless Networks TexPoint fonts used in EMF. Read the TexPoint manual before you delete.

Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.

Johannes PODC 2009 –1 Coloring Unstructured Wireless Multi-Hop Networks Johannes Schneider Roger Wattenhofer TexPoint fonts used in EMF. Read.

On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.

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.

The Case for Addressing the Limiting Impact of Interference on Wireless Scheduling Xin Che, Xi Ju, Hongwei Zhang {chexin, xiju,

Function Computation over Heterogeneous Wireless Sensor Networks Xuanyu Cao, Xinbing Wang, Songwu Lu Department of Electronic Engineering Shanghai Jiao.

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.

MAGNÚS MÁR HALLDÓRSSON, PROFESSOR SCHOOL OF COMPUTER SCIENCE | RU LECTURE MARATHON Capacity of Wireless Networks.

1 A Novel Capacity Analysis for Wireless Backhaul Mesh Networks Tein-Yaw David Chung, Kung-Chun Lee, and Hsiao-Chih George Lee Department of Computer Science.

Ad Hoc and Sensor Networks – Roger Wattenhofer –3/1Ad Hoc and Sensor Networks – Roger Wattenhofer – Topology Control Chapter 3 TexPoint fonts used in EMF.

Ad Hoc and Sensor Networks – Roger Wattenhofer –11/1Ad Hoc and Sensor Networks – Roger Wattenhofer – Capacity Chapter 11 TexPoint fonts used in EMF. Read.

PODC Distributed Computation of the Mode Fabian Kuhn Thomas Locher ETH Zurich, Switzerland Stefan Schmid TU Munich, Germany TexPoint fonts used in.

A New Hybrid Wireless Sensor Network Localization System Ahmed A. Ahmed, Hongchi Shi, and Yi Shang Department of Computer Science University of Missouri-Columbia.

Ad Hoc and Sensor Networks – Roger Wattenhofer –4/1Ad Hoc and Sensor Networks – Roger Wattenhofer – Topology Control Chapter 4 TexPoint fonts used in EMF.

On the Topology of Wireless Sensor Networks Sen Yang, Xinbing Wang, Luoyi Fu Department of Electronic Engineering, Shanghai Jiao Tong University, China.

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.

ETH Zurich – Distributed Computing Group Stephan Holzer 1ETH Zurich – Distributed Computing – Stephan Holzer Yvonne Anne Pignolet Jasmin.

Younghwan Yoo† and Dharma P. Agrawal‡ † School of Computer Science and Engineering, Pusan National University, Busan, KOREA ‡ OBR Center for Distributed.

ETH Zurich – Distributed Computing Group Stephan HolzerSODA Stephan Holzer Silvio Frischknecht Roger Wattenhofer Networks Cannot Compute Their Diameter.

Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad- hoc Networks Xiaohua (Edward) Li Department of Electrical and Computer Engineering.

ETH Zurich – Distributed Computing Group Stephan HolzerETH Zurich – Distributed Computing – Stephan Holzer - ETH Zürich Thomas Locher.

Impact of Interference on Multi-hop Wireless Network Performance

Does Topology Control Reduce Interference?

A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs Johannes Schneider Roger Wattenhofer TexPoint fonts used in EMF.

Xiaohua (Edward) Li and Juite Hwu

Ad Hoc Networks - Performance

Capacity TexPoint fonts used in EMF.

TexPoint fonts used in EMF.

The Capacity of Wireless Networks

Maximizing Broadcast Tree Lifetime in Wireless Ad Hoc Networks

Presentation transcript:

1 The Power of Non-Uniform Wireless Power ETH Zurich – Distributed Computing Group Magnus M. Halldorsson Reykjavik University Stephan Holzer ETH Zürich Pradipta Mitra Reykjavik University Roger Wattenhofer ETH Zürich TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A AA A Presented by Klaus-Tycho Förster Slides by Stephan Holzer and Roger Wattenhofer ETH Zürich

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 Wireless Communication

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 Wireless Communication EE, Physics Maxwell Equations Simulation, Testing ‘Scaling Laws’ Network Algorithms CS, Applied Math [Geometric] Graphs Worst-Case Analysis Any-Case Analysis

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 Interference Range CS Models: e.g. Disk Model (Protocol Model) Reception Range

ETH Zurich – Distributed Computing Group Stephan HolzerSODA

EE Models: e.g. SINR Model (Physical Model)

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013

Signal-To-Interference-Plus-Noise Ratio (SINR) Formula Minimum signal- to-interference ratio Power level of sender u Path-loss exponent Noise Distance between two nodes Received signal power from sender Received signal power from all other nodes (=interference)

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 The Capacity of a Network (How many concurrent wireless transmissions can you have)

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 … is a well-studied problem in Wireless Communication The Capacity of Wireless Networks Gupta, Kumar, 2000 [Toumpis, TWC’03] [Li et al, MOBICOM’01] [Gastpar et al, INFOCOM’02] [Gamal et al, INFOCOM’04] [Liu et al, INFOCOM’03] [Bansal et al, INFOCOM’03] [Yi et al, MOBIHOC’03] [Mitra et al, IPSN’04] [Arpacioglu et al, IPSN’04] [Giridhar et al, JSAC’05] [Barrenechea et al, IPSN’04] [Grossglauser et al, INFOCOM’01] [Kyasanur et al, MOBICOM’05] [Kodialam et al, MOBICOM’05] [Perevalov et al, INFOCOM’03] [Dousse et al, INFOCOM’04] [Zhang et al, INFOCOM’05] etc…

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 The Capacity of a Network (How many concurrent wireless transmissions can you have) Power control helps: arbitrarily better than uniform power (worst case) Arbitrary power: O(1)-Approximation Complex optimization problem Simpler ways?

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 Oblivious Power (usually: small constant) This Paper

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 Old Definitions v w

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 New Crucial Definitions

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 Structural Property * *= for non-weak links

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 Algorithm

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 Applications any p-power

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 Applications any p-power

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 Applications

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 Summary SINR-model capacity max. Length- oblivious power 3 (out of >5) applications

ETH Zurich – Distributed Computing Group Stephan HolzerSODA 2013 Thanks!