Showing papers on "Ad hoc On-Demand Distance Vector Routing published in 2009"

Dpraodv: a dyanamic learning system against blackhole attack in aodv based manet

Abstract: Security is an essential requirement in mobile ad hoc networks to provide protected communication between mobile nodes. Due to unique characteristics of MANETS, it creates a number of consequential challenges to its security design. To overcome the challenges, there is a need to build a multifence security solution that achieves both broad protection and desirable network performance. MANETs are vulnerable to various attacks, blackhole, is one of the possible attacks. Black hole is a type of routing attack where a malicious node advertise itself as having the shortest path to all nodes in the environment by sending fake route reply. By doing this, the malicious node can deprive the traffic from the source node. It can be used as a denial-of-service attack where it can drop the packets later. In this paper, we proposed a DPRAODV (Detection, Prevention and Reactive AODV) to prevent security threats of blackhole by notifying other nodes in the network of the incident. The simulation results in ns2 (ver2.33) demonstrate that our protocol not only prevents blackhole attack but consequently improves the overall performance of (normal) AODV in presence of black hole attack.

SAODV: A MANET Routing Protocol that can Withstand Black Hole Attack

Abstract: Ad hoc On-demand Distance Vector routing (AODV) is a widely adopted network routing protocol for Mobile Ad hoc Network (MANET). The design of AODV, however, paid little attention to security considerations, hence resulting in the vulnerability of such MANET to the black hole attack. On the basis of AODV, this paper proposes and implements AODV suffering black hole attack - BAODV (Bad Ad Hoc On-demand Distance Vector Routing suffering black hole attack), which can simulate black hole attack to MANET by one of nodes as a malicious one in network. BAODV can be regarded as AODV, which is used in MANET exited black hole attack. Based on BAODV, this paper also proposes a secure and efficient MANET routing protocol, the SAODV protocol, which aims to address the security weakness of the AODV protocol and is capable of withstanding the black hole attack. Experimental analysis shows that the SAODV routing protocol is more secure than the basic AODV.

Performance comparison of AODV, DSDV and I-DSDV routing protocols in mobile ad hoc networks.

Abstract: Ad hoc networks are characterized by a lack of infrastructure, and by a random and quickly changing network topology; thus the need for a robust dynamic routing protocol that can accommodate such an environment To improve the packet delivery ratio of Destination Sequenced Distance Vector (DSDV) routing protocol in mobile ad hoc networks with high mobility, a message exchange scheme for its invalid route reconstruction is being used Three protocols AODV, DSDV and I-DSDV were simulated using NS-2 package and were compared in terms of packet delivery ratio, end to end delay and routing overhead in different environment; varying number of nodes, speed and pause time Simulation results show that I-DSDV compared with DSDV, it reduces the number of dropped data packets with little increased overhead at higher rates of node mobility but still can’t compete with AODV in higher node speed and number of node

Security in Wireless Ad Hoc and Sensor Networks: Çayirci/Security in Wireless Ad Hoc and Sensor Networks

