203 search results - page 8 / 41 » On greedy geographic routing algorithms in sensing-covered n... |
IPTPS
2004
Springer
14 years 27 days ago
2004
Springer
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...
22
Voted
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
IJAHUC
2006
13 years 7 months ago
2006
: Wireless sensor networks require energy efficient routing protocols owing to limited resource on the sensor node. In this paper, we develop optimal distance geographic routing (O...
MONET
2006
13 years 7 months ago
2006
In real sensor network deployments, spatial distributions of sensors are usually far from being uniform. Such networks often contain regions without enough sensor nodes, which we ...
IPSN
2005
Springer
14 years 1 months ago
2005
Springer
Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information ab...