268 search results - page 43 / 54 » An Analysis of Bitstate Hashing |
171
click to vote
INFOCOM
2006
IEEE
15 years 12 months ago
2006
IEEE
— Many applications that make use of sensor networks require secure communication. Because asymmetric-key solutions are difficult to implement in such a resource-constrained env...
143
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
160
click to vote
ADHOCNOW
2005
Springer
15 years 11 months ago
2005
Springer
We present the Ad-hoc On-demand Secure Routing (AOSR) protocol, which uses pairwise shared keys between pairs of mobile nodes and hash values keyed with them to verify the validity...
147
click to vote
AP2PC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availabili...
141
click to vote
OOPSLA
2005
Springer
15 years 11 months ago
2005
Springer
As object-oriented class libraries evolve, classes are occasionally deprecated in favor of others with roughly the same functionality. In Java’s standard libraries, for example,...