2808 search results - page 106 / 562 » Routing betweenness centrality |
169
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding...
157
click to vote
NETWORK
2008
15 years 6 months ago
2008
Multihomed subscribers are increasingly adopting intelligent route control solutions to optimize the cost and end-to-end performance of the traffic routed among the different link...
178
click to vote
WINET
2010
15 years 4 months ago
2010
We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery and are k-local, i.e., each intermediate node v’s routing decision only depends on knowl...
163
click to vote
EWSN
2009
Springer
16 years 6 months ago
2009
Springer
The low quality of wireless links leads to perpetual packet losses. While an acknowledgment mechanism is generally used to cope with these losses, multiple retransmissions neverthe...
182
Voted
MOBIHOC
2001
ACM
16 years 5 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...