Comparison of parallel versus hierarchical systems for data processing in distributed sensor networks

2002 ◽  
Vol 49 (2) ◽  
pp. 394-400 ◽  
Author(s):  
V. Gonzalez ◽  
E. Sanchis ◽  
G. Torralba ◽  
J. Martos
Keyword(s):  
Sensor Networks ◽  
Data Processing ◽  
Hierarchical Systems ◽  
Distributed Sensor Networks ◽  
Distributed Sensor

Distributed Hypothesis Formation in Distributed Sensor Networks

1983 ◽  
Author(s):  
C. Y. Chong ◽  
S. Mori ◽  
E. Tse ◽  
R. P. Wishner
Keyword(s):  
Sensor Networks ◽  
Distributed Sensor Networks ◽  
Distributed Sensor ◽  
Hypothesis Formation

scholarly journals Clique Size in Sensor Networks with Key Pre-Distribution Based on Transversal Design

2005 ◽  
Vol 1 (3-4) ◽  
pp. 345-354 ◽  
Author(s):  
Dibyendu Chakrabarti ◽  
Subhamoy Maitra ◽  
Bimal Roy
Keyword(s):  
Sensor Networks ◽  
Distributed Computing ◽  
Secure Communication ◽  
Sensor Nodes ◽  
Transversal Design ◽  
Secret Key ◽  
Distributed Sensor Networks ◽  
Distributed Sensor

Key pre-distribution is an important area of research in Distributed Sensor Networks (DSN). Two sensor nodes are considered connected for secure communication if they share one or more common secret key(s). It is important to analyse the largest subset of nodes in a DSN where each node is connected to every other node in that subset (i.e., the largest clique). This parameter (largest clique size) is important in terms of resiliency and capability towards efficient distributed computing in a DSN. In this paper, we concentrate on the schemes where the key pre-distribution strategies are based on transversal design and study the largest clique sizes. We show that merging of blocks to construct a node provides larger clique sizes than considering a block itself as a node in a transversal design.

Sign in / Sign up

Export Citation Format

Share Document