Abstract

The Social Internet of Things (SIoT) means that every node can use a set of nodes that are considered as friends to search for a specific service. However, this is a slow process because each node is required to manage a high number of friends. Thus, the SIoT issue consists of how to select the right friends that improve the network navigability. The enhancement of the network navigability boosts the search for a service to be rapid but not guaranteed. Furthermore, sending requests from the shortest paths involves the rapid search, but the network lifetime can be reduced due to the number of requests that can be transmitted and processed by the nodes that have low power energy. This paper proposes a new approach that improves the network navigability, speeds up the search process, and increases the network lifetime. This approach aims at creating groups dynamically by nodes where each group has a master node, second, using a consensus algorithm between master nodes to agree with a specific capability, finally adopting a friendship selection method to create a social network. Thus, the friends will be sorted periodically for the objective of creating simultaneously a balance between the energy consumption and the rapid search process. Simulation results on the Brightkite location-based online social network dataset demonstrate that our proposal outperforms baseline methods in terms of some parameters of network navigability, path length to reach the providers, and network lifetime.

Highlights

  • The term Internet of Things (IoT) has been known for the last few years

  • To overcome the limitations associated with Social Internet of Things (SIoT), we propose a new approach with features described as follows

  • This result denotes that we can achieve the provider node quickly. The results of these two parameters are not contradictory, due to the friendship selection in our contribution is focused on the diversification of friends; i.e., it ignores an important number of candidate friends but encourages the social network nodes to make friends from different surrounding areas

Read more

Summary

Introduction

The term Internet of Things (IoT) has been known for the last few years. IoT describes a vision where every object becomes a part of the Internet, and has been recognized as one of the major technological revolutions of this century [1,2]. According to the growth of intelligent devices especially in smart cities, the social Internet of Things offers a new mechanism of communication among nodes, in a distributed manner, with only local information. This mechanism allows the nodes to search for services and resources by themselves instead of the central systems such as servers, cloud computing, etc. The efficiency of Friendship selection strategies is often measured in terms of the parameters of network navigability: giant component, average path length, average local clustering coefficient, average degree, and diameter of the network The enhancement of these parameters boosts rapid search for the service but does not guarantee it. The remainder of this paper is organized as follows: Section 2 introduces the related works, Section 3 includes the problem definition and parameters of a network, Section 4 presents our proposed contribution, Section 5 gives simulation results and discussion, and the final section concludes the paper

Related Works
Problem Definition
Parameters of a Network
Our Proposal
Main Steps
For each request
Construction of Node Groups
Available Resources and Search Factors
Agreement on the Common Group Capability Using a Consensus Algorithm
Social Network Creation
13. For each node j from Li do
Friends Sorting for Service Search
Simulation Setup
Social Network Parameters
Service Search Efficiency
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call