2018 14th International Wireless Communications &Amp; Mobile Computing Conference (IWCMC) 2018
DOI: 10.1109/iwcmc.2018.8450313
|View full text |Cite
|
Sign up to set email alerts
|

Theoretical Game Approach for Mobile Users Resource Management in a Vehicular Fog Computing Environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
17
0
2

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 27 publications
(19 citation statements)
references
References 15 publications
0
17
0
2
Order By: Relevance
“…Therefore, it is necessary to allocate resources in a way that minimizes the service latency. For applications with different QoS requirements, the admission control problem is solved using a game theoretic approach in [138]. Using the proposed scheduling algorithm, QoS requirements and scalability are achieved in [138].…”
Section: F Vehicular Fog Computingmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, it is necessary to allocate resources in a way that minimizes the service latency. For applications with different QoS requirements, the admission control problem is solved using a game theoretic approach in [138]. Using the proposed scheduling algorithm, QoS requirements and scalability are achieved in [138].…”
Section: F Vehicular Fog Computingmentioning
confidence: 99%
“…For applications with different QoS requirements, the admission control problem is solved using a game theoretic approach in [138]. Using the proposed scheduling algorithm, QoS requirements and scalability are achieved in [138]. In another work [139], public service vehicles are used as fog nodes for outsourcing tasks using a semi-Markov decision process.…”
Section: F Vehicular Fog Computingmentioning
confidence: 99%
“…For applications having diverse QoS requirements, the admission control problem is solved using a theoretical game approach. With the help of the proposed scheduling algorithm, QoS requirements and scalability are achieved [ 35 ]. In another work [ 36 ], public service vehicles are used as fog nodes for task offloading using a semi-Markov decision process.…”
Section: Related Workmentioning
confidence: 99%
“…Liu et al [29] used a semi-Markov decision process and linear programming to solve the optimal multi-resource allocation problem. Klaimi et al [30] proposed a dynamic resource allocation algorithm based on game theory, which minimized CPU resource and energy consumption from the aspects of delay and request blocking probability. Finally, the existence of Nash equilibrium was proved.…”
Section: Related Workmentioning
confidence: 99%