63 search results - page 9 / 13 » Greedy Routing with Bounded Stretch |
SENSYS
2003
ACM
14 years 3 months ago
2003
ACM
In the absence of location errors, geographic routing - using a combination of greedy forwarding and face routing - has been shown to work correctly and efficiently. The effects o...
OPODIS
2007
13 years 11 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
COMCOM
2000
13 years 9 months ago
2000
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
PODS
2003
ACM
14 years 10 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...