ENHANCING THE DISTANCE VECTOR ROUTING PROTOCOL WITH FAULT DETECTION CAPABILITY
نویسندگان
چکیده
منابع مشابه
MDVA: A Distance-Vector Multipath Routing Protocol
Routing protocols using the Distributed Bellman-Ford (DBF) algorithm converge very slowly to the correct routes when link costs increase, and in the case when a set of link failures results in a network partition, DBF simply fails to converge, a problem which is commonly referred to as the count-to-infinity problem. In this paper, we present the first distance vector routing algorithm MDVA that...
متن کاملA distance-vector routing protocol for networks with unidirectional links
We propose a simple distance vector protocol for routing in networks having unidirectional links The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol The protocol comprises two main algorithms one for collecting from information and the other one for generating and propagating to information Like the RIP protocol this one can handle dy...
متن کاملSecuring the Destination-Sequenced Distance Vector Routing Protocol (S-DSDV)
A mobile ad hoc network (MANET) is formed by a group of mobile wireless nodes, each of which functions as a router and agrees to forward packets for others. Many routing protocols (e.g., AODV, DSDV, etc) have been proposed for MANETs. However, most assume that nodes are trustworthy and cooperative. Thus, they are vulnerable to a variety of attacks. We propose a secure routing protocol based on ...
متن کاملSecuring Distance-vector Routing Protocols Securing Distance-vector Routing Protocols
The security requirements of distance-vector routing protocols are analyzed, their vulnerabilities identi ed, and countermeasures to these vulnerabilities are proposed. The innovation presented involves the use of mechanisms from the pathnding class of distancevector protocols as a solution to the security problems of distance-vector protocols. The result is the rst proposal to e ectively and e...
متن کاملad hoc on-demand non overlapped multipath distance vector routing protocol (aonomdv)
in this paper, we propose a scheme to improve existing ad-hoc on-demanddistance vector (aodv) routing protocol by discovering and maintaining multiplenon-overlapped routes. our routing protocol is a multipath version of aodvrouting protocol that considers only the disjoint path. due to non-overlappingamong paths, when a link breaks in the network, only one of paths is expired. thepresented rout...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Information Sciences and Computing
سال: 2009
ISSN: 0973-9092
DOI: 10.18000/ijisac.50035