Heuristic Search Based Localization in Mobile Computational Grid

IEEE Access

Manisha Manju¹  Mohamed Abdel-Basset²  Hoang Viet Long³  David Taniar⁴  Le Minh Tuan⁵  Dinesh Prasad Sahu⁶  Karan Singh⁶  Le Hoang Son⁷ 

[1] Department of Computer Science Engineering, G B Pant Government Engineering College, New Delhi, India;Department of Operations Research, Faculty of Computers and Informatics, Zagazig University, Sharqiyah, Egypt;Division of Computational Mathematics and Engineering, Institute for Computational Science, Ton Duc Thang University, Ho Chi Minh City, Vietnam;Faculty of Information Technology, Monash University, Clayton, VIC, Australia;Hanoi University of Home Affairs, Hanoi, Vietnam;School of Computer and Systems Sciences, Jawaharlal Nehru University (JNU), New Delhi, India;VNU Information Technology Institute, Vietnam National University, Hanoi, Vietnam;

关键词: Mobile agent;    mobility;    resource allocation;    speed-up;    localization ratio;    resource provisioning;   

DOI  :  10.1109/ACCESS.2019.2922400

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown