Download now Free registration required
The huge redundant messages generated by flooding which is the basic routing algorithm of unstructured P2P network, severely reduce the efficiency of the algorithm, Combining the advantages of flooding search algorithm and random walk algorithm, such as short response time, high stability, simple structure, to greatly reduce the redundancy of messages, this paper proposed an improved route search algorithm: jump random-flood. The simulation results show that the algorithm can reduce the redundant messages, increase the efficiency of search, and improve the network environment while maintaining the desired coverage rate of nodes.
- Format: PDF
- Size: 796.01 KB