Opportunistic network message forwarding algorithm based on time-effectiveness of encounter probability and repeated diffusion perception

doi:10.11772/j.issn.1001-9081.2019081495

Journal of Computer Applications ›› 2020, Vol. 40 ›› Issue (5): 1397-1402.DOI: 10.11772/j.issn.1001-9081.2019081495

• Network and communications • Previous Articles Next Articles

Opportunistic network message forwarding algorithm based on time-effectiveness of encounter probability and repeated diffusion perception

GE Yu¹, LIANG Jing²

1.College of Computer Science, Sichuan Normal University, ChengduSichuan 610068, China
2.School of Computer Engineering, Chengdu Technological University, ChengduSichuan 610031, China

Received:2019-09-03 Revised:2019-12-07 Online:2020-05-10 Published:2020-05-15
Contact: LIANG Jing, born in 1979, M. S., lecturer. Her research interests machine learning.
About author:GE Yu, born in 1981, M. S., associate professor. His research interests include opportunistic network, computational intelligence.LIANG Jing, born in 1979, M. S., lecturer. Her research interests machine learning.
Supported by:
This work is partially supported by the Foundation of Sichuan Education Department (16ZB0060).

基于相遇概率时效性和重复扩散感知的机会网络消息转发算法

葛宇¹, 梁静²

1.四川师范大学计算机科学学院，成都 610068
2.成都工业学院计算机工程学院，成都 610031

通讯作者: 梁静(1979－)
作者简介:葛宇(1981—)，男，重庆人，副教授，硕士，CCF会员，主要研究方向：机会网络、计算智能；梁静(1979－)，女，四川宜宾人，讲师，硕士，主要研究方向：机器学习。
基金资助:
四川省教育厅基金资助项目(16ZB0060)。

Abstract

Abstract:

In order to select more reasonable relay nodes for message transmission and improve the efficiency of message delivery in opportunistic networks, message forwarding utility was designed, a corresponding message copy forwarding algorithm was proposed. Firstly, based on the historical encounter information of nodes, the indirect encounter probability of nodes and the corresponding time-effectiveness were analyzed， then a time-effectiveness indicator was proposed to evaluate the encounter information value. Secondly, combined with the similarity of node motion, the problem of message repeated diffusion was analyzed, a deviation indicator of node movement was proposed to evaluate the possibility of message repeated diffusion. Simulation results show that compared with Epidemic, ProPHET, Maxprop, SAW (Spray And Wait) algorithms, the proposed algorithm has better performance in delivery success rate, overhead and delay.

Key words: opportunistic network, relay node, delivery efficiency, time-effectiveness of encounter probability, node motion similarity

摘要：

在机会网络中，为了更合理地选择消息传输中继节点并提高消息投递效率，设计了消息转发效用，并给出了对应的消息副本转发算法。首先,从节点历史相遇信息入手，重点分析了节点的间接相遇概率及其对应的时效性问题，提出了评估相遇信息价值的时效指标；然后，结合节点运动相似性分析了消息重复扩散问题，并提出节点移动偏离指标，用于评价节点重复扩散消息的可能性。仿真实验结果表明：与Epidemic、ProPHET、Maxprop和SAW(Spray And Wait)算法相比，综合考虑投递成功率、开销和延时指标，所提算法表现出了更好性能。

关键词: 机会网络, 中继节点, 投递效率, 相遇概率时效性, 节点运动相似性

CLC Number:

TP393.04

GE Yu, LIANG Jing. Opportunistic network message forwarding algorithm based on time-effectiveness of encounter probability and repeated diffusion perception[J]. Journal of Computer Applications, 2020, 40(5): 1397-1402.

葛宇, 梁静. 基于相遇概率时效性和重复扩散感知的机会网络消息转发算法[J]. 计算机应用, 2020, 40(5): 1397-1402.

References

