412 search results - page 43 / 83 » Random Key Predistribution Schemes for Sensor Networks |
ADHOCNOW
2010
Springer
15 years 17 days ago
2010
Springer
Designing message integrity schemes for data aggregation is an imperative problem for securing wireless sensor networks. In this paper, we propose three secure aggregation schemes ...
WCNC
2008
IEEE
15 years 5 months ago
2008
IEEE
—The hot spot problem is a typical byproduct of the many-to-one traffic pattern that characterizes most wireless sensor networks: the nodes with the best channel to the sink are ...
132
click to vote
ICESS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Wireless sensor networks (WSNs) are comprised of energy constrained nodes. This limitation has led to the crucial need for energy-aware protocols to produce an efficient ...
121
click to vote
ESAS
2004
Springer
15 years 4 months ago
2004
Springer
In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...