Sciweavers

2926 search results - page 166 / 586
» Partially Optimal Routing
Sort
View
INFOCOM
2002
IEEE
15 years 11 months ago
Gossip-based ad hoc routing
— Many ad hoc routing protocols are based on (some variant of) flooding. Despite various optimizations, many routing messages are propagated unnecessarily. We propose a gossipin...
Zygmunt J. Haas, Joseph Y. Halpern, Erran L. Li
MOBIHOC
2004
ACM
16 years 6 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
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...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
FCCM
2005
IEEE
139views VLSI» more  FCCM 2005»
16 years 14 days ago
A Study of the Scalability of On-Chip Routing for Just-in-Time FPGA Compilation
Just-in-time (JIT) compilation has been used in many applications to enable standard software binaries to execute on different underlying processor architectures. We previously in...
Roman L. Lysecky, Frank Vahid, Sheldon X.-D. Tan
WOWMOM
2005
ACM
132views Multimedia» more  WOWMOM 2005»
16 years 12 days ago
Comparisons of Inter-Domain Routing Schemes for Heterogeneous Ad Hoc Networks
— In this paper, we propose three interdomain routing schemes for communications between different ad-hoc groups (subnets), namely the implicit foreign degree based (IFD), the ex...
Wenbin Ma, Mooi Choo Chuah
PODC
2003
ACM
16 years 3 days ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...