期刊
IEEE TRANSACTIONS ON MOBILE COMPUTING
卷 17, 期 12, 页码 2898-2911出版社
IEEE COMPUTER SOC
DOI: 10.1109/TMC.2018.2824325
关键词
Opportunistic networks; mobility; service composition; analytical modelling
资金
- EC under the H2020 REPLICATE project [691735]
- EC under the SoBigData project [654024]
- EC under the AUTOWARE project [723909]
Opportunistic computing is a paradigm for completely self-organised pervasive networks. Instead of relying only on fixed infrastructures as the cloud, users devices act as service providers for each other. They use pairwise contacts to collect information about services provided and amount of time to provide them by the encountered nodes. At each node, upon generation of a service request, this information is used to choose the most efficient service, or composition of services, that satisfy that request, based on local knowledge. Opportunistic computing can be exploited in several scenarios, including mobile social networks, IoT, and Internet 4.0. In this paper, we propose an opportunistic computing algorithm based on an analytical model, which ranks the available (composition of) services, based on their expected completion time. Through the model, a service requester picks the one that is expected to be the best. Experiments show that the algorithm is accurate in ranking services, thus providing an effective service-selection policy. Such a policy achieves significantly lower service provisioning times compared to other reference policies. Its performance is tested in a wide range of scenarios varying the nodes mobility, the size of input/output parameters, the level of resource congestion, and the computational complexity of service executions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据