社区模型机会网络路由研究

摘要/Abstract

摘要：

当前,基于社区的机会网络研究在模型上还有待完善,在社区间的路由算法没有考虑消息的传输效率,只采用简单的分发等待路由算法,使得路由效率较低。为此,对社区模型进行了改进,加入节点回归因素,并在此模型下提出了新的路由算法NBR。在社区内采用混合路由算法,并加入了正反馈思想重新计算节点活跃度。在社区间采用查询路由表和判断节点回归相结合的方法,利用节点回归的特性提高转发效率。仿真结果表明,在改进后的社区模型下,NBR算法使得社区间和社区内的消息传输成功率得到了提升,有效的降低了网络资源的消耗。

关键词: 机会网络, 社区模型, 路由算法, 网络效率

Abstract:

Currently,the study on opportunity network based on community structure remains to be improved,since the routing algorithm dose not take the transmission efficiency of the message into account between different communities,and in the community the routing it only use simple Spray and Wait routing algorithm,making opportunistic network based on community structure less efficient.To address these issues,the community model has been improved with the factors of node regression in mind,and a new routing algorithm called Node Back Routing under the improved community model is proposed.In the community,the routing algorithm uses the hybrid routing rules,and adds the positive feedback to recalculate the activity of the nodes.In different communities,the routing algorithm uses query routing table and considers the node regression method,making use of the attributes of the node regression to improve the efficiency of the message forwarding.Simulation results show that the improved community structure and routing algorithms improve the message transmission rate between different communities and in the same communities and effectively reduce network consumption.

Key words: opportunistic network;community structure;routing algorithm;consumption of network

中图分类号:

TP393

马恒,杜庆伟. 社区模型机会网络路由研究[J]. , 2013, 26(5): 117-.

MA Heng,DU Qingwei. Research on Opportunistic Network Routing Based on Community Structure[J]. , 2013, 26(5): 117-.

参考文献

［1］XIONG Yongping.Opportunistic network ［J］.Journal of Software,2009,20(1):124-137.

［2］VAHDAT A,BECKER D.Epidemic routing for partially connected ad hoc networks,CS2200006 ［D］.Durham,North Carolina:Duke University,2000.

［3］SPYROPOULOS T,PSOUNIS K,RAGHAVENDRA C S.Spray and wait:Efficient routing in intermittently connected mobile networks ［C］.New York:PPProc of ACM SIGCOMM Work shop on Delay Tolerant Networking(WDTN),ACM,2005.

［4］SPYROPOULOS T,PSOUNIS K,RAGHAVENDRA C S,et al.Spray an d focus:Efficient mobility assisted routing for het erogenous and correlated mobility ［C］.New York:PPProc of the 5th Annual IEEE Conference on Pervasive Computing and Communications Workshops,IEEE,2007.

［5］LINDGREN,DORIA A,SCHELN O.Probabilistic routing in intermittently connected networks ［C］.New York:PPProc of ACM Sigmobile Mobile Computing and Communications,ACM,2003.

［6］PAN Hui,JON C,EIKO Y.BUBBLE Rap:Social based forwarding in delay tolerant networks ［C］.New York:PPProc of the 9th ACM Symp on Mobile Ad Hoc Networking and Computing,ACM,2008.

［7］NIU Jianwei,ZHOU Xing,LIU Yan,et al.Opportunistic network based on community structure ［J］.Journal of Computer Research and Development,2009,46(12):206-207.

［8］FAN Xiaolin.Research on opportunity network routing protocol based on community structure［D］.Hohhot:Inner Mongolia University,2011.

［9］NEWMAN M E J,GIRVAN M.Finding and evaluating community structure in networks［J］.Physical Review E,2004,69(22):1-15.

［10］SPYROPOULOS T,PSOUNIS K,RAGHAVENDRA C S.Performance analysis of mobility assisted routing ［C］.New York:PPProc of the 7th ACM Mobile Ad Hoc Networking and Computing,ACM,2006:49-60.

［11］WU Dapeng.Message-redundancy estimating adaptive buffer management mechanism for opportunistic network［J］.Journal of Electronics & Information Technology,2012,34(1):101-107.

［12］KRAKEN A.Opportunistic network environment simulator ［D］.Helsinki:Helsinki University of Technology,2008.

［13］熊永平.机会网络［J］.软件学报,2009,20(1):124-137.

［14］牛建伟,周兴,刘燕,等.一种基于社区机会网络的消息传输算法［J］.计算机研究与发展,2009(12):2068-2075.

［15］樊霄琳.基于社团结构的机会网络路由协议研究［D］.呼和浩特:内蒙古大学,2011.

［16］吴大鹏.机会网络中消息冗余度动态估计的缓存管理策略［J］.电子与信息学报,2012,34(1):101-107.

[1]	孙振,王凯,王亚刚. 一种改进的基于时间竞争成簇的路由算法[J]. 电子科技, 2019, 32(8): 27-32.
[2]	杨眉, 李忠科, 王忠. 基于OWL-S语义栅格运动目标信息快速分发技术[J]. , 12, 25(7): 6-.