Abstract: About the Authors. Preface. Acknowledgements. List of Acronyms. Part One Wireless Ad Hoc, Sensor and Mesh Networking. 1 Introduction. 1.1 Information Security. 1.2 Scope of the Book. 1.3 Structure of the Book. 1.4 Electronic Resources for the Book. 1.5 Review Questions. 2 Wireless Ad Hoc, Sensor and Mesh Networks. 2.1 Ad Hoc Networks and Applications. 2.2 Sensor and Actuator Networks. 2.3 Mesh Networks. 2.4 Tactical Communications and Networks. 2.5 Factors Influencing the Design of Wireless Ad Hoc, Sensor and Mesh Networks. .6 Review Questions. 3 The Wireless Medium. 3.1 Wireless Channel Fundamentals and Security. 3.2 Advanced Radio Technologies. 3.3 Review Questions. 4 Medium Access and Error Control. 4.1 Medium Access Control. 4.2 Error Control. 4.3 Wireless Metropolitan Area Networks. 4.4 Wireless Local Area Networks. 4.5 Wireless Personal Area Networks. 4.6 Review Questions. 5 Routing. 5.1 Internet Protocol and Mobile IP. 5.2 Routing in Wireless Ad Hoc Networks. 5.3 Routing in Wireless Sensor and Actuator Networks. 5.4 Review Questions. 6 Reliability, Flow and Congestion Control. 6.1 Reliability. 6.2 Flow and Congestion Control. 6.3 Review Questions. 7 Other Challenges and Security Aspects. 7.1 Localization and Positioning. 7.2 Time Synchronization. 7.3 Addressing. 7.4 Data Aggregation and Fusion. 7.5 Data Querying. 7.6 Coverage. 7.7 Mobility Management. 7.8 Cross-layer Design. 7.9 Review Questions. Part Two Security in Wireless Ad Hoc, Sensor and Mesh Networking. 8 Security Attacks in Ad Hoc, Sensor and Mesh Networks. 8.1 Security Attacks. 8.2 Attackers. 8.3 Security Goals. 8.4 Review Questions. 9 Cryptography. 9.1 Symmetric Encryption. 9.2 Asymmetric Encryption. 9.3 Hash Functions and Message Authentication Code. 9.4 Cascading Hashing. 9.5 Review Questions. 10 Challenges and Solutions: Basic Issues. 10.1 Bootstrapping Security in Ad Hoc Networks. 10.2 Bootstrapping Security in Sensor Networks. 10.3 Key Distribution, Exchange and Management. 10.4 Authentication Issues. 10.5 Integrity. 10.6 Review Questions. 11 Challenges and Solutions: Protection. 11.1 Privacy and Anonymity. 11.2 Intrusion Detection. 11.3 Defense Against Traffic Analysis. 11.4 Access Control and Secure Human-Computer Interaction. 11.5 Software-Based Anti-Tamper Techniques. 11.6 Tamper Resilience: Hardware Protection. 11.7 Availability and Plausibility. 11.8 Review Questions. 12 Secure Routing. 12.1 Defense Against Security Attacks in Ad Hoc Routing. 12.2 Secure Ad Hoc Routing Protocols. 12.3 Further Reading. 12.4 Review Questions. 13 Specific Challenges and Solutions. 13.1 SPINS: Security Protocols for Sensor Networks. 13.2 Quarantine Region Scheme for Spam Attacks. 13.3 Secure Charging and Rewarding Scheme. 13.4 Secure Node Localization. 13.5 Secure Time Synchronization. 13.6 Secure Event and Event Boundary Detection. 13.7 Review Questions. 14 Information Operations and Electronic Warfare. 14.1 Electronic Support. 14.2 Electronic Attack. 14.3 Electronic Protection. 14.4 Review Questions. 15 Standards. 15.1 X.800 and RFC 2828. 15.2 Wired Equivalent Privacy (WEP). 15.3 Wi-Fi Protected Access (WPA). References. Index.

A Dynamic Anomaly Detection Scheme for AODV-Based Mobile Ad Hoc Networks

Abstract: Mobile ad hoc networks (MANETs) are usually formed without any major infrastructure. As a result, they are relatively vulnerable to malicious network attacks, and therefore, security is a more significant issue than infrastructure-based wireless networks. In MANETs, it is difficult to identify malicious hosts as the topology of the network dynamically changes. A malicious host can easily interrupt a route for which it is one of the forming nodes in the communication path. In the literature, there are several proposals to detect such malicious hosts inside the network. In those methods, a baseline profile, which is defined as per static training data, is usually used to verify the identity and the topology of the network, thus preventing any malicious host from joining the network. Since the topology of a MANET dynamically changes, the mere use of a static baseline profile is not efficient. In this paper, we propose a new anomaly-detection scheme based on a dynamic learning process that allows the training data to be updated at particular time intervals. Our dynamic learning process involves calculating the projection distances based on multidimensional statistics using weighted coefficients and a forgetting curve. We use the network simulator 2 (ns-2) system to conduct the MANET simulations and consider scenarios for detecting five types of attacks. The simulation results involving two different networks in size show the effectiveness of the proposed techniques.

Generalized Mobile Ad Hoc Network (MANET) Packet/Message Format

Abstract: This document specifies a packet format capable of carrying multiple messages that may be used by mobile ad hoc network routing protocols. [STANDARDS-TRACK]

A Secure Routing Protocol Against Byzantine Attacks for MANETs in Adversarial Environments

