scispace - formally typeset
Search or ask a question

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


Journal ArticleDOI
TL;DR: Simulations show that adding gossiping to AODV results in significant performance improvement, even in networks as small as 150 nodes, and suggest that the improvement should be even more significant in larger networks.
Abstract: Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations of flooding, many routing messages are propagated unnecessarily. We propose a gossiping-based approach, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. Gossiping exhibits bimodal behavior in sufficiently large networks: in some executions, the gossip dies out quickly and hardly any node gets the message; in the remaining executions, a substantial fraction of the nodes gets the message. The fraction of executions in which most nodes get the message depends on the gossiping probability and the topology of the network. In the networks we have considered, using gossiping probability between 0.6 and 0.8 suffices to ensure that almost every node gets the message in almost every execution. For large networks, this simple gossiping protocol uses up to 35% fewer messages than flooding, with improved performance. Gossiping can also be combined with various optimizations of flooding to yield further benefits. Simulations show that adding gossiping to AODV results in significant performance improvement, even in networks as small as 150 nodes. Our results suggest that the improvement should be even more significant in larger networks

828 citations


Journal ArticleDOI
TL;DR: AOMDV as discussed by the authors is an on-demand, multipath distance vector routing protocol for mobile ad hoc networks, which guarantees loop freedom and disjointness of alternate paths.
Abstract: We develop an on-demand, multipath distance vector routing protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as ad hoc on-demand distance vector (AODV). The resulting protocol is referred to as ad hoc on-demand multipath distance vector (AOMDV). The protocol guarantees loop freedom and disjointness of alternate paths. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to effectively cope with mobility-induced route failures. In particular, it reduces the packet loss by up to 40% and achieves a remarkable improvement in the end-to-end delay (often more than a factor of two). AOMDV also reduces routing overhead by about 30% by reducing the frequency of route discovery operations. Copyright © 2006 John Wiley & Sons, Ltd.

625 citations


Proceedings ArticleDOI
22 May 2006
TL;DR: This study studies the behavior of routing protocols in VANETs by using mobility information obtained from a microscopic vehicular traffic simulator that is based on the on the real road maps of Switzerland, and investigates two improvements that increase the packet delivery ratio and reduce the delay until the first packet arrives.
Abstract: Vehicular ad hoc networks (VANETs) using WLAN tech-nology have recently received considerable attention. The evaluation of VANET routing protocols often involves simulators since management and operation of a large number of real vehicular nodes is expensive. We study the behavior of routing protocols in VANETs by using mobility information obtained from a microscopic vehicular traffic simulator that is based on the on the real road maps of Switzerland. The performance of AODV and GPSR is significantly in uenced by the choice of mobility model, and we observe a significantly reduced packet delivery ratio when employing the realistic traffic simulator to control mobility of nodes. To address the performance limitations of communication pro-tocols in VANETs, we investigate two improvements that increase the packet delivery ratio and reduce the delay until the first packet arrives. The traces used in this study are available for public download.

549 citations



06 Sep 2006
TL;DR: The Secure Ad hoc On-Demand Distance Vector is an extension of the AODV routing protocol that can be used to protect the route discovery mechanism providing security features like integrity and authentication.
Abstract: The Secure Ad hoc On-Demand Distance Vector (SAODV) is an extension of the AODV routing protocol that can be used to protect the route discovery mechanism providing security features like integrity and authentication.

394 citations


01 Jan 2006
TL;DR: AODV and OLSR performance in realistic urban scenarios is evaluated under varying metrics such as node mobility and vehicle density, and with varying traffic rates to provide a qualitative assessment of the applicability of the protocols in different vehicular scenarios.
Abstract: A Vehicular Ad Hoc Network (VANET) is an instance of MANETs that establishes wireless connections between cars. In VANETs, routing protocols and other techniques must be adapted to vehicular-specific capabilities and requirements. As many previous works have shown, routing performance is greatly dependent to the availability and stability of wireless links, which makes it a crucial parameter that should not be neglected in order to obtain accurate performance measurements in VANETs. Although routing protocols have already been analyzed and compared in the past, simulations and comparisons have almost always been done considering random motions. But could we assess that those results hold if performed using realistic urban vehicular motion patterns ? In this paper, we evaluate AODV and OLSR performance in realistic urban scenarios. We study those protocols under varying metrics such as node mobility and vehicle density, and with varying traffic rates. We show that clustering effects created by cars aggregating at intersections have remarkable impacts on evaluation and performance metrics. Our objective is to provide a qualitative assessment of the applicability of the protocols in different vehicular scenarios.

