Documente Academic
Documente Profesional
Documente Cultură
1 INTRODUCTION
Wireless network is gaining popularity with IEEE 802.11 emerging as the standard for wireless communication [1]. Wireless networks can be broadly classified into infrastructure based wireless network and infrastructure less wireless networks or Ad hoc networks. In an ad hoc network, the nodes are mobile and routing between source and destination node, which is not in radio range is achieved by intermediate nodes acting as routers. As Ad hoc networks are highly dynamic, routing protocol plays a crucial role to achieve quality of service. Other important factors to be considered in Ad hoc networks are dynamic network topology, frequency of network updates, scalability, security and energy required. The challenge faced in each layer of the Ad hoc network. In Ad hoc networks routing protocols are broadly classified into proactive (table driven) routing protocol and reactive (on demand) routing protocol [2]. In proactive routing each node in the ad hoc network maintains a table or tables containing routing information of the network. Any node that needs to transmit data can start transmitting data using routes already present in the routing table enabling immediate data transmission. Popular proactive routing protocols include Destination sequence distance vector (DSDV) routing protocol [3], Wireless routing protocol (WRP) [4] and Optimized link state routing protocol (OLSR). Irrespective of data traffic, proactive protocols periodically update the routing table and the control overhead of these protocols is foreseeable as it is independent on the data traffic in the network, and this is an advantage of proactive routing protocols.
Table I: Major challenges in each layer of Ad hoc network Layers Application Layer Transport Layer Network Layer Physical / Link Layer Major Issues Security Authentication, Quality of Service Routing Power Management
N.K.Kuppuchamy is with Research Scholar, Anna University of Technology, Coimbatore, India. R.Manimegalai is With Research Supervisor, Anna University of Technology, Coimbatore, India.
Unlike table driven routing protocols, reactive protocols update routing information only when a route is required by a source node to transmit data. Reactive routing protocols reduce the control overhead which is advantageous in high mobility networks whereas periodic updates in routing information leads to significant increase in network overheads even when there is no data transmission between nodes in the network. Some of the popular ad hoc routing protocols falling in this category are Dynamic Source Routing (DSR) [5] [6], Ad hoc on demand distance vector (AODV) routing [7] [1] and Temporarily Ordered Routing Algorithm (TORA) [8] [9]. AODV has been extensively studied in terms of the route recovery mechanism [10], security [11], Anomaly detection [12], sparse and dense network with different mobility patterns and speeds. Common problems faced by nodes in an ad-hoc network located in the edge of the network are unreliable links, poor signal quality, higher latency and larger packet losses. Chakeres, et al., [15] have presented an event trigger required for AODV implementation operations. Most of the ad hoc routing protocol is done using simulations as creating a real implementation is difficult. The paper [15] describes the event triggers required for AODV operation, the design
possibilities and the decisions for the ad hoc on-demand distance vector (AODV) routing protocol implementation, AODV-UCSB. Identification of strengths and weakness of the presented implementation helps system designers to check whether AODV implementation fits their requirements. The major contribution of the paper is as follows: Defining of AODV triggers required for networks unsupported by operation systems. Various design strategies discussed. Design used for AODV-UCSB described. AODV implementation designs presented. The objective of the study is to provide a base for researchers in developing AODV routing protocols best suited for their needs and to help in determining the implementation design. In this paper, we investigate the behavior of nodes in the network edge and their performance evaluation when adapting AODV routing protocol. This paper is organized into the following sections. Section II describes in detail AODV routing protocol, Section III, IV and V discusses various aspects of AODV protocol related to routing algorithm, security and anomaly detection.
packet. However, AODV performance metrics starts deteriorating as the network size grows and since there is no built in security mechanism it is vulnerable to outside attacks. Some of the works related to AODV with respect to implementation, route discovery, and security is discussed in the following sections.
AODV is an adaptation of Destination Sequenced Distance Vector (DSDV) protocol used in wired networks and overcomes the shortcomings of DSDV in wireless environment. AODV eliminates the counting to infinity problem faced in other distance vector protocols by implementing a sequence number. Unlike DSR which carries the entire route between the source and destination in the packet, the nodes in AODV carry only the next hop information corresponding to each data flow. Being a reactive routing protocol route is discovered as and when needed and the discovered routes are maintained as long as they are required. A route discovery is initiated when one of the nodes in the network wants to send a data packet to another node. If an active route is not available AODV initiates the route discovery process with the source node broadcasting a route request message (RREQ) to find a route to the destination. The route is found either with the RREQ reaching the destination or an intermediate node in the network which has "fresh enough" route to the destination with the sequence number equal to or greater than the sequence number contained in the RREQ. Once a valid route is found it is made available by a route reply (RREP) message back to the originator of the RREQ. Once the route is established the nodes monitor the state of the links continuously. If a link breaks in an active route, a route error message (RERR) is sent to the other nodes of the link breakage. This initiates a new route discovery process [1]. The advantages of AODV routing protocol is the selection of the least congested route instead of the shortest path. AODV supports both unicast and multicast data transmission. Performance is not drastically affected even if the topology changes continuously. Since source routing is not used, there are no additional overheads in the data
improved in terms of throughput and delivery rate, which was the objective of the proposed modification. Tang, et al., [18] have proposed a Robust AODV (RAODV) protocol for building routes on demand and maintaining them. The proposed protocol is maintained by updating route information locally i.e., the active route information is broadcasted only to 1-hop neighbours, thus, the overhead due to updating is low. The RAODV is more robust and easily adapt to mobility than the traditional AODV. Multiple routes are established by the proposed protocol. Thus, when active route breaks, the best backup route can become the active route avoiding unnecessary route discovery flooding. Simulation results show that the proposed protocol performs better than the traditional AODV with respect to packet delivery ratio and throughput. From literature survey on enhanced AODV routing protocols it is seen that kim, et al.,[14] method performs well in high speed mobility networks where the probability of receiving the reply message from the destination is lower compared to low mobility networks. However if the network is bandwidth constrained Tomar, et al.,[16] method provide better solution due to the reduced control overheads. Tang,et al method performs equally well by reducing control packet overheads and when the link failure is high.
In the proposed mechanism, the flooding algorithm is improved and double hash authentication is adopted to protect the routing information. The efficiency of the flooding algorithm is improved by using multicast groups which reduces the redundancy and overhead produced by the broadcast. Instead of digital signature, Hash function is adopted to authenticate routing information. Double hash authentications, authenticates received routing packets and also prevent the nodes from modifying the routing information. Bhargava, et al., [21] have identified misbehaviour caused by malicious node for AODV protocol and proposed an approach to prevent attacks in the network. In the proposed framework, the attacks in the network are detected by Intrusion Detection Model (IDM) and malicious nodes are isolated using Intrusion Response Model (IRM). Internal attacks such as distributed false route request, denial of service, destination compromised impersonation and routing information disclosure are detected by IDM. The IDM is incorporated in all nodes, and it monitors the behaviour of the neighbours to detect if it is compromised. On identification of a compromised node, the IRM propagates this information to the entire network, and routes through the compromised node look for newer routes. Simulation results show that the overheads are marginal and have negligible effect on the performance of the network, thus the proposed method makes the protocol robust.
methods were used to consider various scenarios for detecting several types of routing attacks on AODV. The simulation results show that the proposed approach is successful in detecting anomalies caused by malicious nodes in AODV-based MANETs.
6. CONCLUSION
In this survey paper, application of AODV protocol for routing, security and anomaly detection is studied. Tomar, et al.,[16] method provides the best enhancements due to the lower control and resource overheads. Trust mechanism [19] approach provides the best preventive security mechanism. Options can be provided for control packet and data packet encryption if a resource is not a constraint. Barani, et al., [22] method provide the Soft computing approaches for identifying anomaly which can evolve over a period of time as in virus are highly efficient in adapting itself to learn and adapt for unknown attacks .
REFERENCES
[1] C. E. Perkins and E. M. Royer, Ad Hoc On-demand Distance Vector Routing, Proc . 2nd IEEE Workshop. Mobile Comp. Sys. and Apps., Feb. 1999, pp. 90100. [2] T. Lin, S. Midkiff, and J. Park, A framework for wireless ad hoc routing protocols, in WCNC: Wireless Communications and Networking. IEEE Computer Society, 2003, pp. 11621167 [3] C. E. Perkins and P. Bhagwat, Highly dynamic destinationsequenced distance vector routing (DSDV) for mobile computers, Proceedings of ACM SIGCOMM 94, 1994, pp. 34244. [4] S. Murthy and J. J. Garcia-Luna-Aceves, "An Efficient Routing Protocol for Wireless Networks", ACM Mobile Networks and App. Journal, Special Issue on Routing in Mobile Communication Networks, pp.183-97, 1996. [5] D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, in: Mobile Computing, eds. T. Imielinski and H. Korth (Kluwer Academic, 1996) chapter 5, pp. 153181. [6] D. B. Johnson and D. A. Maltz, "Dynamic Source Routing in Ad Hoc Networks", Mobile Computing, T. Imielinski and H. Korth, Eds., Kulwer Publ., 1996, pp. 152-81. [7] C. E. Perkins and E. M. Royer, Ad-Hoc On Demand Distance Vector Routing, Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), New Orleans, LA, 1999, pp. 90-100 [8] Park, V.D and Corson, M.S "A highly adaptive distributed routing algorithm for mobile wireless networks", Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Japan, pages:1405-1413, 1997 [9] V. Park and S. Corson, Temporally Ordered Routing Algorithm (TORA) Version 1, Functional specification IETF Internet draft, http://www.ietf.org/internet-drafts/draft-ietf-manet-tora-spec01.txt, 1998. [10] G. Liu, K. J. Wong, B. S. Lee, B. C. Seet, C. H. Foh, and L. Zhu, PATCH: a novel local recovery mechanism for mobile ad-hoc networks, Proc. of IEEE Vehicular Technology Conference, vol. 5, pp. 2995-2999, Oct. 2003. [11] Seung Yi, Prasad Naldurg, and Robin Kravets. Security-aware adhoc routing for wireless networks. In ACM Workshop on Mobile ad hoc networks, Mobihoc, 2001. http://wwwsal.cs.uiuc.edu/~rhk/pubs/ SCI2002.pdf.
[12] Nakayama, H.; Kurosawa, S.; Jamalipour, A.; Nemoto, Y.; Kato, N.; , "A Dynamic Anomaly Detection Scheme for AODV-Based Mobile Ad Hoc Networks," Vehicular Technology, IEEE Transactions on , vol.58, no.5, pp.2471-2481, Jun 2009. [13] M. S. Corson and A. Ephremides, A Distributed Routing Algorithm for Mobile Wireless Networks, ACM/Baltzer Wireless Networks J., vol. 1, no. 1, Feb. 1995, pp. 6181. [14] Chonggun Kim, Elmurod Talipov and Byoungchul Ahn, A Reverse AODV routing protocol in Ad hoc Mobile Networks, EUC Workshops 2006, LNCS 4097, pp 522-531, 2006. [15] I. D. Chakeres and E. M. Belding-Royer, AODV Routing Protocol Implementation Design, in Proceedings of the International Workshop on Wireless Ad hoc Networking (WWAN), Tokyo, Japan, March 2004. [16] Geetam S. Tomar, Manish Dixit & Shekhar Verma, et.al. AODV Routing Protocol with Selective Flooding 2009 International Conference of Soft Computing and Pattern Recognition, pp. 682686. [17] P. Papadimitratos, Z. Haas, Secure routing for mobile ad hoc networks, in: SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), 2002. pp. 193-204. [18] Suhua Tang; Bing Zhang; , "A robust AODV protocol with local update," Communications, 2004 and the 5th International Symposium on Multi-Dimensional Mobile Communications Proceedings. The 2004 Joint Conference of the 10th Asia-Pacific Conference on , vol.1, no., pp. 418- 422 vol.1, 29 Aug.-1 Sept. 2004. [19] Khan, R.H.; Imtiaz-ud-Din, K.M.; Faruq, A.A.; Kamal, A.R.M.; Mottalib, A.; , "A security adaptive protocol suite: Ranked Neighbor Discovery (RND) and Security Adaptive AODV (SAAODV),"Electrical and Computer Engineering, 2008. ICECE 2008. International Conference on , vol., no., pp.588-593, 20-22 Dec. 2008. [20] Xinjun Du; Ying Wang; Jianhua Ge; Yumin Wang;, "A method for security enhancements in AODV protocol," Advanced Information Networking and Applications, 2003. AINA 2003. 17th International Conference on , vol., no., pp. 237- 240, 27-29 March 2003. [21] Bhargava, S.; Agrawal, D.P.;, "Security enhancements in AODV protocol for wireless ad hoc networks ," Vehicular Technology Conference, 2001. VTC 2001 Fall. IEEE VTS 54th , vol.4, no., pp.21432147 vol.4, 2001. [22] Barani, Fatemeh; Abadi, Mahdi; , "An ABC-AIS Hybrid Approach to Dynamic Anomaly Detection in AODV-Based MANETs," Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on , vol., no., pp.714-720, 16-18 Nov. 2011. [23] Alikhany, M.; Abadi, M.; , "A dynamic clustering-based approach for anomaly detection in AODV-based MANETs," Computer Networks and Distributed Systems (CNDS), 2011 International Symposium on , vol., no., pp.67-72, 23-24 Feb. 2011. N.K.Kuppuchamy is a Ph.D. student at the Department of Computer Science and Engineering, Anna University of Technology, Coimbatore,Tamil Nadu, India.