SwePub
Sök i LIBRIS databas

  Utökad sökning

WFRF:(Ali Imran)
 

Sökning: WFRF:(Ali Imran) > (2020-2024) > Dynamic application...

Dynamic application partitioning and task-scheduling secure schemes for biosensor healthcare workload in mobile edge cloud

Lakhan, Abdullah (författare)
Kristiania University College
Li, Jin (författare)
Beijing Jiaotong University
Groenli, Tor Morten (författare)
Kristiania University College
visa fler...
Hassan Sodhro, Ali (författare)
Department of Computer Science,Research environment of Computer science,Faculty of Natural Science,Avdelningen för datavetenskap,Fakulteten för naturvetenskap,Chinese Academy of Sciences
Zardari, Nawaz Ali (författare)
Universiti Teknologi Malaysia
Imran, Ali Shariq (författare)
Norwegian University of Science and Technology
Thinnukool, Orawit (författare)
Chiang Mai University
Khuwuthyakorn, Pattaraporn (författare)
Chiang Mai University
visa färre...
 (creator_code:org_t)
2021-11-15
2021
Engelska 29
Ingår i: Electronics. - : MDPI AG. - 2079-9292. ; 10:22, s. 1-30
Relaterad länk:
https://researchport... (primary) (free)
visa fler...
https://doi.org/10.3... (free)
https://www.mdpi.com...
https://doi.org/10.3...
visa färre...
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • Currently, the use of biosensor-enabled mobile healthcare workflow applications in mobile edge-cloud-enabled systems is increasing progressively. These applications are heavyweight and divided between a thin client mobile device and a thick server edge cloud for execution. Application partitioning is a mechanism in which applications are divided based on resource and energy parameters. However, existing application-partitioning schemes widely ignore security aspects for healthcare applications. This study devises a dynamic application-partitioning workload task-scheduling-secure (DAPWTS) algorithm framework that consists of different schemes, such as min-cut algorithm, searching node, energy-enabled scheduling, failure scheduling, and security schemes. The goal is to minimize the energy consumption of nodes and divide the application between local nodes and edge nodes by applying the secure min-cut algorithm. Furthermore, the study devises the secure-min-cut algorithm, which aims to migrate data between nodesin a secure form during application partitioning in the system. After partitioning the applications, the node-search algorithm searches optimally to run applications under their deadlines. The energy and failure schemes maintain the energy consumption of the nodes and the failure of the system. Simulation results show that DAPWTS outperforms existing baseline approaches by 30% in terms of energy consumption, deadline, and failure of applications in the system.

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Kommunikationssystem (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Communication Systems (hsv//eng)
TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)

Publikations- och innehållstyp

ref (ämneskategori)
art (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy