Computer Science ›› 2017, Vol. 44 ›› Issue (3): 105-109.doi: 10.11896/j.issn.1002-137X.2017.03.023
Previous Articles Next Articles
GUO Dong-yue and LIU Lin-feng
[1] XIONG Y P,SUN L M,NIU J W,et al.Opportunistic networks[J].Journal of Software,2009,0(1):124-137.(in Chinese) 熊永平,孙利民,牛建伟,等.机会网络[J].软件学报,2009,0(1):124-137 . [2] WANG S L,LIU M,LI Z C.Opportunistic Routing in Intermittently Connected Mobile P2P Networks[J].IEEE Journal on Selected Areas in Communications,2013,1(9):369-378. [3] VAHDATA,BECKER D.Epidemic routing for partially con-nected ad hoc networks:CS2200006[R].Durham North Carolina:Duke University,2000. [4] SPYROPOULOS T,PSOUNIS K,RAGHAVENDRA C.Effi-cient routing in intermittently connected mobile networks:Themultiple-copy case[J].IEEE/ACM Trans.on Networking,2008,6(1):77-90. [5] YUAN P Y,MA H D.Hug:Human gathering point based routing for opportunistic networks[C]∥Proc.of the IEEE WCNC 2012.2012:3024-3029. [6] WU J,XIAO M,HUANG L.Homing spread:Community home-based multi-copy routing in mobile social networks[C]∥Proc.of the IEEE INFOCOM 2013.2013:2319-2327. [7] BALASUBRAMANIAN A,LEVINE B,VENKATARAMANI A.DTN routing as a resource allocation problem[C]∥Proc.of the ACM SIGCOMM 2007.2007:373-384. [8] MUSOLESI M,HAILES S,MASCOLO C.Adaptive routing for intermittently connected mobile ad hoc networks[C]∥Proc.of the IEEEWoWMoM 2005.2005:183-189. [9] GAO W,CAO G.On exploiting transient contact patterns for data forwarding in delay tolerant networks[C]∥Proc.of the IEEE ICNP 2010.2010:193-202. [10] LINDGREN A,DORIA A,SCHELEN O.Probabilistic routing inintermittently connected networks[M]∥ Service Assurance with Partial and Intermittent Resources.2004,6:239-254. [11] ZHAO L N,LI F,ZHANG C,et al.Routing with multi-level social groups in Mobile Opportunistic Networks[C]∥Global Communications Conference (GLOBECOM),2012 IEEE.2012:5290-5295. [12] LIU Q L,HU C F,LI Y,et al.Global Communications Con-ference (GLOBECOM)[C]∥2013 IEEE.2013:4366-4371. [13] CHEN K,SHEN H Y.SMART:Lightweight distributed social map based routing in delay tolerant networks[C]∥Proc.of the IEEEICNP 2012.2012:1-10. [14] BULUT E,SZYMANSKI B.Exploiting friendship relations for efficient routing in mobile social networks[J].IEEE Trans.on Parallel and Distributed Systems,2012,3(12):2254-2265. [15] KERANEN A,OOT J,KARKKAINEN T.The ONE simulator for DTN protocol evaluation[C]∥The 2ndInternational Con-ference on Simulation Tools and Techniques.Rome,Italy,2009:1-10. [16] OH S.An advanced taxi movement model in the working day movement for delay-tolerate networks[J].Cluster Computing,2014,7:751-756. [17] GEWAALI L,ROMAN V.Generalization of Shortest Path Map[C]∥2010 Seventh International Conference on IEEE Information Technology:New Generation(ITNG).2010:296-300. [18] ROSVALL M,BERGSTORM C T.Maps of random walks on complex networks reveal community structure[C]∥Proceedings of the National Academy of Sciences of the United States of America.2008:1119-1123. |
No related articles found! |
|