TY - JOUR
T1 - Reliability-Aware and Deadline-Constrained Mobile Service Composition over Opportunistic Networks
AU - Peng, Qinglan
AU - Xia, Yunni
AU - Zhou, Mengchu
AU - Luo, Xin
AU - Wang, Shu
AU - Wang, Yuandou
AU - Wu, Chunrong
AU - Pang, Shanchen
AU - Lin, Mingwei
N1 - Funding Information:
Manuscript received January 18, 2019; revised November 6, 2019; accepted May 2, 2020. Date of publication June 2, 2020; date of current version July 2, 2021. This article was recommended for publication by Associate Editor Q. Zhao and Editor M. P. Fanti upon evaluation of the reviewers’ comments. This work was supported in part by NSFC under Grant 61472051 and Grant 61772493, in part by the Fundamental Research Funds for the Central Universities under Project 2019CDXYJSJ0022, in part by the Natural Science Foundation of Chongqing (China) under Grant cstc2019jcyjjqX0013, in part by the Universities’ Sci-tech Achievements Transformation Project of Chongqing under Grant KJZH17104, in part by the Chongqing Research Program of Technology Innovation and Application under Grant cstc2017rgzn-zdyfX0020, Grant cstc2017zdcy-zdyf0554, and Grant cstc2017rgzn-zdyf0118, in part by the Chongqing Cultivation Program of Innovation and Entrepreneurship Demonstration Group under Grant cstc2017kjrc-cxcytd0149, and in part by the Chongqing Overseas Scholars Innovation Program under Grant cx2017012 and Grant cx2018011. (Corresponding authors: Yunni Xia; Xin Luo.) Qinglan Peng, Yunni Xia, Yuandou Wang, and Chunrong Wu are with the School of Computers, Chongqing University, Chongqing 400044, China (e-mail: qinglan.peng@hotmail.com; xiayunni@hotmail.com; judiths11@outlook.com; crwu@cqu.edu.cn).
Publisher Copyright:
© 2004-2012 IEEE.
PY - 2021/7
Y1 - 2021/7
N2 - An opportunistic link between two mobile devices or nodes can be constructed when they are within each other's communication range. Typically, cyber-physical environments consist of a number of mobile devices that are potentially able to establish opportunistic contacts and serve mobile applications in a cost-effective way. Opportunistic mobile service computing is a promising paradigm capable of utilizing the pervasive mobile computational resources around the users. Mobile users are thus allowed to exploit nearby mobile services to boost their computing capabilities without investment in their resource pool. Nevertheless, various challenges, especially its quality-of-service and reliability-aware scheduling, are yet to be addressed. Existing studies and related scheduling strategies consider mobile users to be fully stable and available. In this article, we propose a novel method for reliability-aware and deadline-constrained service composition over opportunistic networks. We leverage the Krill-Herd-based algorithm to yield a deadline-constrained, reliability-aware, and well-executable service composition schedule based on the estimation of completion time and reliability of schedule candidates. We carry out extensive case studies based on some well-known mobile service composition templates and a real-world opportunistic contact data set. The comparison results suggest that the proposed approach outperforms existing ones in terms of success rate and completion time of composed services. Note to Practitioners - Recently, the rapid development of mobile devices and mobile communication leads to the prosperity of mobile service computing. Services running on mobile devices within a limited range are allowed to be composed to coordinate through wireless communication technologies and perform complex tasks and business processes. Despite its great potential, mobile service compositions remains a challenge since the mobility of users and devices imposes high unpredictability on the execution of tasks. A careful investigation into existing methods has found their various limitations, e.g., assuming time-invariant availability of mobile services. This article presents a novel reliability-aware and deadline-constrained service composition method for mobile opportunistic networks. Instead of assuming time-invariant availability of mobile nodes, the proposed method is capable of estimating service availability at run-time and leveraging a Krill-Herd-based algorithm to yield the deadline-constrained, reliability-aware, and well-executable service composition schedules. Case studies based on well-known service composition templates and real-world data sets suggest that it outperforms traditional ones in terms of success and completion time of composed services. It can thus aid the design and optimization of composite services as well as their smooth execution in a mobile environment. It can help practitioners better manage the reliability and performance of real-world applications built upon mobile services.
AB - An opportunistic link between two mobile devices or nodes can be constructed when they are within each other's communication range. Typically, cyber-physical environments consist of a number of mobile devices that are potentially able to establish opportunistic contacts and serve mobile applications in a cost-effective way. Opportunistic mobile service computing is a promising paradigm capable of utilizing the pervasive mobile computational resources around the users. Mobile users are thus allowed to exploit nearby mobile services to boost their computing capabilities without investment in their resource pool. Nevertheless, various challenges, especially its quality-of-service and reliability-aware scheduling, are yet to be addressed. Existing studies and related scheduling strategies consider mobile users to be fully stable and available. In this article, we propose a novel method for reliability-aware and deadline-constrained service composition over opportunistic networks. We leverage the Krill-Herd-based algorithm to yield a deadline-constrained, reliability-aware, and well-executable service composition schedule based on the estimation of completion time and reliability of schedule candidates. We carry out extensive case studies based on some well-known mobile service composition templates and a real-world opportunistic contact data set. The comparison results suggest that the proposed approach outperforms existing ones in terms of success rate and completion time of composed services. Note to Practitioners - Recently, the rapid development of mobile devices and mobile communication leads to the prosperity of mobile service computing. Services running on mobile devices within a limited range are allowed to be composed to coordinate through wireless communication technologies and perform complex tasks and business processes. Despite its great potential, mobile service compositions remains a challenge since the mobility of users and devices imposes high unpredictability on the execution of tasks. A careful investigation into existing methods has found their various limitations, e.g., assuming time-invariant availability of mobile services. This article presents a novel reliability-aware and deadline-constrained service composition method for mobile opportunistic networks. Instead of assuming time-invariant availability of mobile nodes, the proposed method is capable of estimating service availability at run-time and leveraging a Krill-Herd-based algorithm to yield the deadline-constrained, reliability-aware, and well-executable service composition schedules. Case studies based on well-known service composition templates and real-world data sets suggest that it outperforms traditional ones in terms of success and completion time of composed services. It can thus aid the design and optimization of composite services as well as their smooth execution in a mobile environment. It can help practitioners better manage the reliability and performance of real-world applications built upon mobile services.
KW - Intelligent optimization
KW - Krill-Herd algorithm
KW - mobile computing
KW - mobile opportunistic network
KW - mobile service composition
KW - service reliability
UR - http://www.scopus.com/inward/record.url?scp=85112718686&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85112718686&partnerID=8YFLogxK
U2 - 10.1109/TASE.2020.2993218
DO - 10.1109/TASE.2020.2993218
M3 - Article
AN - SCOPUS:85112718686
SN - 1545-5955
VL - 18
SP - 1012
EP - 1025
JO - IEEE Transactions on Automation Science and Engineering
JF - IEEE Transactions on Automation Science and Engineering
IS - 3
M1 - 9106793
ER -