期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：10
DOI：10.15680/IJIRCCE.2015.0310059
出版社：S&S Publications
摘要：With the expansion of the existing wireless networks and the emergence of new applicatio ns that require a real time communication with lo w cost, higher efficiency and less co mplexity; routing protocols become one of the mo st important decisions in the design of these networks. In this paper distance vector protocol and Link state protocol are presented based on Bellman–Ford algorithm and Dij kstra.s algorithm respectively. This paper compares the advantages and disadvantages of DVF and OSPF on the basis of their performance. In co mputer co mmunication system which deals with packet switched networks a distance-vector routing protocol(RIPv2) and link-state protocol(OSPF) are the two major classes routing protocols. Coding for distance vector routing protocol and link state protocol have been done on MATLAB and the simulatio n results are shown in this paper. Though all the features are not present in each protocols but distance-vector routing protocol has several advantages over the link-state protocol. The computatio nal complexity with link-state protocol has been overcome b y distance-vector routing which will be observed at later stages in this paper
