Component evolution in a secure wireless sensor network | Zendy

Bloznelis M. | Zendy; Jaworski J. | Zendy; Rybarczyk K. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Component evolution in a secure wireless sensor network

Author(s) -

Bloznelis M.,

Jaworski J.,

Rybarczyk K.

Publication year - 2009

Publication title -

networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.977

H-Index - 64

eISSN - 1097-0037

pISSN - 0028-3045

DOI - 10.1002/net.20256

Subject(s) - wireless sensor network , component (thermodynamics) , computer network , computer science , giant component , key (lock) , wireless network , key distribution in wireless sensor networks , wireless , set (abstract data type) , property (philosophy) , topology (electrical circuits) , distributed computing , random graph , theoretical computer science , mathematics , telecommunications , computer security , combinatorics , physics , graph , philosophy , epistemology , thermodynamics , programming language

We study a connectivity property of a secure wireless network that uses random pre‐distribution of keys. A network is composed of n sensors. Each sensor is assigned a collection of d different keys drawn uniformly at random from a given set of m keys. Two sensors are joined by a communication link if they share a common key. We show that for large n with high probability the connected component of size Ω( n ) emerges in the network when the probability of a link exceeds the threshold 1/ n . Similar component evolution is shown for networks where sensors communicate if they share at least s common keys. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research