Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

PDF

Syracuse University

Wireless sensor networks

Publication Year

Articles 1 - 6 of 6

Full-Text Articles in Physical Sciences and Mathematics

A Key Predistribution Scheme For Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney Jan 2006

A Key Predistribution Scheme For Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

To achieve security in wireless sensor networks, it is important to be able to encrypt messages sent among sensor nodes. Keys for encryption purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key based schemes, are not suitable for wireless sensor networks. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the network size is large. Recently, a random key pre-distribution scheme and …


An Efficient Scheme For Authenticating Public Keys In Sensor Networks, Wenliang Du, Ronghua Wang, Peng Ning Jan 2005

An Efficient Scheme For Authenticating Public Keys In Sensor Networks, Wenliang Du, Ronghua Wang, Peng Ning

Electrical Engineering and Computer Science - All Scholarship

With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of some public key algorithms, such as Elliptic Curve Cryptography (ECC), is already close to being practical on sensor nodes. However, the energy consumption of PKC is still expensive, especially compared to symmetric-key algorithms. To maximize the lifetime of batteries, we should minimize the use of PKC whenever possible in sensor networks. This paper investigates how to replace one of the important PKC operations–the public key authentication–with symmetric key operations that are …


Lad: Localization Anomaly Detection For Wireless Sensor Networks, Wenliang Du, Lei Fang, Peng Ning Jan 2005

Lad: Localization Anomaly Detection For Wireless Sensor Networks, Wenliang Du, Lei Fang, Peng Ning

Electrical Engineering and Computer Science - All Scholarship

In wireless sensor networks (WSNs), sensors ’ locations play a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of location discovery (localization) schemes have been proposed. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration). Other sensors discover their locations based on the reference information provided by these beacon nodes. Most of the beacon-based localization schemes assume a benign environment, where all beacon nodes are supposed …


A Key Management Scheme For Wireless Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Shigang Chen Jan 2004

A Key Management Scheme For Wireless Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Shigang Chen

Electrical Engineering and Computer Science - All Scholarship

To achieve security in wireless sensor networks, it is important to be able to encrypt messages sent among sensor nodes. Keys for encryption purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key based schemes, are not suitable for wireless sensor networks. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the network size is large. Recently, a random key predistribution scheme and …


Decision Fusion In A Wireless Sensor Network With A Large Number Of Sensors, Ruixin Niu, Michael Moore, Dale Klamer Jan 2004

Decision Fusion In A Wireless Sensor Network With A Large Number Of Sensors, Ruixin Niu, Michael Moore, Dale Klamer

Electrical Engineering and Computer Science - All Scholarship

For a wireless sensor network (WSN) with a large number of sensors, a decision fusion rule using the total number of detections reported by local sensors for hypothesis testing, is proposed and studied. Based on a signal attenuation model where the received signal power decays as the distance from the target increases, the system level detection performance, namely probabilities of detection and false alarms, are derived and calculated. Without the knowledge of local sensors' performances and at low signal to noise ratio (SNR), this fusion rule can still achieve very good system level detection performance if the number of sensors …


A Pairwise Key Pre-Distribution Scheme For Wireless Sensor Networks, Wenliang Kevin Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney Jan 2000

A Pairwise Key Pre-Distribution Scheme For Wireless Sensor Networks, Wenliang Kevin Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

This paper, we provide a framework in which to study the security of key pre-distribution schemes, propose a new key pre-distribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an in-depth analysis of our scheme in terms of network resilience and associated overhead. Our scheme exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that communications between any additional nodes are compromised is close to zero. This desirable property lowers the initial payoff of smaller-scale network breaches to an adversary, and makes it necessary …