Design And Simulated Implementation Of Social-Based Routing In Vehicle Networks

VANET (Vehicular Ad Hoc Networks) is the research area which is becoming popular recently and has a good application prospection. It aims at improving vehicle safety, keeping the traffic flowing and advancing the feelings of the drivers and passengers. Undoubtedly, routing is the most popular area of it. MSN (Moblie Social Network) is the network which guarantees message delivery by using social relationship. The gradual maturity in technology and popularization in daily life of MSN make it become the main trend way of sloving distributed wireless routing problem. As there also exits social relationship in VANET, the routing problem in VANET is solved by using the solutions same in MSN in this thesis.The routing scheme in vehicle networks is divided into two situations namely public transportation routing and private transportation routing. In both two situations, the routing schemes include community dividing, community outside routing and community inside routing. The choosing of community outside routing or community inside routing is juded by the destination node of the message. In public transportation routing scheme, distributed k-clique community detection is used to form the community and the interaction strength and distributed betweeness centrality are used to route the community outside messages and the community inside messages respectively. At the same time, signal strength and the contribution between nodes are also considered in the routing scheme. In private transportation routing scheme, interest approximation rate is considered in community outside routing shceme, as well as signal strength and the contribution, while in community inside routing scheme, parallel multi-paths are formed by considering the interest approximation at each interest coordinate, so that the community inside messages could deliveried quickly. In private transportation routing scheme, a situation that a carrying message node is surrounded by nodes that are all its community members while the message’s destination node is not its community member is under consideration. The best neighbor mechanism and the mechanism aroused by bat algorithm are employed to solve the problem in the above situation. When think about the messages manage mechanism, the real social law among people is used in this thesis, which both consider the relationship and the contribution of two nodes and is used to decide which message is need to be sent first.The proposed routing scheme has been simulated, and then performance comparison is conducted between it and the benchmark on several indexes, in addition, the scheme is analysed objectively. Simulation and evaluation results have demonstrated the feasibility and effectiveness of the proposed routing scheme.