632 search results - page 19 / 127 » On Routing in Circulant Graphs |
102
click to vote
WINET
2010
14 years 10 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...
113
click to vote
SPAA
2006
ACM
15 years 5 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
ICCSA
2004
Springer
15 years 5 months ago
2004
Springer
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...
ICPP
1992
IEEE
15 years 3 months ago
1992
IEEE
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...