Sciweavers

85 search results - page 8 / 17
» Landmark-Based Routing in Dynamic Graphs
Sort
View
IPPS
2003
IEEE
14 years 10 days ago
An Extended Link Reversal Protocol in Dynamic Networks
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
Jie Wu, Fei Dai
VR
2007
IEEE
141views Virtual Reality» more  VR 2007»
14 years 1 months ago
Real-time Path Planning for Virtual Agents in Dynamic Environments
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
JUCS
2010
142views more  JUCS 2010»
13 years 5 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
13 years 4 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras
ICNP
2000
IEEE
13 years 11 months ago
Convergent Multi-Path Routing
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
Jorge Arturo Cobb