477 search results - page 65 / 96 » Information-Theoretic Bounds for Mobile Ad-hoc Networks Rout... |
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join the mobile ad hoc network, contention and congestion are more likely. Th...
VTC
2007
IEEE
14 years 1 months ago
2007
IEEE
—The Hop Distance based Routing Protocol (HDR) is an on-demand based routing protocol suited for mobile ad hoc networks integrated with wired networks. HDR considers an efficient...
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...
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
Security is a critical issue in a mobile ad hoc network (MANET). In most of the previous protocols security is an added layer above the routing protocol. We propose a TrustAware R...