IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v16y2024i4p121-d1368612.html
   My bibliography  Save this article

Research on Secure Community Opportunity Network Based on Trust Model

Author

Listed:
  • Bing Su

    (School of Computer and Artificial Intelligence, Changzhou University, Changzhou 213164, China)

  • Jiwu Liang

    (School of Computer and Artificial Intelligence, Changzhou University, Changzhou 213164, China)

Abstract

With the innovation of wireless communication technology and the surge of data in mobile networks, traditional routing strategies need to be improved. Given the shortcomings of existing opportunistic routing strategies in transmission performance and security, this paper proposes a community opportunistic routing decision-making method based on the trust model. This algorithm calculates the node’s trust value through the node’s historical forwarding behavior and then calculates the node’s trust value based on the trust model. Thresholds and trust attenuation divide dynamic security communities. For message forwarding, nodes in the security community are prioritized as next-hop relay nodes, thus ensuring that message delivery is always in a safe and reliable environment. On this basis, better relay nodes are further selected for message forwarding based on the node centrality, remaining cache space, and remaining energy, effectively improving the message forwarding efficiency. Through node trust value and community cooperation, safe and efficient data transmission is achieved, thereby improving the transmission performance and security of the network. Through comparison of simulation and opportunistic network routing algorithms, compared with traditional methods, this strategy has the highest transmission success rate of 81% with slightly increased routing overhead, and this algorithm has the lowest average transmission delay.

Suggested Citation

  • Bing Su & Jiwu Liang, 2024. "Research on Secure Community Opportunity Network Based on Trust Model," Future Internet, MDPI, vol. 16(4), pages 1-22, April.
  • Handle: RePEc:gam:jftint:v:16:y:2024:i:4:p:121-:d:1368612
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/16/4/121/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/16/4/121/
    Download Restriction: no
    ---><---

    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:gam:jftint:v:16:y:2024:i:4:p:121-:d:1368612. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.