Related papers: Towards $k$-connectivity in Heterogeneous Sensor N…
This paper presents a new key predistribution scheme for sensor networks based on structured graphs. Structured graphs are advantageous in that they can be optimized to minimize the parameter of interest. The proposed approach achieves a…
This paper contributes to the challenging field of security for wireless sensor networks by introducing a key agreement scheme in which sensor nodes create secure radio connections with their neighbours depending on the aid of third…
An important problem in wireless sensor networks is to find the minimal number of randomly deployed sensors making a network connected with a given probability. In practice sensors are often deployed one by one along a trajectory of a…
The dynamic establishment of shared information (e.g. secret key) between two entities is particularly important in networks with no pre-determined structure such as wireless sensor networks (and in general wireless mobile ad-hoc networks).…
In several applications in distributed systems, an important design criterion is ensuring that the network is sparse, i.e., does not contain too many edges, while achieving reliable connectivity. Sparsity ensures communication overhead…
Security in Wireless Sensor Networks (WSN) can be achieved by establishing shared keys among the neighbor sensor nodes to create secure communication links. The protocol to be used for such a pairwise key establishment is a key factor…
Sensor networks technologies had proved their great practicability in the real world, being just a matter of time until this kind of networks will be standardized and used in the field. This paper presents a new approach to secure the…
We study a method for key predistribution in a network of $n$ users where pairwise keys are computed by hashing users' IDs along with secret information that has been (pre)distributed to the network users by a trusted entity. A…
Random key graphs have received considerable attention and been used in various applications including secure sensor networks, social networks, the study of epidemics, cryptanalysis, and recommender systems. In this paper, we investigate a…
In spite of previous widely held belief of the incompatibility of public key cryptography (PKC) schemes for wireless sensor networks (WSNs), some recent works have shown that, PKC based schemes could be implemented for such networks in some…
This paper provides a necessary and sufficient condition for a random network with nodes Poissonly distributed on a unit square and a pair of nodes directly connected following a generic random connection model to be asymptotically almost…
Random intersection graphs have received much attention for nearly two decades, and currently have a wide range of applications ranging from key predistribution in wireless sensor networks to modeling social networks. In this paper, we…
With the development of wireless communication technologies which considerably contributed to the development of wireless sensor networks (WSN), we have witnessed an ever-increasing WSN based applications which induced a host of research…
A Wireless Sensor Network (WSN) is emerging field in Information and communication technology. In WSN data transmission and data collection are unsecure because of sensor node Incompatibility. So providing security to Sensor network is very…
Traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective for wireless sensor networks for the serious limitations in terms of computational power, energy…
It is commonly believed that real networks are scale-free and fraction of nodes $P(k)$ with degree $k$ satisfies the power law $P(k) \propto k^{-\gamma} \text{ for } k > k_{min} > 0$. Preferential attachment is the mechanism that has been…
Despite much research on probabilistic key predistribution schemes for wireless sensor networks over the past decade, few formal analyses exist that define schemes' resilience to node-capture attacks precisely and under realistic…
The constraints of lightweight distributed computing environments such as wireless sensor networks lend themselves to the use of symmetric cryptography to provide security services. The lack of central infrastructure after deployment of…
We study a heterogeneous two-tier wireless sensor network in which N heterogeneous access points (APs) collect sensing data from densely distributed sensors and then forward the data to M heterogeneous fusion centers (FCs). This…
Random $s$-intersection graphs have recently received much interest in a wide range of application areas. Broadly speaking, a random $s$-intersection graph is constructed by first assigning each vertex a set of items in some random manner,…