<--- Back to Details
First PageDocument Content
Routing algorithms / Network theory / Wireless networking / Routing protocols / NP-complete problems / Geographic routing / Routing / Shortest path problem / Unit disk graph / Graph theory / Mathematics / Theoretical computer science
Date: 2010-04-22 03:22:33
Routing algorithms
Network theory
Wireless networking
Routing protocols
NP-complete problems
Geographic routing
Routing
Shortest path problem
Unit disk graph
Graph theory
Mathematics
Theoretical computer science

11276_2007_45_14_5-web[removed]

Add to Reading List

Source URL: distcomp.ethz.ch

Download Document from Source Website

File Size: 536,82 KB

Share Document on Facebook

Similar Documents

Graph theory / Mathematics / NP-complete problems / Edsger W. Dijkstra / Routing algorithms / Network theory / Unit disk graph / Search algorithms / Connectivity / Topology control / Independent set / Dominating set

Sensor Networks Continue to Puzzle: Selected Open Problems Thomas Locher, Pascal von Rickenbach, and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland {lochert, pascalv, wattenhofer}

DocID: 1qIhH - View Document

Wireless networking / Wireless sensor network / Unit disk graph / Connectivity

Virtual Coordinates for Ad Hoc and Sensor Networks Thomas Moscibroda Regina O‘Dell Mirjam Wattenhofer

DocID: 1oOMS - View Document

Graph theory / Mathematics / Routing algorithms / Edsger W. Dijkstra / NP-complete problems / Network theory / Geographic routing / Shortest path problem / Geometric spanner / Routing / Planar graph / Unit disk graph

Geometric Ad-Hoc Routing: Of Theory and Practice∗ Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger Department of Computer Science ETH Zurich 8092 Zurich, Switzerland {kuhn, wattenhofer, yzhang, zollinger}@inf

DocID: 1ofsA - View Document

Graph theory / Routing algorithms / Mathematics / Computing / Wireless networking / Routing protocols / Network theory / Edsger W. Dijkstra / Geographic routing / Shortest path problem / Routing / Unit disk graph

11276_2007_45_14_5-web

DocID: 1o1zj - View Document

Graph theory / Mathematics / NP-complete problems / Spanning tree / Edsger W. Dijkstra / Routing algorithms / Search algorithms / Topology control / Unit disk graph / Connectivity / Minimum spanning tree / Bipartite graph

XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks Roger Wattenhofer and Aaron Zollinger {wattenhofer, zollinger}@inf.ethz.ch Department of Computer Science, ETH Zurich 8092 Zurich, Switzerland

DocID: 1nYMa - View Document