Skip to main content
SpringerLink
Log in

On Covering the Nodes of Circulant Networks and Its Applications

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Angel, D., & Amutha, A. (2012). Optimal covering on hypercube networks. Lecture Notes in Information Technology, 38, 522–528.

    Google Scholar 

  2. Angel, D., & Amutha, A. (2015). Exact covering on butterfly and Benes networks. International Journal of Pure and Applied Mathematics, 101(6), 863–872.

    Google Scholar 

  3. Balaji, S., Swaminathan, V., & Kannan, K. A. (2010). Simple algorithm to optimize maximum independent set. Advanced Modeling and Optimization, 12(1), 107–118.

    MathSciNet  MATH  Google Scholar 

  4. Bermond, J. C., Comellas, F., & Hsu, D. F. (1995). Distributed loop computer networks. A survey. Journal of Parallel and Distributed Computing, 24(1), 2–10.

    Article  Google Scholar 

  5. Bhat, P. G., & Bhat, R. S. (2012). Inverse independence number of a graph. International Journal of Computer Applications, 42(5), 9–13.

    Article  Google Scholar 

  6. Boesch, F. T., & Wang, J. (1985). Reliable circulant networks with minimum transmission delay. IEEE Transactions on Circuit and Systems, 32(12), 1286–1291.

    Article  MathSciNet  MATH  Google Scholar 

  7. Chena, J., Linb, Y., Li, J., Lina, G., Maa, Z., & Tan, A. (2016). A rough set method for the minimum vertex cover problem of graphs. Applied Soft Computing, 42, 360–367.

    Article  Google Scholar 

  8. Hochbaum, D. (1983). Efficient bounds for the stable set, vertex cover and set packing problem. Discrete Applied Mathematics, 6(3), 243–254.

    Article  MathSciNet  MATH  Google Scholar 

  9. Jianhua, T. (2015). A fixed-parameter algorithm for the vertex cover P3 problem. Information Processing Letters, 115(2), 96–99.

    Article  MathSciNet  MATH  Google Scholar 

  10. Karakostas, G. (2005). A better approximation ratio for the vertex cover problem. Lecture Notes in Computer Science, 3580, 1043–1050.

    Article  MathSciNet  MATH  Google Scholar 

  11. Micu, D., & De Mey, G. (2013). The condition number for circulant networks. Électrotechnique et Electroenergetique, 58(2), 115–122.

    Google Scholar 

  12. Norman, R. Z., & Rabin, M. O. (1959). An algorithm for a minimum cover of a graph. Proceedings of the American Mathematical Society, 10, 315–319.

    Article  MathSciNet  MATH  Google Scholar 

  13. Pattillo, J., & Butenko, S. (2013). On the maximum quasi-clique problem. Discrete Applied Mathematics, 161(1), 244–257.

    Article  MathSciNet  MATH  Google Scholar 

  14. Sáenz-de-Cabezón, E., & Wynn, H. P. (2014). Measuring the robustness of a network using minimal vertex covers. Mathematics and Computers in Simulation, 104, 82–94.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Sathyabama University, Chennai, 600119, India

    D. Angel & A. Amutha

Authors
  1. D. Angel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Amutha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. Angel.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Angel, D., Amutha, A. On Covering the Nodes of Circulant Networks and Its Applications. Wireless Pers Commun 94, 2163–2172 (2017). https://doi.org/10.1007/s11277-016-3367-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-016-3367-9

Keywords

Search

Navigation