VICN中多缓存源的隐式协作路由算法

Implicit Cooperative Routing Algorithm for Multiple Cache Sources in VICN

针对城市场景下车载信息中心网络(Vehicular Information Centric Network,VICN)中路由的有效性和时效性问题,提出了多缓存源隐式协作路由算法(Implicit Cooperative Routing Algorithms for Multiple Cache Sources,ICR-MCS)。该路由算法可在拓扑变化明显的岔路口和拓扑相对稳定的直行道路上具有自适应性。请求包中包含请求节点的轨迹信息,当多缓存源同时响应请求包时,通过对请求节点的短时运动预测实现多路径路由,以适应不同拓扑变化规律的路段。中继转发节点可根据自身与源节点、目的节点的位置关系以及接收到响应包的次数,计算中继抑制因子并得到转发概率,以适应于不同节点密度的场景,并实现多缓存源之间的隐式协作。仿真表明,所提的路由算法与多源贪婪转发路由相比,具有更高的数据包到达率和更低的平均请求-响应时延。

Aiming at the validity and effectiveness of routing algorithm in vehicle information center network for urban scenario,an implicit cooperative routing algorithm with multiple cache sources is proposed.The routing algorithm can be adaptive at both intersections which yields obvious topological changes and straight roads which yields relatively stable topology.The request packet contains the trajectory information of the requesting node.When the multi-cache sources respond to the request packet,the multi-path routing is realized by predicting the short-term movement of the requesting node.As a result,the proposed algorithm is suitable for the sections with different topological changes.The relay forwarding node can calculate the relay suppression factor and further acquire the forwarding probability.The forwarding probability is referring to the location relationship between itself and the source node,the destination node besides the number of receiving of the response packet.This method can adapt to the different node densities,and realize the implicit cooperation among multiple cache sources.Simulation results indicate that the proposed routing algorithm has higher packet arrival rate and lower average request-response delay than multi-source greedy forwarding routing.