IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v492y2018icp2198-2204.html
   My bibliography  Save this article

Optimal defense resource allocation in scale-free networks

Author

Listed:
  • Zhang, Xuejun
  • Xu, Guoqiang
  • Xia, Yongxiang

Abstract

The robustness research of networked systems has drawn widespread attention in the past decade, and one of the central topics is to protect the network from external attacks through allocating appropriate defense resource to different nodes. In this paper, we apply a specific particle swarm optimization (PSO) algorithm to optimize the defense resource allocation in scale-free networks. Results reveal that PSO based resource allocation shows a higher robustness than other resource allocation strategies such as uniform, degree-proportional, and betweenness-proportional allocation strategies. Furthermore, we find that assigning less resource to middle-degree nodes under small-scale attack while more resource to low-degree nodes under large-scale attack is conductive to improving the network robustness. Our work provides an insight into the optimal defense resource allocation pattern in scale-free networks and is helpful for designing a more robust network.

Suggested Citation

  • Zhang, Xuejun & Xu, Guoqiang & Xia, Yongxiang, 2018. "Optimal defense resource allocation in scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 492(C), pages 2198-2204.
    • Handle: RePEc:eee:phsmap:v:492:y:2018:i:c:p:2198-2204
    DOI: 10.1016/j.physa.2017.11.135
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437117312128
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2017.11.135?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wu, Taocheng & Wu, Jiajing & You, Wei, 2018. "Optimizing robustness of complex networks with heterogeneous node functions based on the Memetic Algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 511(C), pages 143-153.
    2. Wang, Shuliang & Sun, Jingya & Zhang, Jianhua & Dong, Qiqi & Gu, Xifeng & Chen, Chen, 2023. "Attack-Defense game analysis of critical infrastructure network based on Cournot model with fixed operating nodes," International Journal of Critical Infrastructure Protection, Elsevier, vol. 40(C).
    3. Huang, Wencheng & Li, Linqing & Liu, Hongyi & Zhang, Rui & Xu, Minhao, 2021. "Defense resource allocation in road dangerous goods transportation network: A Self-Contained Girvan-Newman Algorithm and Mean Variance Model combined approach," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    4. Zhang, Xiaoxiong & Ye, Yanqing & Tan, Yuejin, 2020. "How to protect a genuine target against an attacker trying to detect false targets," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    5. Deng, Yu-Jing & Li, Ya-Qian & Qin, Yu-Hua & Dong, Ming-Ru & Liu, Bin, 2020. "Optimal defense resource allocation for attacks in wireless sensor networks based on risk assessment model," Chaos, Solitons & Fractals, Elsevier, vol. 137(C).
    6. Wu, Yipeng & Chen, Zhilong & Gong, Huadong & Feng, Qilin & Chen, Yicun & Tang, Haizhou, 2021. "Defender–attacker–operator: Tri-level game-theoretic interdiction analysis of urban water distribution networks," Reliability Engineering and System Safety, Elsevier, vol. 214(C).
    7. Xu, Sheng & Xia, Yongxiang & Ouyang, Min, 2020. "Effect of resource allocation to the recovery of scale-free networks during cascading failures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    8. Yang, Hanlin & Pu, Cunlai & Wu, Jiexin & Wu, Yanqing & Xia, Yongxiang, 2023. "Enhancing OLSR protocol in VANETs with multi-objective particle swarm optimization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 614(C).
    9. Li, Jie & Wang, Ying & Zhong, Jilong & Sun, Yun & Guo, Zhijun & Chen, Zhiwei & Fu, Chaoqi, 2022. "Network resilience assessment and reinforcement strategy against cascading failure," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:492:y:2018:i:c:p:2198-2204. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.