Sciweavers

235 search results - page 47 / 47
» A robust clock synchronization algorithm for wireless sensor...
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 8 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
JSAC
2008
140views more  JSAC 2008»
13 years 4 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
PETRA
2009
ACM
13 years 11 months ago
Ambient kitchen: designing situated services using a high fidelity prototyping environment
The Ambient Kitchen is a high fidelity prototype for exploring the design of pervasive computing algorithms and applications for everyday environments. The environment integrates ...
Patrick Olivier, Guangyou Xu, Andrew Monk, Jesse H...
SASN
2005
ACM
13 years 10 months ago
Key distribution and update for secure inter-group multicast communication
Group communication has become an important component in wireless networks. In this paper, we focus on the environments in which multiple groups coexist in the system, and both in...
Weichao Wang, Bharat K. Bhargava
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 1 months ago
AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming
Abstract--Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often ...
Andréa W. Richa, Christian Scheideler, Stef...