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

Trusted Tree-Based Trust Management Scheme for Secure Routing in Wireless Sensor Networks

Author

Listed:
  • Zhi Hu
  • Yuxia Bie
  • Hong Zhao

Abstract

The unique characteristics of wireless sensor networks make them susceptible to the attacks. The secure scheme is considered in designing the routing protocol and algorithm. The cryptography and authentication secure technology can defend the external attacks but have no way to protect the network when the internal attacks occur. However, the trust management scheme with attack-resistance and robustness can efficiently detect the internal attack. On the condition of defending the attacks, it is also an issue that the trust management scheme aids routing algorithm to improve the security and performance. In this paper, we proposed a Trusted Tree-based trust management for secure routing in wireless sensor networks. The common attacks are firstly analyzed. And then the dynamic time window is designed in the distributed trust model with the detection of direct trust and indirect trust. Based on the trusted nodes, Trusted Tree is constructed. And the path quality of nodes in Trusted Tree is used as the gradient for routing. Finally, we add Trusted Tree-based trust management into the QoS based routing protocol and algorithm. Experimental results show that the QoS based routing algorithm with Trusted Tree has better performance and security.

Suggested Citation

  • Zhi Hu & Yuxia Bie & Hong Zhao, 2015. "Trusted Tree-Based Trust Management Scheme for Secure Routing in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(12), pages 385849-3858, December.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:12:p:385849
    DOI: 10.1155/2015/385849
    as

    Download full text from publisher

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

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