477 search results - page 87 / 96 » Information-Theoretic Bounds for Mobile Ad-hoc Networks Rout... |
MOBIHOC
2004
ACM
14 years 6 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
IWCMC
2006
ACM
14 years 20 days ago
2006
ACM
Epidemic routing has been proposed as a robust transmission scheme for sparse mobile ad hoc networks. Under the assumption of no contention, epidemic routing has the minimum end-t...
DIMVA
2004
13 years 8 months ago
2004
: The fact that security is a critical problem when implementing mobile ad hoc networks (MANETs) is widely acknowledged. One of the different kinds of misbehavior a node may exhibi...
SIGCOMM
2004
ACM
14 years 4 days ago
2004
ACM
Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to...
WINET
2010
13 years 5 months ago
2010
In this paper, we present a model that estimates the time duration of routes formed by several intermediate nodes in mobile multi-hop ad-hoc networks. First, we analyze a 3-node ro...