Computer Science ›› 2018, Vol. 45 ›› Issue (12): 61-65.doi: 10.11896/j.issn.1002-137X.2018.12.008
Special Issue: Network and communication
• Network & Communication • Previous Articles Next Articles
ZHU Kun, LIU Lin-feng, WU Jia-gao
CLC Number:
[1]XIONG Y P,SUN L M,NIU J W,et al.Opportunistic Networks[J].Journal of Scoftware,2009,20(1):124-137.(in Chinese) 熊永平,孙利民,牛建伟,等.机会网络[J].软件学报,2009,20(1):124-137. [2]IRTF.Delay Tolerant Networking Research Group [EB/OL].(2015-08-09).http://www.dtnrg.org. [3]MA H D,YUAN P Y,ZHAO D.Research Progress on Routing Problem in Mobile Opportunistic Networks[J].Journal of Scoftware,2015,26(3):600-616.(in Chinese) 马华东,袁培燕,赵东.移动机会网络路由问题研究进展[J].软件学报,2015,26(3):600-616. [4]DZIEKONSKI A M,SCHOENEICH R O.DTN Routing Algorithm for Networks with Nodes Social Behavior[J].InternationalJournal of Computers,Communications & Control,2016,11(4):457-471. [5]WANG X,LIN Y,ZHAO Y,et al.A novel approach for inhibiting misinformation propagation in human mobile opportunistic networks[J].Peer-to-Peer Networking and Applications,2017,10(2):377-394. [6]YUAN P Y,MA H D,DUAN P R.Impact of strangers on opportunistic routing performance [J].Journal of Computer Science and Technology,2013,28(3):574-582. [7]VAHDAT A,BECKER D.Epidemic routing for partially connected ad hoc networks:CS2200006 [R].Durham North Caro:Duke University,2000. [8]AYYATSA,HARRAS K A,ALY S G.Interest aware people rank:towards effective social-based opportunistic advertising [C]∥Proc.of 2013 IEEE Wireless Communications and Networking Conference.Shanghai,China,2013:4428-4433. [9]LI Q H,ZHU S C,CAO G H.Routing in Socially Selfish Delay Tolerant Networks[C]∥Proc.of IEEE INFOCOM 2010.Wa-shington DC,USA:IEEE Press,2010:1-9. [10]JUANG P,OKI H,WANG Y,et al.Energy-Efficient computing for wildlife tracking:Design tradeoffs and early experiences with Zebra Net [C]∥Proc.of the 10th Int’l Conf.on Architectural Support for Programming Languages and Operating Systems.New York:ACM,2002:96-107. [11]ZHAO D,MA H D,YUAN P Y,et al.Differentiated probabilistic forwarding for extending the lifetime of opportunistic networks [C]∥Proc.of the IEEE WCNC 2012.2012:3002-3007. [12]GUO D Y,LIU L F.An opportunistic routing algorithm based on regional friendship[J].Computer Science,2017,44(3):105-109.(in Chinese) 郭东岳,刘林峰.一种基于区域朋友关系的机会路由算法[J].计算机科学,2017,44(3):105-109. [13]SANJAY K,DHURANDHER D,KUMAR S,et al.Shruti Bhati HBPR:History Based Prediction for Routing in Infrastructure-less Opportunistic Networks[C]∥2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA).2013:931-936. [14]LI F,WU J.Local Com:A Community-based Epidemic For-warding Scheme in Disruption-tolerant Networks [C]∥6th Annual IEEE Communications Society Conference on Sensor,Mesh and Ad Hoc Communications and Networks.2009:1-9. [15]CHEN K,SHEN H Y.Smart:Lightweight distributed socialmap based routing in delay tolerant networks [C]∥Proc.of the IEEEICNP 2012.2012:1-10. [16]BULUT E,SZYMANSKI B.Exploiting friendship relations for efficient routing in mobile social networks [J].IEEE Trans.on Parallel and Distributed Systems,2012,23(12):2254-2265. [17]YUAN S T,SUN J.Ontology-Based Structured Cosine Similarity in Speech Document Summarization [C]∥Proc.of IEEE/WIC/ACM Conference on Web Intelligence.2004. [18]OH S.An advanced taxi movement model in the working day movement for delay tolerate networks [J].Cluster Computing,2014,17(3):751-756. [19]RUBIN I,CHOI C.Impact of the location area structure on the performance of signaling channels in wireless cellular networks[C]∥IEEE International Conference on Communications.IEEE,1996:1761-1765. [20]GONOOZI M,DASSANAYAKE P.User mobility modeling and characterization of mobility pattern[J].IEEE Journal on Selec-ted Areas in Communications,1997,15(7):1239-1252. |
[1] | WANG Hui, LE Zi-chun, GONG Xuan, ZUO Hao, WU Yu-kun. TNTlink Prediction Model Based on Feature Learning [J]. Computer Science, 2020, 47(12): 245-251. |
[2] | ZHOU Chang, LI Xiang-li, LI Qiao-lin, ZHU Dan-dan, CHEN Shi-lian, JIANG Li-rong. Sparse Non-negative Matrix Factorization Algorithm Based on Cosine Similarity [J]. Computer Science, 2020, 47(10): 108-113. |
[3] | ZHANG Feng. Node Encounter Interval Based Buffer Management Strategy in Opportunistic Networks [J]. Computer Science, 2019, 46(5): 57-61. |
[4] | DENG Xia, CHANG Le, LIANG Jun-bin, JIANG Chan. Survey on Multicast Routing in Mobile Opportunistic Networks [J]. Computer Science, 2018, 45(6): 19-26. |
[5] | LI Xiang-li and XUAN Mao-yi. Research on Incentive Strategy of Nodes in Selfish Opportunistic Network [J]. Computer Science, 2017, 44(4): 213-217. |
[6] | GUO Dong-yue and LIU Lin-feng. Opportunistic Routing Algorithm Based on Regional Friendship [J]. Computer Science, 2017, 44(3): 105-109. |
[7] | MA Xue-bin, LI Ai-li, ZHANG Xiao-juan, JIA Lei-lei and XIAO Jing. Buffer Management Based on Stationary Relay Nodes and Message Correlation in Sparse Opportunistic Networks [J]. Computer Science, 2016, 43(Z11): 296-300. |
[8] | YAN Yu-dao and LIU Lin-feng. Update Strategy of Communities Information Based on Variable Half-lifes in Opportunistic Networks [J]. Computer Science, 2016, 43(2): 124-128. |
[9] | WU Jia,YI Xi and CHEN Zhi-gang. Algorithm of Selecting Optimal Dynamic Cooperation Tree in Opportunistic Networks [J]. Computer Science, 2014, 41(Z11): 170-173. |
[10] | CAO Xiao-mei and YIN Ying. Identity Authentication Scheme in Opportunistic Network Based on Fuzzy-IBE [J]. Computer Science, 2014, 41(10): 191-195. |
[11] | ZHOU Jun-hai,LIN Ya-ping and ZHOU Si-wang. Power-efficient Message Routing Algorithm for Community-based Opportunistic Network [J]. Computer Science, 2014, 41(1): 178-182. |
[12] | MA Xue-bin,ZHANG Yan-wen,OUYANG Zhen-chao and WANG Li-ting. Message Transmission System for Opportunistic Networks [J]. Computer Science, 2013, 40(Z11): 41-45. |
[13] | . Delivering Social Activity Formation Service over Opportunistic Networks [J]. Computer Science, 2013, 40(2): 35-39. |
[14] | . Self-adaptive Epidemic Routing Algorithm [J]. Computer Science, 2012, 39(7): 104-107. |
[15] | XU Jia,WANG Ru-chuan,XU Jie, LIAO Jun. Research of Multi-copy Routing in Delay Tolerant Networks [J]. Computer Science, 2011, 38(8): 74-79. |
|