Optimal RSUs placement with delay bounded message dissemination in vehicular networks
From MaRDI portal
Publication:2012886
DOI10.1007/S10878-016-0034-8zbMATH Open1376.90070OpenAlexW2410232439MaRDI QIDQ2012886FDOQ2012886
Hongwei Du, H.-J. Huang, X.-H. Jia, Chunyan Liu
Publication date: 3 August 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0034-8
Recommendations
- Optimal RSUs deployment with delay bound along highways in VANET
- Adaptive virtual RSU scheduling for scalable coverage under bidirectional vehicle traffic flow
- Performance of beacon safety message dissemination in vehicular ad hoc networks (VANETs)
- Reducing congestion in obstructed highways with traffic data dissemination using ad hoc vehicular networks
- SEMD: secure and efficient message dissemination with policy enforcement in VANET
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cites Work
- A threshold of ln n for approximating set cover
- A genetic algorithm for the set covering problem
- Combinatorial auctions: a survey
- Computational experience with approximation algorithms for the set covering problem
- An algorithm for set covering problem
- Title not available (Why is that?)
- Greedy approximations for minimum submodular cover with submodular cost
- Advances in computer science and information technology. AST/UCMA/ISA/ACN 2010 conferences, Miyazaki, Japan, June 23--25, 2010. Joint proceedings
Cited In (3)
This page was built for publication: Optimal RSUs placement with delay bounded message dissemination in vehicular networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012886)