Sciweavers

4037 search results - page 137 / 808
» Routing without ordering
Sort
View
QSHINE
2005
IEEE
14 years 2 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
FGCN
2007
IEEE
173views Communications» more  FGCN 2007»
13 years 11 months ago
Preventing Cooperative Black Hole Attacks in Mobile Ad Hoc Networks: Simulation Implementation and Evaluation
A black hole attack is a severe attack that can be easily employed against routing in mobile ad hoc networks. A black hole is a malicious node that falsely replies for any route r...
Hesiri Weerasinghe, Huirong Fu
CCR
2004
120views more  CCR 2004»
13 years 9 months ago
MAC-layer anycasting in ad hoc networks
A wireless ad hoc network is formed by a group of wireless hosts, without the use of any infrastructure. To enable communication, hosts cooperate among themselves to forward packet...
Romit Roy Choudhury, Nitin H. Vaidya
ICRA
2010
IEEE
111views Robotics» more  ICRA 2010»
13 years 7 months ago
Visual path following on a manifold in unstructured three-dimensional terrain
— This paper describes the design and testing of a technique to enable long-range autonomous navigation using a stereo camera as the only sensor. During a learning phase, the rov...
Paul Timothy Furgale, Timothy D. Barfoot
DSOM
2006
Springer
14 years 26 days ago
Reconfiguring Self-stabilizing Publish/Subscribe Systems
Recent work on self-stabilizing routing in publish/subscribe systems showed that it is feasible to automate reconfigurations in case of faults by enabling the system to recover fro...
Michael A. Jaeger, Gero Mühl, Matthias Werner...