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

Two-Way Acknowledgment-Based Trust Framework for Wireless Sensor Networks

Author

Listed:
  • X. Anita
  • J. Martin Leo Manickam
  • M. A. Bhagyaveni

Abstract

Security is an inherent and challenging task in Wireless Sensor Networks (WSNs) characterized by multihop routing and stringent resource constraints such as limited processing capability, storage capacity, communication bandwidth, and energy. Most of the existing trust-based routing schemes require the support of promiscuous mode of operation and gather a large number of recommendations from the neighbors for trust derivation. These result in higher energy consumption, higher communication overhead, and larger memory requirements in a resource constrained sensor network. In this paper, we propose a new two-way acknowledgment-based trust (2-ACKT) framework with individual (2-ACKT-I) and group (2-ACKT-G) acknowledgment to minimize the communication overhead and memory requirement for trust establishment in WSNs. The 2-ACKT protocol calculates the direct trust using a link layer acknowledgment and a two-hop acknowledgment from a downstream neighbor. The simulation and theoretical results indicate that 2-ACKT scheme significantly outperforms the conventional multihop and trust-based routing schemes in terms of packet delivery ratio, network lifetime, communication overhead, and memory requirements.

Suggested Citation

  • X. Anita & J. Martin Leo Manickam & M. A. Bhagyaveni, 2013. "Two-Way Acknowledgment-Based Trust Framework for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(5), pages 952905-9529, May.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:5:p:952905
    DOI: 10.1155/2013/952905
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/952905
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/952905?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:5:p:952905. 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.