The Internet of Things (IoT) is an interconnected network of heterogeneous entities, such as sensors and embedded devices. During the current era, a new field of research has emerged, referred to as the social IoT, which mainly includes social networking features. The social IoT refers to devices that are capable of creating interactions with each other to independently achieve a common goal. Based on the structure, the support of numerous applications, and networking services, the social IoT is preferred over the traditional IoT. However, aspects like the roles of users and network navigability are major challenges that provoke users’ fears of data disclosure and privacy violations. Thus, it is important to provide reliable data analyses by using trust- and friendliness-based properties. This study was designed because of the limited availability of information in this area. It is a classified catalog of trust- and friendliness-based approaches in the social IoT with important highlights of important constraints, such as scalability, adaptability, and suitable network structures (for instance, human-to-human and human-to-object). In addition, typical concerns like communities of interest and social contacts are discussed in detail, with particular emphasis on friendliness- and trust-based properties, such as service composition, social similarity, and integrated cloud services.

The Internet of Things (IoT) is a recent evolutionary technology that has been the primary focus of researchers for the last two decades. In the IoT, an enormous number of objects are connected together using diverse communications protocols. As a result of this massive object connectivity, a search for the exact service from an object is difficult, and hence the issue of scalability arises. In order to resolve this issue, the idea of integrating the social networking concept into the IoT, generally referred as the Social Internet of Things (SIoT) was introduced. The SIoT is gaining popularity and attracting the attention of the research community due to its flexible and spacious nature. In the SIoT, objects have the ability to find a desired service in a distributed manner by using their neighbors. Although the SIoT technique has been proven to be efficient, heterogeneous devices are growing so exponentially that problems can exist in the search for the right object or service from a huge number of devices. In order to better analyze the performance of services in an SIoT domain, there is a need to impose a certain set of rules on these objects. Our novel contribution in this study is to address the link selection problem in the SIoT by proposing an algorithm that follows the key properties of navigability in small-world networks, such as clustering coefficients, path lengths, and giant components. Our algorithm empowers object navigability in the SIoT by restricting the number of connections for objects, eliminating old links or having fewer connections. We performed an extensive series of experiments by using real network data sets from social networking sites like Brightkite and Facebook. The expected results demonstrate that our algorithm is efficient, especially in terms of reducing path length and increasing the average clustering coefficient. Finally, it reflects overall results in terms of achieving easier network navigation. Our algorithm can easily be applied to a single node or even an entire network.

No abstract

Internet of things plays a vital role in providing various services to users. Significant volumes of data are generated from the communication between a large numbers of heterogeneous devices over the Internet. Big data technology is generally used to handle the large volume of data. Complex networks are graphs (networks) having non-trivial topological features, such as random graphs and lattices. Big data of complex networks concerns big data methods that can be used to analyze massive structural data sets, including considerably large networks and sets of graphs. This study is based on the critical phenomenon arising in complex networks that enable us to analytically predict the hotspots in smart cities. Hotspots are places with significantly high communication traffic relative to others. In this study, we propose a cyber-physical-social system for the analysis of high communication traffic hotspots using telecom data. The proposed model constructs a graph, and perform social network analysis on it. The process of hotspot extraction is performed, followed by social network analysis, which is conducted by quantifying the importance of each hotspot based on network metrics. These metrics aid in determining the importance of each hotspot in a telecom data network. Our objective is to prioritize different areas and detect hotspots quickly. Our results indicate that the proposed model has an efficiency comparable with that of state of the art methods. This research study will be helpful for urban planning and development, as well as in upgrading telecommunication infrastructure.

We proposed an innovative reversible data hiding technique that is formulated on histogram shifting by using multilayer localized n-bit truncation image (LBPTI), namely, generated form 8-bit plane by means of efficient lossless compression. After selecting the reference point from the block, the neighbor topmost points are used to attain the data embedding without modifying the peak point; in addition, the key information regarding peak point is not mandatory in extraction end to extract the secret information. In order to make the embedded cover-image similar to the histogram of original cover-image, we exploited the localization with efficient lossless compression on lower block level to increase the embedding capacity while controlling extra bit to expand additional embedding capacity on optimum level besides sustaining the quality of cover-image.