Set pair three-way overlapping community discovery algorithm for weighted social internet of things

There are many problems in Social Internet of Things(IoTs),such as complex topology information,different degree of association between nodes and overlapping communities.The idea of set pair information grain computing and clustering is introduced to solve the above problems so as to accurately describe the similarity between nodes and fully explore the multi-community structure.A Set Pair Three-Way Overlapping Community Discovery Algorithm for Weighted Social Internet of Things(WSIoT-SPTOCD)is proposed.In the local network structure,which fully considers the topological information between nodes,the set pair connection degree is used to analyze the identity,difference and reverse of neighbor nodes.The similarity degree of different neighbor nodes is defined from network edge weight and node degree,and the similarity measurement method of set pair between nodes based on the local information structure is proposed.According to the number of nodes'neighbors and the connection degree of adjacent edges,the clustering intensity of nodes is defined,and an improved algorithm for initial value selection of k-means is proposed.The nodes are allocated according to the set pair similarity between nodes and different communities.Three-way community structures composed of a positive domain,boundary domain and negative domain are generated iteratively.Next,the overlapping node set is generated according to the calculation results of community node membership.Finally,experiments are carried out on artificial networks and real networks.The results show that WSIoT-SPTOCD performs well in terms of standardized mutual information,overlapping community modularity and F1.

Smart object recommendation based on topic learning and joint features in the social internet of things

With the extensive integration of the Internet,social networks and the internet of things,the social internet of things has increasingly become a significant research issue.In the social internet of things application scenario,one of the greatest challenges is how to accurately recommend or match smart objects for users with massive resources.Although a variety of recommendation algorithms have been employed in this field,they ignore the massive text resources in the social internet of things,which can effectively improve the effect of recommendation.In this paper,a smart object recommendation approach named object recommendation based on topic learning and joint features is proposed.The proposed approach extracts and calculates topics and service relevant features of texts related to smart objects and introduces the“thing-thing”relationship information in the internet of things to improve the effect of recommendation.Experiments show that the proposed approach enables higher accuracy compared to the existing recommendation methods.

Automated Service Search Model for the Social Internet of Things

The social internet of things(SIoT)is one of the emerging paradigms that was proposed to solve the problems of network service discovery,navigability,and service composition.The SIoT aims to socialize the IoT devices and shape the interconnection between them into social interaction just like human beings.In IoT,an object can offer multiple services and different objects can offer the same services with different parameters and interest factors.The proliferation of offered services led to difficulties during service customization and service filtering.This problem is known as service explosion.The selection of suitable service that fits the requirements of applications and objects is a challenging task.To address these issues,we propose an efficient automated query-based service search model based on the local network navigability concept for the SIoT.In the proposed model,objects can use information from their friends or friends of their friends while searching for the desired services,rather than exploring a global network.We employ a centrality metric that computes the degree of importance for each object in the social IoT that helps in selecting neighboring objects with high centrality scores.The distributed nature of our navigation model results in high scalability and short navigation times.We verified the efficacy of our model on a real-world SIoT-related dataset.The experimental results confirm the validity of our model in terms of scalability,navigability,and the desired objects that provide services are determined quickly via the shortest path,which in return improves the service search process in the SIoT.

Dynamics modeling and optimal control for multi-information diffusion in Social Internet of Things

As an ingenious convergence between the Internet of Things and social networks,the Social Internet of Things(SIoT)can provide effective and intelligent information services and has become one of the main platforms for people to spread and share information.Nevertheless,SIoT is characterized by high openness and autonomy,multiple kinds of information can spread rapidly,freely and cooperatively in SIoT,which makes it challenging to accurately reveal the characteristics of the information diffusion process and effectively control its diffusion.To this end,with the aim of exploring multi-information cooperative diffusion processes in SIoT,we first develop a dynamics model for multi-information cooperative diffusion based on the system dynamics theory in this paper.Subsequently,the characteristics and laws of the dynamical evolution process of multi-information cooperative diffusion are theoretically investigated,and the diffusion trend is predicted.On this basis,to further control the multi-information cooperative diffusion process efficiently,we propose two control strategies for information diffusion with control objectives,develop an optimal control system for the multi-information cooperative diffusion process,and propose the corresponding optimal control method.The optimal solution distribution of the control strategy satisfying the control system constraints and the control budget constraints is solved using the optimal control theory.Finally,extensive simulation experiments based on real dataset from Twitter validate the correctness and effectiveness of the proposed model,strategy and method.

A Double-Compensation-Based Federated Learning Scheme for Data Privacy Protection in a Social IoT Scenario

Nowadays,smart wearable devices are used widely in the Social Internet of Things(IoT),which record human physiological data in real time.To protect the data privacy of smart devices,researchers pay more attention to federated learning.Although the data leakage problem is somewhat solved,a new challenge has emerged.Asynchronous federated learning shortens the convergence time,while it has time delay and data heterogeneity problems.Both of the two problems harm the accuracy.To overcome these issues,we propose an asynchronous federated learning scheme based on double compensation to solve the problem of time delay and data heterogeneity problems.The scheme improves the Delay Compensated Asynchronous Stochastic Gradient Descent(DC-ASGD)algorithm based on the second-order Taylor expansion as the delay compensation.It adds the FedProx operator to the objective function as the heterogeneity compensation.Besides,the proposed scheme motivates the federated learning process by adjusting the importance of the participants and the central server.We conduct multiple sets of experiments in both conventional and heterogeneous scenarios.The experimental results show that our scheme improves the accuracy by about 5%while keeping the complexity constant.We can find that our scheme converges more smoothly during training and adapts better in heterogeneous environments through numerical experiments.The proposed double-compensation-based federated learning scheme is highly accurate,flexible in terms of participants and smooth the training process.Hence it is deemed suitable for data privacy protection of smart wearable devices.

