HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Algorithms for Radio Networks Exercise 7 Stefan Rührup

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Lower Bound for Sparse Euclidean Spanners Presented by- Deepak Kumar Gupta(Y6154), Nandan Kumar Dubey(Y6279), Vishal Agrawal(Y6541)
WSPD Applications.
O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs Chenyu Yan, Yang Xiang, and Feodor F. Dragan (WADS 2009) Kent State University, Kent,
Self Stabilizing Algorithms for Topology Management Presentation: Deniz Çokuslu.
Does Topology Control Reduce Interference? Martin Burkhart Pascal von Rickenbach Roger Wattenhofer Aaron Zollinger.
Ad-Hoc Networks Beyond Unit Disk Graphs
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 21st Lecture Christian Schindelhauer.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Trade-Offs and Topology Control 6th Week.
A Robust Interference Model for Wireless Ad-Hoc Networks Pascal von Rickenbach Stefan Schmid Roger Wattenhofer Aaron Zollinger.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 19th Lecture Christian Schindelhauer.
Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Theory of Interferences, Trade-Offs between.
Ad Hoc and Sensor Networks – Roger Wattenhofer –3/1Ad Hoc and Sensor Networks – Roger Wattenhofer – Topology Control Chapter 3 TexPoint fonts used in EMF.
Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.
Collective Tree Spanners of Graphs with Bounded Parameters F.F. Dragan and C. Yan Kent State University, USA.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 20th Lecture Christian Schindelhauer.
Chapter 4: Straight Line Drawing Ronald Kieft. Contents Introduction Algorithm 1: Shift Method Algorithm 2: Realizer Method Other parts of chapter 4 Questions?
Topology Control Algorithms Davide Bilò
Algorithmic Models for Sensor Networks Stefan Schmid and Roger Wattenhofer WPDRTS, Island of Rhodes, Greece, 2006.
New Algorithm DOM for Graph Coloring by Domination Covering
Maximal Independent Set Distributed Algorithms for Multi-Agent Networks Instructor: K. Sinan YILDIRIM.
Doubling Dimension in Real-World Graphs Melitta Lorraine Geistdoerfer Andersen.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
CS Dept, City Univ.1 The Complexity of Connectivity in Wireless Networks Presented by LUO Hongbo.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
Minimal Spanning Trees What is a minimal spanning tree (MST) and how to find one.
Algorithms for Network Optimization Problems This handout: Minimum Spanning Tree Problem Approximation Algorithms Traveling Salesman Problem.
Lecture 13 Graphs. Introduction to Graphs Examples of Graphs – Airline Route Map What is the fastest way to get from Pittsburgh to St Louis? What is the.
Separability and Topology Control of Quasi Unit Disk Graphs Philippe Giabbanelli CMPT 880 – Spring 2008.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi.
HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Algorithms for Radio Networks Exercise 11 Stefan Rührup
HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Algorithms for Radio Networks Exercise 12 Stefan Rührup
Ad Hoc and Sensor Networks – Roger Wattenhofer –3/1Ad Hoc and Sensor Networks – Roger Wattenhofer – Topology Control Chapter 3 TexPoint fonts used in EMF.
HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
Approximate Distance Oracles Mikkel Thorup and Uri Zwick Presented By Shiri Chechik.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
Lower Bound for Sparse Euclidean Spanners Presented by- Deepak Kumar Gupta(Y6154), Nandan Kumar Dubey(Y6279), Vishal Agrawal(Y6541)
Ad Hoc and Sensor Networks – Roger Wattenhofer –4/1Ad Hoc and Sensor Networks – Roger Wattenhofer – Topology Control Chapter 4 TexPoint fonts used in EMF.
Stefan Rührup 1 HEINZ NIXDORF INSTITUTE University of Paderborn, Germany Algorithms and Complexity Competitive Time and Traffic Analysis of Position-based.
Lecture 6 NP Class. P = ? NP = ? PSPACE They are central problems in computational complexity.
Tree Constructions Distributed Algorithms for Multi-Agent Networks Instructor: K. Sinan YILDIRIM.
Lecture 25 NP Class. P = ? NP = ? PSPACE They are central problems in computational complexity.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
Maximal Independent Set and Connected Dominating Set Xiaofeng Gao Research Group on Mobile Computing and Wireless Networking Univ. of Texas at Dallas.
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Trees Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. Fast.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
The midpoint of a circle is centre The line drawn from the centre to the circumference is … radius.
Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
Proof of correctness of Dijkstra’s algorithm: Basically, we need to prove two claims. (1)Let S be the set of vertices for which the shortest path from.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
CSE 373: Data Structures and Algorithms Lecture 21: Graphs V 1.
Minimum Spanning Trees
Does Topology Control Reduce Interference?
Topology Control –power control
Minimum Spanning Trees
Graph Operations And Representation
Trees.
Introduction Wireless Ad-Hoc Network
Lesson 6 CCSS G-C 3 Construct the inscribed and circumscribed circles of a triangle, and prove properties of angles for a quadrilateral inscribed in a.
Warm Up – Monday Calculate the Redundancy of the above network.
Presentation transcript:

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Algorithms for Radio Networks Exercise 7 Stefan Rührup

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 2 Mini-Exam No. 2 X X X X X Task 1 –Which graphs are Weak c-Spanners?  Yao (k>6)  SparsY (k>6)  SymmY (k>6) –Which implications are true (for appropriate constants c, c’, c’’ and d ≥ 2)?  weak c’-Spanner  (c’’,d)-Power Spanner  c-Spanner  (c’’,d)-Power Spanner  c-Spanner  weak c’-Spanner –Is the Minimum Spanning Tree a c-Spanner?  Yes.  No. X

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 3 Mini-Exam No. 2 Task 1 –Which trade-offs or incompatibilities do exist?  Energy x Congestion  Congestion x Dilation  Dilation x Energy –The HL Graph... ... is a c-Spanner, if  > 2  /(  -1) ... has constant node degree ... is a weak c-Spanner, if  > 2  /(  -1) X X X X X

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 4 Yao-GraphSparsYSymmY Task 2 Draw the Yao Graph, the Sparsified Yao Graph and the Symmetric Yao Graph for the given node set.

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 5 Task 3 Given the following node set V={v 1,...,v 5 }. The nodes have the following priorities: v1v1 v2v2 v5v5 v3v3 v4v4 1+  nodepriority v1v1 3 v2v2 5 v3v3 1 v4v4 4 v5v5 2

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 6 Task 3 Calculate domination radius and publication radius for layers 0 and 1 of a HL Graph with parameters r 0 =1 and  =  =2! dom. radiuspub. radius L0L0 r 0 = 1  · r 0 = 2 L1L1 r 1 = r 0 ·  1 = 2  · r 1 = 4

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 7 Task 3 Draw the HL Graph of the following node set. dom. radiuspub. radius L0L0 r 0 = 1  · r 0 = 2 L1L1 r 1 = r 0 ·  1 = 2  · r 1 = 4 v1v1 v2v2 v5v5 v3v3 v4v4 1+  L 0 -domination L 0 -publication/ L 1 -domination

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 8 Task 3 Draw the HL Graph of the following node set. dom. radiuspub. radius L0L0 r 0 = 1  · r 0 = 2 L1L1 r 1 = r 0 ·  1 = 2  · r 1 = 4 v1v1 v2v2 v5v5 v3v3 v4v L 1 -domination V(L 0 ) = { v 1,...,v 5 } V(L 1 ) = { v 2,v 4 } V(L 2 ) = { v 2 } layer-0 edges layer-1 edges

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 9 Task 3 v1v1 v2v2 v5v5 v3v3 v4v L 1 -domination v1v1 v2v2 v5v5 v3v3 v4v L 1 -publication An alternative solution...

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 10 Task 4 Prove that the Yao Graph is a weak 2-Spanner for k>6. u v w Hint: Consider a node u and show that for every (target) node v there is either an edge (u,v) or another node w in the same sector with |w- v| < |u-v|, i.e. on a path from u to v there is always a node that reduces the distance to the target node v in the same sector. Show that such path never leaves the circle around v with radius |u-v|. To show: For each pair of nodes (u,v) there is a path from u to v (connectivity) and the path never leaves the circle C(u, 2·|u-v|) (weak spanner property).

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 11 Task 4 Prove that the Yao Graph is a weak 2-Spanner for k>6. Consider some nodes u and v. Case 1: If v is the nearest neighbor in sector S(u,v), then there is an edge (u,v) Case 2: If there is a node w the nearest neighbor in sector S(u,v), i.e. |u-w| < |u-v|, then there is an edge (u,w). We apply cases 1 and 2 again to construct a path from w to v. u v u v w

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 12 Task 4 Proof... |w-v| 6  In each step there is a progress, i.e. the distance to the target becomes smaller. So, the path P(u,v) never leaves the circle C(v, |u-v|) (progress circle) which has diameter 2·|u-v|. Therefore, it never leaves the circle C(u, 2·|u-v|) (weak spanner circle). u v w progress circle weak spanner circle

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 13 Exercise 15 For any finite point set V  R d and a layer L i of a Hierarchical Layer Graph with parameters  ≥  > 1 we have the following 1.For any point u, the number of points in layer L i with |u-v| ≤ c r i is at most (2c+1) d. 2.The degree of the sub-graph L i ist at most (2  +1) d. 3.The interference number of L i is bounded by (2  +1) 2d.

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 14 Exercise For any point u, the number of points in layer L i with |u-v| ≤ c r i is at most (2c+1) d. d = 2 Min. distance for layer i: |u-v| ≥ r i All circles with radius r i /2 and a layer-i node as center do not intersect. If |u-v| ≤ c r i then C(u, r i /2) lies inside C(v, r i /2 + c r i ) Number of small circles inside the big one: π(r i /2 + c r i ) 2 / π(r i /2 ) 2 = (2c+1) 2 u v r i /2 c r i r i /2 + c r i

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity 15 Exercise 15 2.The degree of the sub-graph L i ist at most (2  +1) d. Within the domination radius  r i there are at most (2  + 1) d nodes (follows from 1.) 3.The interference number of L i is bounded by (2  +1) 2d. Two edges can only interfere when the distance is at most  r i. There are most (2  + 1) d nodes within this distance and their degree is at most (2  + 1) d.