Key Pre-distribution Schemes via Certain Resolvable Block Designs
Utilitas Mathematica · 2024
DOI: 10.61091/um120-03 ↗Kurz gefasst
Fachartikel in der Zeitschrift Utilitas Mathematica, 2024. Verfasst von Shyam Saurabh.
Abstract (Originalsprache)
Earlier optimal key pre\(-\)distribution schemes (KPSs) for distributed sensor networks (DSNs) were proposed using combinatorial designs via transversal designs, affine, and partially affine resolvable designs. Here, nearly optimal KPSs are introduced and a class of such KPSs is obtained from resolvable group divisible designs. These KPSs are nearly optimal in the sense of local connectivity. A metric for the efficiency of KPSs is given. Further, an optimal KPS has also been proposed using affine resolvable \( L_{2} \)-type design.
Zitieren
APA
Saurabh, S. (2024). Key Pre-distribution Schemes via Certain Resolvable Block Designs. Utilitas Mathematica. https://doi.org/10.61091/um120-03
Vancouver
Saurabh S. Key Pre-distribution Schemes via Certain Resolvable Block Designs. Utilitas Mathematica. 2024. doi:10.61091/um120-03
BibTeX
@article{Saurabh2024,
author = {Saurabh, Shyam},
title = {Key Pre-distribution Schemes via Certain Resolvable Block Designs},
journal = {Utilitas Mathematica},
year = {2024},
doi = {10.61091/um120-03}
}
EUVIMED