Content distribution mechanism in mobile P2P network

被引:32
作者
Zeng, Degui [1 ]
Geng, Yishuang [2 ]
机构
[1] Luzhou Vocational and Technical College, Sichuan
[2] Center of Wireless Information Network Studies (CWINS), Worcester Polytechnic Institute, Worcester, MA
关键词
Content distribution; Mobile P2P; Network node; Selection strategy;
D O I
10.4304/jnw.9.5.1229-1236
中图分类号
学科分类号
摘要
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 strategy, 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. © 2014 ACADEMY PUBLISHER.
引用
收藏
页码:1229 / 1236
页数:7
相关论文
共 15 条
[1]  
Li S., Geng Y., He J., Pahlavan K., Analysis of Three-dimensional Maximum Likelihood Algorithm for Capsule Endoscopy Localization, 2012 5th International Conference On Biomedical Engineering and Informatics (BMEI), pp. 721-725, (2012)
[2]  
Peng J., Chen F., Wang Q., A Simulated Annealing Algorithm for Progressive Mesh Optimization, Journal of Multimedia, 8, 4, pp. 323-330, (2013)
[3]  
Hoppe H., Derose T., Duchamp T., Et al., Mesh optimization, Proceedings of the 20th Annual Conference On Computer Graphics and Interactive Techniques. ACM, 27, pp. 19-26, (1992)
[4]  
Biba M., Esposito F., Ferilli S., Mauro N.D., Basile T., Unsupervised discretization using kernel density estimation, The Twentieth International Joint Conference On Artificial Intelligence (IJCAI), pp. 696-701, (2007)
[5]  
Hsiao H., Chung H., Shen H., Et al., Load Rebalancing For Distributed File Systems In Clouds, 21, pp. 102-105, (2012)
[6]  
Jing Z., Gongqing W., Xuegang H., Li S., Shuilong H., A parallel clustering algorithm with MPI -Mkmeans, Journal of Computers (Finland), 7, 1, pp. 10-17, (2013)
[7]  
Hsiao H.C., Liao H., Chen S.T., Et al., Load Balance with Imperfect Information in Structured Peer-to-Peer Systems. Parallel and Distributed Systems, IEEE Transactions On, 22, 4, pp. 634-649, (2011)
[8]  
Jelasity M., Montresor A., Babaoglu O., Gossip-based aggregation in large dynamic networks, ACM Transactions On Computer Systems (TOCS), 23, 3, pp. 219-252, (2005)
[9]  
Fu Z.-Y., Lv S.-Z., Song Y., A EPON dynamic bandwidth assignment algorithm based on the multiple traffic prediction, Optical Communication Technique, 4, pp. 12-14, (2010)
[10]  
Jelasity M., Voulgaris S., Guerraoui R., Et al., Gossip-based peer sampling, ACM Transactions On Computer Systems (TOCS), 25, 3, (2007)