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.
               
Click one of the above tabs to view related content.