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

A Credible Routing Based on a Novel Trust Mechanism in Ad Hoc Networks

Author

Listed:
  • Renjian Feng
  • Shenyun Che
  • Xiao Wang
  • Ning Yu

Abstract

Many existing routing protocols in Mobile Ad hoc Networks (MANETs) focus on finding paths in dynamic networks without considering security. In this paper, we propose a trust model which evaluates neighbours' direct trust by factors of encounter time, mobility, and successful cooperation frequency. The revised D-S evidence theory is used to combine multiple recommended pieces of evidence and obtain the recommended trust value. Then based on the novel trust mechanism, we propose a trusted routing protocol named TDS-AODV protocol by extending the AODV protocol. In this protocol, a node makes a routing decision according to the trust values of its neighbour nodes. Finally, two routes are built: the main route with highest route trust value in the candidate routes and a backup route. Simulation results reveal that TDS-AODV can eliminate malicious nodes effectively when building the route; furthermore, it also achieves better performance than TAODV and AODV in terms of throughput, packet delivery ratio, and average end to end delay.

Suggested Citation

  • Renjian Feng & Shenyun Che & Xiao Wang & Ning Yu, 2013. "A Credible Routing Based on a Novel Trust Mechanism in Ad Hoc Networks," International Journal of Distributed Sensor Networks, , vol. 9(4), pages 652051-6520, April.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:4:p:652051
    DOI: 10.1155/2013/652051
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/652051
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/652051?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:9:y:2013:i:4:p:652051. 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.