IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i7p690482.html
   My bibliography  Save this article

TR-SDTN: Trust Based Efficient and Scalable Routing in Hostile Social DTNs

Author

Listed:
  • Zhenjing Zhang
  • Maode Ma
  • Zhigang Jin

Abstract

A delay tolerant network (DTN) presents a new communication model, which uses a store-carry-forward approach to deliver messages due to the nature of the network. With the development of the mobile internet, the research on DTNs becomes a hot topic. One critical issue in the DTNs with social characteristics is that there could exist selfish and malicious nodes which block important data and as a result intentionally disturb the communication. Although there are many research works which address the issue and adopt various trust models to encourage nodes to forward information, most of them have not considered the social characteristics of the mobile nodes and they have not handled the selfish behaviors and attacks in a systematic way. In view of these defects, we propose a novel solution to address the selfish and security issues in social DTNs. Based on nodes’ social characteristics, a dynamic trust model is proposed to prevent bad-mouthing and ballot stuffing attacks and the Shannon entropy function is introduced to avoid blackhole and greyhole attacks. The simulation results show that our proposed scheme can significantly improve the performance of social DTNs. And the simulation is proved to be consistent with the results from theoretical analysis.

Suggested Citation

  • Zhenjing Zhang & Maode Ma & Zhigang Jin, 2015. "TR-SDTN: Trust Based Efficient and Scalable Routing in Hostile Social DTNs," International Journal of Distributed Sensor Networks, , vol. 11(7), pages 690482-6904, July.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:7:p:690482
    DOI: 10.1155/2015/690482
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/690482
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/690482?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:sae:intdis:v:11:y:2015:i:7:p:690482. 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: SAGE Publications (email available below). General contact details of provider: .

    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.