The IRV-Tool (“Internet Routing Visualization”) is a simple interactive tool designed to give students easy access to the fundamentals of Internet routing. Two major classes of dynamic routing protocols — distance vector and link state — can be studied with this tool; for distance vector routing, we already successfully used it in classes. In this paper, we introduce the IRVTool, describe examp...

Abstract—In Mobile Ad-Hoc Networks (MANETs), mobile devices are operational with power. In order to utilize these energy operational devices resourcefully for transmission of data packets, many energy aware routing strategies are followed. As a key note to these routing strategies, the energy aware performance metrics are analyzed on three routing protocols like Ad-Hoc on Demand Distance Vector...

The proposed Loop-free Distance Vector Routing (LFDVR) is a distributed dynamic routing, derived from the famous Bellman Ford’s Distance Vector Routing Algorithm (BFDVRA) which is widely used in the Internet and private intranets. Several routing protocols based on distance-vector algorithms have been proposed like Routing Information Protocol (RIP), Gateway-to-Gateway Protocol (GGP) and Exteri...

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

Mobile Ad Hoc Networks (MANETs) are receiving a significant interest and are becoming very popular in the world of wireless networks and telecommunication. MANETs consist of mobile nodes which can communicate with each other without any infrastructure or centralized administration. In MANETs, the movement of nodes is unpredictable and complex; thus making the routing of the packets challenging....

In this paper, we make a survey of Distance Vector Multicast Routing Protocol (DVMRP) andfind that it is not optimal in the aspect of network cost (NC). Therefore, we propose a modified version of DVMRP, called “Group Membership Near First-DVMRP” (GMNF-DVMRP), to decrease the NC of the multicast tree formed by DVMRP. A simulation is implemented to compare our modified version and the original D...