As the field of data science grows, document analytics has become a more challenging task for rough classification, response analysis, and text summarization. These tasks are used for the analysis of text data from various intelligent sensing systems. The conventional approach for data analytics and text processing is not useful for big data coming from intelligent systems. This work proposes a novel TF/IDF algorithm with the temporal Louvain approach to solve the above problem. Such an approach is supposed to help the categorization of documents into hierarchical structures showing the relationship between variables, which is a boon to analysts making essential decisions. This paper used public corpora, such as Reuters-21578 and 20 Newsgroups for massive-data analytic experimentation. The result shows the efficacy of the proposed algorithm in terms of accuracy and execution time across six datasets. The proposed approach is validated to bring value to big text data analysis. Big data handling with map-reduce has led to tremendous growth and support for tasks like categorization, sentiment analysis, and higher-quality accuracy from the input data. Outperforming the state-of-the-art approach in terms of accuracy and execution time for six datasets ensures proper validation.

Artificial I ntelligence-based Q uorum s ystems a re used to solve the energy crisis in real-time wireless sensor networks. They tend to improve the coverage, connectivity, latency, and lifespan of the networks where millions of sensor nodes need to be deployed in a smart grid system. The reality is that sensors may consume more power and reduce the lifetime of the network. This paper proposes a quorum-based grid system where the number of sensors in the quorum is increased without actually increasing quorums themselves, leading to improvements in throughput and latency by 14.23%. The proposed artificial intelligence scheme reduces the network latency due to an increase in time slots over conventional algorithms previously proposed. Secondly, energy consumption is reduced by weighted load balancing, improving the network's actual lifespan. Our experimental results show that the coverage rate is increased on an average of 11% over the conventional Coverage Contribution Area (CCA), Partial Coverage with Learning Automata (PCLA), and Probabilistic Coverage Protocol (PCP) protocols respectively.

No abstract

A wireless sensor network (WSN) consists of several tiny sensor nodes to monitor, collect, and transmit the physical information from an environment through the wireless channel. The node failure is considered as one of the main issues in the WSN which creates higher packet drop, delay, and energy consumption during the communication. Although the node failure occurred mostly due to persistent energy exhaustion during transmission of data packets. In this paper, Artificial Neural Network (ANN) based Node Failure Detection (NFD) is developed with cognitive radio for detecting the location of the node failure. The ad hoc on-demand distance vector (AODV) routing protocol is used for transmitting the data from the source node to the base station. Moreover, the Mahalanobis distance is used for detecting an adjacent node to the node failure which is used to create the routing path without any node failure. The performance of the proposed ANN-NFD method is analysed in terms of throughput, delivery rate, number of nodes alive, drop rate, end to end delay, energy consumption, and overhead ratio. Furthermore, the performance of the ANN-NFD method is evaluated with the header to base station and base station to header (H2B2H) protocol. The packet delivery rate of the ANN-NFD method is 0.92 for 150 nodes that are high when compared to the H2B2H protocol. Hence, the ANN-NFD method provides data consistency during data transmission under node and battery failure.

No abstract