English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study the secure and reliable connectivity of wireless sensor networksunder the heterogeneous pairwise key predistribution scheme. This scheme wasrecently introduced as an extension of the random pairwise key predistributionscheme of Chan et al. to accommodate networks where the constituent sensorshave different capabilities or requirements for security and connectivity. Forsimplicity, we consider a heterogeneous network where each of the $n$ sensorsis classified as type-1 (respectively, type-2) with probability $\mu$(respectively, $1-\mu)$ where $0<\mu<1$. Each type-1 (respectively, type-2)node selects 1 (respectively, $K_n$) other nodes uniformly at random to bepaired with; according to the pairwise scheme each pair is then assigned aunique pairwise key so that they can securely communicate with each other. Weestablish critical conditions on $n, \mu$, and $K_n$ such that the resultingnetwork has minimum node degree of at least $k$ with high probability in thelimit of large network size. Our result constitutes a zero-one law for theminimum node degree of the recently introduced inhomogeneous random K-out graphmodel. This constitutes a crucial step towards establishing a similar zero-onelaw for the $k$-connectivity of the graph; i.e., for the property that thenetwork remains connected despite the failure of any $k-1$ nodes or links. Wepresent numerical results that indicate the usefulness of our results inselecting the parameters of the scheme in practical settings with finite numberof sensors.

Towards $k$-connectivity in Heterogeneous Sensor Networks under Pairwise Key Predistribution