A unified approach to combinatorial key predistribution schemes for sensor networks

There have been numerous recent proposals for key predistribution schemes for wireless sensor networks based on various types of combinatorial structures such as designs and codes. Many of these schemes have very similar properties and are analysed in a similar manner. We seek to provide a unified framework to study these kinds of schemes. To do so, we define a new, general class of designs, termed “partially balanced t-designs”, that is sufficiently general that it encompasses almost all of the designs that have been proposed for combinatorial key predistribution schemes. However, this new class of designs still has sufficient structure that we are able to derive general formulas for the metrics of the resulting key predistribution schemes. These metrics can be evaluated for a particular scheme simply by substituting appropriate parameters of the underlying combinatorial structure into our general formulas. We also compare various classes of schemes based on different designs, and point out that some existing proposed schemes are in fact identical, even though their descriptions may seem different. We believe that our general framework should facilitate the analysis of proposals for combinatorial key predistribution schemes and their comparison with existing schemes, and also allow researchers to easily evaluate which scheme or schemes present the best combination of performance metrics for a given application scenario

Convex Cone Conditions on the Structure of Designs

Various known and original inequalities concerning the structure of combinatorial designs are established using polyhedral cones generated by incidence matrices. This work begins by giving definitions and elementary facts concerning t-designs. A connection with the incidence matrix W of t-subsets versus k-subsets of a finite set is mentioned. The opening chapter also discusses relevant facts about convex geometry (in particular, the Farkas Lemma) and presents an arsenal of binomial identities. The purpose of Chapter 2 is to study the cone generated by columns of W, viewed as an increasing union of cones with certain invariant automorphisms. The two subsequent chapters derive inequalities on block density and intersection patterns in t-designs. Chapter 5 outlines generalizations of W which correspond to hypergraph designs and poset designs. To conclude, an easy consequence of this theory for orthogonal arrays is used in a computing application which generalizes the method of two-point based samplin

The cone condition and t-designs

AbstractThe existence of a t-(v,k,λ) design implies that certain ‘almost constant’ vectors belong to the convex cone generated by the columns of the incidence matrix of t-subsets versus k-subsets of a v-set. We prove that some vectors are not in, or in a few cases are in, this cone—whether a design exists or not. When certain vectors are shown not to be in this cone, the implication is an inequality on the parameters or a condition on the structure of a t-design. We unify a number of known inequalities for t-designs, and derive some new ones concerning t-wise balanced designs, with this approach

Hermitian unitary matrices with modular permutation symmetry

We study Hermitian unitary matrices $\mathcal{S}\in\mathbb{C}^{n,n}$ with the following property: There exist $r\geq0$ and $t>0$ such that the entries of $\mathcal{S}$ satisfy $|\mathcal{S}_{jj}|=r$ and $|\mathcal{S}_{jk}|=t$ for all $j,k=1,\ldots,n$, $j\neq k$. We derive necessary conditions on the ratio $d:=r/t$ and show that these conditions are very restrictive except for the case when $n$ is even and the sum of the diagonal elements of $\S$ is zero. Examples of families of matrices $\mathcal{S}$ are constructed for $d$ belonging to certain intervals. The case of real matrices $\mathcal{S}$ is examined in more detail. It is demonstrated that a real $\mathcal{S}$ can exist only for $d=\frac{n}{2}-1$, or for $n$ even and $\frac{n}{2}+d\equiv1\pmod 2$. We provide a detailed description of the structure of real $\mathcal{S}$ with $d\geq\frac{n}{4}-\frac{3}{2}$, and derive a sufficient and necessary condition of their existence in terms of the existence of certain symmetric $(v,k,\lambda)$-designs. We prove that there exist no real $\mathcal{S}$ with $d\in\left(\frac{n}{6}-1,\frac{n}{4}-\frac{3}{2}\right)$. A parametrization of Hermitian unitary matrices is also proposed, and its generalization to general unitary matrices is given. At the end of the paper, the role of the studied matrices in quantum mechanics on graphs is briefly explained.Comment: revised version, 21 page