LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Key Predistribution Schemes Based on Orthogonal Arrays with Unique Hamming Distance Distribution

Photo by hudsoncrafted from unsplash

With the deep study of the Hamming distances of orthogonal arrays (OAs), the application of OAs has penetrated into many fields, one of which is to construct the key predistribution… Click to show full abstract

With the deep study of the Hamming distances of orthogonal arrays (OAs), the application of OAs has penetrated into many fields, one of which is to construct the key predistribution schemes (KPSs) for distributed sensor networks. In this paper, we define the Hamming distance distribution (HDD) of an OA and its uniqueness. Furthermore, we present some OAs with unique HDD. In KPSs based on these OAs, the calculations of metrics for evaluating connectivity and resilience can be simplified. We also illustrate that KPSs based on them have a wider application and better connectivity and resilience than the existing ones.

Keywords: predistribution schemes; distance distribution; key predistribution; orthogonal arrays; hamming distance

Journal Title: Wireless Personal Communications
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.