Sciweavers

1578 search results - page 90 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
AINA
2010
IEEE
14 years 1 months ago
Iterative Route Discovery in AODV
Abstract—Several protocols for ad hoc network try to reduce redundancy as an effective measure against broadcast problems. Though these protocols ensure good performance in a fav...
Nashid Shahriar, Syed Ashker Ibne Mujib, Arup Rato...
JCM
2010
126views more  JCM 2010»
13 years 7 months ago
Adding Redundancy to Replication in Window-aware Delay-tolerant Routing
— This paper presents a resource-efficient protocol for opportunistic routing in delay-tolerant networks (DTN). First, our approach exploits the context of mobile nodes (speed, ...
Gabriel Sandulescu, Simin Nadjm-Tehrani
ICDE
1999
IEEE
143views Database» more  ICDE 1999»
14 years 10 months ago
Query Routing in Large-Scale Digital Library Systems
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the inc...
Ling Liu
ADHOC
2006
115views more  ADHOC 2006»
13 years 8 months ago
Routing characteristics of ad hoc networks with unidirectional links
Unidirectional links in an ad hoc network can result from factors such as heterogeneity of receiver and transmitter hardware, power control or topology control algorithms, or diff...
Jorjeta G. Jetcheva, David B. Johnson
WCW
2004
Springer
14 years 2 months ago
ShortCuts: Using Soft State to Improve DHT Routing
Distributed hash tables are increasingly being proposed as the core substrate for content delivery applications in the Internet, such as cooperative Web caches, Web index and sear...
Kiran Tati, Geoffrey M. Voelker