Sciweavers

995 search results - page 169 / 199
» Gossip-based ad hoc routing
Sort
View
WMCSA
1999
IEEE
15 years 2 months ago
Ad-hoc On-Demand Distance Vector Routing
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In th...
Charles E. Perkins, Elizabeth M. Belding-Royer
ADHOC
2007
108views more  ADHOC 2007»
14 years 9 months ago
A self-healing On-demand Geographic Path Routing Protocol for mobile ad-hoc networks
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...
Venkata C. Giruka, Mukesh Singhal
COMCOM
2007
94views more  COMCOM 2007»
14 years 9 months ago
Adaptive backup routing for ad-hoc networks
The network topology changes frequently in ad-hoc networks. Some on-demand protocols with multi-paths or backup routes have been proposed to improve the performance in ad-hoc netw...
Wei Kuang Lai, Sheng-Yu Hsiao, Yuh-Chung Lin
IWCMC
2006
ACM
15 years 3 months ago
Performance analysis of epidemic routing under contention
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...
Apoorva Jindal, Konstantinos Psounis
TON
2008
109views more  TON 2008»
14 years 9 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...