基于兴趣社区的高效路由与缓存管理算法

doi:10.11959/j.issn.1000-0801.2018160

Abstract

Abstract:

Aiming at the problem of control message redundancy existing in BEEINFO algorithm,unconsidered node multi-neighbor message forwarding problem and unreasonable management of message in cache,an efficient routing and cache management algorithm named ERCMAON which based on community of interest was proposed.The message forwarding delay was reduced by streamlining control messages,increasing the route design for multiple-neighbor nodes.At the same time,by optimizing the node cache management mechanism,the probability of deleting useful information was reduced,which could improve the success rate of message delivery.Simulation results show thatcompared with the BEEINFO algorithm,the delivery success rate of ERCMAON algorithm increases by at least 2.0%,the data delivery overhead and the normalized control overhead reduces by at least 9.7% and 1.7% respectively.At the same time,the message transmission delay reduces at least 2.4%.

Key words: opportunity network, community, efficient, cache management, routing algorithm

CLC Number:

TP393.4

Zhi REN,Kunlong WANG,Xiufeng LI. An efficient routing and cache management algorithm based on interest-community for opportunity networks[J]. Telecommunications Science, 2018, 34(6): 43-52.

Figures/Tables 10

References 15

[1]	STAVROULAKI V , TSAGKARIS K , LOGOTHETIS M ,et al. Opportunistic networks[J]. IEEE Vehicular Technology Magazine, 2011,6(3): 52-59.
[2]	HOSSMANN T , NOMIKOS G , SPYROPOULOS T ,et al. Collection and analysis of multi-dimensional network data for opportunistic networking research[J]. Computer Communications, 2012,35(13): 1613-1625.
[3]	VAHDAT A , BECKER D . Epidemic routing for partially-connected Ad Hoc networks[J]. Master Thesis, 2000
[4]	LINDGREN A , DORIA A . Probabilistic routing in intermittently connected networks[J]. ACM Sigmobile Mobile Computing ＆ Communications Review, 2004,7(3): 239-254.
[5]	MEI A , MORABITO G , SANTI P ,et al. Social-aware stateless forwarding in pocket switched networks[C]// 2011 IEEE INFOCOM,April 10-15,2011,Shanghai,China. Piscataway:IEEE Press, 2011: 251-255.
[6]	PAN H , CROWCROFT J , EIKO Y . BUBBLE rap:social-based forwarding in delay-tolerant networks[J]. IEEE Transactions on Mobile Computing, 2010,10(11): 1576-1589.
[7]	WANG Y , WU J . Social-tie-based information dissemination in mobile opportunistic social networks[C]// 2013 IEEE 14th International Symposium and Workshops on aWorld of Wireless,Mobile and Multimedia Networks (WoWMoM),June 4-7,2013,Madrid,Spain. Piscataway:IEEE Press, 2013: 1-6.
[8]	WONG G , JIA X . A novel socially-aware opportunistic routing algorithm in mobile social networks[C]// International Conference on Computing,Networking and Communications,Jan 28-31,2013,San Diego,USA. Piscataway:IEEE Press, 2013: 514-518.
[9]	BECKER C , SCHLINGA S , FISCHER S . Trustful data forwarding in social opportunistic networks[C]// Ubiquitous Intelligence and Computing,Dec 18-21,2013,Vietri,Italy. Piscataway:IEEE Press, 2013: 430-437.
[10]	JANG K , LEE J , KIM S K ,et al. An adaptive routing algorithm considering position and social similarities in an opportunistic network[J]. Wireless Networks, 2016,22(5): 1537-1551.
[11]	ZHANG S , WANG X , YAO M ,et al. Community-based message transmission with energy efficient in opportunistic networks[C]// International Conference on Web Information Systems Engineering,November 16-18,Zhangjiajie,China. Berlin:Springer Press, 2016: 411-423.
[12]	LI J , LIU L , XIA F . BEEINFO:data forwarding based on interest and swarm intelligence for socially-aware networking[C]// International Conference on Mobile Computing ＆Networking,September 30-October 4,2013,Miami,USA. New York:ACM Press, 2013: 175-178.
[13]	ERRAMILLI V , CROVELLA M . Forwarding in opportunistic networks with resource constraints[C]// The 3rd ACM Workshop on Challenged Networks,September 15-15,2008,San Francisco,USA. New York:ACM Press, 2008: 41-48.
[14]	XIA F , LIU L , LI J ,et al. BEEINFO:interest-based forwarding using artificial bee colony for socially aware networking[J]. IEEE Transactions on Vehicular Technology, 2015,64(3): 1188-1200.
[15]	ZHOU J , LIN Y , ZHOU S ,et al. Community-based adaptive buffer management strategy in opportunistic network[C]// International Conference on Security,Privacy and Anonymity in Computation,Communication and Storage,November 16-18,2016,Zhangjiajie,China. Berlin:Springer Press, 2016: 16-25.

