Abstract
Fog computing networks have been widely integrated in IoT-based systems to improve the quality of services (QoS) such as low response service delay through efficient offloading algorithms. However, designing an efficient offloading solution is still facing many challenges including the complicated heterogeneity of fog computing devices and complex computation tasks. In addition, the need for a scalable and distributed algorithm with low computational complexity can be unachievable by global optimization approaches with centralized information management in the dense fog networks. In these regards, this paper proposes a distributed computation offloading framework (DISCO) for offloading the splittable tasks using matching theory. Through the extensive simulation analysis, the proposed approaches show potential advantages in reducing the average delay significantly in the systems compared to some related works.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
