Content Caching and Distribution Policies for Vehicular Ad-Hoc Networks (VANETs): Modeling and Simulation

被引:0
|
作者
Kilanioti, Irene [1 ]
Astrinakis, Nikolaos [1 ]
Papavassiliou, Symeon [1 ]
机构
[1] Natl Tech Univ Athens, Sch Elect & Comp Engn, Athens 15780, Greece
关键词
content caching; content distribution policies; VANETs; machine learning;
D O I
10.3390/electronics12132901
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The paper studies the application of various content distribution policies for vehicular ad hoc networks (VANETs) and compares their effectiveness under various simulation scenarios. Our implementation augments the existing Veins tool, an open source framework for vehicular network simulations based on the discrete event simulator OMNET++ and SUMO, a tool that simulates traffic on road networks. The proposed solution integrates various additional features into the pre-existing Veins realizations and expands them to include the modeling and implementation of proposed caching and content distribution policies and the measurement of respective metrics. Moreover, we integrate machine learning algorithms for distribution policies into the simulation framework in order to efficiently study distribution of content to the network nodes. These algorithms are pre-trained neural network models adapted for VANETs. Using these new functions, we can specify the simulation parameters, run a plethora of experiments and proceed to evaluate metrics and policies for content distribution.
引用
收藏
页数:22
相关论文
共 50 条
  • [41] HPDM: A Hybrid Pseudonym Distribution Method for Vehicular Ad-hoc Networks
    Boualouache, Abdelwahab
    Senouci, Sidi-Mohammed
    Moussaoui, Samira
    [J]. 7TH INTERNATIONAL CONFERENCE ON AMBIENT SYSTEMS, NETWORKS AND TECHNOLOGIES (ANT 2016) / THE 6TH INTERNATIONAL CONFERENCE ON SUSTAINABLE ENERGY INFORMATION TECHNOLOGY (SEIT-2016) / AFFILIATED WORKSHOPS, 2016, 83 : 377 - 384
  • [42] VaSili - A Simulation Runtime Environment for Applications in Vehicular Ad-Hoc Networks
    Ebers, Sebastian
    Hellbueck, Horst
    Fischer, Stefan
    [J]. 2015 12TH ANNUAL IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE, 2015, : 937 - 942
  • [43] Simulation of vehicular ad-hoc networks: Challenges, review of tools and recommendations
    Stanica, Razvan
    Chaput, Emmanuel
    Beylot, Andre-Luc
    [J]. COMPUTER NETWORKS, 2011, 55 (14) : 3179 - 3188
  • [44] Information Hovering in Vehicular Ad-Hoc Networks
    Xeros, Andreas
    Lestas, Marios
    Andreou, Maria
    Pitsillides, Andreas
    Ioannou, Petros
    [J]. 2009 IEEE GLOBECOM WORKSHOPS, 2009, : 380 - +
  • [45] A trust based model (TBM) to detect rogue nodes in vehicular ad-hoc networks (VANETS)
    Kuldeep Narayan Tripathi
    S. C. Sharma
    [J]. International Journal of System Assurance Engineering and Management, 2020, 11 : 426 - 440
  • [46] A Cautionary View of Mobility and Connectivity Modeling in Vehicular Ad-Hoc Networks
    Conceicao, Hugo
    Ferreira, Michel
    Barros, Joao
    [J]. 2009 IEEE VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5, 2009, : 2764 - 2768
  • [47] Vehicular Ad-hoc Networks ( VANETs) Dynamic Performance Estimation Routing Model for City Scenarios
    Abdelgadir, Mayada
    Saeed, Rashid
    Babiker, Abuagla
    [J]. 2016 INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND COMMUNICATIONS TECHNOLOGIES (ICISCT), 2016,
  • [48] A trust based model (TBM) to detect rogue nodes in vehicular ad-hoc networks (VANETS)
    Tripathi, Kuldeep Narayan
    Sharma, S. C.
    [J]. INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT, 2020, 11 (02) : 426 - 440
  • [49] Modeling and Evaluation of a Streaming Traffic Controller for Vehicular Ad-Hoc Networks
    Mohandas, Brijesh Kadri
    Yang, Oliver
    Liscano, Ramiro
    [J]. 2010 7TH IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE-CCNC 2010, 2010, : 1083 - 1087
  • [50] Privacy Issues of Vehicular Ad-Hoc Networks
    Dok, Hang
    Fu, Huirong
    Echevarria, Ruben
    Weerasinghe, Hesiri
    [J]. INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING, 2010, 3 (01): : 17 - 32