pith. sign in

arxiv: 1901.07314 · v1 · pith:CMMXUZOHnew · submitted 2019-01-09 · 💻 cs.CR

An Integer Programming Formulation of the Key Management Problem in Wireless Sensor Networks

classification 💻 cs.CR
keywords programmingcommunicationsformulationintegermanagementmodelnetworknetworks
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.