105 search results - page 2 / 21 » Distributed Algorithms for Computing Alternate Paths Avoidin... |
IPSN
2011
Springer
13 years 1 days ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
ICPR
2010
IEEE
13 years 8 months ago
2010
IEEE
The conventional mean shift algorithm has been known to be sensitive to selecting a bandwidth. We present a robust mean shift algorithm with heterogeneous node weights that come f...
ECUMN
2007
Springer
14 years 2 months ago
2007
Springer
— Currently used IP routing protocols calculate and only use a single path between two nodes of a network, or in the best case, only paths with the same cost (with OSPF2 or IS-IS...
ADHOCNOW
2008
Springer
14 years 3 months ago
2008
Springer
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
TELETRAFFIC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract— Paths with loops, even transient ones, pose significant stability problems in high-speed networks. We present a new algorithm, named Distributed Path Computation with ...