Sciweavers

953 search results - page 65 / 191
» A Heuristic for Channel Routing
Sort
View
CCR
2004
120views more  CCR 2004»
13 years 7 months ago
MAC-layer anycasting in ad hoc networks
A wireless ad hoc network is formed by a group of wireless hosts, without the use of any infrastructure. To enable communication, hosts cooperate among themselves to forward packet...
Romit Roy Choudhury, Nitin H. Vaidya
WIOPT
2006
IEEE
14 years 1 months ago
Achievable performance improvements provided by cooperative diversity
— This paper examines the achievable performance gains when a particular class of cooperative relaying known as best-select is employed. In essence, best-select seeks to improve ...
Stephan Bohacek
CRYPTO
2005
Springer
137views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
A Formal Treatment of Onion Routing
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the crypto...
Jan Camenisch, Anna Lysyanskaya
CAL
2004
13 years 7 months ago
An Efficient Fault-Tolerant Routing Methodology for Meshes and Tori
In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade...
María Engracia Gómez, José Du...
ICCAD
2006
IEEE
304views Hardware» more  ICCAD 2006»
14 years 4 months ago
Trunk decomposition based global routing optimization
We present global routing optimization methods which are not based on rip-up and re-route framework. In particular, the routing optimization is based on trunk decomposition [13] o...
Devang Jariwala, John Lillis