4037 search results - page 62 / 808 » Routing without ordering |
ICCAD
2005
IEEE
14 years 5 months ago
2005
IEEE
— The flip-chip package gives the highest chip density of any packaging method to support the pad-limited Application-Specific Integrated Circuit (ASIC) designs. In this paper,...
ICNP
1998
IEEE
14 years 1 months ago
1998
IEEE
We develop a theory for deciding, for any routing metric and any network, whether the messages in this network can be routed along paths whose metric values are maximum. In order ...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—In this paper, we consider routing in multi-hop wireless mesh networks. We analyze three standardized and commonly deployed routing mechanisms that we term “nodepair discovery...
MOBICOM
2006
ACM
14 years 2 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
MSWIM
2005
ACM
14 years 2 months ago
2005
ACM
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...