229 citations


Proceedings ArticleDOI
22 May 2006
TL;DR: In this article, the problem of an attacker disrupting an encrypted victim wireless ad hoc network through jamming is considered and a sensor is developed and tested on live data and the classification is found to be highly reliable for many packet types.
Abstract: This paper considers the problem of an attacker disrupting an encrypted victim wireless ad hoc network through jamming. Jamming is broken down into layers and this paper focuses on jamming at the Transport/Network layer. Jamming at this layer exploits AODV and TCP protocols and is shown to be very effective in simulated and real networks when it can sense victim packet types, but the encryption is assumed to mask the entire header and contents of the packet so that only packet size, timing, and sequence is available to the attacker for sensing. A sensor is developed and tested on live data. The classification is found to be highly reliable for many packet types. The relative roles of size, timing, and sequence are discussed along with the implications for making networks more secure.

183 citations


Journal ArticleDOI
TL;DR: It is argued that routing should not only be aware of, but also be adaptive to, network congestion, and proposed a routing protocol (CRP) with such properties is proposed.
Abstract: Mobility, channel error, and congestion are the main causes for packet loss in mobile ad hoc networks. Reducing packet loss typically involves congestion control operating on top of a mobility and failure adaptive routing protocol at the network layer. In the current designs, routing is not congestion-adaptive. Routing may let a congestion happen which is detected by congestion control, but dealing with congestion in this reactive manner results in longer delay and unnecessary packet loss and requires significant overhead if a new route is needed. This problem becomes more visible especially in large-scale transmission of heavy traffic such as multimedia data, where congestion is more probable and the negative impact of packet loss on the service quality is of more significance. We argue that routing should not only be aware of, but also be adaptive to, network congestion. Hence, we propose a routing protocol (CRP) with such properties. Our ns-2 simulation results confirm that CRP improves the packet loss rate and end-to-end delay while enjoying significantly smaller protocol overhead and higher energy efficiency as compared to AODV and DSR

171 citations


Journal ArticleDOI
TL;DR: A lightweight hierarchical routing model, way point routing (WPR), in which a number of intermediate nodes on a route are selected as waypoints and the route is divided into segments by the waypoints, which shows that DOA scales well for large networks with more than 1,000 nodes.
Abstract: We present a lightweight hierarchical routing model, way point routing (WPR), in which a number of intermediate nodes on a route are selected as waypoints and the route is divided into segments by the waypoints. The waypoints, including the source and the destination, run a high-level intersegment routing protocol, while the nodes on each segment run a low-level intrasegment routing protocol. One distinct advantage of our model is that when a node on the route moves out or fails, instead of discarding the whole original route and discovering a new route from the source to the destination, only the two waypoint nodes of the broken segment have to find a new segment. In addition, our model is lightweight because it maintains a hierarchy only for nodes on active routes. On the other hand, existing hierarchical routing protocols such as CGSR and ZRP maintain hierarchies for the entire network. We present an instantiation of WPR, where we use DSR as the intersegment routing protocol and AODV as the intrasegment routing protocol. This instantiation is termed DSR over AODV (DOA) routing protocol. Thus, DSR and AODV - two well-known on-demand routing protocols for MANETs - are combined into one hierarchical routing protocol and become two special cases of our protocol. Furthermore, we present two novel techniques for DOA: one is an efficient loop detection method and the other is a multitarget route, discovery. Simulation results show that DOA scales well for large networks with more than 1,000 nodes, incurring about 60 percent-80 percent less overhead than AODV, while other metrics are better than or comparable to AODV and DSR

149 citations


