Abstract
Sensor networks include nodes with limited computation and communication capabilities. One of the basic functions of sensor networks is to sense and transmit data to the end users. The resource constraints and security issues pose a challenge to information aggregation in large sensor networks. Bootstrapping keys is another challenge because public key cryptosystems are unsuitable for use in resource-constrained sensor networks. In this paper, we propose a solution by dividing the problem in two domains. First, we present a protocol for establishing cluster keys in sensor networks using verifiable secret sharing. We chose elliptic curve cryptosystems for security because of their smaller key size, faster computations and reductions in processing power. Second, we develop a Secure Data Aggregation and Verification (SecureDAV) protocol that ensures that the base station never accepts faulty aggregate readings. Integrity check of the readings is done using Merkle Hash Trees avoiding over-reliance on the cluster-heads.
Original language | English (US) |
---|---|
Title of host publication | GLOBECOM'04 - IEEE Global Telecommunications Conference |
Pages | 2175-2179 |
Number of pages | 5 |
Volume | 4 |
State | Published - 2004 |
Event | GLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States Duration: Nov 29 2004 → Dec 3 2004 |
Other
Other | GLOBECOM'04 - IEEE Global Telecommunications Conference |
---|---|
Country/Territory | United States |
City | Dallas, TX |
Period | 11/29/04 → 12/3/04 |
ASJC Scopus subject areas
- General Engineering