Research Of Secure Routing Procotol For Mobile Ad Hoc Networks

Mobile Ad Hoc Networks is a wireless network technique that the nodes in thenetwork could move randomly, topology changes highly dynamic and there is nobeforehand support of network infrastructure. Mobile Ad Hoc Networks has thecharacteristics of temporarily network, rapidly deploy, no control center andsurvivability, so it can provide flexible and convenient communication, broaden thefield of mobile communications applications. Therefore, there has a wide range ofapplications for the Mobile Ad Hoc Networks early, such as tactical militarycommunications network and personal radio. In recent years, the technology is rapidlyexpanding to the civilian system, such as wireless local area networks, personal areanetwork, sensor network, etc., they have broad application prospects. In a major naturaldisaster occurred due to leaving the fixed telecommunications network facilities weredestroyed or not working correctly, or in remote, wild areas of work can not rely onfixed facilities or the default network access, the Mobile Ad Hoc Networks which hasthe ability to separate network and self-organizing capacity of communication in thesesituations is the only or the best option, especially for military applications is of greatsignificance.As the mobile Ad Hoc networks of their own characteristics, from a security pointof view, the security of Mobile Ad-Hoc network is more worthy of attention comparedwith traditional networks. And whether the secure routing protocol of mobile Ad Hocnetwork is safe and efficient is one of the important security issues for mobile Ad HocNetworks.This paper discusses the secure routing protocols for mobile Ad Hoc networks, themain results of this paper are as follows:1. We present an efficiently anonymous routing protocol(EARP), it bases on alocalized trust management which can primarily remove malicious nodes, and encryptsthe identity of node by random number. The node that participates in the protocolencrypts the entire message with trust key and says Hello to its ancestor withinexpiration time. It makes malicious node can be detected and isolated from the network,in this way, an anonymous and secure route path can be established in a hostileenvironment. The method is able to resist many attacks efficiently.2. A new Anonymous and Authenticated Routing protocol for mobile Ad-HocNetworks(AARAN) is presented. It makes use of hash function, signature and Hello message, it can effectively ensure the anonymous of the networks, avoid launching arouting request repeatedly, so it improves the efficiency, and the protocol can availablyaccount for the harm which is caused by selfish nodes.3. A new secure and anonymous authentication routing protocol based on trustvaluation for Mobile Ad-Hoc Networks(AARP) is presented. It introduces a system oftrust valuation that could dynamic and in time discover malicious actions in networks,so the secure environment of routing protocol can be achieved. An anonymous identityof nodes presented by the hash routing is stored in routing table, it can effectivelyensure the anonymous of the network, avoid launching a routing request repeatedly, allthis improves the efficiency. Based on the Diffie-Hellman key agreement arithmetic, theprotocol set up the key agreement, and insures that bidirectional anonymousauthentication among CA, source node and destination node. The protocol combineswith symmetric cryptographic algorithm and asymmetric cryptographic algorithm, itmade the structure of the protocol simple and availability.4. We presente a new anonymous and efficiently routing protocol AE-ARAN forMANET. It bases on Dempster-Shafer(D-S) evidence theory and a trust evaluation modelwhich is a system of trust valuation was given. It could dynamic and timely discovermalicious actions in networks and isolate them efficiently, and resist attacks to some extentand improve the reliability, robustness and security of the over all network effectively. So itcould provide a secure network environment for routing establishing. Meanwhile, wepresente the anonymous identity of nodes which presented by the hash routing that wasstored in routing table. Based on the Diffie-Hellman key agreement arithmetic, the protocolset up the key agreement at the time of routing. Theory analysis and simulation results showthat the proposed scheme can detect and isolate malicious nodes efficiently and resistattacks. The protocol can achieve the anonymous and improve the efficiency and security ofthe all network.