نتایج جستجو برای: random key predistribution

تعداد نتایج: 820182  

2014
Jun Zhao Osman Yagan Osman Yağan Virgil Gligor

In wireless sensor networks (WSNs), the Eschenauer–Gligor (EG) key pre-distribution scheme is a widely recognized way to secure communications. Although the connectivity properties of secure WSNs with the EG scheme have been extensively investigated, few results address physical transmission constraints. These constraints reflect real–world implementations of WSNs in which two sensors have to b...

2006
Arjan Durresi Vijay Bulusu Vamsi Paruchuri Mimoza Durresi Raj Jain

Key predistribution is a popular technique for key distribution in sensor networks. The schemes available in current literature using this approach are for nodes with no or limited mobility. In this paper we present two key predistribution based scheme for heterogeneous networks i.e. networks which consist of nodes which are stationary as well as highly mobile. The existing schemes make use of ...

2017
Rashad Eletreby Osman Yagan

We study the connectivity of a random graph formed by the intersection of an inhomogeneous random key graph with an inhomogeneous Erdős-Rényi graph. The former graph is naturally induced by a heterogeneous random key predistribution scheme introduced for securing wireless sensor network communications. In this scheme, nodes are divided into r classes according to a probability distribution μ = ...

Journal: :IACR Cryptology ePrint Archive 2009
Simon R. Blackburn Tuvi Etzion Keith M. Martin Maura B. Paterson

We consider symmetric key predistribution in grid-based wireless sensor networks. Networks consisting of wireless sensor nodes arranged in a grid pattern have many useful applications, including environmental monitoring and agribusiness. The structured physical distribution of nodes in such networks facilitates efficient distribution of keys to the nodes prior to deployment. It has been shown t...

Journal: :CoRR 2018
Satoshi Takabe Tadashi Wadayama

k-connectivity of random graphs is a fundamental property indicating reliability of multi-hop wireless sensor networks (WSN). WSNs comprising of sensor nodes with limited power resources are modeled by random graphs with unreliable nodes, which is known as the node fault model. In this paper, we investigate k-connectivity of random graphs in the node fault model by evaluating the network breakd...

2007
Firdous Kausar Sajid Hussain Tai-Hoon Kim Ashraf Masood

Key pre-distribution schemes are a favored solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main drawback is seen to be the large storage overhead imposed on resource-constrained devices and also these schemes are quite insecure because pre-loading global secrets onto exposed devices strengthens the incentive for attackers...

2010
Keith M. Martin

There are many applications of symmetric cryptography where the only realistic option is to predistribute key material in advance of deployment, rather than provide online key distribution. The problem of how most effectively to predistribute keys is inherently combinatorial. We revisit some early combinatorial key predistribution shemes and discuss their limitations. We then explain why this p...

2016
Neetu Rani Manik Gupta

A wireless sensor network consist distributed sensors which are used to monitor physical or environmental conditions like temperature, sound, pressure and so on. Wireless sensor network are used in future in many applications like military, investigation teams, researches and so on. Security is the main issue in wireless sensor network. Sensor network arrange several types of data packets, pack...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید