Abstract:

       Aiming at the existing problems of incredible nodes and services of services coverage in social network, a model of trustworthy services coverage is built up. The model represents the relationship between social network nodes and services. After recognizing the excellent nodes and ordinary nodes, it can enhance the credibility and maximum of services coverage by the excellent nodes. The optimalpathfinding algorithm is designed to find the optimal coverage path, which can ensure the nodes connectivity. As the excellent nodes is utilized as the source nodes, the services coverage algorithm is given to achieve the maximum coverage for trustworthy services within the specified coverage radius. We evaluate the performance of our approach under the social network services coverage model. The experimental results demonstrate the effectiveness and efficiency of our approach.

Key words: social network;trustworthy services;excellent nodes;services maximum coverage