On demand routing algorithms such as the dynamic source routing (DSR) and ad hoc on-demand distance vector (AODV) have received much attention recently and are being promoted as better alternatives to the currently used distance vector algorithms such as the destination sequenced distance vector (DSDV). In this paper, we provide a variation of DSDV and compare it with AODV and DSR in their orig...

As our economy and critical infrastructure increasingly rely on the Internet, securing routing protocols becomes of critical importance. In this paper, we present four new mechanisms as tools for securing distance vector and path vector routing protocols. For securing distance vector protocols, our hash tree chain mechanism forces a router to increase the distance (metric) when forwarding a rou...

As our economy and critical infrastructure increasingly rely on the Internet, securing routing protocols becomes of critical importance. In this paper, we present four new mechanisms as tools for securing distance vector and path vector routing protocols. For securing distance vector protocols, our hash tree chain mechanism forces a router to increase the distance (metric) when forwarding a rou...

Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. The nodes in WSN can receive and relay packets as a router. Routing is a critical issue and an efficient routing protocol makes the network reliable. Routing protocols in WSNs might differ depending on the application and architecture of network. The routing protocols are divided...

An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each Mobile Host operates as a specialized router, and routes are obtained as needed (i....

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...

Distance vector routing algorithms operate by having each router maintain a table giving the best known distance to each destination and which line to use to get there. Genetic algorithms are search algorithms based on mechanics of natural selection and natural genetics. To overcome some of the problems of traditional adaptive routing techniques genetic algorithms can be used. GA’s have the cap...

In this paper, an effort was made to analyze the performance of Routing Protocols for Mobile Ad-hoc Networks. Wireless networks can be classified in two types: infrastructured wireless networks and infrastructureless (ad hoc) wireless networks. Ad hoc networks are characterized by the need for efficient routing protocols. According to previous research, the Destination-Sequenced Distance-Vector...

The latest technology MANETs is being studied widely and attracting a large variety of applications. Due to varying network topology, The most common challenging factor in MANET is routing [2][3]. In this research paper, we study the performance of reactive routing protocols, Ad hoc on demand Distance Vector (AODV) and Dynamic Source Routing (DSR) and proactive routing protocol Destination Sequ...

Routing protocols for ad hoc networks typically include mechanisms for route discovery and route maintenance. The performance of these protocols depends on the route maintenance mechanism they use. The movement of network nodes can cause routes to become unusable. A node on a route from a source to a destination may become unreachable from its predecessor node because of node movement. In this ...