Abstract: To secure a mobile ad hoc network (MANET) in adversarial environments, a particularly challenging problem is how to feasibly detect and defend possible attacks on routing protocols, particularly internal attacks, such as a Byzantine attack. In this paper, we propose a novel algorithm that detects internal attacks by using both message and route redundancy during route discovery. The route-discovery messages are protected by pairwise secret keys between a source and destination and some intermediate nodes along a route established by using public key cryptographic mechanisms. We also propose an optimal routing algorithm with routing metric combining both requirements on a node's trustworthiness and performance. A node builds up the trustworthiness on its neighboring nodes based on its observations on the behaviors of the neighbor nodes. Both of the proposed algorithms can be integrated into existing routing protocols for MANETs, such as ad hoc on-demand distance vector routing (AODV) and dynamic source routing (DSR). As an example, we present such an integrated protocol called secure routing against collusion (SRAC), in which a node makes a routing decision based on its trust of its neighboring nodes and the performance provided by them. The simulation results have demonstrated the significant advantages of the proposed attack detection and routing algorithm over some known protocols.

Performance Comparison of AODV, DSR and ZRP Routing Protocols in MANET'S

Abstract: This paper aims to compare performance of some routing protocols for Mobile Ad-Hoc networks (MANET’s). A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. Data transmission between two nodes in MANET’s , requires multiple hops as nodes transmission range is limited. Mobility of the different nodes makes the situation even more complicated. Multiple routing protocols especially for these conditions have been developed during the last years, to find optimized routes from a source to some destination. This paper presents performance evaluation of three different routing Protocols (AODV, DSR and ZRP) in variable pause times . We have used QualNet Simulator [1] from Scalable Networks to perform the simulations. Performance evaluation of AODV, DSR and ZRP is evaluated based on Average end to end delay, TTL based hop count and Packet delivery ratio.

Energy Efficient Location Aided Routing Protocol for Wireless MANETs

Abstract: A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. In this paper we introduce an Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is based on the Location Aided Routing (LAR). EELAR makes significant reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead is significantly reduced. In EELAR a reference wireless base station is used and the network's circular area centered at the base station is divided into six equal sub-areas. At route discovery instead of flooding control packets to the whole network area, they are flooded to only the sub-area of the destination mobile node. The base station stores locations of the mobile nodes in a position table. To show the efficiency of the proposed protocol we present simulations using NS-2. Simulation results show that EELAR protocol makes an improvement in control packet overhead and delivery ratio compared to AODV, LAR, and DSR protocols.

Performance analysis of random-based mobility models in MANET routing protocol.

Abstract: With current advances in technology, wireless networks are increasing in popularity. Wireless networks allow users the freedom to travel from one location to another without interruption of their computing services. Ad hoc networks is one of the subset of wireless network that dynamically forming a temporary network without using any existing network infrastructure or centralized administration. Therefore, it is required a good routing protocol in order to established the connection between the nodes since the mobile node can change their topology frequently. In the routing protocol, the movement of the mobile node is one of the important characteristics because it can effects the performance of the ad hoc network protocol. In this research, we have studied the effect of the different mobile node movement pattern in random-based mobility model group (Random Waypoint Mobility Model, Random Walk Mobility Model and Random Direction Mobility Model) on the performance of Ad hoc On-demand Distance Vector (AODV). The performance analysis was conducted by using the discrete-event simulator, OMNeT++. The simulator was used to simulate the mobility environment and the Open System Interconnections (OSI) layers utilized in wireless simulation. The simulation results illustrate the performance of the routing protocol varies across different performance metrics.

Power Aware Routing in Ad Hoc Wireless Networks

Abstract: Development of the efficient power aware protocol is the need of today s adhoc networks. Although developing battery efficient systems that have low cost and complexity, remains a crucial issue. In order to facilitate communication within a mobile adhoc network, an efficient routing protocol is required to discover routes between mobile nodes. Power is one of the most important design criteria for adhoc networks as batteries provide limited working capacity to the mobile nodes. Power failure of a mobile node not only affects the node itself but also its ability to forward packets on behalf of others and hence affects the overall network lifetime. Much research efforts have been devoted to develop energy aware routing protocols. In this paper we propose an efficient algorithm, which maximizes the network lifetime by minimizing the power consumption during the source to destination route establishment. As a case study proposed algorithm has been incorporated along with the route discovery procedure of AODV and by simulation it is observed that proposed algorithm s perperformance is better as compare to AODV and DSR in terms of various energy related parameters like Total Energy Consumption, Average Energy Left Per Alive Node, Node Termination Rate, and Network Lifetime for different network scenario

