390 search results - page 64 / 78 » Computing shortest paths for any number of hops |
101
click to vote
WCNC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— In this paper, the design of distributed spacefrequency codes (DSFCs) for wireless relay networks employing the amplify-and-forward (AAF) protocol is considered. The te...
115
click to vote
NETWORKS
2002
14 years 11 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
105
click to vote
DIALM
2003
ACM
15 years 5 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
WISEC
2010
ACM
15 years 6 months ago
2010
ACM
The problem of localizing in-band wormhole tunnels in MANETs is considered. In an in-band wormhole attack, colluding attackers use a covert tunnel to create the illusion that two ...
EUROPAR
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. When parallelizing hierarchical view frustum culling and collision detection, the low computation cost per node and the fact that the traversal path through the tree stru...