[Paper Review] Designing Securely and Reliably Connected Wireless Sensor Networks

Jun Zhao, Osman Yağan+1 more|arXiv (Cornell University)|Jan 8, 2015

Security in Wireless Sensor Networks27 references4 citations

TL;DR

This paper derives rigorous conditions for network connectivity in wireless sensor networks using the q-composite key predistribution scheme under physical transmission constraints and unreliable wireless links. It provides analytical guidelines for designing secure, reliable, and connected sensor networks by modeling link activity probabilistically and validating results through numerical experiments.

ABSTRACT

In wireless sensor networks, the $q$-composite key predistribution scheme is a widely recognized way to secure communications. Although connectivity properties of secure sensor networks with the $q$-composite scheme have been studied in the literature, few results address physical transmission constraints since it is challenging to analyze the network connectivity in consideration of both the $q$-composite scheme and transmission constraints together. These transmission constraints reflect real-world implementations of sensor networks in which two sensors have to be within a certain distance from each other to communicate. In this paper, we rigorously derive conditions for connectivity in sensor networks employing the $q$-composite scheme under transmission constraints. Furthermore, we extend the analysis to consider the unreliability of wireless links by modeling each link being independently active with some probability. Our results provide useful guidelines for designing securely and reliably connected sensor networks. We also present numerical experiments to confirm the analytical results.

Motivation & Objective

• To address the gap in analyzing network connectivity when combining q-composite key predistribution with physical transmission constraints.
• To model and quantify the impact of unreliable wireless links on network connectivity in q-composite secured sensor networks.
• To derive analytical conditions ensuring secure and reliable connectivity under realistic transmission and link failure constraints.
• To provide practical design guidelines for deploying secure and reliable wireless sensor networks.

Proposed method

• The authors model sensor networks using the q-composite key predistribution scheme, where each sensor is preloaded with q random keys from a shared key pool.
• They incorporate transmission constraints by assuming two sensors can only communicate if within a certain transmission range.
• The network connectivity is analyzed under a probabilistic link model, where each link is independently active with a given probability.
• Theoretical conditions for network connectivity are derived using random graph theory and probabilistic analysis, considering both key predistribution and transmission constraints.
• The analysis is extended to evaluate the probability of full network connectivity under varying parameters such as node density, key ring size, and transmission range.
• Numerical experiments are conducted to validate the analytical findings and demonstrate the accuracy of the derived conditions.

Experimental results

Research questions

• RQ1 What conditions ensure network connectivity in q-composite secured wireless sensor networks when transmission range is limited?
• RQ2 How does link unreliability—modeled as independent probabilistic link activity—affect overall network connectivity?
• RQ3 What is the relationship between key ring size, transmission range, and the probability of achieving full network connectivity?
• RQ4 How do transmission constraints and link failures jointly impact the design of secure and reliable sensor networks?

Key findings

• The paper derives explicit analytical conditions under which the network remains connected despite transmission range limitations and probabilistic link failures.
• It shows that increasing the key ring size q significantly improves connectivity probability, especially in sparse networks.
• The results demonstrate that reliable connectivity can be achieved even with moderate transmission ranges, provided the key ring size and node density are appropriately chosen.
• Numerical experiments confirm that the derived analytical bounds closely match simulation outcomes, validating the theoretical model.