IDEAS home Printed from https://ideas.repec.org/a/igg/jismd0/v8y2017i2p30-44.html
   My bibliography  Save this article

An Energy Efficient Trust Aware Opportunistic Routing Protocol for Wireless Sensor Network

Author

Listed:
  • Nagesh Kumar

    (Jaypee University of Information Technology, Waknaghat, India)

  • Yashwant Singh

    (Central University of Jammu, Jammu, India)

  • Pradeep Kumar Singh

    (Department of CSE and IT, Jaypee University of Information Technology, Waknaghat, India)

Abstract

As the wireless sensor networks (WSN) are gaining popularity the need of reliable delivery of data packets becomes more important. The reliable delivery is only possible when the routing protocols are efficient and secure. Because of lack of resources it is not possible to use existing cryptosystems to provide security in WSN. But, trust aware routing can provide the security with lesser resources, which become popular in last three to four years. In this paper, a new energy efficient and trust aware reliable opportunistic routing (TAEROR) protocol is proposed. The protocol consists of a trust metric and also a relay selection algorithm. The trust aware metric detects the malicious nodes on the basis of forwarding sincerity, energy consumption and acknowledgement sincerity. Relay selection algorithms avoid these malicious nodes to get selected in the routing process. The protocol is simulated and compared to existing trust aware routing protocols. Proposed protocol TEAROR presents better results than the other compared protocols.

Suggested Citation

  • Nagesh Kumar & Yashwant Singh & Pradeep Kumar Singh, 2017. "An Energy Efficient Trust Aware Opportunistic Routing Protocol for Wireless Sensor Network," International Journal of Information System Modeling and Design (IJISMD), IGI Global, vol. 8(2), pages 30-44, April.
    • Handle: RePEc:igg:jismd0:v:8:y:2017:i:2:p:30-44
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISMD.2017040102
    Download Restriction: no
    ---><---

    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:igg:jismd0:v:8:y:2017:i:2:p:30-44. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.