Sciweavers

1464 search results - page 281 / 293
» Worst case mobility in ad hoc networks
Sort
View
SUTC
2008
IEEE
14 years 1 months ago
Hovering Information - Self-Organising Information that Finds Its Own Storage
A piece of Hovering Information is a geo-localized information residing in a highly dynamic environment such as a mobile ad hoc network. This information is attached to a geograph...
Alfredo A. Villalba Castro, Giovanna Di Marzo Seru...
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...
AIPS
1996
13 years 8 months ago
Least-Commitment Action Selection
The principle of least commitment was embraced early in planning research. Hierarchical task networks (HTNs)reason about high-level tasks without committing to specific low-level ...
Marc Friedman, Daniel S. Weld
FIW
2003
120views Communications» more  FIW 2003»
13 years 8 months ago
A Policy Architecture for Enhancing and Controlling Features
Abstract. Features provide extensions to a basic service, but in new systems users require much greater flexibility oriented towards their needs. Traditional features do not easil...
Stephan Reiff-Marganiec, Kenneth J. Turner