A robust and reliable routing based on multi-hop information in industrial wireless sensor networks
by Dariush Zolfaghari; Hassan Taheri; A. Hossein Rezaie; Mohsen Rezaei
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 19, No. 1/2, 2015

Abstract: Due to considerable noise in the industrial environments, wireless packet transmission is usually unreliable. Designing an efficient routing algorithm for these environments poses significant challenges. Current routing algorithms consider the quality of service parameters such as node energies and delay, but packet losses need a novel strategy to compensate for the decline in signal to noise ratio (SNR) in noisy industrial environments. The proposed routing algorithm is based on multi-hop neighbour information. The multi-hop neighbour nodes provide vital information for the source node, enabling it to select the proper relay node. In noisy channel conditions the transmitted packets should meet the deadline and be delivered to the sink node on time. Performance evaluation via simulations indicates significant improvement in reliability, lifetime of network, and real-time performance. The proposed algorithm is more robust than previous methods. The most beneficial features of the proposed algorithm are its uniform distribution of energy among nodes and deliverance of deadline packets with the lowest losses.

Online publication date: Tue, 19-May-2015

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 Ad Hoc and Ubiquitous Computing (IJAHUC):
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