Abstract The growing ubiquity of Internet of Things (IoT) devices within smart homes demands the use of advanced strategies in IoT implementation, with an emphasis on energy efficiency and security. The incorporation of Artificial Intelligence (AI) within the IoT framework improves the overall efficiency of the network. An inefficient mechanism of parent selection at the network layer of IoT causes energy drain in the nodes, particularly near the sink node. As a result, nodes die earlier, causing network holes that further increase the control message overhead as well as the energy consumption of the network, compromising network security. This research introduces an AI‐based approach to parent selection of the Routing Protocol for Low Power and Lossy networks (RPL) at the network layer of IoT to enhance security and energy efficiency. A novel objective function, named Energy and Parent Load Objective Function (EA‐EPL), is also proposed that considers the composite metrics, including energy and parent load. Extensive experiments are conducted to assess EA‐EPL against OF0 and MRHOF algorithms. Experimental results show that EA‐EPL outperformed these algorithms in improving energy efficiency, network stability, and packet delivery ratio. The results also demonstrate a significant enhancement in the overall efficiency of IoT networks and increased security in smart home environments.

Big IoT data is inherently distributed, high-dimensional, irregular, and sparse in nature. Fog computing model in its original form is by no means the optimal solution for mining big IoT data. However, utilizing the network edge for mining tasks, such as enabling edge and IoT devices to mine locally frequent patterns can significantly improve the mining performance. Additionally, edge devices capable of performing distributed job processing could utilize the model to the fullest. But resource poorness of edge and IoT devices needs lightweight pattern mining algorithms. This paper presents Distributed HARnessing the Power of Powersets for Mining Frequent Itemsets (D-HARPP), a spark-based distributed algorithm to mine frequent co-occurring itemsets in big IoT data. Unlike state-of-the-art distributed algorithms, D-HARPP makes a single pass over the data and does not create candidate itemsets; thus, achieves significantly better runtime and consumes the least memory. Moreover, performance of D-HARPP is not deteriorated at lower minimum support thresholds. These distinguishing characteristics make D-HARPP an optimal choice for Spark-enabled edge and IoT devices. D-HARPP has outperformed Spark-Apriori, another distributed algorithm by significant margins, both in terms of runtime and memory consumption, particularly on sparse datasets.

For the last two decades, cybercrimes are growing on a daily basis. To track down cybercrimes and radio network crimes, digital forensic for radio networks provides foundations. The data transfer rate for the next-generation wireless networks would be much greater than today’s network in the coming years. The fifth-generation wireless systems are considering bands beyond 6 GHz. The network design of the next-generation wireless systems depends on propagation characteristics, frequency reuse, and bandwidth variation. This article declares the channel’s propagation characteristics of both line of sight (LoS) and non-LOS (NLoS) to construct and detect the path of rays coming from anomalies. The simulations were carried out to investigate the diffraction loss (DL) and frequency drop (FD). Indoor and outdoor measurements were taken with the omnidirectional circular dipole antenna with a transmitting frequency of 28 GHz and 60 GHz to compare the two bands of the 5th generation. Millimeter-wave communication comes with a higher constraint for implementing and deploying higher losses, low diffractions, and low signal penetrations for the mentioned two bands. For outdoor, a MATLAB built-in 3D ray tracing algorithm is used while for an indoor office environment, an in-house algorithmic simulator built using MATLAB is used to analyze the channel characteristics.

