Friendship Selection in the Social Internet of Things: Challenges and Possible Strategies

摘要

The Internet of Things (IoT) is expected to be overpopulated by a very large number of objects, with intensive interactions, heterogeneous communications, and millions of services. Consequently, scalability issues will arise from the search of the right object that can provide the desired service. A new paradigm known as Social Internet of Things (SIoT) has been introduced and proposes the integration of social networking concepts into the Internet of Things. The underneath idea is that every object can look for the desired service using its friendships, in a distributed manner, with only local information. In the SIoT it is very important to set appropriate rules in the objects to select the right friends as these impact the performance of services developed on top of this social network. In this work, we addressed this issue by analyzing possible strategies for the benefit of overall network navigability. We first propose five heuristics, which are based on local network properties and that are expected to have an impact on the overall network structure. We then perform extensive experiments, which are intended to analyze the performance in terms of giant components, average degree of connections, local clustering, and average path length. Unexpectedly, we discovered that minimizing the local clustering in the network allowed for achieving the best results in terms of average path length. We have conducted further analysis to understand the potential causes, which have been found to be linked to the number of hubs in the network.