An Integer Programming Formulation of the Key Management Problem in Wireless Sensor Networks
This work addresses secure communication in wireless sensor networks, but it is incremental as it applies an existing optimization method to a known scheme.
The authors tackled the key management problem in wireless sensor networks by proposing an integer programming formulation of the q-Composite scheme, demonstrating its effectiveness through numerical experiments and an illustrative example for a small-scale network.
With the advent of modern communications systems, much attention has been put on developing methods for securely transferring information between constituents of wireless sensor networks. To this effect, we introduce a mathematical programming formulation for the key management problem, which broadly serves as a mechanism for encrypting communications. In particular, an integer programming model of the q-Composite scheme is proposed and utilized to distribute keys among nodes of a network whose topology is known. Numerical experiments demonstrating the effectiveness of the proposed model are conducted using using a well-known optimization solver package. An illustrative example depicting an optimal encryption for a small-scale network is also presented.