Performance comparison of ad-hoc routing protocols AODV and DSR

Abstract: Ad hoc networks are known by many specifications like multi-hop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols that plays an important role. This paper presents a performance comparison between two reactive routing protocols for mobile ad hoc networks: Dynamic Source Routing (DSR), Ad Hoc On demand distance Vector (AODV).Both protocols were simulated using the tool ns-2 and were compared in terms of packet loss ratio, end to end delay, with mobile nodes varying number of nodes and speed. Simulation revealed that although DSR perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.

Performance Analysis of AODV, DSR, and Swarm Intelligence Routing Protocols In Vehicular Ad Hoc Network Environment

Abstract: Vehicular Ad hoc Networks (VANETS) are self-organizing communities of wheeled mobile units consisting of large numbers of trucks, cars, buses and a small number of static infrastructure nodes such as traffic signals, highway rail grade crossings, and informational signage within radio communication range to each other. VANET is a promising approach for facilitating road safety, traffic management,and infotainment dissemination for drivers and passengers.Key characteristics that distinguish VANETs from other networks are time-varying nature of vehicle density, high mobility, and time-critical safety applications. Hence, devising protocols for VANETs may not be successfully accomplished by simple adaptation of protocols designed for wired networks and Mobile Ad hoc Networks (MANETs). In this paper, we compared and evaluated the performance of following routing protocols: AODV, DSR, and Swarm Intelligence based routing protocol. A variety of VANETs, characterized by the mobility, load, and size of the network were simulated. Simulation results shows that AODV and DSR may not be suitable for vehicular environments. SWARM Intelligence based routing protocol showed promising results in VANETs in terms throughput, latency, data delivery ratio and data delivery cost.

Game theoretic approach in routing protocol for wireless ad hoc networks

Abstract: This paper introduces a game theoretic method, called forwarding dilemma game (FDG), which controls routing overhead in dense multi-hop wireless ad hoc networks. The players of the game are the wireless nodes with set of strategies {Forward, Not forward}. The game is played whenever an arbitrary node in the network receives a flooding packet. In FDG, every player needs to know the number of players of the game. That is why a neighbor discovery protocol (NDP) is introduced. In order for NDP to function, a field is attached to the flooding packets (routing overhead packets). The mixed strategy Nash equilibrium is used as a solution for the FDG. This provides the probability that the flooding packet would be forwarded by the receiver node. FDG with NDP is implemented in AODV protocol in Network Simulator NS-2 to verify its performance with simulations. FDG with NDP improves performance of the AODV compared to the same network with only AODV protocol in moderate and high node densities. FDG can be applied to any routing protocol that uses flooding in the route discovery phase.

Improving Route Stability and Overhead on AODV Routing Protocol and Make it Usable for VANET

Abstract: one of the most important routing protocols used in Ad hoc networks is AODV. This protocol is a reactive protocol that searches routes only when they are needed. It always exchanges control packets between neighbor nodes for routing. For reduction of control overheads and bandwidth consumption and make AODV usable for VANET, we have eliminated route discovery phase by restricting neighbor’s distance and number of discovered routes. This restriction leads to reduce most of control overheads. We make an improvement on AODV and propose PAODV as routing protocol. This protocol improves AODV control overheads and makes routes more stable. One of the technical differences between MANET and VANET is mobility model. Manhattan is the mobility model for VANET that we use to evaluate our method.

Cooperation in Mobile Ad Hoc Networks

Abstract: Mobile ad hoc networks (MANETs) are collections of self-organizing mobile nodes with dynamic topologies and no fixed infrastructure [1, 2]. Cooperation among nodes is fundamental to the function of a MANET. However, nodes in a MANET are autonomous and independent wireless devices. Due to the lack of infrastructure, the constraints of resources at each node, and the ad hoc nature of nodes, we cannot assume that every node behaves as the protocol requires. This chapter presents a detailed study on the recent advances in stimulating cooperation in MANETs. Virtual currency systems and reputation systems are described, followed by a discussion of the directions for future research.

Performance evaluation of AODV and OLSR in highly fading vehicular ad hoc network environments

