Academia.eduAcademia.edu

Outline

Title
Abstract
Figures
Introduction
Protocol Overview
Security Analysis
Conclusion
References
All Topics
Computer Science
Computer Networks

A secure multipath routing protocol in mobile ad hoc networks

Profile image of Hao YinHao Yin

2010, Concurrency and Computation: Practice and Experience

https://doi.org/10.1002/CPE.1506
visibility

…

description

22 pages

link

1 file

Abstract

Ad hoc Networks (MANETs). However, existing multipath routing protocols are often practically infeasible due to its security venerability if they suffer from attacks in MANETs, such as repudiation attacks, Denial of Service attacks. In this paper we propose a novel secure multipath routing protocol, referred to as SMRP, and investigate its feasibility and performance. SMRP applies a new heuristic algorithm increasing the number of disjoint paths and a smart authentication mechanism to enhance the security against the attacks in MANETs. The performance results from extensive analysis and experiments show that SMRP can efficiently enhance the security in MANETs while preserving the low overhead of computing and communication.

Figures (15)
Figure 1. Last-Hop DSR request propagation pattern. can use it to authenticate the message. If the receiver misses a message from the source, it just can use the threshold signature to actualize its hash key.
Figure 1. Last-Hop DSR request propagation pattern. can use it to authenticate the message. If the receiver misses a message from the source, it just can use the threshold signature to actualize its hash key.
Figure 2. Route request forwarding algorithm in the intermediary nodes.
Figure 2. Route request forwarding algorithm in the intermediary nodes.
Figure 3. Route request answer algorithm at the destination nodes.
Figure 3. Route request answer algorithm at the destination nodes.
Figure 5. RREQ process algorithm at the intermediary nodes. node verifies the digital signature. In any case the node stores the RO*. The node adds its route address to the path in the message and rebroadcasts it again. The algorithm used to process route request is described in Figures 5 and 10.
Figure 5. RREQ process algorithm at the intermediary nodes. node verifies the digital signature. In any case the node stores the RO*. The node adds its route address to the path in the message and rebroadcasts it again. The algorithm used to process route request is described in Figures 5 and 10.
Figure 6. RREP process at the intermediary nodes.
Figure 6. RREP process at the intermediary nodes.
Figure 7. RREP processing flow.
Figure 7. RREP processing flow.
Figure 8. RREQ processing flow. used. NS2 is an event-driven network simulator developed at UC Berkeley that simulates variety of IP networks. It implements network protocols such as TCP and UPD, traffic source behavior such as FTP, Telnet, Web, CBR and VBR, router queue management mechanism such as Drop Tail, RED and CBQ, routing algorithms such as Dijkstra and more. NS also implements multi- casting and some of the MAC layer protocols for LAN simulations. NS-2 uses an uncommon programming technique called split-level programming [4]. In NS-2 C++ is used to provide fast computable parts of network nodes that are glued together by the tcl scripting language. This style of programming combines both fast computation of compiled programs and flexibility of scripting languages in modifying node structures. If new protocols have to be implemented, both C++ objects and tcl scripts have to be modified. The project concentrates on Security in MANETs.
Figure 8. RREQ processing flow. used. NS2 is an event-driven network simulator developed at UC Berkeley that simulates variety of IP networks. It implements network protocols such as TCP and UPD, traffic source behavior such as FTP, Telnet, Web, CBR and VBR, router queue management mechanism such as Drop Tail, RED and CBQ, routing algorithms such as Dijkstra and more. NS also implements multi- casting and some of the MAC layer protocols for LAN simulations. NS-2 uses an uncommon programming technique called split-level programming [4]. In NS-2 C++ is used to provide fast computable parts of network nodes that are glued together by the tcl scripting language. This style of programming combines both fast computation of compiled programs and flexibility of scripting languages in modifying node structures. If new protocols have to be implemented, both C++ objects and tcl scripts have to be modified. The project concentrates on Security in MANETs.
Table I. Number of route requests sent in one route discovery.
Table I. Number of route requests sent in one route discovery.
Figure 9. Square topology for multipath algorithm experiment. 5.1. Multipath algorithm
Figure 9. Square topology for multipath algorithm experiment. 5.1. Multipath algorithm
Figure 10. RREQ propagation pattern of SMRP(1, 1 bis) and DSR(2, 2 bis). The first strangeness we found is that in the DSR plots several arrows were pointing to the same nodes, which means that a node was forwarding more than one RREQ. The inspection of the traces revealed that even in this simple communication paradigm, DSR needs to restart 4 or 5 times the route discoveries to reach the destination nodes. In comparison, SMRP uses only 1 or 2 route discoveries. Our analysis of such a phenomenon is that in DSR, when a node which is not on the direct trajectory to the destination is the first to rebroadcast the route request, the whole neighborhood is biased to a wrong direction and then the route request that just reaches has max hop numbers and fails. By also forwarding the shortest path request, we avoid such a behavior. [he last-hop unicast is useful to avoid too many trash routes due to the route request broadcasts around the destination. We can see in Figure 10 that the SMRP leads to a more uniform request propagation pattern than DSR; hence, the probability of finding disjoint paths is increased. Not uniform distribution means that the propagation is biased in some particular directions, so that the number of disjoint path is not optimal.
Figure 10. RREQ propagation pattern of SMRP(1, 1 bis) and DSR(2, 2 bis). The first strangeness we found is that in the DSR plots several arrows were pointing to the same nodes, which means that a node was forwarding more than one RREQ. The inspection of the traces revealed that even in this simple communication paradigm, DSR needs to restart 4 or 5 times the route discoveries to reach the destination nodes. In comparison, SMRP uses only 1 or 2 route discoveries. Our analysis of such a phenomenon is that in DSR, when a node which is not on the direct trajectory to the destination is the first to rebroadcast the route request, the whole neighborhood is biased to a wrong direction and then the route request that just reaches has max hop numbers and fails. By also forwarding the shortest path request, we avoid such a behavior. [he last-hop unicast is useful to avoid too many trash routes due to the route request broadcasts around the destination. We can see in Figure 10 that the SMRP leads to a more uniform request propagation pattern than DSR; hence, the probability of finding disjoint paths is increased. Not uniform distribution means that the propagation is biased in some particular directions, so that the number of disjoint path is not optimal.
Figure 11. Number of RREQ signed with hash signatures and with threshold signatures.
Figure 11. Number of RREQ signed with hash signatures and with threshold signatures.
Table II. Gain estimation on P3-997 MHz in ms (key length:512 bits). Table III represents an estimation of the delay overhead introduced by the SMRP security scheme on the route propagation. The delay is computed for a scenario containing 50 nodes, 30 sources which send packets at a rate of 4pkts~! and with a pause time of 300s. We assume an average number of hops of 4. The practical values come from a previous DSR performance evaluation [32]. Eram thie ectimatinn it ic clear that the nce af 4a ceambine anthenticatinn echeme cean conificantly
Table II. Gain estimation on P3-997 MHz in ms (key length:512 bits). Table III represents an estimation of the delay overhead introduced by the SMRP security scheme on the route propagation. The delay is computed for a scenario containing 50 nodes, 30 sources which send packets at a rate of 4pkts~! and with a pause time of 300s. We assume an average number of hops of 4. The practical values come from a previous DSR performance evaluation [32]. Eram thie ectimatinn it ic clear that the nce af 4a ceambine anthenticatinn echeme cean conificantly
Figure 12. Number of RREP signed with hash signature and with threshold signature.
Figure 12. Number of RREP signed with hash signature and with threshold signature.

Related papers

An Efficient and Secure Routing Protocol for Mobile Ad-Hoc Networks
Akshay Atrey

Computing Research Repository, 2010

Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving complex problems in the domain of communication networks. This paper presents a random algorithm for handling the routing problem in Mobile Ad hoc Networks [MANETS].The performance of most existing routing protocols for MANETS degrades in terms of packet delay and congestion caused as the number of mobile nodes increases beyond a certain level or their speed passes a certain level. As the network becomes more and more dynamic, congestion in network increases due to control packets generated by the routing protocols in the process of route discovery and route maintenance. Most of this congestion is due to flooding mechanism used in protocols like AODV and DSDV for the purpose of route discovery and route maintenance or for route discovery as in the case of DSR protocol. This paper introduces the concept of random routing algorithm that neither maintains a routing table nor floods the entire network as done by various known protocols thereby reducing the load on network in terms of number of control packets in a highly dynamic scenario. This paper calculates the expected run time of the designed random algorithm.

View PDFchevron_right
Performance comparison of multipath reactive Ad hoc routing protocols
Yvon Gourhant

2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, 2008

The recent proliferation of wireless devices extends the scope of Mobile Ad hoc NETworks (MANETs) applications beyond the military domain to include civil and commercial application scenarios. Since MANETs are composed of mobile terminals with limited resources, guaranteeing their security remains an unsolved and motivating challenge. Due to advantageous features like infrastructureless and spontaneous deployment, MANETs offer an opportunity to set up temporary, dynamic and local networks for low cost. However, some of their characteristics like unreliability of wireless links, dynamic topology, and absence of underlying infrastructure raise serious problems which become critical when security is also considered. Multipath routing scheme enhances the robustness of routing protocols and offers a mean to mitigate networks mobility impact and node misbehaviors. In this paper we compare the performances of five multipath routing protocols: three node-disjoint multipath routing protocols and two routing protocols based on a Untrusted Node Disjoint (UND) path scheme. Comparisons between these protocols highlight the improvements raised by the UND scheme under different attack configurations.

View PDFchevron_right
Secure Multipath Routing for Data Confidentiality in Mobile Ad Hoc Networks
Julia Punitha Malar Dhas

Research Journal of Applied Sciences, Engineering and Technology, 2013

In Mobile Ad Hoc Networks (MANET), the traditional way of communication performed by the nodes by choosing the geographical location causes complexity. Also the existence of malicious nodes in the transmission path may drop the data packet or influence the routing messages. In order to overcome these issues, in this study, we propose a secure multipath routing for improving data confidentiality in MANET. Initially multiple paths are established between source and destination for data transmission. In the established paths, the monitoring nodes are chosen based on the parameters such as available bandwidth and residual energy using swarm intelligence. These monitoring nodes involve in malicious node detection and informing the source of the attack. When the source wants to transmit the data to the destination, it eliminates the path with malicious nodes and bypasses the data through other alternate path. Then a secure key management technique is deployed to defend against the malicio...

View PDFchevron_right
A Secure Routing Protocol for Ad Hoc Networks
Kanij Sharme

A Secure Routing Protocols for Ad Hoc Network, 2018

Mobile Ad-Hoc network is a kind of wireless network and self-configuring network of moving routers associated with wireless network. The routers are free to move randomly and organize themselves arbitrarily. wireless topology may change rapidly and unpredictably Due to the resource constrain mobile ad hoc network faces lot of various challenges as compared to the wired network such as error prone broadcast channels, limited bandwidth, hidden and exposed terminal problems, frequent topology changes, power constraints and security issues [1]. A Mobile ad hoc network is a group of wireless mobile computers (or nodes). In which nodes collaborate by forwarding packets for each other to allow them to communicate outside range of direct wireless transmission. Ad hoc networks require no centralized administration or fixed network infrastructure such as base stations or access points, and can be quickly and inexpensively set up as needed. A MANET is an autonomous group of mobile users that communicate over reasonably slow wireless links. The network topology may vary rapidly and unpredictably over time, because the nodes are mobile. The network is decentralized, where all network activity, including discovering the topology and delivering messages must be executed by the nodes themselves. Hence routing functionality will have to be incorporated into the mobile nodes. Mobile ad hoc network is a collection of independent mobile nodes that can communicate to each other via radio waves. The mobile nodes can directly communicate to those nodes that are in radio range of each other, whereas others nodes need the help of intermediate nodes to route their packets. These networks are fully distributed, and can work at any place without the aid of any infrastructure. Mobile ad-hoc network is presently applicable everywhere in real life like in business meetings outside the offices, in Bluetooth, Wi-Fi Protocols etc. Routing is the process of selecting paths in a network along which to send data or physical traffic. Routing directs the passing of logically addressed packets from their source toward their ultimate destination through intermediary nodes. So, routing protocol is the routing of packets based on the defined rules and regulations. Every routing protocol has its own algorithm on the basis of which it discovers and maintains the route. In every routing protocol, there is a data structure which stores the information of route and modifies the table as route maintenance is requires. A routing metric is a value used by a routing algorithm to determine whether one route should perform better than another. Metrics can cover such information as bandwidth, delay, hop count, path cost, load, reliability and communication cost. The routing table stores only the best possible routes while link-state or topological databases may store all other information as well.

View PDFchevron_right
A multipath routing strategy to prevent flooding disruption attacks in link state routing protocols for MANETs
Joaquin Garcia-Alfaro

Journal of Network and Computer Applications, 2013

Multipath routing has been proposed to increase resilience against network failures or improve security in Mobile Ad-Hoc Networks (MANETs). The Optimized Link State Routing (OLSR) protocol has been adopted by several multipath routing strategies. They implement Multipoint Relay (MPRs) nodes as a flooding mechanism for distributing control information. Ideally, the construction of multiple disjoint paths helps to increase resilience against network failures or malicious attacks. However, this is not always possible. In OLSR networks, partial link-state information is generated and flooded exclusively by the MPRs. Therefore, the nodes only obtain a partial view of the network topology. Additionally, flooding disruption attacks may affect either the selection of the MPRs or the propagation of control traffic information. As a consequence, the chances of constructing multiple disjoint paths are reduced. We present a strategy to compute multiple strictly disjoint paths between any two nodes in OLSR-based networks. We provide mechanisms to improve the view of the network topology by the nodes, as well as handling potential flooding disruption attacks to the multipath construction mechanism in OLSR-based networks. We conduct simulations that confirm our claims.

View PDFchevron_right
An Analysis of Secured Routing Technique in Mobile Ad Hoc Networks
Co. SEP

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes which have the ability to communicate with each other without having fixed network infrastructure or any central base station. Individual nodes are responsible for dynamically discovering other nodes that they can directly communicate with. Communication between nodes may be achieved by means of Route Discovery and maintenance. Because of mobility nature, discovery task is more complex. A black hole is a malicious node that falsely replies to any route requests without having active route to specified destination and drops all the receiving packets. Black Hole Attack can be easily deployed by the adversary. If these malicious nodes work together as a group then the damage will be very serious. This type of attack is called cooperative black hole attack. A neighborhood based method to detect whether there exists a black hole attack and a routing recovery protocol to set up a correct path to the true destination. We propose a complete protocol to detect a chain of cooperating malicious nodes in an ad hoc network that disrupts transmission of data by feeding wrong routing information. In this model, the nodes authenticate each other by issuing security certificate with digital signature to all the other nodes in the network. This model is capable of detecting and removing black hole nodes in the MANET also with a secured route discovery by means of an algorithm termed as endairA algorithm.

View PDFchevron_right
AOMDV- Multipath Routing Protocol in Mobile Networks to Enhance Network Security
Siva Brindha

2015

Dynamic topology formed by an interconnection of mobile devices through wireless links is known as Mobile Ad-hoc Network (MANET). It is a dynamic wireless network that can be formulated without the need for any pre-existing infrastructure in which each node can act as a router. Routing protocols play a vital role in transmission of data across the network. The two major classifications of routing protocols are unipath and multipath. One of the main challenges of MANET is the design of robust routing protocol that adapt to the frequent and randomly changing network topology. Passive Attacks such as snooping and Active Attacks such as wormhole attack, black hole attack, byzantine attack, Transport Layer Attacks, Multipath Layer Attacks etc. are possible in the available routing protocols. Wireless ad-hoc networks are unprotected to attacks of the malicious nodes due to security vulnerabilities of the AODV routing protocol. Anonymous routing protocols attract much more attention in sec...

View PDFchevron_right
SecureZone: Secure and Efficient Multipath Routing for Mobile Ad Hoc Networks
Rani Sahu, International Journal of Advanced Networking and Applications (IJANA)

Eswar Publications, 2024

Mobile ad hoc networks (MANETs) represent collaborative networks formed by mobile nodes without a centralized infrastructure, finding application across diverse domains including military and security-sensitive operations. However, securing the routing process within MANETs poses significant challenges due to the absence of a central authority and the dynamic nature of the network. Existing routing protocols suffer from limitations such as bandwidth consumption and route request delays. In response, this paper introduces the Secure and Energy-efficient Zone-based Multipath Routing Protocol (SEZMRPR) for MANETs. SEZMRPR integrates proactive and reactive approaches while incorporating digital signatures and encryption techniques to ensure message integrity, data confidentiality, and end-to-end authentication at the IP layer. The paper provides a comprehensive design of SEZMRPR, assesses its resilience against security attacks, and evaluates its performance through simulations. Results demonstrate SEZMRPR's robustness against security threats, its efficient security performance with acceptable overhead, and its applicability in securing MANETs for military and security-sensitive operations. SEZMRPR, in conjunction with existing security measures, establishes a reliable framework for ensuring secure operations in ad hoc networks. Future enhancements may focus on optimizing performance, scalability, energy efficiency, and addressing quality of service requirements to further refine the protocol.

View PDFchevron_right
Secure Routing for Mobile Ad hoc Networks Based on DSR Protocol
Science Park Research Organization & Counselling

A mobile ad hoc network (MANET) is an instantly deployable wireless network that does not require the services of any networking infrastructure such as base stations or routers. In such kind of a network, a collection of nodes forms rapidly changing topologies in which each individual node is able to act as intermediaries for communications of other nodes. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. Correct and efficient route construction should be done in a timely manner, with a minimum of overhead and bandwidth consumption. Although many existing routing protocols are designed to fulfil most of the needs of these self-organized networks, they do not address possible security threats that cause disruption in the network. In order to overcome such threats, several efforts have been made toward the design of a secure and robust routing protocol for ad hoc networks. Some of the proposed secure ad hoc routing protocols are based on DSR, a famous on-demand routing protocol. In this paper, several specific attacks that can target the operation of a routing protocol, is reviewed. Then we survey some of the recent proposed secure routing protocols that use DSR as their platform for implementation. These protocols are compared based on some security parameters and the advantages and disadvantages of each protocol. We conclude with a brief summary and a general direction that can provide the basis for future work.

View PDFchevron_right
The Enhancement of Routing Security in Mobile Ad-hoc Networks
Manar Ahmed

International Journal of Computer Applications, 2012

In this paper we study the routing security issues of MANETs, we propose an algorithm to detect malicious nodes based on intelligent water drops algorithm and examine "routing modification attack" problem that can easily be exploited against the MANETs. We also propose a solution for this problem and examine security issues related to proactive routing protocols for MANETs. This could be achieved by adding some extensions to secure routing. These extensions include integrity which means that the message will not change along the route and authentication which means that the sender is the one who introduces himself. This protection is provided by a hash chain and authentication by digital signature which both added to all control massages. We obtained acceptable results depending on the performance of metrics(end-to-end delay and network load). The difference in average of end-to-end delay when using secure protocol is very small and the average of network load is also very small.

View PDFchevron_right

References (33)

  1. Perkins C, Bhagwat P. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. ACM SIGCOMM Computer Communication Review 1994; 24(4):234-244.
  2. Perkins C, Royer E. Ad-hoc on-demand distance vector routing. Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, vol. 2, 1999; 90-100.
  3. Johnson D, Maltz D, Broch J et al. DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks. Ad hoc Networking 2001; 5:139-172.
  4. Aad I, Hubaux JP, Knightly E. Denial of service resilience in ad hoc networks. Proceedings of ACM MobiCom, Philadelphia, PA, September 2004.
  5. Bobba RB, Eschenauer L, Gligor V, Arbaugh W. Bootstrapping security associations for routing in mobile ad-hoc networks, May 2002.
  6. Hu Y, Perrig A, Johnson D. Ariadne: A secure on-demand routing protocol for ad hoc networks. Wireless Networks 2005; 11(1):21-38.
  7. Papadimitratos P, Haas Z. Secure routing for mobile ad hoc networks. SCS Communication Networks and Distributed Systems Modeling and Simulation Conference, San Antonio, TX, 2002; 1-27.
  8. Hu Y, Johnson D, Perrig A. SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks. Ad Hoc Networks 2003; I:175-192.
  9. Marti S, Giuli T, Lai K, Baker M. Mitigating routing misbehavior in mobile ad hoc networks. Proceedings of the 6th Annual International Conference on Mobile Computing and Networking. ACM: New York, NY, U.S.A., 2000; 255-265.
  10. Michiardi P, Molva R. CORE: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. CMS'2002, Communication and Multimedia Security 2002 Conference, Portoroz, Slovenia, 22 September 2002.
  11. Lee S, Gerla M. Split multipath routing with maximally disjoint paths in ad hoc networks. IEEE International Conference on Communications, vol. 10, 2001.
  12. Wei W, Zakhor A. Robust multipath source routing protocol (RMPSR) video communication over wireless ad hoc networks. Proceedings of IEEE International Conference on Multimedia and Expo (ICME), Taipeh, 22, 2004.
  13. Rojviboonchai K, Yang F, Zhang Q, Aida H, Zhu W. AMTP: A multipath multimedia streaming protocol for mobile ad hoc networks. Proceedings of IEEE International Conference on Communications (ICC) 2005; 2:1246-1250.
  14. Thulasiraman P, Ramasubramanian S, Krunz M. Disjoint multipath routing to two distinct drains in a multi-drain sensor network. Proceedings of IEEE International Conference on Computer Communications (INFOCOM), Anchorage, Alaska, May 2007; 643-651.
  15. Saha A, Ur Rehman S, Park G-L, Lee J. Directional node-disjoint multipath routing in wireless ad hoc networks. Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Networks, Cambridge, MA, November 2007.
  16. Wu Z, Sun Y, Wu J, Ye S. Robust multi-path zone routing protocol for video transport over reconfigurable wireless networks. Signal Processing Systems 2008; 51(2):183-194.
  17. Jayavelu G, Ramasubramanian S, Younis O. Maintaining colored trees for disjoint multipath routing under node failures. IEEE/ACM Transactions on Networking 2009; 17(1):346-359.
  18. 502 H. YIN ET AL.
  19. Lin S, Wang Y, Mao S, Panwar S. Video transport over ad-hoc networks using multiple paths. IEEE International Symposium on Circuits and Systems, Citeseer, 2002.
  20. Burmester M, Van Le TV. Secure multipath communication in mobile ad hoc networks. International Conference on Information Technology: Coding and Computing, vol. 2, 2004.
  21. Mavropodi R, Kotzanikolaou P, Douligeris C. Performance analysis of secure multipath routing protocols for mobile ad hoc networks. Third International Conference on Wired/Wireless Internet Communications. Springer: Berlin, 2005; 269.
  22. Kotzanikolaou P, Mavropodi R, Douligeris C. Secure multipath routing for mobile ad hoc networks. Second Annual Conference on Wireless On-demand Network Systems and Services, 2005; 89-96.
  23. Perrig A, Canetti R, Tygar D, Song D. The tesla broadcast authentication protocol. Cryptobytes 2002; 5-2:2-13.
  24. Argyroudis PG, O'Mahony D. Secure routing for mobile ad hoc networks. Communications Surveys and Tutorials, IEEE 2005; 7(3):2-21.
  25. Lamport L. Password authentication with insecure communication. Communications of the ACM 1981; 24(11):770-772.
  26. Shamir A. How to share a secret. Communications of the ACM 1979; 22(11):612-613.
  27. Desmedt Y. Some recent research aspects of threshold cryptography. Information Security, First International Workshop ISW '97 (Lecture Notes in Computer Science, vol. 1196), Mambo M, Okamoto E, Davida E (eds.). Springer: Berlin, 1997; 158-173.
  28. Shoup V. Practical Threshold Signatures (Lecture Notes in Computer Science, vol. 1807). Springer: Berlin, 2000; 207-214.
  29. Herzberg A, Jarecki S, Krawczyk H, Yung M. Proactive Secret Sharing or: How to Cope with Perpetual Leakage (Lecture Notes in Computer Science, vol. 963). Springer: Berlin, 1995; 339-352.
  30. Zapata MG. Secure ad hoc on-demand distance vector routing. SIGMOBILE Mobile Computing and Communications Review 2002; 6(3):106-107.
  31. Saxena N, Tsudik G, Yi JH. Admission control in peer-to-peer: Design and performance evaluation. SASN '03: Proceedings of the 1st ACM Workshop on Security of Ad Hoc and Sensor Networks. ACM Press: New York, NY, U.S.A., 2003; 104-113.
  32. Roe M. Performance of symmetric ciphers and one-way hash functions. Fast Software Encryption, Cambridge Security Workshop. Springer: London, U.K., 1994; 83-89.
  33. Perkins C, Royer E, Das S, Marina M. Performance comparison of two on-demand routing protocols for adhoc networks. IEEE [see also IEEE Wireless Communications] Personal Communications 2001; 8(1):16-28.

Related papers

SecMR – a secure multipath routing protocol for ad hoc networks
Christos Douligeris

Ad Hoc Networks, 2007

Multipath routing in ad hoc networks increases the resiliency against security attacks of collaborating malicious nodes, by maximizing the number of nodes that an adversary must compromise in order to take control of the communication. In this paper, we identify several attacks that render multipath routing protocols vulnerable to collaborating malicious nodes. We propose an on-demand multipath routing protocol, the secure multipath routing protocol (SecMR), and we analyze its security properties. Finally, through simulations, we evaluate the performance of the SecMR protocol in comparison with existing secure multipath routing protocols.

View PDFchevron_right
Secure Multipath Routing for Mobile Ad Hoc Networks
Christos Douligeris

Second Annual Conference on Wireless On-demand Network Systems and Services, 2005

Multipath routing minimizes the consequences of security attacks deriving from collaborating malicious nodes in MANET, by maximizing the number of nodes that an adversary must compromise in order to take control of the communication. In this paper, we identify several attacks that render multipath routing protocols more vulnerable than it is expected, to collaborating malicious nodes. We propose a novel on-demand multipath routing protocol, the Secure Multipath Routing protocol (SecMR) and we analyze its security properties. The SecMR protocol can be easily integrated in a wide range of on-demand routing protocols, such as DSR and AODV.

View PDFchevron_right
Multipath Routing Protocols for Mobile Ad Hoc Networks: Security Issues and Performance Evaluation
Christos Douligeris

Lecture Notes in Computer Science, 2006

The evolution of wireless network technologies and mobile computing hardware made possible the introduction of various applications in mobile ad hoc networks. These applications have increased requirements regarding security and the acceptable delays in order to provide high quality services. Multipath routing protocols were designed to address these challenges. With the use of multiple paths for the communication between a source and a destination, the autonomic user becomes almost unaware of a possible network failure, due to security attacks or link collapses. Several secure multipath routing protocols have been proposed but little performance information and extensive comparisons are available. In this paper, we briefly describe some security issues that multipath routing protocols face and we evaluate the performance of three existing secure routing protocols under different traffic conditions and mobility patterns.

View PDFchevron_right
Improving security and performance of an Ad Hoc network through a multipath routing strategy
Cedric Tavernier

Journal in Computer Virology, 2008

Privacy and security solutions require today the protection of personal information so that it may not be disclosed to unauthorized participant for illegal purposes. It is a challenge to address these issues in networks with strong constraints such as Ad Hoc network. The security increase is often obtained with a quality of service (QoS) decrease. We propose in this paper a solution that provides at the anonymity, security to Ad Hoc network with a limited impact on QoS. This method could be efficient against some viral attacks. We also give some security proofs of our solution for Ad Hoc networks.

View PDFchevron_right
SCMR : Secure Cognizant Multipath Routing for MANET
International Journal of Scientific Research in Science, Engineering and Technology IJSRSET

A MANETs is a multihop system that comprises of multiple mobiles over wireless nodes. We propose cognizant multipath routing for security by establishing multiple paths under routing metrics over source destination in MANET (Mobile Ad hoc Network). Two paths are considered in this paper for transmission between source and destination. Use of AOMDV protocol helps to determine the optimal route for transmission of data for the reducing energy consumption. So, to overcome these issues security analysis algorithm is provided which provides key authentication for threats. Also, security algorithm is used to provide a safe path between source and destination during transmission of data packets. The aim of this paper is to develop a security over multipath routing protocol for MANET. Also, to improve the performance parameter such as throughput and packet delivery ratio by detecting anonymous activity in a network and hence avoid the attackers in routing. A black hole attack type of DoS (Denial of Service) is considered in this paper, constitutes a severe threat against multipath routing. Also, it makes the destination node as unreachable or downgrades its communication over an entire network. Finally, the performance parameters of throughput, packet delivery ratio, an end to end delay, and energy consumption are calculated for SCMR and compared with the existing protocol. On the other hand, the node failure is analyzed by the collection of information about the node respectively.

View PDFchevron_right

Related topics

  • Distributed Computing
  • Mobile Ad Hoc Network
  • Multipath Routing

    • Cited by

    Secure and Energy-Efficient Data Collection in Wireless Sensor Networks
    Motoki Sakai

    International Journal of Distributed Sensor Networks, 2013

    Wireless sensor networks (WSNs) are a kind of multihop and self-organizing networks formed by the way of wireless communication and composed by a large number of lowcost microsensor nodes deployed in the monitoring area. The sensor nodes cooperate to perceive and acquire the process and transmit the perceived object information in the network covering within the geographical area and finally send the information to the sink. In the recent decade, with the rapid development of various kinds of key technology in WSNs, they are widely applied to many especial environments, such as, military defense, environment detection, biological health, and disaster-relief work. Due to the limited computing ability, battery capacity, and storage capacity of sensor nodes, energy-efficient data collection became a nonnegligible research issue in WSNs. Also the open architecture in receiving data and transmitting data of WSNs is vulnerable to various security attacks during the data collection process. These two fundamental issues motivate us to have this special issue addressing the recent advances which are mentioned in Table 1 on security and energy-efficient data collection in WSNs. In response to this call for papers, we have received a total of 36 high-quality submissions, and 13 papers have been selected for publication after a rigorous review process due to the space limit. The papers in this special issue are divided into three thematic groups as follows. The first set of the seven papers emphasizes the security technology with a series of key agreement protocol, encryption, authentication, and trust scheme to solve the special security issues. According to the current researches in

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved