EconPapers    
Economics at your fingertips  
 

An Auction-Based Bid Prediction Mechanism for Fog-Cloud Offloading Using Q-Learning

Reza Besharati, Mohammad Hossein Rezvani, Mohammad Mehdi Gilanian Sadeghi and Roberto Natella

Complexity, 2023, vol. 2023, 1-20

Abstract: In the fog computing paradigm, if the computing resources of an end device are insufficient, the user’s tasks can be offloaded to nearby devices or the central cloud. In addition, due to the limited energy of mobile devices, optimal offloading is crucial. The method presented in this paper is based on the auction theory, which has been used in recent studies to optimize computation offloading. We propose a bid prediction mechanism using Q-learning. Nodes participating in the auction announce a bid value to the auctioneer entity, and the node with the highest bid value is the auction winner. Then, only the winning node has the right to offload the tasks on its upstream (parent) node. The main idea behind Q-learning is that it is stateless and only considers the current state to perform an action. The evaluation results show that the bid values predicted by the Q-learning method are near-optimal. On average, the proposed method consumes less energy than traditional and state-of-the-art techniques. Also, it reduces the execution time of tasks and leads to less consumption of network resources.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2023/5222504.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2023/5222504.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:5222504

DOI: 10.1155/2023/5222504

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().

 
Page updated 2025-03-19
Handle: RePEc:hin:complx:5222504