Sciweavers

Share
14 search results - page 1 / 3
» Geometric spanner for routing in mobile networks
Sort
View
MOBIHOC
2001
ACM
12 years 9 months ago
Geometric spanner for routing in mobile networks
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...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
ICDCSW
2009
IEEE
12 years 4 months ago
A Geometric Routing Protocol in Disruption Tolerant Network
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...
Jingzhe Du, Evangelos Kranakis, Amiya Nayak
SEUS
2008
IEEE
12 years 3 months ago
M-Geocast: Robust and Energy-Efficient Geometric Routing for Mobile Sensor Networks
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...
Lynn Choi, Jae Kyun Jung, Byong-Ha Cho, Hyohyun Ch...
SPAA
2005
ACM
12 years 3 months ago
Constant density spanners for wireless ad-hoc networks
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-ef´Čücient routing. Many local-control strategies for maintaining...
Kishore Kothapalli, Christian Scheideler, Melih On...
IM
2008
11 years 9 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
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...
Chen Avin
books