qinglan peng, yunni xia*, mengchu zhou, xin luo, shu wang, yuandou wang, chunrong wu, shanchen pang, mingwei lin. (*corresponding author)
ieee transactions on automation science and engineering
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.