Summary The throughput of a TCP flow depends on the average size of Congestion Window (cwnd) of a congestion control mechanism being used during the communication. The size of cwnd depends upon the usage of available link bandwidth during communication. The response function is a measure of average throughput of a single TCP flow of congestion control mechanism as the level of random packet loss is varied. Nowadays, many organizations are deploying IoT based applications for the analytics of their Big Data. TCP CUBIC and TCP Compound are the default congestion control mechanisms in Linux and Microsoft Windows Operating Systems respectively. Whereas, TCP Reno which is also known as Standard TCP congestion control mechanism is act as a trademark congestion control mechanism. During communication among different IoT applications, TCP CUBIC flows use more available link bandwidth as compared to TCP Reno flows, thus, the average cwnd size of TCP CUBIC flows are greater than the TCP Reno flows. It implies that these both kinds of flows are not sharing available link fairly, which refers as low TCP friendliness of TCP CUBIC. It means that the throughput of TCP CUBIC flows is higher than the trademark congestion control mechanism, i.e., TCP Reno flows. As a result, friendliness behavior or fair share of available link bandwidth among TCP CUBIC flows and TCP Reno flows is decreased. In other words, TCP friendliness of TCP CUBIC flows is reduced. Now, it is important to decrease the average cwnd size of TCP CUBIC flows, such that available link bandwidth can be shared fairly among flows of TCP CUBIC and TCP Reno. The aim of this research is to enhance the TCP friendliness behavior of TCP CUBIC congestion control mechanism for IoT based applications using Big Data. In this paper, an Advance Response Function of TCP CUBIC (ARFC) is designed to share fairly available link bandwidth among flows of TCP CUBIC and TCP Reno. Results show that TCP friendliness behavior of TCP CUBIC is increased by using ARFC. Overall, 18.6% performance is increased by using ARFC.

Summary Most of the data concerning business‐oriented systems are still based on either NoSQL or the relational data model. On the other hand, Semantic Web data model Resource Description Framework (RDF) has become the new standard for data modeling and analysis. Due to this situation integration of NoSQL, Relational Database (RDB) and RDF data models are becoming a required feature of the systems. Many solutions like tools and languages are provided in the shape of the transformation of data from RDB to RDF. This research is aimed to compare and map data models used for transformation between NoSQL, RDB, and Semantic Web. This study will help in achieving much better and enhanced technology‐based systems for retrieval and storage of data among Big‐data annotation using Semantic Web. It is aimed to reduce the response time of queries and offer compatibility with the web and semantically enriched data format. A drugs dataset is being used and transformed to have semantical meaning embedded and linked to support big data localization. At the end of this paper, RDF graph and bar chart are used to represent transformed data after passing through the proposed model. Big data localization helps in gaining fast and accurate results.

Summary Geo‐related data, also known as spatial data, is represented using a vector used for representing longitude, elevation, and latitude. Specially built systems, well known as Geographical Information Systems (GIS), made use of such data for querying, manipulating, navigation, and analyzing. In the current era of data, science needs to involve smart interactive investigation involving Internet of Data (IoD) on predicting upcoming changes and spatial updates on the map is growing rapidly. To resolve issues concerning real‐time spatial data, transformation using semantic annotation can provide a better way to translate spatial relationships. These spatial relationships will support spatial analysis by linking different cause and effect with the help of reasoning mechanism. This research's major focus is on a data transformation methodology for geo‐related semantic annotation. Spatial dataset gets stored in a database and then transformed into Extensible Markup Language (XML) and Resource Description Framework (RDF). Even for bi‐directional transformation to work properly, we need to map different schema level transformations. A deep research is conducted to consider available mappings, implementations, and updates to further improving data fusion for having better compatibility. Then, transformed data as results get analyzed and discussed based on the data mapping rules formulated. It is aimed to show the importance of reducing the response time of investigation and offer compatibility between the web and semantically enriched spatial data.

Among constituents of communication architecture, routing is the most energy squeezing process. In this survey article, we are targeting an innovative aspect of analysis on routing in wireless sensor network (WSN) that has never been seen in the available literature before. This article can be a guiding light for new researchers to comprehend the WSN technology, energy aware routing, and the factors that affect the energy aware routing in WSN. This insight comprehension then makes the ways easy for them in designing such types of algorithms as well as evaluating the authenticity and extending the existing algorithms of this category, since algebraic and graphical modelling of these factors is also demonstrated. Various available techniques used by existing routing algorithms to handle these factors in making themselves energy aware are also given. Further, they are analyzed along with the suggested improvements for the researchers. At the end, we presented our previously published research work as an example and case study of discussed factors. A rich list of references is also cited for interested readers to explore the related given points.