Research On Security Routing Protocol In Mobile Ad Hoc Networks

Mobile Ad hoc network is made up by a team of nodes which have the function of wireless transmit-receive. It has the characteristics of dynamic topology structure, multi-hop communication, no center control and self-organization. The communication channel is wireless, so the information through the channel is easily to be monitor and falsify. It is very important to make sure the security of communication. So, the secure routing becomes such a hot research topic. Summarize the recent research there has two type of secure mechanism:cryptology and trust evaluation.The research of routing protocol in ad hoc network is often used the NS2simulation tool. This paper based on the AODV routing protocol and insert selfish node into it after analysis. Then simulate to get the performance of AODV when have selfish node. To set AODV as an example, we introduce the detail process of simulation, analyze and modify the code of AODV. Then add selfish node and compare the results when have different number of selfish nodes. We set environmental parameter and business flow date to proceed the experiment. Analyze the trace file to get the network packet loss rate and throughput. The method and process can easily transplant into other classical protocol. Then we get the result, when there is no selfish node, routing protocol performs well. But the performance degraded obviously along with the increase of number of selfish node.We design a secure routing protocol in Ad hoc network named TEI-AODV, aiming at the selfish node attack in routing. We used the modified trust evaluation model, then composite the direct trust and neighbors’indirect trust to get the final trust. Every node maintains a table of trust value. In the process of routing, according to that table to judge credibility of the previous hop and next hop in route request and route reply. Keep the both success of RREQ and RREP. Furthermore, when choose the route considering both the value of route trust and hop count. The scheme makes trust evaluation and routing protocol have more connection with each other. Then, we use NS2to do simulation experiment to prove it. Modify the NS2and add the compute part of node’s trust. Amend the routing code and compile again. We get the curve of packets deliver and throughput change after analysis the experiment data. The result verifies that the protocol can avoid and isolate selfish node well which not only enhance the security but also increase the routing efficiency.In the cluster-based Ad hoc network which has cluster head, cluster member and gateway node, we propose a scheme of secure and anonymous communication. Use Differ-Hellman key exchange and network flow method to get the session key which reduce the Communication frequency and compute cost. Also use the pseudonym and hash function to achieve the anonymous communication. When used in the routing, the midsize nodes can’t know the true identity information about the communication nodes. The scheme includes node authentication and register, nodes communicate in the same cluster and nodes communicate in different cluster. After authenticated node register into the cluster, it has the session key with cluster head. Also have session key between cluster members. When sent message use the session key to keep is safe. Then, we prove the scheme’s validity from the analysis of its security, anonymity, complexity and application.