Abstract: Vehicular Ad hoc Network (VANET) is a challenging network environment in which communication between vehicles in highly fading environments, like an urban scenario, is unpredictable and difficult In order to analyze the performance of protocols and applications, network simulators like NS-2 use deterministic Two Ray Ground radio propagation model This model, however, poorly reflects the channel characteristics of real world conditions In this paper, probabilistic Nakagami radio propagation model is used to represent channel fading characteristics of urban scenarios The performance analysis of two routing protocols, AODV and OLSR using Nakagami propagation model under high obstacle urban environment is presented It is observed that both routing protocols fail to provide acceptable packet delivery ratio Overall, OLSR, with short interval of control messages, performed better than AODV in urban environments

ARMR: Anonymous routing protocol with multiple routes for communications in mobile ad hoc networks

Abstract: A mobile ad hoc network consists of mobile nodes that communicate in an open wireless medium. Adversaries can launch analysis against the routing information embedded in the routing message and data packets to detect the traffic pattern of the communications, thereby obtaining sensitive information of the system, such as the identity of a critical node. In order to thwart such attacks, anonymous routing protocols are developed. For the purposes of security and robustness, an ideal anonymous routing protocol should hide the identities of the nodes in the route, in particular, those of the source and the destination. Multiple routes should be established to increase the difficulty of traffic analysis and to avoid broken paths due to node mobility. Existing schemes either make the unrealistic and undesired assumption that certain topological information about the network is known to the nodes, or cannot achieve all the properties described in the above. In this paper, we propose an anonymous routing protocol with multiple routes called ARMR, which can satisfy all the required properties. In addition, the protocol has the flexibility of creating fake routes to confuse the adversaries, thus increasing the level of anonymity. In terms of communication efficiency, extensive simulation is carried out. Compared with AODV and MASK, our ARMR protocol gives a higher route request success rate under all situations and the delay of our protocol is comparable to the best of these two protocols.

MANET routing protocols vs. mobility models: performance analysis and comparison

Abstract: This paper considers performance of mobile ad hoc network (MANET) routing protocols with respect to group and entity mobility models. The three widely used routing protocols have been investigated and compared: Destination Sequenced Distance Vector (DSDV), Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). Mobility models encompass: Reference Point Group Mobility (RPGM), Random Waypoint (RW), Gauss-Markov (GM) and Manhattan Grid (MG). Simulations have been carried out using Network Simulator version 2 (NS2) and its associated tools for animation and analysis of results. We have developed a set of specific simulation scripts that are applicable for a wide range of MANET scenarios. Comparative analysis of simulation results includes network performance with respect to mobile node speeds and network size.

Combat with Black hole attack in AODV routing protocol in MANET

Abstract: A mobile ad hoc network (MANET) is an autonomous network that consists of mobile nodes that communicate with each other over wireless links. In the absence of a fixed infrastructure, nodes have to cooperate in order to provide the necessary network functionality. One of the principal routing protocols used in Ad hoc networks is AODV (Ad hoc on demand Distance Vector) protocol. The security of the AODV protocol is threaded by a particular type of attack called ‘Black Hole’ attack. In this attack a malicious node advertises itself as having the shortest path to the destination node. To combat with black hole attack, it is proposed to wait and check the replies from all the neighboring nodes to find a safe route but this approach suffers from high delay. In this paper, an approach is proposed to combat the Black hole attack by using negotiation with neighbors who claim to have a route to destination. the Simulation's results show that the proposed protocol provides better security and also better performance in terms of packet delivery than the conventional AODV in the presence of Black holes with minimal additional delay and Overhead.

Throughput and Delay Comparison of MANET Routing Protocols

Abstract: Mobile wireless ad hoc networks are infrastructureless and often used to operate under unattended mode. So, it is significant in bringing out a comparison of the various routing protocols for better understanding and implementation of them. In this paper, we studied and compared the performance of various routing protocols like Ad hoc On-Demand Vector routing (AODV), Fisheye, Dynamic MANET On-demand (DYMO), Source Tree Adaptive Routing (STAR) protocol, Routing Information Protocol (RIP), Bellman Ford, LANd Mark Ad hoc Routing protocol (LANMAR) and Location Aided Routing protocol (LAR). The comparison results were graphically depicted and explained.

A Taxonomy of Routing Protocols for Mobile Ad Hoc Networks

Abstract: This chapter contains sections titled: Introduction Ad Hoc Networks Applications Design Issues Ad Hoc Networks Routing Protocols Conclusions Exercises References

