Routing algorithm based on attribute of sociality of node in opportunistic networks

doi:10.3778/j.issn.1002-8331.1605-0426

Computer Engineering and Applications ›› 2017, Vol. 53 ›› Issue (22): 92-96.DOI: 10.3778/j.issn.1002-8331.1605-0426

Previous Articles Next Articles

Routing algorithm based on attribute of sociality of node in opportunistic networks

LIU Hui1, ZHANG Zhenyu1，2, YANG Wenzhong2, WU Xiaohong2

1.School of Software Engineering, Xinjiang University, Urumqi 830008, China
2.School of Information Science and Engineering, Xinjiang University, Urumqi 830046, China

Online:2017-11-15 Published:2017-11-29

机会网络中基于节点社会属性的转发算法

刘慧1，张振宇1，2，杨文忠2，吴晓红2

1.新疆大学软件学院，乌鲁木齐 830008
2.新疆大学信息科学与工程学院，乌鲁木齐 830046

Abstract

Abstract: For message forwarding in opportunistic networks, a forwarding algorithm based on Attribute of Sociality of Node is proposed in this paper. This algorithm computes value of strangeness of nodes, betweenness, similarity and balanced use of the resources of multiple nodes to prevent some nodes fast out of the network and reduces network connectivity. Through the simulation experiment and compared with Epidemic, PROPHET, SW algorithm, this algorithm can reduce network overhead by reducing the number of forwarding between nodes based on ensuring lower delivery latency and higher delivery success rate, which improves data delivery ratio and decreases latency.

Key words: opportunistic networks, degree of strangeness, betweenness, similarity, message forwarding

摘要： 针对机会网络中的数据转发问题，提出一种基于节点社会属性的转发算法。该算法计算节点的陌生性、介数中心性和相似性，均衡利用多个节点的资源防止某些节点因资源消耗过快而退出网络，降低网络的连通性。仿真结果表明，与Epidemic、PROPHET及SW等算法相比，在保证较低传输延迟和较高传输成功率的基础上，通过减少节点间的转发次数，有效地降低了网络传输开销，从而提高数据交付率和减少延迟。

关键词: 机会网络, 陌生性, 介数中心性, 相似性, 数据转发

LIU Hui1, ZHANG Zhenyu1，2, YANG Wenzhong2, WU Xiaohong2. Routing algorithm based on attribute of sociality of node in opportunistic networks[J]. Computer Engineering and Applications, 2017, 53(22): 92-96.

刘慧1，张振宇1，2，杨文忠2，吴晓红2. 机会网络中基于节点社会属性的转发算法[J]. 计算机工程与应用, 2017, 53(22): 92-96.

[1]	ZHANG Qishan, CHEN Lulu. Slope One Algorithm Based on Grey Correlational Analysis by Method of Degree of Balance and Approach [J]. Computer Engineering and Applications, 2021, 57(9): 96-102.
[2]	WANG Yonggui, LI Qianyu. Hybrid Collaborative Filtering Recommendation Algorithm Based on KNN-GBDT [J]. Computer Engineering and Applications, 2021, 57(9): 103-108.
[3]	ZHANG Xiaowen, REN Yongfeng. Image Matching Algorithm Combining Sparse Representation and Topological Similarity [J]. Computer Engineering and Applications, 2021, 57(8): 198-203.
[4]	ZHANG Songcan, PU Jiexin, SI Yanna, SUN Lifan. Adaptive Improved Ant Colony Algorithm Based on Population Similarity and Its Application [J]. Computer Engineering and Applications, 2021, 57(8): 70-77.
[5]	YANG Fang, YIN Xi, SI Jianhui, LIU Hongyuan, WANG Xue. Mathematical Expression Similarity Calculation Method Based on Focus Clustering [J]. Computer Engineering and Applications, 2021, 57(6): 88-93.
[6]	QIAN Yunyun, YANG Wenzhong, YAO Miao, LI Hailei, CHAI Yachuang. Topic Community Discovery Model Incorporating Topic Similarity Weight [J]. Computer Engineering and Applications, 2021, 57(5): 107-114.
[7]	JIANG Bin, LIANG Xiao’an, ZHANG Liang, GAO Yangjun. Evidence Combination Method Based on Improved Modified Weight [J]. Computer Engineering and Applications, 2021, 57(24): 100-106.
[8]	TIAN Wei’an, CHEN Hongmei, ZHOU Lihua. Diversified Recommendation Method Based on Similar Users’Curiosity [J]. Computer Engineering and Applications, 2021, 57(23): 113-121.
[9]	LIANG Tian, CAO Dexin. Improved and Simplified Particle Swarm Optimization Algorithm Based on Levy Flight [J]. Computer Engineering and Applications, 2021, 57(20): 188-196.
[10]	WEI Dingfeng, LI Liang, CHAI Jing. Social Recommendation Algorithm by Fusing Item Information [J]. Computer Engineering and Applications, 2021, 57(19): 198-204.
[11]	LIU Li. Top-N Recommendation Algorithm Based on User Diversity Preference [J]. Computer Engineering and Applications, 2021, 57(17): 116-121.
[12]	YANG Yanjiao, ZHAO Guotao, WANG Pidong. Sentence Similarity Calculation Method Based on Semantics and Emotion [J]. Computer Engineering and Applications, 2021, 57(16): 151-158.
[13]	ZHANG Tao, YU Jiong, LIAO Bin, BI Xuehua. Method for Attributed Graph Summarization Based on Minimum Description Length [J]. Computer Engineering and Applications, 2021, 57(15): 124-132.
[14]	ZHAO Qi, DU Yanhui, LU Tianliang, SHEN Shaoyu. Algorithm of Text Similarity Analysis Based on Capsule-BiGRU [J]. Computer Engineering and Applications, 2021, 57(15): 171-177.
[15]	SHI Chen, ZHANG Yu, HU Bo. Model for Near-Synonym/Synonym Phrase Finding Based on Common Surrounding Context [J]. Computer Engineering and Applications, 2021, 57(14): 142-147.

Routing algorithm based on attribute of sociality of node in opportunistic networks

机会网络中基于节点社会属性的转发算法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics