Sciweavers

1184 search results - page 215 / 237
» Connecting Sensor Networks with TCP IP Network
Sort
View
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 8 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
CORR
2011
Springer
148views Education» more  CORR 2011»
13 years 2 months ago
Modeling the pairwise key distribution scheme in the presence of unreliable links
Abstract— We investigate the secure connectivity of wireless sensor networks under the pairwise key distribution scheme of Chan et al.. Unlike recent work which was carried out u...
Osman Yagan, Armand M. Makowski
CCS
2006
ACM
13 years 11 months ago
Hot or not: revealing hidden services by their clock skew
Location-hidden services, as offered by anonymity systems such as Tor, allow servers to be operated under a pseudonym. As Tor is an overlay network, servers hosting hidden service...
Steven J. Murdoch
KDD
2010
ACM
215views Data Mining» more  KDD 2010»
13 years 11 months ago
On the quality of inferring interests from social neighbors
This paper intends to provide some insights of a scientific problem: how likely one’s interests can be inferred from his/her social connections – friends, friends’ friends,...
Zhen Wen, Ching-Yung Lin
ESORICS
2007
Springer
14 years 1 months ago
SilentKnock: Practical, Provably Undetectable Authentication
Port knocking is a technique first introduced in the blackhat and trade literature to prevent attackers from discovering and exploiting potentially vulnerable services on a networ...
Eugene Y. Vasserman, Nicholas Hopper, John Laxson,...