Sciweavers

106 search results - page 1 / 22
» A Path Density Protocol for MANETs
Sort
View
AHSWN
2006
84views more  AHSWN 2006»
13 years 5 months ago
A Path Density Protocol for MANETs
Knowing or being able to measure the "path density" at sources of communications is essential to provide fair capacity distribution between sessions in multi-hop ad hoc ...
Evgeny Osipov, Christian F. Tschudin
MOBIHOC
2003
ACM
14 years 4 months ago
PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols
We develop a detailed approach to study how mobilityimpacts the performance of reactive MANET routing protocols. In particular we examine how the statistics of path durations inclu...
Narayanan Sadagopan, Fan Bai, Bhaskar Krishnamacha...
CNSR
2010
IEEE
140views Communications» more  CNSR 2010»
13 years 9 months ago
Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2
—MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constr...
Ulrich Herberg
ICDCSW
2006
IEEE
13 years 11 months ago
A directional gossip protocol for path discovery in MANETs
In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with th...
Roberto Beraldi
ADHOC
2008
95views more  ADHOC 2008»
13 years 5 months ago
The polarized gossip protocol for path discovery in MANETs
In this paper we present a novel probabilistic protocol for path discovery in Mobile Ad Hoc Networks (MANETs). The protocol implements what we call a polarized gossiping algorithm...
Roberto Beraldi