390 search results - page 51 / 78 » Computing shortest paths for any number of hops |
118
click to vote
MOBIHOC
2004
ACM
16 years 1 months ago
2004
ACM
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
116
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
123
click to vote
PDCAT
2005
Springer
15 years 7 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
110
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...
118
click to vote
DCOSS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...