Sciweavers

425 search results - page 41 / 85
» A Fully Dynamic Algorithm for Distributed Shortest Paths
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
Wei Zeng, Rik Sarkar, Feng Luo 0002, Xianfeng Gu, ...
PDP
2005
IEEE
14 years 2 months ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz
IPPS
2005
IEEE
14 years 2 months ago
Dynamic RWA Based on the Combination of Mobile Agents Technique and Genetic Algorithm in WDM Networks with Sparse Wavelength Con
In this paper, we study the dynamic RWA problem in WDM networks with sparse wavelength conversion and propose a novel hybrid algorithm for it based on the combination of mobile ag...
Vinh Trong Le, Xiaohong Jiang, Son-Hong Ngo, Susum...
JNW
2007
118views more  JNW 2007»
13 years 8 months ago
Collision Prevention Platform for a Dynamic Group of Asynchronous Cooperative Mobile Robots
— This paper presents a fail-safe platform on which cooperative mobile robots rely for their motion. The platform consists of a collision prevention protocol for a dynamic group ...
Rami Yared, Xavier Défago, Julien Iguchi-Ca...
GRC
2008
IEEE
13 years 10 months ago
Effects of Varying the Delay Distribution in Random, Scale-free, and Small-world Networks
Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artificial networks. However, these approaches have not factored...
Bum Soon Jang, Timothy Mann, Yoonsuck Choe