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

J. Martin Sahayaraj and J.M. Ganaseakar

International Journal of Networking and Virtual Organisations, 2018, vol. 19, issue 2/3/4, 176-186

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.

Keywords: WSN; routing; Markov model; relay node; energy consumption. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=95420 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijnvor:v:19:y:2018:i:2/3/4:p:176-186

Access Statistics for this article

More articles in International Journal of Networking and Virtual Organisations from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().