计算机科学 ›› 2018, Vol. 45 ›› Issue (12): 61-65.doi: 10.11896/j.issn.1002-137X.2018.12.008

所属专题: 网络通信

• 网络与通信 • 上一篇    下一篇

一种基于节点位置余弦相似度的机会网络转发算法

朱坤, 刘林峰, 吴家皋   

  1. (南京邮电大学计算机学院 南京210023)
    (江苏省大数据安全与智能处理重点实验室 南京210023)
  • 收稿日期:2017-11-19 出版日期:2018-12-15 发布日期:2019-02-25
  • 作者简介:朱 坤(1991-),男,硕士生,主要研究方向为机会网络;刘林峰(1981-),男,博士,教授,主要研究方向为机会网络,E-mail:liulf@njupt.edu.cn(通信作者);吴家皋(1969-),男,博士,副教授,主要研究方向为机会网络。
  • 基金资助:
    本文受国家自然科学基金(61373139,61502250),中国博士后科学基金面上项目(2014M560379),中国博士后科学基金(2015T80484)资助。

Opportunistic Network Forwarding Algorithm Based on Node Cosine Similarity

ZHU Kun, LIU Lin-feng, WU Jia-gao   

  1. (School of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,China)
    (Jiangsu Key Laboratory of Big Data Security & Intelligent Processing,Nanjing 210023,China)
  • Received:2017-11-19 Online:2018-12-15 Published:2019-02-25

摘要: 针对机会网络中数据送达率较低的问题,文中根据节点历史接触信息即节点相遇次数、相遇时间长度、节点关系稳定性来计算节点转发效用值。首先选择通信范围内效用值最大的邻居节点作为初始转发节点,再根据余弦相似度选择其他转发节点,使得转发节点能够尽可能均匀地分布。在此基础上,提出一种基于节点位置余弦相似度的机会网络转发算法(Opportunistic Network forwarding algorithm based on Node Cosine Similarity,ONNCS)。该算法使得转发节点能够均匀地分布,因此数据报文能够尽快地被转发到目的节点。实验结果表明,ONNCS具有较高的转发成功率和较低的转发能耗,转发成功率高出其他算法5%~8%。

关键词: 机会网络, 余弦相似度, 转发效用值

Abstract: Aiming at the problem of low data delivery ratio in opportunistic networks,this paper defined and computed the node forwarding utility according to the historical contacts between nodes,e.g.,the number of nodes contacts,the length of contacts and the stability of nodes relations.First,the node with the largest utility value falling into the communication range is selected as the initial forwarding node.Then,other forwarding nodes are selected by their cosine similarities,such that the forwarding nodes can be evenly distributed approximately.On this basis,an opportunistic network forwarding algorithm based on node cosine similarity (ONNCS) was proposed.ONNCS enables the selected forwarding nodes to be evenly distributed and improves the data delivery ratio.The simulation results show that ONNCS has a hig-her forwarding success rate and lower forwarding energy consumption,and the success rate of the algorithm is 5% to 8% higher than other algorithms in this paper.

Key words: Cosine similarity, Forwarding utility value, Opportunistic network

中图分类号: 

  • TP393
[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] 周昌, 李向利, 李俏霖, 朱丹丹, 陈世莲, 蒋丽榕.
基于余弦相似度的稀疏非负矩阵分解算法
Sparse Non-negative Matrix Factorization Algorithm Based on Cosine Similarity
计算机科学, 2020, 47(10): 108-113. https://doi.org/10.11896/jsjkx.190700112
[2] 张峰.
机会网络中基于节点相遇间隔的缓存管理策略
Node Encounter Interval Based Buffer Management Strategy in Opportunistic Networks
计算机科学, 2019, 46(5): 57-61. https://doi.org/10.11896/j.issn.1002-137X.2019.05.008
[3] 邓霞, 常乐, 梁俊斌, 蒋婵.
移动机会网络组播路由的研究进展
Survey on Multicast Routing in Mobile Opportunistic Networks
计算机科学, 2018, 45(6): 19-26. https://doi.org/10.11896/j.issn.1002-137X.2018.06.003
[4] 李向丽,宣茂义.
自私性机会网络中的节点激励策略研究
Research on Incentive Strategy of Nodes in Selfish Opportunistic Network
计算机科学, 2017, 44(4): 213-217. https://doi.org/10.11896/j.issn.1002-137X.2017.04.046
[5] 郭东岳,刘林峰.
一种基于区域朋友关系的机会路由算法
Opportunistic Routing Algorithm Based on Regional Friendship
计算机科学, 2017, 44(3): 105-109. https://doi.org/10.11896/j.issn.1002-137X.2017.03.023
[6] 马学彬,李爱丽,张晓娟,贾磊磊,肖静.
稀疏机会网络中基于固定中继节点与消息相关性的缓存管理策略
Buffer Management Based on Stationary Relay Nodes and Message Correlation in Sparse Opportunistic Networks
计算机科学, 2016, 43(Z11): 296-300. https://doi.org/10.11896/j.issn.1002-137X.2016.11A.069
[7] 关培源,陈志刚,吴嘉,郭霖.
机会网络中阶段性非增殖型传递算法的研究
Study on Non Proliferation Stage Transfer Algorithm Based on Opportunistic Network
计算机科学, 2016, 43(4): 37-40. https://doi.org/10.11896/j.issn.1002-137X.2016.04.007
[8] 吴嘉,易茜,陈志刚.
基于机会网络的最优化动态合作树选择算法
Algorithm of Selecting Optimal Dynamic Cooperation Tree in Opportunistic Networks
计算机科学, 2014, 41(Z11): 170-173.
[9] 曹晓梅,殷瑛.
基于模糊身份密码学的机会网络身份认证方案
Identity Authentication Scheme in Opportunistic Network Based on Fuzzy-IBE
计算机科学, 2014, 41(10): 191-195. https://doi.org/10.11896/j.issn.1002-137X.2014.10.042
[10] 周军海,林亚平,周四望.
一种低功耗的社区机会网络消息路由算法
Power-efficient Message Routing Algorithm for Community-based Opportunistic Network
计算机科学, 2014, 41(1): 178-182.
[11] 马学彬,张岩纹,欧阳真超,王丽婷.
基于机会网络的消息传输系统
Message Transmission System for Opportunistic Networks
计算机科学, 2013, 40(Z11): 41-45.
[12] 李东生,杨志义,郭 斌,贺会磊,於志文.
基于机会网络的社会性活动组织研究
Delivering Social Activity Formation Service over Opportunistic Networks
计算机科学, 2013, 40(2): 35-39.
[13] 孙践知,张迎新,陈 丹,韩忠明.
具有自适应能力的Epidemic路由算法
Self-adaptive Epidemic Routing Algorithm
计算机科学, 2012, 39(7): 104-107.
[14] 徐佳,王汝传,徐杰,廖俊.
容迟网络多副本路由技术研究
Research of Multi-copy Routing in Delay Tolerant Networks
计算机科学, 2011, 38(8): 74-79.
[15] 蔡青松,牛建伟,刘畅.
一种基于车载机会网络的自适应数据分发算法
Adaptive Data Dissemination Algorithm for Vehicular Opportunistic Networks
计算机科学, 2011, 38(6): 58-63.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!