Sciweavers

8259 search results - page 344 / 1652
» On Generalized Feistel Networks
Sort
View
MOBIHOC
2006
ACM
16 years 6 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
MOBIHOC
2003
ACM
16 years 6 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
ICCD
2004
IEEE
119views Hardware» more  ICCD 2004»
16 years 3 months ago
An Accurate Combinatorial Model for Performance Prediction of Deterministic Wormhole Routing in Torus Multicomputer Systems
Although several analytical models have been proposed in the literature for different interconnection networks with deterministic routing, very few of them have considered the eff...
Hashem Hashemi Najaf-abadi, Hamid Sarbazi-Azad
WISEC
2010
ACM
16 years 1 months ago
Automating the injection of believable decoys to detect snooping
We propose a novel trap-based architecture for enterprise networks that detects “silent” attackers who are eavesdropping network traffic. The primary contributions of our work...
Brian M. Bowen, Vasileios P. Kemerlis, Pratap V. P...
WISEC
2010
ACM
16 years 1 months ago
On the reliability of wireless fingerprinting using clock skews
Determining whether a client station should trust an access point is a known problem in wireless security. Traditional approaches to solving this problem resort to cryptography. B...
Chrisil Arackaparambil, Sergey Bratus, Anna Shubin...