IDEAS home Printed from https://ideas.repec.org/a/wsi/fracta/v30y2022i07ns0218348x22501407.html
   My bibliography  Save this article

Average Trapping Time Of Honeypots On Weighted Random Fractal Networks

Author

Listed:
  • YUKE HUANG

    (School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, P. R. China)

  • CHENG ZENG

    (School of Mathematics and Information Science, Shandong Technology and Business University, Yantai, Shandong Province 264003, P. R. China)

  • HANXIONG ZHANG

    (School of Science, China University of Mining and Technology – Beijing, Beijing 100083, P. R. China)

  • YUMEI XUE

    (School of Mathematics and System Science, Beihang University, Beijing 100191, P. R. China)

Abstract

This paper studies the average trapping time of honeypots on weighted random fractal networks. We introduce three parameters: the node-weight factor w, the edge-weight factor r and the connecting probability p, making our model closer to real networks. We analyze the movements of the attacker on the network, and get the explicit and asymptotic expressions of the average trapping time for different ranges of parameters.

Suggested Citation

  • Yuke Huang & Cheng Zeng & Hanxiong Zhang & Yumei Xue, 2022. "Average Trapping Time Of Honeypots On Weighted Random Fractal Networks," FRACTALS (fractals), World Scientific Publishing Co. Pte. Ltd., vol. 30(07), pages 1-9, November.
    • Handle: RePEc:wsi:fracta:v:30:y:2022:i:07:n:s0218348x22501407
    DOI: 10.1142/S0218348X22501407
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0218348X22501407
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0218348X22501407?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. Hu, Zhongren & Wu, Bo, 2023. "The average shortest distance of three colored substitution networks," Chaos, Solitons & Fractals, Elsevier, vol. 176(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:wsi:fracta:v:30:y:2022:i:07:n:s0218348x22501407. 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: Tai Tone Lim (email available below). General contact details of provider: https://www.worldscientific.com/worldscinet/fractals .

    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.