A unified approach to combinatorial key predistribution schemes for sensor networks (Q2448085)

A general framework to unify a large variety of combinatorial key predistribution schemes (KPSs) is developed. To support this framework, a very general class of combinatorial designs, the \textit{partially balanced \(t\)-designs}, is introduced. Numerous combinatorial designs are shown to be special cases of partially balanced \(t\)-designs, including all of those previously used in combinatorial KPSs. Relevant metrics for partially balanced \(t\)-designs are described, to facilitate both a comparison and a unification of existing schemes. Using these metrics, some apparently different schemes are shown to be equivalent. The general framework should prove to be useful in balancing competing objectives in the selection of a combinatorial KPS. Moreover, although the paper focusses on existing schemes, it provides support for the investigation of further schemes.