The Study Of Peer-to-Peer Network Routing Model And Its Application In MANET Routing Protocol Design

Peer-to-Peer network technology is currently a hotspot in the international computer network researching domain. And it is aiming to fully utilize the underlying resources of internet, which include computing resources, storage resources and file resources, etc. The study of P2P routing model is always an important component in the research of P2P network. How to route efficiently in P2P network is the key to improve network scalability and solve the network bandwidth consuming problem. Whether these problems can be solved will directly affect the efficiency of P2P applications and the further development of P2P technology.The work of this thesis is parts of a project named "the research of new network architecture (Peer-to-Peer network technology)", which is supported by the National High Technology Development 863 Program of China. By analyzing the working mechanism and key technics of the three generations of P2P routing models, this thesis proposes a new kind of structured P2P routing model. Based on this, we attempt to further expand our achievement in the research of P2P routing area into the study of routing protocol for mobile ad hoc network (MANET). By analyzing the crossed area of these two technologies, we propose a new kind of p2p computing based MANET routing model.The primary work and contributions of this thesis include:1) By discussing the working mechanisms of currently three kinds of mainstream P2P network routing models, which are centralized, unstructured and structured P2P network routing model respectively, and analyzing the advantages and disadvantages of them, this thesis has proposed a new kind of structured P2P routing model named hierarchical aggregation p2p network routing model (HARM). The main work of this segment is composed of the following six parts. ?A physical topology based network partitioning and cluster plotting algorithm is proposed in the new model. By introducing the concepts of Hierarchical Agent (HA) and Clusters, HARM puts the nodes which are physically closed into the same cluster. By taking advantage of nodes' network proximity character, HARM overcomes the detouring problem existing popularly in structured P2P systems.A distributed hash table (DHT) based dynamic node naming mechanism is proposed in HARM to realize the load balancing during the key-distributing procedure and to implement the mapping relationship between a node's identity and its logical identifier under the environment of hash ring. By introducing global ring zone (GRZ) and individual ring zone (IRZ), HARM has simplified the route discovering process.The structure of hierarchical routing table (HRT) is proposed in HARM to constrain the HRT entries which a node maintains in the scope of O (logN) and to implement the routing functionon different layer of logical clusters.?The structured P2P overlay network based route discovering and updating algorithm namedHARM_Scale is proposed to construct hash ring which is used to store data and discover routes.By doing this, HARM has constrained the maximam hops a routing message passes in the scopeof O (logN) and the messages sent during a nodes's join and departure in the scope of O (log2N).?A series of optimizing mechanisms, which include HA load banacing, data item replication andring preserving mechanisms, are proposed to keep the stability of hash ring and to improve therouting performance of HARM by taking advantage of network locality character.?The routing performance of HARM is analyzed and validated by making network simulatingexperiments. The experiments' results indicate that the general routing performance of HARM isdistinctly enhanced composed to one of the mainstream structured P2P routing models - Chord.2) By analyzing charactisrics and performance guideline on designing a MANET routingprotocol and studying the synergy between P2P network and MANET, this thesis has proposed anovel MANET routing model named peer computing based dynamic source routing (PDSR) andapplied our achievement on the research of P2P routing models into the study of MANETrouting protocol. The main work of this segment is composed of the following five parts:?A DHT based distributive node naming mechanism is proposed in PDSR to implement themapping relationship between node's identity and its logical identifier under the environment ofhash ring. By building up a hash ring which is used to discover routes, HARM has constructed alayer of structured P2P overlay network on top of MANET's physical topology.?The structure of PDSR routing table (PRT) is proposed in PDSR to constrain the PRT entrieswhich a node maintains in the scope of O (logN), and to reduce nodes' routing storage overhead.?By inheriting the advantages of structured P2P overlay network and reactive MANET routingprotocol, the route discovering, route table querying and route updating algorithms used in PDSRare proposed to realize the route discovery and maintainence process under a MANETenvironment and to constrain the routing overhead.?A series of optimizing mechanisms for PDSR model, which include overhearing mechanism,source route detecting mechanism and importing of Phello protocol, are proposed to overcomethe detouring problem in structured P2P overlay network and to further improve PDSR's routingperformance by taking MANET's charactisrics into consideration.?The routing performance of PDSR is analyzed and validated by making network simulatingexperiments. The experiments' results indicate that the general routing performance of PDSR isdistinctly enhanced composed to one of the mainstream MANET routing protocol - DSR.