Computer Science ›› 2017, Vol. 44 ›› Issue (7): 74-78.doi: 10.11896/j.issn.1002-137X.2017.07.013

Previous Articles     Next Articles

Opportunistic Forwarding Mechanism Based on Node Movement Tendencies Detecting

LIU Lin-feng, YAN Yu-dao and WU Guo-xin   

  • Online:2018-11-13 Published:2018-11-13

Abstract: The nodes in the social network can be classified into two types as strong mobility and weak mobility.The MTBR (Mobile-Tendency Based Routing) algorithm was proposed.And MTBR introduces the concept of ‘Movement Tendency’ which associates the human movements with their behavior habits.The algorithm detects the movement tendencies of the strong mobility nodes and takes advantage of strong mobility nodes to forward the messages.The simu-lation results indicate that the movement tendency will be more apparent with a stronger mobility.Besides,compared with other algorithms,MTBR algorithm can effectively forward the messages to the ulterior area near the destination,and produce fewer message copies and achieve a higher delivery ratio.

Key words: Opportunistic forwarding,Social networks,Community structure,Interest value

[1] FALL K.A delay-tolerant network architecture for challenged internets[C]∥Conference on Applications,Technologies,Architectures,and Protocols for Computer Communications (ACM SIGCOMM’03).2003:27-34.
[2] XIONG Y P,SUN L M,NIU J W.Opportunistic Networks[J].Journal of Software,2009,20(1):124-137.(in Chinese) 熊永平,孙利民,牛建伟.机会网络[J].软件学报,2009,20(1):124-137.
[3] RIEDY J,BADER D A,MEYERHENKE N.Scalable multi-threaded community detection in social networks[C]∥IEEE 26th International Parallel and Distributed Processing Sympo-sium Workshops.2012:1619-1628.
[4] LINDGREN A,DORIA A,SCHELN N O.Probabilistic routing in intermittently connected networks[J].ACM SIGMOBILE Mobile Computing and Communications Review,2003,7(3):19-20.
[5] GUO Z,PENG Z,WANG B,et al.Adaptive routing in underwater delay tolerant sensor networks[C]∥6th International ICST Conference on Communications and Networking in China (CHINACOM).IEEE,Harbin,2011:1044-1051.
[6] XIE X,ZHANG Y,DAI C,et al.Social relationship enhanced predicable routing in opportunistic network[C]∥The Seventh International Conference on Mobile Ad-hoc and Sensor Networks (MSN).2011:268-275.
[7] LANCICHINETTI A,FORTUNATO S.Benchmarks for tes-ting community detection algorithms on directed and weighted graphs with overlapping communities[J].Physical Review E,2009,0(1):016118 .
[8] YAN Y D,LIU L F.An update strategy of communities information based on variable half-lifes in opportunistic networks[J].Computer Science,2016,43(2):124-128.(in Chinese) 严禹道,刘林峰.一种基于可变半衰期的机会网络社团兴趣值更新策略[J].计算机科学,2016,43(2):124-128.
[9] BHORKAR A,NAGHSHVAR M,JAVIDI T,et al.Adaptive opportunistic routing for wireless ad hoc networks[J].IEEE/ACM Transactions on Networking,2012,20(1):243-256.
[10] NIU J,GUO J,CAI Q.Predict and spread:an efficient routing algorithm for opportunistic networking[C]∥IEEE Wireless Communications and Networking Conference (WCNC).2011:498-503.
[11] YUAN Q,CARDEI I,WU J.An efficient prediction-based routing in disruption-tolerant networks[J].IEEE Transactions on Parallel and Distributed Systems,2012,23(1):19-31.
[12] HUI P,CROWCROFT J,YONEKI E.BUBBLE Rap:social-based forwarding in delay-tolerant networks[J].IEEE Transactions on Mobile Computing,2011,10(11):1576-1589.
[13] KIM J K,KIM H K,OH H Y,et al.A group recommendation system for online communities[J].International Journal of Information Management,2010,30(3):212-219.
[14] KERNEN A,OTT J,KRKKEN T.The ONE simulator for DTN protocol evaluation[C]∥The 2nd International Conference on Simulation Tools and Techniques.2009:1-10.
[15] OH S.An advanced taxi movement model in the working day movement for delay-tolerant networks[J].Cluster Computing,2014,17(3):751-756.
[16] GEWALI L,ROMAN V.Generalization of shortest path map[C]∥Seventh International Conference on Information Technology:New Generations (ITNG).2010:296-300.
[17] ROSVALL M,BERGSTROM C T.Maps of random walks on complex networks reveal community structure[J].Proceedings of the National Academy of Sciences of the United States of America,2008,105(4):1118-1123.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!