Proceedings ArticleDOI
01 Nov 2006
TL;DR: Evaluating the performance of three well-known and widely investigated MANET routing protocols in the presence of bursty self-similar traffic indicates that DSR routing protocol performs well with bursty traffic models compared to AODV and OLSR in terms of delivery ratio, throughput and end-to-end delay.
Abstract: A number of measurement studies have convincingly demonstrated that network traffic can exhibit a noticeable self-similar nature, which has a considerable impact on queuing performance. However, many routing protocols developed for MANETs over the past few years have been primarily designed and analyzed under the assumptions of either CBR or Poisson traffic models, which are inherently unable to capture traffic self-similarity. It is crucial to re-examine the performance properties of MANETs in the context of more realistic traffic models before practical implementation show their potential performance limitations. In an effort towards this end, this paper evaluates the performance of three well-known and widely investigated MANET routing protocols, notably DSR, AODV and OLSR, in the presence of the bursty self-similar traffic. Different performance aspects are investigated including, delivery ratio, routing overhead, throughput and end-to-end delay. Our simulation results indicate that DSR routing protocol performs well with bursty traffic models compared to AODV and OLSR in terms of delivery ratio, throughput and end-to-end delay. On the other hand, OLSR performed poorly in the presence of self-similar traffic at high mobility especially in terms of data packet delivery ratio, routing overhead and delay. As for AODV routing protocol, the results show an average performance, yet a remarkably low and stable end-to-end delay.

135 citations


Proceedings ArticleDOI
01 Oct 2006
TL;DR: A comparative simulation study of random waypoint and Gauss-Markov mobility models on the performance study of MANET that uses ad-hoc on-demand distance vector (AODV) as the routing protocol shows that both mobility models are not different in case each MN is moving at human running speed.
Abstract: A mobile ad hoc network (MANET) is a network consisting of a set of wireless mobile nodes that communicate with each other without centralized control or established infrastructure. The mobility model represents the moving behavior of each mobile node (MN) in the MANET that should be realistic. It is a crucial part in the performance evaluation of MANET. Random Waypoint mobility model is the only mobility model that has been widely used in the simulation study of MANET despite some unrealistic movement behaviors such as sudden stop and sharp turn. Whilst Gauss-Markov mobility model has been proved that it can solve both of these problems. This paper presents a comparative simulation study of Random Waypoint and Gauss-Markov mobility models on the performance study of MANET that uses Ad-hoc On-Demand Distance Vector (AODV) as the routing protocol. The results show that both mobility models are not different in case each MN is moving at human running speed. Therefore, it is suggested to use Random Waypoint mobility model because of its less computational overhead comparing to Gauss-Markov mobility model. When the speed of MNs is as high as fast automobiles, the performance result using Random Waypoint mobility model is significant different from Gauss-Markov mobility model. Therefore, Gauss-Markov mobility model should be used instead. Moreover, different levels of randomness setting have no effect on the accuracy of throughput and end-to-end delay.



01 Jan 2006
TL;DR: This book discusses Ad Hoc Networks, the Architecture for Intrusion Detection in MANET, and Application of Policy Management to Security Management, which addresses the challenges faced by ad-hoc networks in the rapidly changing environment.

Book ChapterDOI
01 Aug 2006
TL;DR: The R-AODV protocol is designed and implemented, which has a novel aspect compared to other on-demand routing protocols on Ad-hoc Networks: it reduces path fail correction messages and obtains better performance than the AODV and other protocols have.
Abstract: In mobile ad hoc networks, mobile devices wander autonomously for the use of wireless links and dynamically varying network topology. AODV (Ad-hoc on-demand Distance vector routing) is a representative among the most widely studied on-demand ad hoc routing protocols. Previous protocols have shown some shortcomings on performance. AODV and most of the on-demand ad hoc routing protocols use single route reply along reverse path. Rapid change of topology causes that the route reply could not arrive to the source node, i.e. after a source node sends several route request messages, the node obtains a reply message, especially on high speed mobility. This increases both in communication delay and power consumption as well as decrease in packet delivery ratio. To avoid these problems, we propose a reverse AODV which tries multiple route replies. The extended AODV is called reverse AODV (R-AODV), which has a novel aspect compared to other on-demand routing protocols on Ad-hoc Networks: it reduces path fail correction messages and obtains better performance than the AODV and other protocols have. We design the R-AODV protocol and implement simulation models using NS-2. Simulation results show that the reverse AODV provides good experimental results on packet delivery ratio, power consumption and communication delay.

Proceedings ArticleDOI
09 Oct 2006
TL;DR: This work proposes ODAR, an On-Demand Anonymous Routing protocol for wireless ad hoc networks to enable complete anonymity of nodes, links and source-routing paths/trees using Bloom filters and compares it with AODV in certain ad hoc network scenarios.
Abstract: Routing in wireless ad hoc networks are vulnerable to traffic analysis, spoofing and denial of service attacks due to open wireless medium communications. Anonymity mechanisms in ad hoc networks are critical security measures used to mitigate these problems by concealing identification information, such as those of nodes, links, traffic flows, paths and network topology information from harmful attackers. We propose ODAR, an On-Demand Anonymous Routing protocol for wireless ad hoc networks to enable complete anonymity of nodes, links and source-routing paths/trees using Bloom filters. We simulate ODAR using J-Sim, and compare its performance with AODV in certain ad hoc network scenarios.

Journal ArticleDOI
TL;DR: Ad hoc Networking with Swarm Intelligence (ANSI), is a congestion-aware routing protocol, which is able to collect more information about the local network and make more effective routing decisions than traditional MANET protocols, and achieves this performance with fewer route errors as compared to AODV.

Journal ArticleDOI
TL;DR: A comprehensive survey of MPR-based broadcast schemes is presented, classified into three categories based on their objectives, and the evaluation of their performances is provided in light of their costs.
Abstract: Almost every routing protocol in mobile ad hoc networks (MANETs) depends on a broadcast scheme to disseminate routing information. For this reason, creating an efficient broadcast scheme is important and a large variety of approaches have been proposed. Among them, multipoint relay (MPR) is one of the distributed broadcast schemes which is efficient and simple. Based on the MPR concept, many broadcast schemes have been proposed, which generally focus on different performance issues. In this article we present a comprehensive survey of MPR-based broadcast schemes, classified into three categories based on their objectives. Different heuristics are described, and the evaluation of their performances is provided in light of their costs. Advantages and limitations of different broadcast schemes are also highlighted.

Proceedings ArticleDOI
19 Feb 2006
TL;DR: This paper proposes that the enhanced AODV routing protocol which is modified to improve the networks lifetime in MANET (Mobile Ad-hoc NETwork) by applying an Energy Mean Value algorithm which considerate node energy-aware.
Abstract: A mobile ad-hoc network which does not use a wired network and base station system is composed of a group of mobile and wireless nodes. There are various types of restrictions. The biggest restriction is the confined energy of the batteries. If the network is divided into more than two, and one of the nodes consumes all the energy, that node can no longer participate in the network. In recent years, much research has been under taken to not only improve the energy storage but also to lengthen the networks lifetime. In this paper, we propose that the enhanced AODV (Ad-hoc On-demand Distance Vector) routing protocol which is modified to improve the networks lifetime in MANET (Mobile Ad-hoc NETwork). One improvement for the AODV protocol is to maximize the networks lifetime by applying an Energy Mean Value algorithm which considerate node energy-aware. We know the effectiveness of enhanced AODV compared with existing AODV by using NS-2. ..

Proceedings ArticleDOI
01 Jan 2006
TL;DR: This paper surveys clustering schemes and classifies them into ad hoc sensor network clustering scheme and mobile ad hoc network clusters, which aim at handling topology maintenance, managing node movement or reducing overhead.
Abstract: Many clustering schemes have been proposed for different ad hoc networks and play an important role in self organizing them. A systematic classification of these clustering schemes enables one to better understand and make improvements. This paper surveys clustering schemes and classifies them into ad hoc sensor network clustering schemes and mobile ad hoc network clustering schemes. In sensor networks, the energy stored in the network nodes is limited and usually infeasible to recharge; the clustering schemes for these networks therefore aim at maximizing the energy efficiency. In mobile ad hoc networks, the movement of the network nodes may quickly change the topology resulting in the increase of the overhead message in topology maintenance; the clustering schemes for mobile ad hoc networks therefore aim at handling topology maintenance, managing node movement or reducing overhead

Book ChapterDOI
20 Aug 2006
TL;DR: In this paper, the authors present an overview of issues related to medium access control (MAC), routing, and transport in wireless ad hoc networks and techniques proposed to improve the performance of protocols.
Abstract: A wireless ad hoc network is a collection of wireless nodes that can dynamically self-organize into an arbitrary and temporary topology to form a network without necessarily using any pre-existing infrastructure. These characteristics make ad hoc networks well suited for military activities, emergency operations, and disaster recoveries. Nevertheless, as electronic devices are getting smaller, cheaper, and more powerful, the mobile market is rapidly growing and, as a consequence, the need of seamlessly internetworking people and devices becomes mandatory. New wireless technologies enable easy deployment of commercial applications for ad hoc networks. The design of an ad hoc network has to take into account several interesting and difficult problems due to noisy, limited-range, and insecure wireless transmissions added to mobility and energy constraints. This paper presents an overview of issues related to medium access control (MAC), routing, and transport in wireless ad hoc networks and techniques proposed to improve the performance of protocols. Research activities and problems requiring further work are also presented. Finally, the paper presents a project concerning an ad hoc network to easily deploy Internet services on low-income habitations fostering digital inclusion.

Proceedings ArticleDOI
01 Dec 2006
TL;DR: This paper does the comprehensive performance analysis of the routing protocols using ns2 simulator considering all the metrics as suggested by RFC 2501 and indicates reactive routing protocols are more suitable for adhoc networks.
Abstract: Routing in adhoc networks is nontrivial due to highly dynamic nature of the nodes. In recent years several routing protocols targeted at mobile adhoc networks are being proposed and prominent among them are DSDV, AODV, TORA, and DSR. This paper does the comprehensive performance analysis of the routing protocols using ns2 simulator considering all the metrics as suggested by RFC 2501. Results indicate reactive routing protocols are more suitable for adhoc networks.

Journal Article
TL;DR: This paper proposes an anonymous geographic routing algorithm which includes three components to avoid the explicit exposure of identity and location in communication without compromising the efficiency guaranteed by geographic routing.
Abstract: Due to the utilization of location information, geographic ad hoc routing presents superiority in scalability compared with traditional topology-based routing in mobile ad hoc networks. However, the consequent solicitation for location presence incurs severe concerns of location privacy, which has not been properly studied. In this paper, we attempt to preserve location privacy based on the idea of dissociating user's location information with its identity. We propose an anonymous geographic routing algorithm which includes three components to avoid the explicit exposure of identity and location in communication without compromising the efficiency guaranteed by geographic routing.

Proceedings ArticleDOI
11 Dec 2006
TL;DR: This paper presents performance comparisons of the DSDV, AODV, DSR and TORA routing protocols with respect to a modified path optimality metric that is called weighted path Optimality, network's load deviation that affects nodes and can be a metric for load balancing, average end-to-end delay, and jitter extensively.
Abstract: Ad hoc networks are characterized by multi-hop wireless connectivity and frequently changing network topology which have made them infrastructureless. These networks need efficient routing protocols, so various ad hoc routing protocols have been proposed and compared based on some metrics. In this paper we present performance comparisons of the DSDV, AODV, DSR and TORA routing protocols with respect to a modified path optimality metric that we call it weighted path optimality, network's load deviation that affects nodes and can be a metric for load balancing, average end-to-end delay, and we analyzed jitter (average, maximum, and deviation) extensively, that recently became important in ad hoc networks. A variety of workload and scenarios which characterized by paused time are simulated with ns-2.

Proceedings Article
01 Jan 2006
TL;DR: This paper addresses the problem of low-latency content distribution to a dense vehicular highway network from roadside infostations, using efficient multihop vehicle-to-vehicle coll aboration, and shows that in the limit of a highly dense network, the decentralized approach can attain a multicast throughput that is up to a factor of 1/e of the throughput which could be achieved by perfectly scheduling all packets in the network.
Abstract: The proliferation of low-cost wireless connectivity, combined with the growth of distributed peer-to-peer cooperative systems, is changing the way in which next-generation vehicular networks will evolve. In this paper, we address the problem of low-latency content distribution (multicast streaming) to a dense vehicular highway network from roadside infostations, using efficient multihop vehicle-to-vehicle coll aboration. Due to the highly dynamic nature of the underlying vehicular network topology, we depart from architectures requiring centralized coordination, reliable MAC scheduling, or global network state knowledge, and instead adopt a distributed an d minimally coordinated paradigm. We establish the viability of our approach with both analysis and extensive simulations. Our study is motivated by questions such as “what is the network capacity?” and “how many infostations are needed to realizea target throughput and latency?” The key ingredient in our approach is the use of multihop randomized network coding to efficiently distribute the content in the vehicular network. Specifically, we show that in the limit of a highly dense network, our decentralized approach can attain a multicast throughput that is up to a factor of 1/e of the throughput which could be achieved by perfectly scheduling all packets in the network. Further, the gains ofusing randomized network coding over classical store-and-forwa rd multihop routing strategies can be significant, as measuredby the throughput received at a vehicle as a function of the dist ance between that vehicle and the nearest infostation. This in tu rn translates into a significant decrease in the number of roads ide infostations required to meet desired throughput and latency constraints for specific streaming applications.

Book ChapterDOI
01 Jan 2006
TL;DR: A survey and overview of recently proposed MAC protocols for medium access control in the application of directional antennas in the mobile devices of wireless ad hoc networks is provided.
Abstract: The application of directional antennas in the mobile devices of wireless ad hoc networks has the potential to increase the network connectivity and capacity. However, new solutions for medium access control (MAC) are needed. This pa-per provides a survey and overview of recently proposed MAC protocols for this scenario. We summarize problems specific to this setup and categorize proposed protocols.

Proceedings ArticleDOI
19 Jun 2006
TL;DR: Interestingly, the experiments showed that evolving graphs have all the potentials to be an effective and powerful tool in the development of algorithms for dynamic networks, with predictable dynamics at least.
Abstract: The highly dynamic behavior of wireless networks make them very difficult to evaluate, e.g. as far as the performance of routing algorithms is concerned. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and low Earth orbit (LEO) satellites systems have more predictable dynamics, as the temporal variations in the network topology are somehow deterministic. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of these networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study on the uses of these theoretical results into practical situations. Therefore, the objective of this work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we used the NS2 network simulator to first implement an evolving graph based routing protocol, and then to evaluate such protocol compared to three major ad-hoc protocols (DSDV, DSR, AODV). Interestingly, our experiments showed that evolving graphs have all the potentials to be an effective and powerful tool in the development of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like stochastically predictable behavior. We also discuss such issues in this paper, as a result of our experience

Posted Content
TL;DR: In this paper, an ID-based online/offline scheme for authentication in AODV and then a formal transformation to convert the scheme to an ID based online/online multisignature scheme is presented.
Abstract: Efficient authentication is one of important security requirements in mobile ad hoc network (MANET) routing systems. The techniques of digital signatures are generally considered as the best candidates to achieve strong authentication. However, using normal digital signature schemes is too costly to MANET due to the computation overheads. Considering the feasibility of incorporating digital signatures in MANET, we incorporate the notion of online/offline signatures, where the computational overhead is shifted to the offline phase. However, due to the diversity of different routing protocols, a universal scheme that suits all MANET routing systems does not exist in the literature. Notably, an authentication scheme for the AODV routing is believed to be not suitable to the DSR routing. In this paper, we first introduce an efficient ID-based online/offline scheme for authentication in AODV and then provide a formal transformation to convert the scheme to an ID-based online/offline multisignature scheme. Our scheme is unique, in the sense that a single ID-based online/offline signature scheme can be applied to both AODV and DSR routing protocols. We provide the generic construction as well as the concrete schemes to show an instantiation of the generic transformation. We also provide security proofs for our schemes based on the random oracle model. Finally, we provide an application of our schemes in the dynamic source routing protocol.

Proceedings ArticleDOI
01 Oct 2006
TL;DR: A new secure routing protocol for mobile ad hoc networks (MANETs) based on A ODV called AODV-SEC is presented, using certificates and a public key infrastructure as trust anchor and the need for a new certificate type for secure routing in MANETs called mCert is presented.
Abstract: In this paper we present a new secure routing protocol for mobile ad hoc networks (MANETs) based on AODV called AODV-SEC. Our security approach is using certificates and a public key infrastructure as trust anchor. To verify the correct functionality of the protocol we implemented it in the NS-2 simulator using genuine cryptography and performed extensive simulations and performance evaluations. In addition we present the need for a new certificate type for secure routing in MANETs called mCert. In our opinion the results point out the current difficulties of secure routing protocol design. The paper contains two main sections, one presenting the protocol implementation, the other presenting the simulation settings and the simulation results. The paper closes with a conclusion.

Proceedings ArticleDOI
18 Apr 2006
TL;DR: The SecRout protocol uses the symmetric cryptography to secure messages, and uses a small cache in sensor nodes to record the partial routing path to the destination, and guarantees that the destination will be able to identify and discard the tampered messages.
Abstract: In this paper, we present a secure routing protocol for sensor networks (SecRout) to safeguard sensor networks under different types of attacks. The SecRout protocol uses the symmetric cryptography to secure messages, and uses a small cache in sensor nodes to record the partial routing path (previous and next nodes) to the destination. It guarantees that the destination will be able to identify and discard the tampered messages and ensure that the messages received are not tampered. Comparing the performance with non-secure routing protocol AODV (ad hoc on demand distance vector routing), the SecRout protocol only has a small byte overhead (less than 6%), but packet delivery ratio is almost same as AODV and packet latency is better than AODV after the route discovery.