Sciweavers

1495 search results - page 288 / 299
» A Friend Mechanism for Mobile Ad Hoc Networks
Sort
View
CCCG
2008
13 years 9 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
CORR
2011
Springer
170views Education» more  CORR 2011»
13 years 2 months ago
Performance Comparison and Analysis of Preemptive-DSR and TORA
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. Preemptiv...
V. Ramesh, P. Subbaiah, N. Koteswar Rao, N. Subhas...
ICRA
2009
IEEE
119views Robotics» more  ICRA 2009»
14 years 2 months ago
Rapid pole climbing with a quadrupedal robot
— This paper describes the development of a legged robot designed for general locomotion of complex terrain but specialized for dynamical, high-speed climbing of a uniformly conv...
G. Clark Haynes, Alex Khripin, Goran Lynch, Jonath...
IEEEIAS
2008
IEEE
14 years 1 months ago
Geolocation-Based Trust for Vanet's Privacy
: Research in Vehicular Ad Hoc NETworks (VANETs) has evolved considerably over the last years. Security and privacy in VANETs have recently appealed special interest in the researc...
Jetzabel Serna, Jesus Luna, Manel Medina
HPDC
1997
IEEE
13 years 11 months ago
A Directory Service for Configuring High-Performance Distributed Computations
High-performance execution in distributed computing environments often requires careful selection and configuration not only of computers, networks, and other resources but also o...
Steven Fitzgerald, Ian T. Foster, Carl Kesselman, ...