103 search results - page 7 / 21 » Oblivious routing on geometric networks |
107
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
138
click to vote
MOBIHOC
2004
ACM
15 years 11 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
JNW
2007
14 years 11 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
121
click to vote
HPCA
2008
IEEE
16 years 2 days ago
2008
IEEE
Interconnection networks-on-chip (NOCs) are rapidly replacing other forms of interconnect in chip multiprocessors and system-on-chip designs. Existing interconnection networks use...