Content Distribution Mechanism in Mobile P2P Network

As content distribution in mobile P2P network facing architecture instability, the limited ability of a single node, low efficiency of content distribution and other problems, this paper proposes a new mobile network structure and content distribution mechanism strateg y , the new mobile network structure will be divided into multiple subnets network for partition management. Each subnet manages information routing and dissemination strategies through a super-node. The transfer of information between subnets can be achieved by transitional node in cross region. Thus the information transfer is achieved in the entire network. Content distribution strategies using part of network coding mechanism for data compression, improve the efficiency of information transmission and download success rate. Finally, experimental verification, the experimental results show that: the proposed new mobile network structure and content distribution mechanisms strategies can reduce the disturbance of download success rate caused by fixed point, reduce the data transmission delay, and effectively improve the hit rate

[1]  Anne-Marie Kermarrec,et al.  Gossip-based peer sampling , 2007, TOCS.

[2]  Jing Zhang,et al.  A Parallel Clustering Algorithm with MPI - MKmeans , 2013, J. Comput..

[3]  Kaveh Pahlavan,et al.  Modeling the effect of human body on TOA ranging for indoor human tracking with wrist mounted sensor , 2013, 2013 16th International Symposium on Wireless Personal Multimedia Communications (WPMC).

[4]  Junjie Peng,et al.  A Simulated Annealing Algorithm for Progressive Mesh Optimization , 2013, J. Multim..

[5]  Yu-Chang Chao,et al.  Load Rebalancing for Distributed File Systems in Clouds , 2013, IEEE Transactions on Parallel and Distributed Systems.

[6]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[7]  Phalguni Gupta,et al.  A Robust Vein Pattern-based Recognition System , 2012, J. Comput..

[8]  Song Yun A EPON dynamic bandwidth assignment algorithm based on the multiple traffic prediction , 2010 .

[9]  Márk Jelasity,et al.  Gossip-based aggregation in large dynamic networks , 2005, TOCS.

[10]  Baoxin Li,et al.  Discriminative K-SVD for dictionary learning in face recognition , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[11]  Kaveh Pahlavan,et al.  Analysis of three-dimensional maximum likelihood algorithm for capsule endoscopy localization , 2012, 2012 5th International Conference on BioMedical Engineering and Informatics.

[12]  Kuo-Chan Huang,et al.  Load Balance with Imperfect Information in Structured Peer-to-Peer Systems , 2011, IEEE Transactions on Parallel and Distributed Systems.

[13]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[14]  Stefano Ferilli,et al.  Unsupervised Discretization Using Kernel Density Estimation , 2007, IJCAI.