152 research outputs found

    A Pragmatic View of MANET Performance Evaluation and Design of a Prototype MAC Level Routing Algorithm

    Get PDF
    Our goal in this research is to investigate and determine how to best support a challenging mobile wireless network based in a military operational environment. Since routing protocols used in mobile ad hoc networks (MANET) must adapt to frequent or continual changes of topology, while simultaneously limiting the impact of tracking these changes on wireless resources, we focused our initial research on improving the efficiency of route discovery. We proposed and designed a new MAC layer routing protocol that pursues reduced routing overhead, greater interaction of network protocol layers and passive neighbor/path discovery. This algorithm, called Virtual MAC Tag Switching (VMTS), evolved as we implemented a prototype in the ns-2 network simulator and conducted simulation analysis of existing protocols: DSDV, DSR and AODV. Upon analyzing the performance of existing routing protocols using pragmatic metrics not applied in any MANET literature it was found that current MANET models produce unsatisfactory performance. Subsequent analysis of transport layer protocol behaviors pinpointed the causes that undermine the performance of the existing protocols and would have thwarted VMTS as well

    Building Realistic Mobility Models for Mobile Ad Hoc Networks

    Get PDF
    A mobile ad hoc network (MANET) is a self-configuring wireless network in which each node could act as a router, as well as a data source or sink. Its application areas include battlefields and vehicular and disaster areas. Many techniques applied to infrastructure-based networks are less effective in MANETs, with routing being a particular challenge. This paper presents a rigorous study into simulation techniques for evaluating routing solutions for MANETs with the aim of producing more realistic simulation models and thereby, more accurate protocol evaluations. MANET simulations require models that reflect the world in which the MANET is to operate. Much of the published research uses movement models, such as the random waypoint (RWP) model, with arbitrary world sizes and node counts. This paper presents a technique for developing more realistic simulation models to test and evaluate MANET protocols. The technique is animation, which is applied to a realistic scenario to produce a model that accurately reflects the size and shape of the world, node count, movement patterns, and time period over which the MANET may operate. The animation technique has been used to develop a battlefield model based on established military tactics. Trace data has been used to build a model of maritime movements in the Irish Sea. Similar world models have been built using the random waypoint movement model for comparison. All models have been built using the ns-2 simulator. These models have been used to compare the performance of three routing protocols: dynamic source routing (DSR), destination-sequenced distance-vector routing (DSDV), and ad hoc n-demand distance vector routing (AODV). The findings reveal that protocol performance is dependent on the model used. In particular, it is shown that RWP models do not reflect the performance of these protocols under realistic circumstances, and protocol selection is subject to the scenario to which it is applied. To conclude, it is possible to develop a range of techniques for modelling scenarios applicable to MANETs, and these simulation models could be utilised for the evaluation of routing protocols

    Design and Performance Analysis of an Aeronautical Routing Protocol with Ground Station Updates

    Get PDF
    Aeronautical routing protocol (AeroRP) is a position-based routing protocol developed for highly dynamic airborne networks. It works in conjunction with the aeronautical network protocol (AeroNP). AeroRP is a multi-modal protocol that operates in different modes depending on the mission requirements. Ground station (GS) update mode is an AeroRP mode in which the GS sends geolocation or topology updates to improve routing accuracy. The main contribution of this thesis is to develop and implement the GS updates in AeroRP and analyse its performance in the various modes and compare them against canonical MANET routing protocols such as DSDV, OLSR, AODV, and DSR. The simulation analysis shows that AeroRP outperforms the traditional MANET protocols in various scenarios

    An Effective Approach for Mobile ad hoc Network via I-Watchdog Protocol

    Full text link
    Mobile ad hoc network (MANET) is now days become very famous due to their fixed infrastructure-less quality and dynamic nature. They contain a large number of nodes which are connected and communicated to each other in wireless nature. Mobile ad hoc network is a wireless technology that contains high mobility of nodes and does not depend on the background administrator for central authority, because they do not contain any infrastructure. Nodes of the MANET use radio wave for communication and having limited resources and limited computational power. The Topology of this network is changing very frequently because they are distributed in nature and self-configurable. Due to its wireless nature and lack of any central authority in the background, Mobile ad hoc networks are always vulnerable to some security issues and performance issues. The security imposes a huge impact on the performance of any network. Some of the security issues are black hole attack, flooding, wormhole attack etc. In this paper, we will discuss issues regarding low performance of Watchdog protocol used in the MANET and proposed an improved Watchdog mechanism, which is called by I-Watchdog protocol that overcomes the limitations of Watchdog protocol and gives high performance in terms of throughput, delay

    Design and Performance Analysis of a Geographic Routing Protocol for Highly Dynamic MANETs

    Get PDF
    Efficient multi-hop routing has become important for airborne telemetry networks. The highly dynamic nature in these scenarios results in short-lived links. Geographic-based routing has an advantage over topology-based routing to make rapid forwarding decisions based on neighbor and destination position. The AeroRP geographic routing protocol is detailed, which uses a heuristic metric for forwarding decisions that takes transmission range and a neighbor's location and velocity into consideration. The main contributions of this work include detailing and finalizing the routing decision metrics, design, and simulation implementation of AeroRP. The analysis of the simulations shows AeroRP has several advantages over other MANET routing protocols and offers tradeoffs for different performance metrics in the form of different AeroRP modes. Specifically, AeroRP yields higher accuracy than all compared routing protocols and various AeroRP modes can be chosen depending on how packet delivery and delay are prioritized

    Evaluation of MANET Routing Protocols in Realistic Environments

    Get PDF
    Projecte final de carrera realitzat en col.laboració amb College of Electronics and Information Engineering. Tongji UniversityRecently, many researchers have become interested in MANET (Mobile Ad-hoc NET- works) to construct a self-con gurable network without existing communication infras- tructure. This research presents the results of a detailed performance evaluation on several MANET routing protocols working under realistic environments. The routing protocols, mobility models and other aspects are explained and discussed in order to know how to use them properly to model real-life conditions. NS-2 and Bonnmotion were used to create the networks, services and environment characteristics in general. It is concluded which protocols can handle which applications and which not and that the performance of the protocols can be considerably di erent when more and more realistic elements are taken into account. This should be considered in further researches since the nowadays evolution of MANET will bring them soon into services of our society

    An Effective Approach for Mobile ad hoc Network via I-Watchdog Protocol

    Get PDF
    Mobile ad hoc network (MANET) is now days become very famous due to their fixed infrastructure-less quality and dynamic nature. They contain a large number of nodes which are connected and communicated to each other in wireless nature. Mobile ad hoc network is a wireless technology that contains high mobility of nodes and does not depend on the background administrator for central authority, because they do not contain any infrastructure. Nodes of the MANET use radio wave for communication and having limited resources and limited computational power. The Topology of this network is changing very frequently because they are distributed in nature and self-configurable. Due to its wireless nature and lack of any central authority in the background, Mobile ad hoc networks are always vulnerable to some security issues and performance issues. The security imposes a huge impact on the performance of any network. Some of the security issues are black hole attack, flooding, wormhole attack etc. In this paper, we will discuss issues regarding low performance of Watchdog protocol used in the MANET and proposed an improved Watchdog mechanism, which is called by I-Watchdog protocol that overcomes the limitations of Watchdog protocol and gives high performance in terms of throughput, delay

    Modified Adhoc on Demand Routing Protocol in Mobile Ad hoc Network

    Get PDF
    In Ad hoc network there no any central infrastructure but it allows mobile devices to establish communication path.Since there is no central infrastructure and mobile devices are moving randomly ,gives rise to various kinds of problems, such as security and routing. here we are consider problem of routing. Routing is one of the key issues in MANET because of highly dynamic and distributed nature of nodes. Especially energy efficient routing is most important because all the nodes are battery powered. Failure of one node may affect the entire network. If a node runs out of energy the probability of network partition- ing will be increased. Since every mobile node has limited power supply, energy depletion is become one of the main threats to the lifetime of the ad hoc network. So routing in MANET should be in such a way that it will use the remaining battery power in an efficient way to increase the life time of the network. In this thesis, we have proposedModified Adhoc on Demand Routing (MAODV) which will efficiently utilize the battery power of the mobile nodes in such a way that the network will get more lifetime. Multiple paths are used to send data and load balancing approach is used to avoid over utilized nodes. Load balancing is done by selecting a route which contains energy rich nodes

    Energy Efficient Dynamic Source Routing Protocol For Mobile Ad hoc Networks

    Get PDF
    In a MANET, there is no Base Station i.e no fixed infrastructure and the nodes are free to move, thus network topology changes dynamically in an unpredictable manner. In this network each node acts both as a router and its job as an ordinary device. The major constraint of a network is the network parameters. These parameters are crucial in determining the network stability and reliability. Hence a better algorithm than the existing DSR algorithm is proposed to make the network transmission energy ecient. The major parameters on which the selection of the path depends is : (1) Node type and energy (2) Packet size (3) Delay in the network channel (4) no of hop counts required to reach the destination (5) Energy loss during transmission The conventional DSR algorithm uses any arbitrary path between the source and the destination pair. There is no parameter to judge the effectiveness of the path and this even floods the route cache with lengthier and multiple paths for the same source and destination. The EEDSR algorithm selects a node as a source node n then selects a set of node as destination. For each source and destination pair the best path is selected and then the parameters are collected. The average value of the parameters are taken over al the source and destination pair. This process is repeated for all the network of different dimension and a graph was plotted between no of nodes and the average parameter value. This algorithm not only enhances the network life but also minimises the effort required during the route maintenance phase. It even prevents back flooding of the packets and thus reduces the network congestion
    corecore