Sciweavers

5234 search results - page 324 / 1047
» Simulation of Computer Network Attacks
Sort
View
143
Voted
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
IJISEC
2007
119views more  IJISEC 2007»
15 years 6 months ago
An incentive compatible reputation mechanism for ubiquitous computing environments
The vision of ubiquitous computing is becoming a reality thanks to the advent of portable devices and the advances in wireless networking technologies. It aims to facilitate user ...
Jinshan Liu, Valérie Issarny
DAC
2005
ACM
16 years 7 months ago
Designing logic circuits for probabilistic computation in the presence of noise
As Si CMOS devices are scaled down into the nanoscale regime, current computer architecture approaches are reaching their practical limits. Future nano-architectures will confront...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
PEWASUN
2005
ACM
16 years 8 days ago
An error model for inter-vehicle communications in highway scenarios at 5.9GHz
The design and evaluation of Inter-Vehicle Communication (IVC) protocols rely much on the accurate and efficient computational simulations. For simulations of Medium Access Contro...
Yunpeng Zang, Lothar Stibor, Georgios Orfanos, Shu...
FOCS
2003
IEEE
16 years 17 hour ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell