in recent years mobile networks have expanded dramatically, compared with other wireless networks. routing protocols in these networks are designed with the assumption that there is no attacker node, so routing protocols are vulnerable to various attacks in these networks. in this paper, we review the network layer attacks and then we simulate the impact of black hole attack on ad hoc on demand...

Existing routing algorithms treat Quality of Service (QoS) parameters and secure routing as completely separate entities requiring separate algorithms. In this paper we propose secure QoS Distance Vector and secure Bellman-Ford-Moore routing algorithms that meet QoS requirements and satisfy security concerns. Security is achieved by placing filters in the network. The routing algorithms generat...

We analyze the security requirements of distance-vector routing protocols, identify their vulnerabilities, and propose countermeasures to these vulnerabilities. The innovation we propose involves the use of mechanisms from the path-finding class of distance-vector protocols as a solution to the security problems of distance-vector protocols. The result is a proposal that effectively and efficie...

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes dynamically shaping a provisional network devoid of the use of any existing network infrastructure or centralized management. In MANETs, security is the major challenge due to the dynamic topology which is because of the mobility of the nodes. In this paper, we propose to design and develop a secure methodology incorporate...

Mobile Adhoc Network is a kind of wireless ad hoc network where nodes are connected wirelessly and the network is self configuring. MANET may work in a standalone manner or may be a part of another network. In this paper we have compared Random Walk Mobility Model and Random Waypoint Mobility Model over two reactive routing protocols Dynamic Source Routing (DSR) and Adhoc On-Demand Distance Vec...

Paths with loops, even transient ones ,can pose significant stability problems in networks. Some earlier approaches like Shortest path routing (Dijkstra),Flooding, Flowbased routing, Distance vector routing(OSPF),Link state routing(Bellmen-Ford),Hierarchical routing, Broadcast routing, Multicast routing have problems maintaining the balance between node delays and link delays. We present a new ...

In this paper we give a brief introduction to five different distance vector routing protocols (RIP, AODV, EIGRP, RIP-MTI and Babel) and give some of our thoughts on how to solve the count to infinity problem. Our focus is how distance vector routing protocols, based on limited information, can prevent routing loops and the count to infinity problem.

This paper compares Ad hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Wireless Routing Protocol (WRP) for MANETs to Distance Vector protocol to better understand the major characteristics of the three routing protocols, using a parallel discrete event-driven simulator, GloMoSim. MANET (mobile ad hoc network) is a multi-hop wireless network without a fixed infrastructure...

Routing is one of the key functions of the Internet, and routing protocols form an inseparable part of the Internet infrastructure. Without accurate routing information, packet forwarding can be drastically affected and potentially even cause a network-wide blackout. The routing protocols in use today were designed during the more benign days of the Internet and operate on implicit trust betwee...