Construction of Secure and Energy-Efficient Connected Wireless Sensor Networks

In this paper, we study the problem of constructing secure and energy-efficient connected communication graphs of Wireless Sensor Networks (WSNs). Unlike most existing works optimizing only one of the three constraints of WSNs: security, connectivity or energy consumption, our proposed algorithm, named Cluster-based Graph Construction (CGC) Algorithm, produces a connected graph which is secure and energy-efficient. We prove the correctness of the algorithm, and then validate its performance in terms of 1) the number of keys used, 2) power levels and 3) the node degrees and the network diameter for simulated networks as it is ideal for a network to have 1) the less number of keys as a large number of keys would increase overheads of nodes, 2) the less power level consumptions to prolong the network's lifetime, and 3) the smaller node degrees and diameters for WSNs applications to produce lesslatency schedules. Finally, we conclude with the future research directions.