Computation offloading using K-nearest neighbour time critical optimisation algorithm in fog computing
by Ashwini Kumar Jha; Minal P. Patel; Tanmay D. Pawar
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 23, No. 3/4, 2022

Abstract: The wide range of IoT devices and wireless devices used in healthcare, hospitals and enterprises generates a large volume of digital data that must be processed, analysed and stored. Owing to the small processing capacity of these devices, the data generated cannot be processed on-board. Therefore, we suggest offloading this data to an efficient server. Time-critical applications cannot rely on the availability of cloud servers since they are in a remote location. The paper examines algorithms such as Deep Reinforcement Learning for Online Computation Offloading (DROO), coordinate descent, adaptive boosting, and then implements the K-nearest neighbour time critical optimisation algorithm as a fog offloading network topology. The offloading decision is based on the cost function, which includes latency, memory consumption and model accuracy. The topology implementing K-NN can be trained quickly and offers almost 99% accuracy when it comes to data offloading. Based on the comparative analysis, it excels over other machine learning approaches.

Online publication date: Mon, 12-Dec-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email [email protected]