Heuristic search based localization in mobile computational grid

Dinesh Prasad Sahu, Karan Singh, Manisha Manju, David Taniar, Le Minh Tuan, Le Hoang Son, Mohamed Abdel-Basset, Hoang Viet Long

Research output: Contribution to journalArticleResearchpeer-review

2 Citations (Scopus)

Abstract

In recent years, the number of cell phones in society has increased drastically and they are getting popular due to their computational ability and adaptability. Resource provisioning is important, but still remains NP-hard problem in mobile computational grid (MCG). Once the jobs are assigned to the MCG, the main challenge is how to identify the correct resource according to the job's requirement and use them to execute the sub-jobs. The heuristic methods such as Min-Min, Max-Min, and HEFT can be used to select appropriate resources from the MCG that is assigned for job execution. Since the computational nodes are static and mobile in nature, the performance of such heuristics is not as expected. Such heuristics suffers from low throughput and low speedup. The process of localization is used in a wireless sensor network with good results. The proposed model uses heuristics and localization process for optimizing the quality of service parameter localization, normalized speedup, and throughput in MCG, with the concept of grid nodes available in MCG. The observation shows significant improvement in the quality of service parameter localization, normalized speedup, and throughput in MCG. The proposed model HGLA and MIN-MIN, MAX-MIN, and HEFT are compared with respect to localization, speedup, and throughput. The results reveal that the proposed model shows better performance over MIN-MIN, MAX-MIN, and HEFT.

Original languageEnglish
Article number8735685
Pages (from-to)78652-78664
Number of pages13
JournalIEEE Access
Volume7
DOIs
Publication statusPublished - 12 Jun 2019

Keywords

  • HEFT
  • localization ratio
  • MAX-MIN
  • MIN-MIN
  • Mobile agent
  • mobility
  • resource allocation
  • resource provisioning
  • speed-up

Cite this

Sahu, D. P., Singh, K., Manju, M., Taniar, D., Tuan, L. M., Son, L. H., ... Long, H. V. (2019). Heuristic search based localization in mobile computational grid. IEEE Access, 7, 78652-78664. [8735685]. https://doi.org/10.1109/ACCESS.2019.2922400
Sahu, Dinesh Prasad ; Singh, Karan ; Manju, Manisha ; Taniar, David ; Tuan, Le Minh ; Son, Le Hoang ; Abdel-Basset, Mohamed ; Long, Hoang Viet. / Heuristic search based localization in mobile computational grid. In: IEEE Access. 2019 ; Vol. 7. pp. 78652-78664.
@article{4c9a47c9372340b09900d10099637167,
title = "Heuristic search based localization in mobile computational grid",
abstract = "In recent years, the number of cell phones in society has increased drastically and they are getting popular due to their computational ability and adaptability. Resource provisioning is important, but still remains NP-hard problem in mobile computational grid (MCG). Once the jobs are assigned to the MCG, the main challenge is how to identify the correct resource according to the job's requirement and use them to execute the sub-jobs. The heuristic methods such as Min-Min, Max-Min, and HEFT can be used to select appropriate resources from the MCG that is assigned for job execution. Since the computational nodes are static and mobile in nature, the performance of such heuristics is not as expected. Such heuristics suffers from low throughput and low speedup. The process of localization is used in a wireless sensor network with good results. The proposed model uses heuristics and localization process for optimizing the quality of service parameter localization, normalized speedup, and throughput in MCG, with the concept of grid nodes available in MCG. The observation shows significant improvement in the quality of service parameter localization, normalized speedup, and throughput in MCG. The proposed model HGLA and MIN-MIN, MAX-MIN, and HEFT are compared with respect to localization, speedup, and throughput. The results reveal that the proposed model shows better performance over MIN-MIN, MAX-MIN, and HEFT.",
keywords = "HEFT, localization ratio, MAX-MIN, MIN-MIN, Mobile agent, mobility, resource allocation, resource provisioning, speed-up",
author = "Sahu, {Dinesh Prasad} and Karan Singh and Manisha Manju and David Taniar and Tuan, {Le Minh} and Son, {Le Hoang} and Mohamed Abdel-Basset and Long, {Hoang Viet}",
year = "2019",
month = "6",
day = "12",
doi = "10.1109/ACCESS.2019.2922400",
language = "English",
volume = "7",
pages = "78652--78664",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "IEEE, Institute of Electrical and Electronics Engineers",

}

Sahu, DP, Singh, K, Manju, M, Taniar, D, Tuan, LM, Son, LH, Abdel-Basset, M & Long, HV 2019, 'Heuristic search based localization in mobile computational grid', IEEE Access, vol. 7, 8735685, pp. 78652-78664. https://doi.org/10.1109/ACCESS.2019.2922400

Heuristic search based localization in mobile computational grid. / Sahu, Dinesh Prasad; Singh, Karan; Manju, Manisha; Taniar, David; Tuan, Le Minh; Son, Le Hoang; Abdel-Basset, Mohamed; Long, Hoang Viet.

In: IEEE Access, Vol. 7, 8735685, 12.06.2019, p. 78652-78664.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Heuristic search based localization in mobile computational grid

AU - Sahu, Dinesh Prasad

AU - Singh, Karan

AU - Manju, Manisha

AU - Taniar, David

AU - Tuan, Le Minh

AU - Son, Le Hoang

AU - Abdel-Basset, Mohamed

AU - Long, Hoang Viet

PY - 2019/6/12

Y1 - 2019/6/12

N2 - In recent years, the number of cell phones in society has increased drastically and they are getting popular due to their computational ability and adaptability. Resource provisioning is important, but still remains NP-hard problem in mobile computational grid (MCG). Once the jobs are assigned to the MCG, the main challenge is how to identify the correct resource according to the job's requirement and use them to execute the sub-jobs. The heuristic methods such as Min-Min, Max-Min, and HEFT can be used to select appropriate resources from the MCG that is assigned for job execution. Since the computational nodes are static and mobile in nature, the performance of such heuristics is not as expected. Such heuristics suffers from low throughput and low speedup. The process of localization is used in a wireless sensor network with good results. The proposed model uses heuristics and localization process for optimizing the quality of service parameter localization, normalized speedup, and throughput in MCG, with the concept of grid nodes available in MCG. The observation shows significant improvement in the quality of service parameter localization, normalized speedup, and throughput in MCG. The proposed model HGLA and MIN-MIN, MAX-MIN, and HEFT are compared with respect to localization, speedup, and throughput. The results reveal that the proposed model shows better performance over MIN-MIN, MAX-MIN, and HEFT.

AB - In recent years, the number of cell phones in society has increased drastically and they are getting popular due to their computational ability and adaptability. Resource provisioning is important, but still remains NP-hard problem in mobile computational grid (MCG). Once the jobs are assigned to the MCG, the main challenge is how to identify the correct resource according to the job's requirement and use them to execute the sub-jobs. The heuristic methods such as Min-Min, Max-Min, and HEFT can be used to select appropriate resources from the MCG that is assigned for job execution. Since the computational nodes are static and mobile in nature, the performance of such heuristics is not as expected. Such heuristics suffers from low throughput and low speedup. The process of localization is used in a wireless sensor network with good results. The proposed model uses heuristics and localization process for optimizing the quality of service parameter localization, normalized speedup, and throughput in MCG, with the concept of grid nodes available in MCG. The observation shows significant improvement in the quality of service parameter localization, normalized speedup, and throughput in MCG. The proposed model HGLA and MIN-MIN, MAX-MIN, and HEFT are compared with respect to localization, speedup, and throughput. The results reveal that the proposed model shows better performance over MIN-MIN, MAX-MIN, and HEFT.

KW - HEFT

KW - localization ratio

KW - MAX-MIN

KW - MIN-MIN

KW - Mobile agent

KW - mobility

KW - resource allocation

KW - resource provisioning

KW - speed-up

UR - http://www.scopus.com/inward/record.url?scp=85068344787&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2019.2922400

DO - 10.1109/ACCESS.2019.2922400

M3 - Article

VL - 7

SP - 78652

EP - 78664

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 8735685

ER -

Sahu DP, Singh K, Manju M, Taniar D, Tuan LM, Son LH et al. Heuristic search based localization in mobile computational grid. IEEE Access. 2019 Jun 12;7:78652-78664. 8735685. https://doi.org/10.1109/ACCESS.2019.2922400