scispace - formally typeset
Search or ask a question

Showing papers on "Key distribution in wireless sensor networks published in 1969"


Journal ArticleDOI
TL;DR: This paper presents a model, which uses a Voronoi diagram based network architecture, which ensures the compatibility of the anomaly detection model for the resource constrained WSNs, and warrants data integrity between the MDCs and the LNs.
Abstract: Wireless sensor networks (WSNs) are prone to vulnerabilities due to their resource constraints and deployment in remote and unattended areas. A sensor node exhibits anomaly in behaviour due to its dying energy level or being compromised by the intruders. The node showing anomalous behaviours being a leader node (LN) of a cluster/group multifolds the vulnerability problem. To identify the anomalous nodes in WSNs, this paper presents a model, which uses a Voronoi diagram based network architecture. The network architecture, which deploys mobile data collectors (MDCs), ensures the compatibility of the anomaly detection model for the resource constrained WSNs, and warrants data integrity between the MDCs and the LNs. Our empirical evidence shows the effectiveness of the proposed approach.

17 citations


Journal ArticleDOI
TL;DR: A simple-but-effective routing tree algorithm is proposed to maintain a dynamic energy-efficient tree structure over all cluster heads, in order to further reduce the energy consumption for those heads to relay data to the sink.
Abstract: This paper proposes a new clustering scheme for wireless sensor networks, which efficiently balances the energy usage inter- and intra-clusters, by using the k - medoids method and the intra-cluster head update policy. Particularly, we propose a simple-but-effective routing tree algorithm to maintain a dynamic energy-efficient tree structure over all cluster heads, in order to further reduce the energy consumption for those heads to relay data to the sink. We also conduct simulations with realistic configurations to evaluate our design in terms of system lifetime, by comparing with LEACH. The experimental results show the efficiency and effectiveness of our work.

7 citations


Journal Article
TL;DR: This proposed paper consists of two algorithms IRL algorithm and data privacy mechanism that addresses this problem and proves that the proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.
Abstract: Full network level privacy has often been categorized into four sub-categories:Identity, Route, Location and Data privacy. Achieving full network level privacy is a challenging problem due to the conditions imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). This proposed paper consists of two algorithms IRL algorithm and data privacy mechanism that addresses this problem. The proposed system provides additional trustworthiness, less computation power, less storage space and more reliability. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.

1 citations