The Social Internet of Things (SIoT) paradigm incorporates social networking concepts with the Internet of Things (IoT) solutions to support novel services. The massive amount of data (big data) produced by SIoT necessitates efficient information processing frameworks to exploit social relationships and comprehend actionable information from real-world observations. Data from AI-enabled sensors (AIS) is typically geo-tagged, thus demanding geo-textual processing for information retrieval and analysis. Social media applications are the main source of geo-textual data as mobile users connect with millions of posts daily. The processing of big geo-textual data requires resource-efficient algorithms and frameworks. Clustering algorithms are often applied to geo-textual data to examine spatial, textual, and temporal information for event detection, sentiment analysis, and search query response. Clustering algorithms on big data are resource-hungry requiring comparisons among all data points to calculate similarity and distance metrics. Existing hybrid clustering techniques execute algorithms collectively on geo-textual data resulting in a enormous footprint for big data. We propose a resource-efficient clustering framework for AIS that hierarchically performs geo-textual clustering without significantly lowering the clustering quality. The proposed framework achieves substantial time and memory efficiency while reducing the overall resource requirements for constrained end-user and edge devices compared to the standard hybrid geo-textual clustering framework. Moreover, we augment the research work by developing open-source scripts for both hierarchical and hybrid clustering frameworks.

Large urban communication networks such as smart cities are an ecosystem of devices and services cooperating to address multiple issues that greatly benefit end users, cities and the environment. LinkNYC is a first-of-its-kind urban communications network aiming to replace all payphones in the five boroughs of New York City (NYC) with kiosk-like structures providing free public Wi-Fi. We consolidate these networks with standalone edge cloud devices known as cloudlets and introduce geographically distributed content delivery cloudlets (CDCs) to store popular Internet content closer to end users; essential in environments with diverse and dynamic content interests. A content-centric and delivery framework is proposed leveraging NYC’s population densities and CDCs for interest-based in-network caching. Analysis shows that although the adoption of multiple CDCs dramatically improves overall network performance, advanced caching policies are needed when considering increased content heterogeneity. Thus, we propose popularity-driven (pLFU) and cooperation-based (sLFU) caching policies at individual CDCs to account for user and content dynamics over time. The amalgamation of urban population densities, multiple CDC placements and smarter caching techniques helps exploit the ultimate benefits of a content-centric urban communications network and dramatically improves overall network performance and responsiveness. Our proposed solutions are validated using LinkNYC as a use-case.

The growth of mobile traffic volume has been exploded because of the rapid improvement of mobile devices and their applications. Heterogeneous networks (HetNets) can be an attractive solution in order to adopt the exponential growth of wireless data. Femtocell networks are accommodated within the concept of HetNets. The implementation of femtocell networks has been considered as an innovative approach that can improve the network’s capacity. However, dense implementation and installation of femtocells would introduce interference, which reduces the network’s performance. Interference occurs when two adjacent femtocells are operated with the same radio resources. In this work, a scheme, which comprises two stages, is proposed. The first step is to distribute radio resources among femtocells, where each femtocell can identify the source of the interference. A constructed table is generated in order to measure the level of interference for each femtocell. Accordingly, the level of interference for each sub-channel can be recognized by all femtocells. The second stage includes a mechanism that helps femtocell base stations adjust their transmission power autonomously to alleviate the interference. It enforces a cost function, which should be realized by each femtocell. The cost function is calculated based on the production of undesirable interference impact, which is introduced by each femtocell. Hence, the transmission power is adjusted autonomously, where undesirable interference can be monitored and alleviated. The proposed scheme is evaluated through a MATLAB simulation and compared with other approaches. The simulation results show an improvement in the network’s capacity. Furthermore, the unfavorable impact of the interference can be managed and alleviated.

The multi-tenancy concept in cloud data center (DC) networks paves the way towards advancements and innovation in the underlying infrastructure such as network virtualization. Multicast routing is essential in leveraging multi-tenancy to its full potential. However, traditional IP multicast routing is not suitable for DC networks due to the need to support a massive amount of multicast groups and hosts. State-of-the-art DC multicast routing approaches aim to overcome these scalability issues by, for instance, taking advantage of the symmetry of DC topologies and the programmability of DC switches to compactly encode multicast group information inside packets, thereby reducing the overhead resulting from the need to store the states of flows at the network switches. Although these approaches scale well with the number of multicast groups, they do not perform well with group sizes and, as a result, yield substantial traffic control overhead and network congestion. In this article, we present Bert, a scalable source-initiated DC multicast routing approach that scales well with both the number and size of multicast groups through the clustering of multicast group members where each cluster employs its own forwarding rules. Compared to the state-of-the-art approach, Bert yields much less traffic control overhead by significantly reducing packet header sizes and eliminating switch memory usage across the switches.