Sciweavers

153 search results - page 16 / 31
» An experimental study of greedy routing algorithms
Sort
View
FPGA
2007
ACM
153views FPGA» more  FPGA 2007»
15 years 3 months ago
Variation-aware routing for FPGAs
Chip design in the nanometer regime is becoming increasingly difficult due to process variations. ASIC designers have adopted statistical optimization techniques to mitigate the e...
Satish Sivaswamy, Kia Bazargan
GIR
2006
ACM
15 years 3 months ago
Retrieval of Similar Travel Routes Using GPS Tracklog Place Names
GPS tracklogs provide a valuable record of routes travelled. In this paper we describe initial experiments exploring the use of text information retrieval techniques for the locat...
Aiden R. Doherty, Cathal Gurrin, Gareth J. F. Jone...
84
Voted
SIGCOMM
2004
ACM
15 years 3 months ago
Comparison of routing metrics for static multi-hop wireless networks
Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to...
Richard Draves, Jitendra Padhye, Brian Zill
JNCA
2011
137views more  JNCA 2011»
14 years 4 months ago
Providing survivability against jamming attack for multi-radio multi-channel wireless mesh networks
Built upon a shared wireless medium, wireless mesh network is particularly vulnerable to jamming attacks. The ability to recover from attacks and maintain an acceptable level of s...
Shanshan Jiang, Yuan Xue
CODES
2009
IEEE
15 years 4 months ago
FlexRay schedule optimization of the static segment
The FlexRay bus is the prospective automotive standard communication system. For the sake of a high flexibility, the protocol includes a static time-triggered and a dynamic event...
Martin Lukasiewycz, Michael Glaß, Jürge...