Metrics

Recommended 0

No Suggested Reading articles found!

仿真参数	数值
场景面积	4 500 m×3 400 m
仿真时间/h	80
人节点个数	80
公交车节点个数/个	10
社区个数/个	6
人节点移动速/(m·s^-1)	0.5,1.5]
公交车节点移动速/(m·s^-1)	1.2,10]
人节点通信半径/m	10
公交车节点通信半径/m	1 000
消息大小/MB	0.5,1]
人消息传输速度/(Mbit·s^-1)	2
公交车消息传输速度/(Mbit·s^-1)	10
消息生存时间/h	10,15,20,25,30,35
消息间隔时间/s	10,35]
节点缓存/MB	10
移动模型	工作日运动模型
α	0.3
β	0.3
γ	0.98

An efficient routing and cache management algorithm based on interest-community for opportunity networks

RichHTML

PDF下载

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 10

References 15

Related Articles 15

Metrics

Recommended 0

[1]	Kun DENG, Qingfeng JIANG, Xingyan LIU. Community detection algorithm of hybrid node analysis and edge analysis in complex networks [J]. Telecommunications Science, 2023, 39(4): 87-100.
[2]	Yudi SUN. A prediction model of massive 5G network users’ revisit behavior based on telecom big data [J]. Telecommunications Science, 2023, 39(2): 157-162.
[3]	Jian HU, Lei SUN, Yiyan YIN, Xiaokang YANG, Jingui BAI, Yejiang ZHANG. Research on 4G/5G voice quality optimization based on data mining and geographic visualization [J]. Telecommunications Science, 2022, 38(10): 131-139.
[4]	Guoqing LIU, Xingqi WANG, Dan WEI, Jinglong FANG, Yanli SHAO. Feature selection method for software defect number prediction based on maximum information coefficient [J]. Telecommunications Science, 2021, 37(5): 133-147.
[5]	Xuan WEI, Xiaoying HUANG. Principal component analysis of time delay in large IP network [J]. Telecommunications Science, 2021, 37(4): 62-72.
[6]	Yin LIN, Xiaoxia QIN, Guodong WANG, Shutian WEI. Precise deployment scheme of 10G PON based on different scenarios [J]. Telecommunications Science, 2021, 37(12): 133-143.
[7]	Jianliang WEI,Hao JI,Tengyan TIAN,Shengli ZHOU. Public opinion model based on super-influencer integrating network community and content [J]. Telecommunications Science, 2020, 36(5): 93-105.
[8]	Di HAN,Hua XIAO,Yuan ZHONG,Xuegang LAO,Chao HAN. Technical research of a new type of optical fibre with ultra-low-loss and large effective area [J]. Telecommunications Science, 2020, 36(12): 41-48.
[9]	Fei GUI,Yang CHENG,Dan LI,Sihong HONG. Internet intelligent routing architecture and algorithm [J]. Telecommunications Science, 2020, 36(10): 12-20.
[10]	Xiaowen SU,Chaofei LIU,Zhiwei WANG,Hao ZHANG. Boiler excess air coefficient model based on the large data analysis [J]. Telecommunications Science, 2019, 35(3): 147-152.
[11]	Yuze CHEN,Lei LI,Xuemin FANG,Jian LIU,Jiakui ZHAO,Yuxi LIU,Songlin ZUO. An analysis method for electricity consumption in peak load period of summer based on regression analysis [J]. Telecommunications Science, 2019, 35(11): 125-131.
[12]	Yanbin SHI,Qi YU,Xiaojun XIE. Operation support system blue print and evolution strategy for SDN/NFV [J]. Telecommunications Science, 2018, 34(6): 171-182.
[13]	Keli HU,En FAN,Jun YE,Shigen SHEN,Yuzhang GU. A scale adaptive visual object tracking algorithm based on weighted neutrosophic similarity coefficient [J]. Telecommunications Science, 2018, 34(5): 50-62.
[14]	Zhiliang LIU. An improved RFID authentication protocol based on quadratic residue [J]. Telecommunications Science, 2018, 34(4): 90-97.
[15]	Bowen XU,Xiaodong WANG,Lei GUO,Jian WANG. A video encryption in HEVC entropy coding based on magic square [J]. Telecommunications Science, 2018, 34(3): 95-104.