Wireless Sensor Networks (WSNs) are gaining traction in the realm of network communication, renowned for their adaptability, configuration, and flexibility. The forthcoming network traffic within WSNs can be forecasted through temporal sequence models. In this correspondence, We present a method (TSENet) that can accurately predict the traffic in the cellular network. TSENet is composed of transformers and self-attention network. We have designed a temporal transformer module specifically for extracting temporal features. This module accomplishes this by modeling the traffic flow within each grid of the communication network at both near-term and periodical intervals. Simultaneously, we amalgamate the spacial features of each grid with information from its correlated grids, generating spacial predictions within the spacial transformer. Furthermore, we employ self-attention aggregation to capture dependencies between external factor features and celluar data features. Empirical assessments performed on a genuine cellular traffic dataset offer compelling evidence substantiating the efficacy of TSENet.

Wireless sensor networks (WSNs) are a critical research area with numerous practical applications. WSNs are utilized in real-life scenarios, including environmental monitoring, healthcare, industrial automation, smart homes, and agriculture. As WSNs advance and become more sophisticated, they offer limitless opportunities for innovative solutions in various fields. However, due to their unattended nature, it is essential to develop strategies to improve their performance without draining the battery power of the sensor nodes, which is their most valuable resource. This paper proposes a novel sink mobility model based on constructing a bipartite graph from a deployed wireless sensor network. Using the bipartite graph’s properties, the mobile sink node can visit stationary sensor nodes in an optimal way to collect data and transmit it to the base station. We evaluated the proposed approach through simulations using the NS-2 simulator to investigate the performance of wireless sensor networks when adopting this mobility model. Our results show that using the proposed approach can significantly enhance the performance of wireless sensor networks while conserving the energy of the sensor nodes.

In this work, we adapt the fine-tuning algorithm of the Naïve Bayesian (FTNB) classifier to make it more suitable for imbalanced datasets. In particular, we boost misclassified instance probability terms by an amount that is disproportional to the harmonic mean of actual and predicted classes. The intuition is that discriminative attributes when the instance is misclassified would have small probability term pair values in both the actual class due to data scarcity and the predicted class due to weak correlation. Conversely, if both values are relatively high, then the attribute has good data coverage (support) and it should not be a cause for misclassification. Since the harmonic average is dominated by the smaller value and we have an imbalanced dataset, we should enact a large update if both or either term probabilities of actual and predicted classes are small. We used several benchmark datasets (60 different balanced and imbalanced datasets) to determine if the poor performance of the NB classifier is due to the scarcity of data and compared the performance of the proposed algorithm with NB, original FTNB, and other relatively new SOTA Ensemble Imbalanced Classifiers. Our empirical results reveal that the new proposed algorithm significantly outperforms all other classifiers.

The minimum vertex cover (MVC) problem is a canonical NP-hard combinatorial optimization problem, aiming to find a smallest set of vertices such that every edge has at least one endpoint in the set, which has extensive applications in cyber security, scheduling, and monitoring link failures in wireless sensor networks (WSNs). Numerous local search algorithms have been proposed to obtain a “good” vertex cover. However, due to the NP-hard nature, it is challenging to efficiently solve the MVC problem, especially on large graphs. In this paper, we propose an efficient local search algorithm for MVC called TIVC, which is based on two main ideas: A 3-improvements (TI) framework with tiny perturbation, and an edge selection strategy. We conducted experiments on real-world large instances of a massive graph benchmark. Compared with two state-of-the-art MVC algorithms, TIVC shows superior performance in accuracy and possesses a remarkable ability to identify significantly smaller vertex covers on many graphs.

The issues concerning the development of the smart systems for the management of freight transport are related to many factors which are influencing by properties of such a complex processes and ICT development. We are concerned with the recognition of a wide spectrum of services and provision specifics under conditions of wireless communication networks. Also, we are investigated for the adequate provision of context data with problematic of a definition of such context data and with possibilities to apply formalized artificial intelligence methods for recognition of this context information needs for transportation. In this stage of application of the smart system, we are solving the problem of priority of provision of possible providing services, ensuring of quite optimal quality of data supply channels and restriction of flooding of wireless communication channels. The proposed methodology is based on methods of indication of con-text-aware situations and integration of such data into the situation recognition algorithms. The constructions of smart service provision system are developed for more safety management of transportation. The experimental results are demonstrated on analysis of heterogeneity of smart services, construction of schemas for service provision priorities, and extension of potential of intelligent transport with intellectual recognition possibilities of context-aware information in the transportation process.

The development of wireless sensor networks (WSNs) technology comes with inherent limitations and vulnerabilities that make it exploitable by intruders. The fundamental goal of this article is to solve security problems related to black hole attacks, which interfere with the proper performance of the network and can lead to data leakage and loss. The proposed solution in this article is to apply IDS to a WSN for the first time. We also used the NS2.35 simulator to compare the three routing protocols, AODV, AODV under Hacker Node (HNAODV), and the proposed solution (IDSHNAODV) in the WSN model to reduce the effects of black hole attacks.