On Covering the Nodes of Circulant Networks and Its Applications

Abstract

Coverage and security of network nodes are the critical issue in wireless sensor networks. The covering number is an essential tool in monitoring networks, as it gives the smallest number of detection devices needed to identify the location of an intruder or a malicious node. In this paper, we provide a graph theory based approach which could be beneficial to keep the network secure. The covering number for circulant networks are calculated exactly and their theoretical properties are explored in this article. Circulant networks have a broad range of applications in parallel computing and signal processing because of its increased connectivity. The minimal vertex covering set of a network serves as its back bone in the process of routing.