Sciweavers

362 search results - page 9 / 73
» Authenticated Adversarial Routing
Sort
View
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
14 years 8 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
CN
1999
88views more  CN 1999»
13 years 7 months ago
Building a high-performance, programmable secure coprocessor
Secure coprocessors enable secure distributed applications by providing safe havens where an application program can Z .execute and accumulate state , free of observation and inte...
Sean W. Smith, Steve Weingart
JSAC
2010
86views more  JSAC 2010»
13 years 6 months ago
A randomized countermeasure against parasitic adversaries in wireless sensor networks
—Due to their limited capabilities, wireless sensor nodes are subject to physical attacks that are hard to defend against. In this paper, we first identify a typical attacker, c...
Panagiotis Papadimitratos, Jun Luo, Jean-Pierre Hu...
CAL
2004
13 years 7 months ago
Globally Adaptive Load-Balanced Routing on Tori
We introduce a new method of adaptive routing on k-ary n-cubes, Globally Adaptive Load-Balance (GAL). GAL makes global routing decisions using global information. In contrast, most...
Arjun Singh, William J. Dally, Brian Towles, Amit ...
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 8 months ago
GossiCrypt: Wireless Sensor Network Data Confidentiality Against Parasitic Adversaries
Resource and cost constraints remain a challenge for wireless sensor network security. In this paper, we propose a new approach to protect confidentiality against a parasitic adver...
Jun Luo, Panos Papadimitratos, Jean-Pierre Hubaux