Stochastic dynamic programming model for optimal resource allocation in vehicular ad hoc networks
DOI10.1007/S12046-018-0853-7zbMATH Open1397.90074OpenAlexW2797652235MaRDI QIDQ1789136FDOQ1789136
Authors: B. Paramasivan, A. Kandasamy, M. C. Bhuvaneswari
Publication date: 10 October 2018
Published in: Sādhanā (Search for Journal in Brave)
Full work available at URL: https://www.ias.ac.in/describe/article/sadh/043/04/0052
Recommendations
- Vehicular ad hoc network mobility models applied for reinforcement learning routing algorithm
- An energy-efficient geographic routing protocol design in vehicular ad-hoc network
- Distributed resource allocation over random networks based on stochastic approximation
- An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
- Analysis and optimization of resource control in high-speed railway wireless networks
Deterministic network models in operations research (90B10) Dynamic programming (90C39) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Cites Work
Cited In (3)
This page was built for publication: Stochastic dynamic programming model for optimal resource allocation in vehicular ad hoc networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789136)