Research On Anoymous Routing Protocols For Mobile Ad Hoc Networks

With the rapid development of mobile communication technology and computernetworks, Ad Hoc networks have been in-depth applications in the military,commercial and academic research due to its flexibility, no center, self-organization.However, due to the characteristics of the wireless communication, as well as the AdHoc networks dynamic topology, lack of control centers, which lead to safety morevulnerable. However, anonymity is a very important part of the Ad Hoc networks, ifwe do not concern about the anonymity, the attacker can get legitimate node statusand location, mode of communication and other important information from thenetworks, which will bring danger to Ad Hoc networks. This paper do research of theexisting anonymous routing protocols and design a new safe and efficeientanonymous routing protocol.Anonymous routing protocol is designed for avoiding from being leaked bynodes during communication in mobile Ad Hoc networks and insuring thecommunication route can’t be discovered, but those anonymous secure routingprotocols known in Ad Hoc networks can’t meet anonymity sufficient or apply tohierarchical Ad Hoc Networks. In addition, the protocols almost didn’t have formalproof, which is difficult to guarantee the networks safety.In this paper, we introduce the anonymous neighbor authentication mechanismbased on ring signature, looking for honest neighbors and getting the session key.We adopt the identity-based public key cryptosystem, the source node set “trapdoor” by using the public key of the destination nodes to insure only the destinationnode can open the trap “door”. Based on-demand routing protocols, through routingrequest and routing replay, the nodes in the network complete their routing table. wedesign routing schemes and use the session key between the neighborhood nodes toensure the security and integrity of data transmission during the data transmission.This new protocols meet the hierarchical Ad Hoc networks by joining the networkidentifier.Universally composable (UC) model is used to prove the security of theprotocol running. The most outstanding nature is the idea of modular designagreement. This paper takes universally composable model for formal analysis thenew proposed protocol and proves its security.