Sciweavers

691 search results - page 60 / 139
» Performance modeling of epidemic routing
Sort
View
INFOCOM
2007
IEEE
16 years 14 days ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
AINA
2007
IEEE
16 years 15 days ago
Trust Enhanced Secure Mobile Ad-Hoc Network Routing
In recent years, several trust and reputation models have been proposed to enhance the security of mobile ad hoc networks. However, they either fail to capture evidence of trustwo...
Venkatesan Balakrishnan, Vijay Varadharajan, Phill...
MSWIM
2004
ACM
15 years 11 months ago
Outdoor experimental comparison of four ad hoc routing algorithms
Most comparisons of wireless ad hoc routing algorithms involve simulated or indoor trial runs, or outdoor runs with only a small number of nodes, potentially leading to an incorre...
Robert S. Gray, David Kotz, Calvin C. Newport, Nik...
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
15 years 11 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
MOBICOM
2006
ACM
16 years 3 days ago
Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks
Underwater sensor networks consist of sensors and vehicles deployed to perform collaborative monitoring tasks over a given region. Underwater sensor networks will find applicatio...
Dario Pompili, Tommaso Melodia, Ian F. Akyildiz