A Query-Based Greedy Approach for Authentic Influencer Discovery in SIoT

The authors propose an informed search greedy approach that efficiently identifies the influencer nodes in the social Internet of Things with the ability to provide legitimate information.Primarily,the proposed approach minimizes the network size and eliminates undesirable connections.For that,the proposed approach ranks each of the nodes and prioritizes them to identify an authentic influencer.Therefore,the proposed approach discards the nodes having a rank(α)lesser than 0.5 to reduce the network complexity.αis the variable value represents the rank of each node that varies between 0 to 1.Node with the higher value ofαgets the higher priority and vice versa.The threshold valueα=0.5 defined by the authors with respect to their network pruning requirements that can be vary with respect to other research problems.Finally,the algorithm in the proposed approach traverses the trimmed network to identify the authentic node to obtain the desired information.The performance of the proposed method is evaluated in terms of time complexity and accuracy by executing the algorithm on both the original and pruned networks.Experimental results show that the approach identifies authentic influencers on a resultant network in significantly less time than in the original network.Moreover,the accuracy of the proposed approach in identifying the influencer node is significantly higher than that of the original network.Furthermore,the comparison of the proposed approach with the existing approaches demonstrates its efficiency in terms of time consumption and network traversal through the minimum number of hops.

Intelligent Service Search Model Using Emerging Technologies

In recent years,the Internet of Things(IoT)has played a vital role in providing various services to users in a smart city.However,searching for services,objects,data,and frameworks remains a concern.The technological advancements in Cyber-Physical Systems(CPSs)and the Social Internet of Things(SIoT)open a new era of research.Thus,we propose a Cyber-Physical-Social Systems(CPSs)for service search.Herein,service search and object discovery operation carries with the suitable selection of friends in the network.Our proposed model constructs a graph and performs social network analysis(SNA).We suggest degree centrality,clustering,and scalefree emergence and show that a rational selection of friends per service exploration increases the overall network navigability.The efficiency of our proposed system is verified using real-world datasets based on service processing time,path length,giant component,and network diameter.The simulation results proved that our proposed system is efficient,robust,and scalable.

Optimal Data Placement and Replication Approach for SIoT with Edge

Social networks(SNs)are sources with extreme number of users around the world who are all sharing data like images,audio,and video to their friends using IoT devices.This concept is the so-called Social Internet of Things(SIot).The evolving nature of edge-cloud computing has enabled storage of a large volume of data from various sources,and this task demands an efficient storage procedure.For this kind of large volume of data storage,the usage of data replication using edge with geo-distributed cloud service area is suited to fulfill the user’s expectations with low latency.The major issue is the way to store the data and replicate these large data items optimally and allocate the request from the data center efficiently.For efficient storage of these data,we use edge server,which is part of the cloud server,in this study.Thus,the data are distributed and stored with quick access,which will reduce the latency with response.The proposed data placement approach learns with machine learning(ML)algorithm called radial basis kernel function assisted with support vector machine(RBF-SVM)to classify the data center for storing the user and friend’s data from the SIoT devices.These learning algorithms will be used to predict the workload of the data stored in the data center as either edge or cloud depending on the existing time slots.The data placement with dynamic nature is also optimized using the proposed dynamic graph partitioning(GP)method to meet the individual user’s demand of low latency with minimum costs.This way will keep the SIoT data placement efficient and effective over time.Accordingly,this proposed data placement and replication approach introduces three kinds of innovations compared with the existing data placement approach.(i)Rather than storing the user data in a single cloud,this study uses the edge server closest to the SIoT devices for faster access with reduced response time.(ii)The classification algorithm called RBF-SVM is used to find storage for user for reducing data replication.(iii)Dynamic GP is introduced for data placement with reduced latency and minimum cost to fulfil the dynamic nature of the SN.The simulation result of this approach obtains reduced latency of 130 ms and minimum cost compared with those of the existing data placement approaches.Therefore,our proposed data placement with ML-based learning on edge provides promising results in terms of efficiency,effectiveness,and performance with reduced latency and minimum cost.

Dynamic Hypergraph Modeling and Robustness Analysis for SIoT

The Social Internet of Things(SIoT)integrates the Internet of Things(IoT)and social networks,taking into account the social attributes of objects and diversifying the relationship between humans and objects,which overcomes the limitations of the IoT’s focus on associations between objects.Artificial Intelligence(AI)technology is rapidly evolving.It is critical to build trustworthy and transparent systems,especially with system security issues coming to the surface.This paper emphasizes the social attributes of objects and uses hypergraphs to model the diverse entities and relationships in SIoT,aiming to build an SIoT hypergraph generation model to explore the complex interactions between entities in the context of intelligent SIoT.Current hypergraph generation models impose too many constraints and fail to capture more details of real hypernetworks.In contrast,this paper proposes a hypergraph generation model that evolves dynamically over time,where only the number of nodes is fixed.It combines node wandering with a forest fire model and uses two different methods to control the size of the hyperedges.As new nodes are added,the model can promptly reflect changes in entities and relationships within SIoT.Experimental results exhibit that our model can effectively replicate the topological structure of real-world hypernetworks.We also evaluate the vulnerability of the hypergraph under different attack strategies,which provides theoretical support for building a more robust intelligent SIoT hypergraph model and lays the foundation for building safer and more reliable systems in the future.