Sciweavers

4670 search results - page 707 / 934
» Testing that distributions are close
Sort
View
MOBIHOC
2005
ACM
16 years 6 months ago
An efficient scheme for authenticating public keys in sensor networks
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
Wenliang Du, Ronghua Wang, Peng Ning
MOBIHOC
2001
ACM
16 years 6 months ago
Performance of a new Bluetooth scatternet formation protocol
A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. The constraints and properties of Bluetooth scatternets present special challenges in formin...
Ching Law, Amar K. Mehta, Kai-Yeung Siu
EWSN
2006
Springer
16 years 6 months ago
Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks
Nodes in sensor networks often encounter spatially-correlated contention, where multiple nodes in the same neighborhood all sense an event they need to transmit information about....
Kyle Jamieson, Hari Balakrishnan, Y. C. Tay
ICS
2010
Tsinghua U.
16 years 4 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
SPAA
2009
ACM
16 years 3 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...