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

Development of Energy-Efficient Routing Protocol in Wireless Sensor Networks Using Optimal Gradient Routing with On Demand Neighborhood Information

Author

Listed:
  • K. Nattar Kannan
  • B. Paramasivan

Abstract

Wireless sensor networks (WSNs) consist of a number of autonomous sensor nodes which have limited battery power and computation capabilities with sensing of various physical and environmental conditions. In recent days, WSNs adequately need effective mechanisms for data forwarding to enhance the energy efficiency in networks. In WSNs, the optimization of energy consumption is a crucial issue for real-time application. Network topology of WSNs also is changed dynamically by anonymous nodes. Routing protocols play a major role in WSNs for maintaining the routes and for ensuring reliable communication. In this paper, on demand acquisitions of neighborhood information are used to find the optimal routing paths that reduce the message exchange overhead. It optimizes the number of hops for packet forwarding to the sink node which gives a better solution for energy consumption and delay. The proposed protocol combines the on demand multihop information based multipath routing (OMLRP) and the gradient-based network for achieving the optimal path which reduces energy consumption of sensor nodes. The proposed routing protocol provides the least deadline miss ratio which is most suitable to real-time data delivery. Simulation results show that the proposed routing protocol has achieved good performance with respect to the reduction in energy efficiency and deadline miss ratio.

Suggested Citation

  • K. Nattar Kannan & B. Paramasivan, 2014. "Development of Energy-Efficient Routing Protocol in Wireless Sensor Networks Using Optimal Gradient Routing with On Demand Neighborhood Information," International Journal of Distributed Sensor Networks, , vol. 10(5), pages 208023-2080, May.
  • Handle: RePEc:sae:intdis:v:10:y:2014:i:5:p:208023
    DOI: 10.1155/2014/208023
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/208023
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/208023?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:10:y:2014:i:5:p:208023. 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.