Open Journal of Transportation Technologies
Vol. 07  No. 05 ( 2018 ), Article ID: 26985 , 11 pages
10.12677/OJTT.2018.75044

Research on Vehicle Network Advertising Delivery Based on Friends Relationship

Yuxin Hou1, Guicao Yang1, Xiumei Fan2*

1System Engineering, Xi’an University of Technology, Xi’an Shaanxi

2Department of Automation and Information Engineering, Xi’an University of Technology, Xi’an Shaanxi

Received: Sep. 7th, 2018; accepted: Sep. 20th, 2018; published: Sep. 27th, 2018

ABSTRACT

The rapid development of the Internet of Vehicles has also led to discussions and research on many application issues. This paper aims at the advertising delivery demand of shopping malls and proposes a vehicle networking routing algorithm based on the social relationship between vehicles, which mainly optimizes and improves the delivery rate and network energy consumption in the network of vehicles. First, the contact time and frequency between vehicles are used to establish and maintain a friend relationship between vehicles. Second, a vehicle node social distance table in each vehicle node is maintained. This can reduce the number of information exchanges between vehicle nodes and reduce the overall network energy consumption. The data received by the vehicle node in the process is then recorded in a table maintained by it for the transmission of different links. When there is a friend node with a social distance of 1 in the node with which the vehicle node is in contact, the utility value between the available link and the data is calculated and forwarded. Finally, the packet is forwarded close to the target node until it reaches the destination node. The analysis of the experimental results shows that the number of auxiliary information exchanges is relatively reduced, and the overhead of the whole network can be reduced to achieve the expected goal while maintaining efficient delivery rate of data packets.

Keywords:Internet of Vehicles, Opportunistic Network, Social Relationship

1西安理工大学，系统工程，陕西 西安

2西安理工大学，自动化与信息工程系，陕西 西安

1. 引言

2. 相关研究背景及成果

3. 基于朋友关系的车联网广告投递

3.1. 节点间朋友关系识别

3.2. 节点间社会距离表

Figure 1. Vehicle node contact time distribution

1) 目标节点：即可以到达的节点的位置信息。

2) 社会距离：节点自身与目的节点之间的社会距离。

3) 直属节点：节点自身到目标节点这条链路中节点自身的下一跳节点。

3.3. 数据分组摘要表

Figure 2. Establishment and maintenance of vehicle relationships

Table 1. System resulting data of standard experiment

1) 数据条编号：从1开始编号方便调用。

2) 目标节点：所要发送到的目标节点位置信息和车辆信息。

3) 数据包信息：所要发送的数据包。

3.4. 免疫信息表

3.5. 传输效用计算

Table 2. Data group summary table

3.6. 具体操作步骤

4. 仿真实验及结果分析

4.1. 仿真环境

4.2. 性能对比参数

4.3. 仿真结果分析

Figure 3. Routing flow chart

Table 3. Simulation parameter table

Figure 4. Relationship between delivery rate and number of vehicle nodes

Figure 5. Auxiliary information exchange times

Figure 6. Routing cost

5. 结论

Research on Vehicle Network Advertising Delivery Based on Friends Relationship[J]. 交通技术, 2018, 07(05): 359-369. https://doi.org/10.12677/OJTT.2018.75044

1. 1. 王建强, 吴辰文, 李晓军. 车联网架构与关键技术研究[J]. 微计算机信息, 2011, 27(4): 156-158.

2. 2. Jia, X.U., Sun, L.J., Wang, R.C., et al. (2010) Adaptive Seed Spray Routing for Opportunistic Networks. Acta Electronica Sinica, 38, 2315-2321.

3. 3. Mundur, P., Seligman, M. and Lee, G. (2008) Epidemic Routing with Immunity in Delay Tolerant Networks. 2008 IEEE Military Communications Conference, San Diego, 16-19 November 2008, 1-7.

4. 4. Kayastha, N., Niyato, D., Wang, P., et al. (2011) Applications, Architectures, and Protocol Design Issues for Mobile Social Networks: A Survey. Proceedings of the IEEE, 99, 2130-2158. https://doi.org/10.1109/JPROC.2011.2169033

5. 5. 刘慧, 张振宇, 杨文忠, 等. 机会网络中基于陌生人的转发算法[J]. 计算机工程与设计, 2017, 38(4): 893-897.

6. 6. Luis, R., Mejia, G., Cruz, C., Berrone, P., et al. (2011) The Bind That Ties: Socioemotional Wealth Preservation in Family Firms. Academy of Management Annals, 5, 653-707. https://doi.org/10.5465/19416520.2011.593320

7. 7. Daly, E.M. and Haahr, M. (2007) Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs. ACM International Symposium on Mobile Ad Hoc Networking & Computing, Montreal, 9-14 September 2007, 32-40.

8. 8. Wu, X.H., Gu, X.F. and Poslad, S. (2015) Routing Algorithm Based on Social Relations in Opportunistic Networks. 2015 12th International Computer Conference on Wavelet Active Media Technology and Information Processing, Chengdu, 18-20 December 2015, 146-149.

9. 9. 张淯舒, 王慧强, 冯光升, 等. 基于兴趣匹配的机会社会网络消息分发机制[J]. 计算机研究与发展, 2016, 53(6): 1365-1375.

10. 10. 李捷, 陈阳, 刘红霞. 基于社交效用向量的机会网络路由算法[J]. 河南大学学报(自然科学版), 2016, 46(2): 196-201.

11. 11. 彭碧涛. 接触概率和数据分组新鲜度感知的机会网络路由算法[J]. 小型微型计算机系统, 2017, 38(7): 1459-1463.

12. 12. 王文涛, 郑芳, 王奇枫, 等. 基于ONE平台的机会网络路由协议仿真分析[J]. 中南民族大学学报(自然科学版), 2014(3): 110-114.

13. 13. 袁培燕, 宋明阳. 移动机会网络中一种轻量级的分布式社会距离路由算法[J]. 计算机应用, 2018(1): 13-19.

14. NOTES

*通讯作者。