1 杨轶博 . 移动机会网络数据转发与拥塞控制技术研究[D]. 哈尔滨:哈尔滨工业大学, 2018:1-14. (YANG Y B. Research on data delivery and congestion control in mobile opportunistic networks[D]. Harbin: Harbin Institute of Technology, 2018:1-14.)
2 张勉 . 基于节点效用值和消息价值的机会网络路由协议研究[D]. 郑州:郑州大学, 2018:1-12.(ZHANG M. Research on opportunistic network routing protocol based on node utility value and message value[D]. Zhengzhou: Zhengzhou University, 2018:1-12.)
3 李继蕊,李小勇,高雅丽,等 . 物联网环境下数据转发模型研究[J]. 软件学报, 2018, 29(1):196-224. LI J R , LI X Y , GAO Y L , et al . Review on data forwarding model in Internet of Things[J]. Journal of Software, 2018, 29(1):196-224.
4 吴黎兵,刘冰艺,聂雷 . VANET-Cellular环境下安全消息广播中继选择方法研究[J]. 计算机学报, 2017, 40(4):1004-1016. (WU L B, LIU B Y, NIE L. Research on selection of safety message broadcast relay in VANET-Cellular[J]. Chinese Journal of Computers, 2017, 40(4):1004-1016.)
5 TRIFUNOVIC S , KOUYOUMDJIEVA S T , DISTL B , et al . A decade of research in opportunistic networks: challenges, relevance, and future directions[J]. IEEE Communications Magazine, 2017, 55(1):168-173.
6 LI Y , WANG Z , JIN D , et al . Optimal beaconing control for epidemic routing in delay-tolerant networks[J]. IEEE Transactions on Vehicular Technology , 2012, 61(1): 311-320.
7 陆芳,李建波,宋有美 . 基于局部位置信息和消息投递度的受控传染路由算法[J]. 小型微型计算机系统, 2018, 39(5) :918-923. (LU F, LI J B, SONG Y M. Location position and message delivery ratio based controlled epidemic routing for DENs[J]. Journal of Chinese Computer Systems,2018, 39(5):918-923.)
8 SPYROPOULOS T , PSOUNIS K , RAGHAVENDRA C S . Spray and wait: an efficient routing scheme for intermittently connected mobile networks[C]// Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, New York: ACM, 2005: 252-259.
9 KAUR H , KAUR H . An enhanced spray-copy-wait den routing using optimized delivery predictability[C]// Proceedings of IC3T 2016: Computer Communication, Networking and Internet Security, LNNS 5. Singapore: Springer, 2016:603-610.
10 LINDGREN A , DORIA A , SCHELéN O . Probabilistic routing in intermittently connected networks[J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2003, 7(3):19-20.
11 YOSHINO Y , NAKASAKI S , IKEDA M , et al . An integrated message suppression controller with epidemic and MaxProp protocols: performance evaluation for VDENs[C]// Proceedings of the 32nd International Conference on Advanced Information Networking and Applications Workshops. Piscataway: IEEE, 2018:159-163.
12 AHMAD K , FATHIMA M , JAIN V , et al . FUZZY-PRoPHET: a novel routing protocol for opportunistic network[J]. International Journal of Information Technology, 2017, 9(2):121-127.
13 张峰 . 机会网络中基于节点相遇间隔的缓存管理策略[J]. 计算机科学, 2019,46(5):57-61.(ZHANG F.Node encounter interval based buffer management strategy in opportunistic networks[J].Computer Science,2019,46(5):57-61.)
14 王海泉,马伟建,顾娟娟 . 基于ICT分布的容迟网络接触模型[J]. 北京航空航天大学学报, 2015, 41(8):1422-1429. (WANG H Q, MA W J, GU J J. ICT distribution-based contact model for delay tolerant networks[J]. Journal of Beijing University of Aeronautics and Astronautics, 2015 ,41(8):1422-1429.)
15 郑啸,高汉,王修君,等 . 移动机会网络中接触时间感知的协作缓存策略[J]. 计算机研究与发展, 2018, 55(2):338-345. ZHENG X , GAO H , WANG X J , et al . Contact duration aware cooperative data caching in mobile opportunistic networks[J]. Journal of Computer Research and Development, 2018, 55(2):338-345.
16 彭碧涛 . 接触概率和数据分组新鲜度感知的机会网络路由算法[J]. 小型微型计算机系统, 2017, 38(7):1459-1463. (PENG B T. Opportunistic networks routing algorithm with contact probability and data packet freshness perception[J]. Journal of Chinese Computer Systems, 2017, 38(7):1459-1463.)
17 马费成,望俊成 . 信息生命周期研究述评(Ⅰ)——价值视角[J]. 情报学报, 2010, 29(5):939-947. (MA F C, WANG J C. A literature review of studies on information lifecycle (Ⅰ)—the perspective of value[J]. Journal of the China Society for Scientific and Technical Information, 2010, 29(5):939-947.)
18 DEDE J , FÖRSTER A , HERNáNDEZ-ORALLO E , et al . Simulating opportunistic networks: survey and future directions[J]. IEEE Communications Surveys and Tutorials, 2018, 20(2):1547-1573.

[1]	YUAN Peiyan, SONG Mingyang. Lightweight distributed social distance routing algorithm in mobile opportunistic network [J]. Journal of Computer Applications, 2018, 38(1): 13-19.
[2]	YAO Yukun, LI Xiaoyong, REN Zhi, LIU Jiangbing. High efficiency medium access control protocol based on cooperative network coding [J]. Journal of Computer Applications, 2017, 37(10): 2748-2753.
[3]	YAO Yukun, YANG Jikai, LIU Wenhui. High-efficient community-based message transmission scheme in opportunistic network [J]. Journal of Computer Applications, 2015, 35(9): 2447-2452.
[4]	YUAN Peiyan, WANG Chenyang, LI Sijia. Data forwarding strategy based on gathering point in mobile opportunistic networks [J]. Journal of Computer Applications, 2015, 35(11): 3038-3042.
[5]	REN Zhi WANG Lulu YANG Yong LEI Hongjiang. Geographic routing algorithm based on directional data transmission for opportunistic networks [J]. Journal of Computer Applications, 2014, 34(1): 4-7.
[6]	ZHU Jiang PENG Zhenzhen ZHANG Yuping. Transmission and scheduling scheme based on W-learning algorithm in wireless networks [J]. Journal of Computer Applications, 2013, 33(11): 3005-3009.
[7]	LIU Yahong GAO Yuan QIAO Jinlong TAN Chunhua. Community-based message transmission scheme in opportunistic social networks [J]. Journal of Computer Applications, 2013, 33(05): 1212-1216.
[8]	WU Dapeng BAI Na WANG Ruyan. Adaptive cache management strategy with node forwarding ability estimation [J]. Journal of Computer Applications, 2013, 33(04): 901-904.
[9]	LIU Qilie XU Meng LI Yun YANG Jun. Routing algorithm in opportunistic network based on historical utility [J]. Journal of Computer Applications, 2013, 33(02): 361-364.
[10]	ZHENG En LUO Qiu-xia. Spray and Wait routing based on ACK-mechanism in disruption tolerant networks [J]. Journal of Computer Applications, 2012, 32(02): 367-369.
[11]	. Survey of anonymity communication [J]. Journal of Computer Applications, 2010, 30(3): 719-722.
[12]	. Routing protocols for opportunistic networks [J]. Journal of Computer Applications, 2010, 30(3): 723-728.
[13]	. Power allocation and channel capacity for cooperative tri-node [J]. Journal of Computer Applications, 2010, 30(12): 3151-3154.
[14]	. EH-EC: High performance data forwarding mechanism for opportunistic networks [J]. Journal of Computer Applications, 2010, 30(12): 3180-3183.
[15]	. Cost optimization model of relay-based B3G/4G cellular network [J]. Journal of Computer Applications, 2009, 29(12): 3207-3210.

Opportunistic network message forwarding algorithm based on time-effectiveness of encounter probability and repeated diffusion perception

基于相遇概率时效性和重复扩散感知的机会网络消息转发算法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics