面向车联网的社交型路由机制设计与仿真实现

发布时间：2018-01-24 23:01

本文关键词： 车联网社交网络路由机制社区划分　出处：《东北大学》2014年硕士论文　论文类型：学位论文

【摘要】：VANET (Vehicular Ad Hoc Networks)是近期兴起的一项致力于改善车辆安全、交通畅通、驾驶人与乘客的便捷与舒适体验,且有着较好应用前景的研究领域。其中,路由问题无疑是这一领域的研究热点。同时,MSN (Moblie Social Network)作为在分布式条件下利用社交关系保证信息传递的网络,其技术与理论的不断成熟与广泛的应用使其成为解决分布式无线路由的主流方法。由于VANET中同样存在社交关系,因此,本文将MSN中使用社交关系进行路由的方法应用于VANET中,以达到提高VANET中信息高效传输的目的。本文将VANET路由分为轨迹交通路由和非轨迹交通路由两种情况,并分别对这两种情况进行社区划分,然后依据社区划分的结果针对不同消息选择社区外路由或社区内路由。在轨迹交通路由中,考虑到网络节点移动的规律性导致其相遇时间的周期性,利用分布式k-clique算法对其进行社区划分,将感知互动强度和分布式介度集中度分别作为社区外路由和社区内路由的主要依据,同时结合节点间信号强度和贡献值对消息进行路由。在非轨迹交通中,考虑到节点移动是由其兴趣取向所引导的,本文利用节点间的兴趣匹配程度对网络内节点进行社区划分；在社区外路由机制中,主要考虑消息的目的节点与相遇节点的兴趣匹配度对消息的引导作用,并同时考虑节点间的信号强度与贡献值；在社区内路由机制中,根据节点在不同兴趣上与消息目的节点的匹配程度,生成无交叉路径进行消息的平行多路发送,以达到快速交付的目的。同时,在非轨迹交通中,针对消息的目的节点是其携带节点的社区外成员,而当前携带消息的节点接触范围内却都是其社区成员的情况,本文采用最佳邻居机制配合由蝙蝠算法得到的启发机制予以解决。与此同时,为了有效管理节点的消息缓存,本文设计了基于人类社会关系的缓存处理机制：在消息缓存机制中,同时考虑了人与人之间的亲疏关系以及相互的贡献程度,将这两个因素同时作为消息缓存排序的依据,以达到交付概率大的消息优先被处理的目的。本文对上述面向车联网的社交型路由机制进行了仿真实现,与基准机制在多个指标上进行了性能对比,并且对机制的结果进行了客观的分析。仿真和评价结果表明本文提出的路由机制是可行且有效的。
[Abstract]:VANET vehicle Ad Hoc Networks (Ad Hoc Networks) is a recent development that aims to improve vehicle safety and traffic flow. The convenient and comfortable experience of drivers and passengers, and has a good application prospects in the research field, among which, the routing problem is undoubtedly the research hotspot in this field. At the same time. MSN Social Network acts as a network that uses social relationships to ensure the delivery of information under distributed conditions. With the development of technology and theory and its wide application, it has become the mainstream method to solve distributed wireless routing. Because there are social relations in VANET, so. This article applies the social relationship routing method in MSN to VANET. In order to improve the efficient transmission of information in VANET, this paper divides the VANET routing into two situations: track traffic route and non-track traffic route. Then, according to the results of community division, we choose the out-of-community routing or intra-community routing for different messages. In the path traffic routing, considering the regularity of the network node movement, the periodicity of the encounter time is taken into account. The distributed k-clique algorithm is used to divide the community, and the perceptual interaction intensity and the distributed media concentration are regarded as the main basis of the out-of-community routing and intra-community routing, respectively. At the same time, the message is routed by combining the signal strength and contribution value between nodes. In non-track traffic, it is considered that the node movement is guided by its interest orientation. This paper uses the degree of interest matching between nodes to divide the community of nodes in the network. In the out-of-community routing mechanism, the interest matching between the destination node and the encounter node is considered to guide the message, and the signal strength and contribution between the nodes are also considered. In the intra-community routing mechanism, according to the matching degree between the nodes in different interests and the message destination node, the parallel multipath is generated to send messages without cross paths, so as to achieve the purpose of rapid delivery. At the same time. In the off-track traffic, the destination node of the message is the outside member of its carrying node, but the current nodes carrying the message are all members of the community in the contact range. In this paper, the best neighbor mechanism combined with the heuristic mechanism obtained by bat algorithm is used to solve the problem. At the same time, in order to effectively manage the message cache of nodes. In this paper, we design a cache processing mechanism based on human social relations: in the message caching mechanism, we also consider the relationship between people and the degree of mutual contribution. These two factors are taken as the basis of message cache ranking, so that the message with high delivery probability can be processed first. In this paper, the above social routing mechanism for vehicle networking is simulated and implemented. The results of simulation and evaluation show that the proposed routing mechanism is feasible and effective.
【学位授予单位】：东北大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：U495;TN929.5;TP391.44

【相似文献】