Performance Analysis of MANET under Blackhole Attack

Abstract: Mobile Ad Hoc Network (MANET) consists of a collection of wireless mobile hosts without the required intervention of any existing infrastructure or centralized access point such as base station. The dynamic topology of MANET allows nodes to join and leave the network at any point of time. Wireless MANET is particularly vulnerable due to its fundamental characteristics such as open medium, dynamic topology, distributed cooperation and constrained capability. In this paper we simulate the blackhole attack which is one of the possible attacks on AODV routing protocol in mobile ad hoc networks by the help of network simulator (NS-2). The simulation results show the packet loss, throughput, and end-to-end delay with blackhole and without blackhole on AODV in MANET. We analyzed that the packet loss increases in the network with a blackhole node. We also observed that the throughput and end-to-end delay decreases in the network with a blackhole node.

Comparison of effectiveness of aodv, dsdv and dsr routing protocols in mobile ad hoc networks

Abstract: Mobile ad hoc networks (MANET) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self organize into arbitrary and temporary ad hoc network topologies. A mobile ad hoc network is a collection of nodes that is connected through a wireless medium forming rapidly changing topologies. The widely accepted existing routing protocols designed to accommodate the needs of such self-organized networks do not address possible threats aiming at the disruption of the protocol itself. Simulation is the research tool of choice for a majority of the mobile ad hoc network (MANET) community. Manets are infrastructure less and can be set up anytime, anywhere. We have conducted survey of simulation results of various Manet routing algorithms and analyzed them. The routing algorithms considered are classified into two categories proactive and reactive. The algorithms considered are AODV, DSR, DSDV. The performance measurements are based on the various parameters such as packet delivery fraction, average end to end delay and number of packets dropped. Future work in this area includes development of efficient routing protocols so as to improve the performance of the parameter in which the particular routing protocol is lagging.

Combat with Black Hole attack in AODV routing protocol

Abstract: A mobile ad hoc network (MANET) is an autonomous network that consists of mobile nodes that communicate with each other over wireless links. In the absence of a fixed infrastructure, nodes have to cooperate in order to provide the necessary network functionality. One of the principal routing protocols used in Ad hoc networks is AODV (Ad hoc on demand Distance Vector) protocol. The security of the AODV protocol is threaded by a particular type of attack called ‘Black Hole’ attack. In this attack a malicious node advertises itself as having the shortest path to the destination node. To combat with black hole attack, it is proposed to wait and check the replies from all the neighboring nodes to find a safe route but this approach suffers from high delay. In this paper, an approach is proposed to combat the Black hole attack by using negotiation with neighbors who claim to have a route to destination. the Simulation's results show that the proposed protocol provides better security and also better performance in terms of packet delivery than the conventional AODV in the presence of Black holes with minimal additional delay and Overhead.

A Static Multi-hop Underwater Wireless Sensor Network Using RF Electromagnetic Communications

Abstract: Most underwater sensor networks choose acoustics as the medium for wireless transmission. However, electromagnetic waves also offer great merits for transmission in special underwater environment. A small scale wireless sensor network is deployed using electromagnetic waves with a multi-hop static topology under shallow water conditions where there is a high level of sediment and aeration in the water column. Data delivery is scheduled via daily cycles of sleeping and waking up to transmit. Due to the unique features of the network, ad-hoc on-demand Distance Vector (AODV) is chosen as the routing protocol. Modeling and simulations are conducted to evaluate network performance in terms of failure tolerance, congestion handling, and optimal grid arrangements. The results demonstrate the likely effectiveness of the designated network for this and similar scenarios.

Performance Comparison of Flat and Cluster-Based Hierarchical Ad Hoc Routing with Entity and Group Mobility

Abstract: Ad hoc routing protocols can be divided into flat and hierarchical routing. One typical way to build hierarchy is to group mobile nodes into clusters, thus decrease routing space and improve network performance. Mobility models also affect the performance of ad hoc routing protocols and can be divided into entity mobility and group mobility models. This paper first studies the performance of flat routing, AODV and DSR, and cluster-based hierarchical routing, CBRP and ECBRP, on entity mobility, Random Waypoint, and group mobility, RPGM and RRGM. Performance comparisons between flat and cluster-based hierarchical routing protocols in different mobility models are analyzed. We have observed that the effects of group mobility on routing protocols are significantly different from that of entity mobility.