Resource Search in Peer-to-Peer Network Based on Power Law Distribution

In wireless communication system, the real identity, current location and movement mode of user are important and sensitive information, and their confidentiality must be ensured. Especially, in heterogeneous wireless integrated networks, the key factor for attracting client is to protect the network information. Every identity can be used indicating the Fig. and location of each entity. But coupling relation and binding transfer of identity can result in divulging sensitive user information. The identity technology to avoid divulging sensitive user information has become a hot topic of research in communication field. In face of the complicated heterogeneous wireless environment, it’s important but difficult to design a perfect identity technology. In view of above problem and security of heterogeneous wireless integrated networks, the related solution is proposed. It can improve the efficiency of trusted connection and handoff between heterogeneous networks.

[1]  Alhussein A. Abouzeid,et al.  Optimizing random walk search algorithms in P2P networks , 2007, Comput. Networks.

[2]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[3]  Abhishek Kumar,et al.  Efficient and scalable query routing for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[4]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[5]  Vwani P. Roychowdhury,et al.  Percolation search in power law networks: making unstructured peer-to-peer networks scalable , 2004 .

[6]  Guo-Fu Feng PeerRank:A Strategy for Resource Discovery in Unstructured P2P Systems , 2006 .

[7]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[8]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[9]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[10]  Rongmei Zhang,et al.  Assisted Peer-to-Peer Search with Partial Indexing , 2007, IEEE Trans. Parallel Distributed Syst..

[11]  P. Oscar Boykin,et al.  Scalable percolation search on complex networks , 2006, Theor. Comput. Sci..

[12]  Christopher R. Palmer,et al.  Generating network topologies that obey power laws , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[13]  Dimitrios Tsoumakos,et al.  Adaptive probabilistic search for peer-to-peer networks , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[14]  Ian T. Foster,et al.  Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.

[15]  B. Bollobás The evolution of random graphs , 1984 .

[16]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[17]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.