Computer Science ›› 2013, Vol. 40 ›› Issue (9): 103-105.

Previous Articles     Next Articles

Improved Gossip Algorithm Based on Mobile P2P Networks

ZHANG Guo-yin,LI Jun,WANG Xiang-hui and XU Guo-kun   

  • Online:2018-11-16 Published:2018-11-16

Abstract: With the wide use of intelligent mobile terminals,the research of mobile peer-to-peer networks came to be in-depth continuously.Although the classic Gossip algorithm can be applied to data dissemination in mobile peer-to-peer networks,it cannot adapt to the requirement of mobile networks,especially to the adaptability of churn.Therefore,in order to realize the effective transmission of topology control information and to maintain replica consistency of the node resource lists, an improved Gossip algorithm based on the specific topology was presented to update the resource lists of nodes which belong to the same k-clique,by dynamically adjusting data dissemination probability of each neighbor node.Simulation results show that data dissemination efficiency of the proposed algorithm is improved significantly than the classic Gossip algorithm.It achieves the efficiency of flooding data dissemination strategy and ensures the lower network load.

Key words: Mobile peer-to-peer networks,Gossip,Data dissemination

[1] Demers A,Greene D,Hauser C,et al.Epidemic algorithms for replicated database maintenance[C]∥the 6th ACM Symposiums on Principles of Distributed Computing.1987:1-12
[2] Gabriele G,Ernesto D,Guido L C,et al.Gossiping solutions for distributed consensus on unstructured overlays[C]∥The 4th IEEE International Conference on Digital Ecosystems and Technologies.2010:246-251
[3] Da Hora D N,Macedo D F,Oliveira L B,et al.Enhancing peer-to-peer content discovery techniques over mobile ad hoc networks[J].Computer Communications,2009,32(13/14):1445-1459
[4] Jin Yang,Simon T,Mueller C,et al.Comparing and refiningGossip protocols for fault tolerance in wireless P2P systems[C]∥The 19th Euromicro International Conference on Parallel,Distributed and Network-Based Processing (PDP).2011:595-599
[5] Drabkin V,Friedman R,Kliot G,et al.RAPID:Reliable probabilistic dissemination in wireless Ad-Hoc networks[C]∥The 26th IEEE International Symposium on Reliable Distributed Systems.2007:13-22
[6] 刘德辉,尹刚,王怀民,等.Chord网络环境下的Gossip算法[J].计算机工程与科学,2011,3(9):48-51
[7] 汪洋,陈京文,黑晓军,等.混合内容分发网中社群感知的Gossip 协议[J].北京邮电大学学报,2010,3(5):18-21,46
[8] Chen Nao,Hu Rui-min,Zhu Yong-qiong.Gossip-based topology management protocol for self-organizing overlays [J].China Communications,2011,9:38-46
[9] Andras K,Vilmos S.Adaptive multihop broadcast protocols for ad hoc networks [C]∥The 8th IEEE,IET International Symposium on Communication Systems,Networks and Digital Signal Processing.2012:1-6
[10] Stingl D,Groβ C,Rückert J,et al.Peerfactsim.kom:A largescale simulation framework for peer-to-peer systems[C]∥the 2011International Conference on High Performance Computing & Simulation.2011:577-584
[11] Kermarrec A M,Steen M V.Gossiping in distributed Systems[J].Operating Systems Review,2007,41(5):2-7
[12] Gavidia D,Voulgaris S,Steen M V.A gossip-based distributed news service for wireless mesh networks[C]∥Third International Conference on Wireless On-demand Network Systems & Services (WONS).2006:59-67
[13] Bailey N T J.The mathematical theory of infectious diseases and its applications(second edition)[M].Hafner Press,1975
[14] Johnson D B,Maltz D A.Dynamic source routing in ad hoc wireless networks[J].Mobile Computing,1996,3:153-181

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!