445 search results - page 64 / 89 » Maximizable Routing Metrics |
INFOCOM
1999
IEEE
15 years 1 months ago
1999
IEEE
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
GD
2008
Springer
14 years 10 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
TMC
2008
14 years 9 months ago
2008
In multihop wireless networks, the variability of channels results in some paths providing better performance than other paths. While it is well known that some paths are better t...
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--We present an analytical model combining geometric and stochastic approaches to describe the effects of attacks and countermeasures on MANETs. In particular, we focus on ...
AIMS
2007
Springer
14 years 11 months ago
2007
Springer
As the nodes and the resources in a structured peer-to-peer network are indexed with unique identifiers, and as the identifiers are assigned to nodes whose nodeId (i.e., the iden...