260 search results - page 39 / 52 » Geographical Routing in Intermittently Connected Ad Hoc Netw... |
ADHOC
2007
13 years 7 months ago
2007
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
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...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
IFM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present an industrial project conducted at Ericsson Danmark A/S, Telebit where formal methods in the form of Coloured Petri Nets (CP-nets or CPNs) have been used for t...
PEWASUN
2004
ACM
14 years 1 months ago
2004
ACM
The nature of ad hoc networks makes it a challenge to offer connections with an assured quality. In order to improve the performance of the network, multipath routing in combinati...