期刊文献+

基于朋友关系的车联网广告投递研究

Research on Vehicle Network Advertising Delivery Based on Friends Relationship
下载PDF
导出
摘要 车联网的快速发展随之也引发了很多应用问题的讨论和研究。本文针对商场的广告投递需求,提出了基于车联之间的社会关系的车联网路由算法,主要是针对车联网网络中的投递率和网络能耗进行优化和改进。首先,利用车辆之间的接触时间和频率来确立和维护车辆之间的朋友关系。其次,在每一个车辆节点内维护一张车辆节点社会距离表。这样可以使得车辆节点间的信息交换次数减少,从而减少整网的消耗、然后,将车辆节点在过程中接收的数据按条记录在其维护的表内,用于进行不同链路的传输。当车辆节点与其接触的节点中有社会距离为1的朋友节点时,计算其中可用链路与数据之间的效用值,并进行转发。最后,数据包被转发至靠近目标节点直至到达目的节点。其实验结果分析表明:辅助信息交换次数有相对的减少,在维持高效的数据包投递率情况下可以将整网的开销降低,达到预期的目标。 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.
作者 侯煜欣 杨贵草 樊秀梅 Yuxin Hou;Guicao Yang;Xiumei Fan(System Engineering, Xi’an University of Technology, Xi’an Shaanxi;Department of Automation and Information Engineering, Xi’an University of Technology, Xi’an Shaanxi)
出处 《交通技术》 2018年第5期359-369,共11页 Open Journal of Transportation Technologies
基金 陕西省“百人计划” 陕西省重点研发计划重点项目(2017ZDCXL-GY-05-01)。
关键词 车联网 机会网络 社会关系 Internet of Vehicles Opportunistic Network Social Relationship
  • 相关文献

参考文献8

二级参考文献76

  • 1Vahdat D Becker.Epidemic routing for partially connected ad hoc networks .CS-2000-06,Department of Computer Science,Duke University,Durham,NC,2000.
  • 2B Burns,O Brock,B N Levine.MV routing and capacity building in disruption tolerant networks .Proceedings of the IEEE International Conference on Computer Communications (INFOCOM) .Miami,FL:IEEE Press,2005,vol1.398-408.
  • 3J Leguay,T Friedman,V Conan.DTN routing in a mobility pattern space .Proceedings of the ACM Special Interest Group on Data Communication (SIGCOMM) Workshop on Delay Tolerant Networks .Philadelphia,PA,USA:ACM Press,2005.276-183.
  • 4M Musolesi,S Hailes,C Mascolo.Adaptive routing for intermittently connected mobile ad hoc networks .Proceedings of the 6th IEEE International Symposium on a World of Wireless,Mobile and Multimedia Networks (WoWMoM) .Taormina-Giardini Naxos,Italy:IEEE Press,2005.183-189.
  • 5T Spyropoulos,K Psounis,C S Raghavendra.Spray and wait:an efficient routing scheme for intermittently connected mobile networks .Proceedings of the ACM Special Interest Group on Data Communication (SIGCOMM) Workshop on Delay Tolerant Networks .Philadelphia,PA,USA:ACM Press,2005.183-189.
  • 6Thrasyvoulos Spyropoulos,Konstantinos Psounis,Cauligi Raghavendra.Spray and focus:efficient mobility-assisted routing for heterogeneous and correlated mobility .Proceedings of IEEE Pervasive Computing and Communication (PERCOM),on the International Workshop on Intermittently Connected Mobile Ad hoc Networks (ICMAN) .White Plains,New York,USA:IEEE Press,2007.252-259.
  • 7Thrasyvoulos Spyropoulos,Thierry Turletti,Katia Obrazcka.Utility-based message replication for intermittently connected heterogeneous wireless networks .Proceedings of IEEE International Symposium on a World of Wireless,Mobile and Multimedia Networks (WoWMoM) .IEEE Press,2007.79-85.
  • 8Jindal A, Psounis K.Optimizing multi-copy routing schemes for resource constrained intermittently connected mobile networks .Proceedings of IEEE Asilomar Conference on Signals,Systems and Computers .Pacific Grove,CA,United States:IEEE Press,2006.2142-2146.
  • 9Li Zhuoqun,Sun Lingfen,Ifeachor,Emmanuel C.Adaptive multi-copy routing for intermittently connected mobile ad hoc networks .Proceedings of IEEE Global Telecommunications Conference (GLOBECOM) .San Francisco,CA,United states:IEEE Press,2006.1-7.
  • 10Thrasyvoulos Spyropoulos,Konstantinos Psounis,Cauligi Raghavendra.Efficient routing in intermittently connected mobile networks:the single-copy case[J].ACM/IEEE Transactions on Networking,2008,16(1):63-76.

共引文献149

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部