1 / 9

Wireless Sensor Networks 20th Lecture 17.01.2007

Wireless Sensor Networks 20th Lecture 17.01.2007. Christian Schindelhauer. Options for topology control. Topology control. Control link activity – deliberately use/not use certain links. Control node activity – deliberately turn on/off nodes. Topology control.

odette-black
Download Presentation

Wireless Sensor Networks 20th Lecture 17.01.2007

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Wireless SensorNetworks20th Lecture17.01.2007 Christian Schindelhauer

  2. Options for topology control Topology control Control link activity – deliberately use/not use certain links Control node activity – deliberately turn on/off nodes Topology control Hierarchical network – assign different roles to nodes; exploit that to control node/link activity Flat network – all nodes have essentially same role Power control Backbones Clustering

  3. (c,)-Power-Spanner Graph c-Spanner Graph weakc-Spanner Graph Geometric Spanner Graphs

  4. Delaunay Graph • Definition • Triangularization of a point set p such that no point is inside the circumcircle of any triangle • Facts • Dual graph of the Voronoi-diagram • In 2-D • edge flipping leads to the Delaunay-graph • Flip edge if circumcircle condition is not fulfilled • planar graphs • 5.08-spanner graph • Problem: Might produce very long links

  5. Yao-Graph • Choose nearest neighbor in each sector • c-spanner, • with stretch factor • Simple distributed construction • High (in-) degree YG6

  6. Disadvantage: Unbounded in-degree Interferences ! Yao-Family ⊇SymmY Symmetric Yao-Graph only symmetric edges not a spanner, nor weak spanner, yet power-spanner Yao-Graph Spanner ⊇ SparsY Sparsified Yao-Graph use only the shortestingoing edges weak- & power-Spanner, constant in-degree

  7. Directed Topologies Yao-Graph SparsY-Graph SymmY-Graph

  8. Relative Neighborhood Graph (RNG): There is an edge between u and v only if there is no vertex w such that d(u,w) and d(v,w) are both less than d(u,v) No spanners Small degree Gabriel Graph (GG): There is an edge between u and v if there is no vertex w in the circle with diameter chord (u,v) Perfect (1,2)-power spanners No strong spanners Possibly high degree Proximity Graphs

  9. Thank youand thanks to Holger Karl for some slides Wireless Sensor Networks Christian Schindelhauer 20th Lecture17.01.2007

More Related