14 search results - page 1 / 3 » Geometric spanner for routing in mobile networks |
MOBIHOC
2001
ACM
14 years 3 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...
ICDCSW
2009
IEEE
13 years 11 months ago
2009
IEEE
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
SEUS
2008
IEEE
13 years 10 months ago
2008
IEEE
In this paper we investigate a practical routing solution for a new class of wireless sensor networks where any node can be mobile anytime. Assuming GPS-enabled sensor nodes we pro...
SPAA
2005
ACM
13 years 9 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
IM
2008
13 years 4 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...