Sciweavers

688 search results - page 123 / 138
» Random key-assignment for secure Wireless Sensor Networks
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
FOCS
2008
IEEE
14 years 2 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 8 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi
CONEXT
2008
ACM
13 years 10 months ago
ALPHA: an adaptive and lightweight protocol for hop-by-hop authentication
Wireless multi-hop networks are particularly susceptible to attacks based on flooding and the interception, tampering with, and forging of packets. Thus, reliable communication in...
Tobias Heer, Stefan Götz, Oscar García...
HICSS
2007
IEEE
222views Biometrics» more  HICSS 2007»
14 years 2 months ago
Battery-Sensing Intrusion Protection for Wireless Handheld Computers Using a Dynamic Threshold Calculation Algorithm for Attack
This paper proposes a pioneering Battery-Sensing Intrusion Protection System (B-SIPS) for mobile computers, which alerts on power changes detected on small wireless devices, using...
Timothy Buennemeyer, Faiz Munshi, Randy C. Marchan...