Relay node selection with energy efficient routing using hidden Markov model in wireless sensor networks
by J. Martin Sahayaraj; J.M. Ganaseakar
International Journal of Networking and Virtual Organisations (IJNVO), Vol. 19, No. 2/3/4, 2018

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.

Online publication date: Thu, 04-Oct-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Networking and Virtual Organisations (IJNVO):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com