Secure Connectivity of Heterogeneous Wireless Sensor Networks Under a Heterogeneous On-Off Channel Model
Rashad Eletreby, Osman Yagan

TL;DR
This paper analyzes the secure connectivity of heterogeneous wireless sensor networks by modeling the network as a composite random graph combining inhomogeneous random key graphs and inhomogeneous Erdős-Rényi graphs, deriving conditions for network connectivity.
Contribution
It introduces a new model for secure connectivity in heterogeneous sensor networks using a composite graph approach and establishes zero-one laws for network connectivity.
Findings
Derived zero-one laws for secure network connectivity
Identified parameter scaling conditions for no isolated nodes
Supported theoretical results with numerical simulations
Abstract
In this paper, we investigate the secure connectivity of wireless sensor networks utilizing the heterogeneous random key predistribution scheme, where each sensor node is classified as class- with probability for with and . A class- sensor is given cryptographic keys selected uniformly at random from a key pool of size . After deployment, two nodes can communicate securely if they share at least one cryptographic key. We consider the wireless connectivity of the network using a heterogeneous on-off channel model, where the channel between a class- node and a class- node is on (respectively, off) with probability (respectively, ) for . Collectively, two sensor nodes are adjacent if they i) share a cryptographic key and ii) have a wireless channel in between that is on.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity in Wireless Sensor Networks · Energy Efficient Wireless Sensor Networks · Mobile Ad Hoc Networks
