History based reliability: a novel routing metric in mobile ad hoc networks

Authors:
Yaser Taj;Karim Faez
Affiliations:
Department of IT and Computer Engineering, Qazvin Islamic Azad University, Qazvin, Iran;Department of Electrical Engineering, AmirKabir University of Technology, Tehran, Iran
Venue:
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Year:
2010

Citing 6
Cited 1

DSR: the dynamic source routing protocol for multihop wireless ad hoc networks

Ad hoc networking
Associativity-Based Routing for Ad Hoc Mobile Networks

Wireless Personal Communications: An International Journal
Link Stability and Route Lifetime in Ad-hoc Wireless Networks

ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
A stable weight-based on-demand routing protocol for mobile ad hoc networks

Information Sciences: an International Journal
A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A Routing Metric for Load Balance in Wireless Mesh Networks

MMIT '08 Proceedings of the 2008 International Conference on MultiMedia and Information Technology

A cross layer based reliable route metric for Mobile Ad hoc Networks

Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

A mobile ad hoc network has a dynamic topology. A route probably fails if intermediate nodes of the route have high mobility. In order to choose reliable nodes in a route, we define and quantify a novel routing metric called HBR that avoids choosing nodes with frequent failure history. Thus, route failure probability is decreased. We propose a routing scheme called HADDV based on the HBR metric. In HADDV, source node is able to determine its desired minimum reliability of route. HADDV is able to avoid waste of bandwidth caused by unreliable nodes. HADDV finds the most reliable route with a low overhead. Dur simulation experiments show that HADDV improves packet delivery ratio when nodes are mobile.