55 search results - page 4 / 11 » Greedy Routing in Tree-Decomposed Graphs |
ISAAC
2000
Springer
13 years 11 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
CCECE
2009
IEEE
13 years 10 months ago
2009
IEEE
In this paper we investigate the limits of routing according to left- or righthand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits ...
CLUSTER
2002
IEEE
13 years 7 months ago
2002
IEEE
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
COMCOM
2006
13 years 7 months ago
2006
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
ICASSP
2010
IEEE
13 years 6 months ago
2010
IEEE
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...