477 search results - page 79 / 96 » Information-Theoretic Bounds for Mobile Ad-hoc Networks Rout... |
ICC
2009
IEEE
13 years 5 months ago
2009
IEEE
Conventional routing algorithms in mobile ad hoc networks (MANETs), i.e., multi-hop forwarding, assume the existence of contemporaneous source-destination paths and are not scalabl...
EJWCN
2010
13 years 2 months ago
2010
This paper addresses mobility control routing in wireless networks. Given a data flow request between a sourcedestination pair, the problem is to move nodes towards the best placem...
WS
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
ICPADS
2005
IEEE
14 years 28 days ago
2005
IEEE
Point-to-point transmissions represent a fundamental primitive in any communication network. Despite many proave appeared in the literature, providing an efficient implementation ...
ADHOC
2007
13 years 7 months ago
2007
We present a self-healing On-demand Geographic Path Routing Protocol (OGPR) for mobile ad-hoc networks. OGPR is an efficient, stateless, and scalable routing protocol that inherit...