Optimal RSUs placement with delay bounded message dissemination in vehicular networks
From MaRDI portal
(Redirected from Publication:2012886)
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
Cites work
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- A genetic algorithm for the set covering problem
- A threshold of ln n for approximating set cover
- Advances in computer science and information technology. AST/UCMA/ISA/ACN 2010 conferences, Miyazaki, Japan, June 23--25, 2010. Joint proceedings
- An algorithm for set covering problem
- Combinatorial auctions: a survey
- Computational experience with approximation algorithms for the set covering problem
- Greedy approximations for minimum submodular cover with submodular cost
Cited in
(6)- Adaptive virtual RSU scheduling for scalable coverage under bidirectional vehicle traffic flow
- Scheduling algorithm for vehicle to road-side data distribution
- Opportunistic Offloading of Deadline-Constrained Bulk Cellular Traffic in Vehicular DTNs
- A scheduling algorithm for medical emergency rescue aircraft trajectory based on hybrid estimation and intent inference
- Optimal RSUs deployment with delay bound along highways in VANET
- Performance of beacon safety message dissemination in vehicular ad hoc networks (VANETs)
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)