IDEAS home Printed from https://ideas.repec.org/a/ids/ijnvor/v19y2018i2-3-4p176-186.html
   My bibliography  Save this article

Relay node selection with energy efficient routing using hidden Markov model in wireless sensor networks

Author

Listed:
  • J. Martin Sahayaraj
  • J.M. Ganaseakar

Abstract

Wireless sensor based routing is a challenging issue in the context of convergecast routing. In order to counter these issues the relay nodes share the burden of forwarding in multi-hop routing. In this research to counter the effect energy efficient relay node routing (ERNR) algorithm is proposed. ERNR relay nodes are found among the group of member nodes based on the residual energy of the node using Voronoi cells. The selected relay nodes with two hop neighbours form virtual subsets of cluster. The cluster head is then used to allocate the TDMA time slots to its neighbours based on the Hidden Markov prediction model. The proposed technique is evaluated with existing relay node based routing schemes and the performance of the ERNR algorithm yields significant improvements while considering energy related metrics.

Suggested Citation

  • J. Martin Sahayaraj & J.M. Ganaseakar, 2018. "Relay node selection with energy efficient routing using hidden Markov model in wireless sensor networks," International Journal of Networking and Virtual Organisations, Inderscience Enterprises Ltd, vol. 19(2/3/4), pages 176-186.
    • Handle: RePEc:ids:ijnvor:v:19:y:2018:i:2/3/4:p:176-186
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=95420
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. G Pius Agbulu & G Joselin Retna Kumar & A Vimala Juliet, 2020. "A lifetime-enhancing cooperative data gathering and relaying algorithm for cluster-based wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 16(2), pages 15501477199, February.

    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:ids:ijnvor:v:19:y:2018:i:2/3/4:p:176-186. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=22 .

    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.