A fast convergence solution for distance vector routing protocol using hidden markov model (HMM)

Due to low complexity, power and bandwidth saving Distance Vector Routing is the most popular dynamic routing protocol which is using in many networks such as ad hoc networks. However, this protocol has a serious drawback in practice called Count To Infinity problem or slow convergence. There are ma...

Full description

Saved in:
Bibliographic Details
Published in20th Iranian Conference on Electrical Engineering (ICEE2012) pp. 1194 - 1198
Main Authors Golestanian, M., Ghazizadeh, R., Mohammadzadeh, S.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2012
Subjects
Ad hoc networks
Count To Infinity
Distance Vector Routing (DVR)
Handheld computers
Hidden Markov Model (HMM)
Hidden Markov models
Markov processes
Slow convergence
Online AccessGet full text

Cover

More Information
Summary:Due to low complexity, power and bandwidth saving Distance Vector Routing is the most popular dynamic routing protocol which is using in many networks such as ad hoc networks. However, this protocol has a serious drawback in practice called Count To Infinity problem or slow convergence. There are many proposed solutions in literature to solve the problem, but all of these methods depend on the network topology, and impose much computational complexity to the network. In this paper, we use hidden markov model (HMM), which is one of the most important machine learning tools, to solve the problem. As the results show, this method is completely independent from the network topology and simple with low computational complexity.
ISBN:1467311499
9781467311496
ISSN:2164-7054
DOI:10.1109/IranianCEE.2012.6292536