基于节点相似性的容延_容断网络路由算法.docx

基于节点相似性的容延/容断网络路由算法*戴晨曲，李建波，由磊，徐吉兴(青岛大学信息工程学院，山东青岛266071)(*通信作者电子邮箱lijianboqdu@gmail．com)摘要:针对容延/容断网络(DTN)网络的时延高、割裂频繁，以及节点缓存和能量受限等网络特性，为提高容延网络的传输率，同时降低网络开销和网络时延，提出了一种基于节点相似性的容延网络路由算法(ＲABNS)。该算法利用历史相遇信息预测节点未来相遇概率，并且把历史相遇的节点录入为集合，利用集合的交集运算来评估一对相遇节点的相似性，并以此为判定条件控制网络中的副本数量。在模拟器TheONE上采用ＲandomWaypoint运动模型进行仿真，其中ＲABNS在消息投递率方面优于PＲOPHET，网络负载约为PＲOPHET的50%，较大程度上提高了网络资源利用率;平均时延稍高于Epidemic但低于PＲOPHET，节点缓存空间大小对算法的平均跳数影响不大，且ＲABNS的平均跳数约为PＲOPHET的一半。仿真结果表明，ＲABNS能有效地限制消息洪泛，获取更高的消息投递率、更低的网络开销和数据时延，因此尤其适用于节点存储空间有限的DTN环境和具有群居特性的社交容延网络中。关键词:容延/容断网络;路由算法;节点相似性;集合运算中图分类号:TP393文献标志码:AＲoutingalgorithmbasedonnodesimilarityindelay/disruptiontolerantnetworks*DAIChenqu，LIJianbo，YOULei，XUJixing(CollegeofInformationEngineering，QingdaoUniversity，QingdaoShandong266071，China)Abstract:Delay/DisruptionTolerantNetwork(DTN)hascharacteristicsoflongdelay，intermittentdisruption，andlimitationofbufferspaceandenergy．Toimprovethedeliveryrateofmessages，whilereducingnetworkoverheadandtheaveragelatency，anewＲoutingAlgorithmBasedonNodeSimilarity(ＲABNS)inDTNwasproposed．Thealgorithmusedhistoricalinformationtopredictnodeencounterprobabilityinfuture．Thenodeswhichencounteredhistoricallywererecordedasacollection，thenthesetintersectionoperationwasappliedtoevaluatethesimilarityofapairofnodes．Andthesimilaritywasusedtocontrolthenumberofcopiesinthenetwork．SimulationswereconductedonTheONEplatformusingＲandomWaypointmotionmodel．Inthesimulation，ＲABNSperformedbetterthanPＲOPHET(ProbabilisticＲOutingProtocolusingHistoryofEncountersandTransitivity)inthemessagedeliveryrate．AndthenetworkoverheadofＲABNSwasabouthalfofPＲOPHET，whichgreatlyimprovedtheutilizationofnetworkresources．TheaveragelatencyofＲABNSwasalittlehigherthanEpidemicbutlowerthanPPＲOPHET，thenodecachesizedidnothaveasignificantimpactonaverage-hops，anditsaverage-hopswasabouthalfofPＲOPHET．ThesimulationresultsshowthatＲABNScaneffectivelylimitthemessagefloodingwithhighermessagedeliveryrate，lowernetworkoverheadandaveragelatency，thereforeitissuitablefortheDTNsceneswithlimitednodesstoragea