A Based On Dht Strategies Hu Mobile P2p Network Routing Protocols,

Peer-to-Peer networking technology is one of hot research and application topics in the field ofcomputer networking. It aims to fully make use of the potential power of devices at the edge of theInternet, including computing resource, memory and storage etc. Meanwhile, with the rapiddevelopment of the new generation of the wireless communication technology, Mobile Ad-HocNetwork(MANET),which can be set up easily, increasingly attracts more and more concerns. Dueto the natural similarities between MANET and P2P, e.g., dynamic topology, decentralization, etc., anew research field, P2P over MANET naturally emerged. However, considering the inheritlimitations of Mobile P2P networks and the mobility of nodes, there exist a lot of problems whentraditional P2P networks overlay on MANET underlying infrastructure. Especially, an efficientrouting protocol is the most important component in Mobile P2P research field.In this thesis, firstly, several existing Mobile P2P network routing protocols werecomprehensively overviewed; then, through referring to similar schemes, two improvementmethods for a traditional P2P routing protocol, Pastry, was introduced. Specifically, on one hand,the physical proximity of peers is considered to construct the overlay topology. In detail, theRandom Landmark (RLM) is adopted to cluster peers (first-level clustering), which can alleviate thetopological mismatch between overlay and underlying layers, and reduce the unnecessary theintermediate routes; on the other hand, according to peers'interests, the small-world property ofP2P network is used to re-cluster peers based on first-level clustering, which can speed up thekey-word based search. Simulation results show those improvements can effectively reduce P2Pnetwork traffic; Finally, one DHT-based routing protocol in Mobile P2P ACP (AODV Combinedwith Pastry Routing Protocol) is discussed, which combined the improved Pastry with one typicalMANET routing protocol, AODV, including clustering, updating and maintenance of routing table,and detailed routing procedure, etc. The preliminary simulations illustrate that the comprehensiveperformance of ACP routing model is greatly improved. Even though nodes move fast, a relativelylow routing delay and network overhead can still be maintained, and meanwhile, a high searchingsuccess rate is still kept.