Sciweavers

497 search results - page 8 / 100
» Curve-Based Greedy Routing Algorithm for Sensor Networks
Sort
View
ALGOSENSORS
2009
Springer
14 years 4 days ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...
SPAA
1994
ACM
14 years 26 days ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
INFOCOM
2009
IEEE
14 years 3 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
WDAG
2005
Springer
102views Algorithms» more  WDAG 2005»
14 years 2 months ago
Papillon: Greedy Routing in Rings
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku
IEEEHPCS
2010
13 years 7 months ago
An experimental study of greedy routing algorithms
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...
Stavros Athanassopoulos, Christos Kaklamanis, Ilia...