Search Results (65)

Wireless sensor networks (WSNs) are sophisticated monitoring systems that gather environmental data via wireless sensors. Numerous wireless sensors that have been placed to monitor and gather data on a particular environment make up these networks. Typically, a base station or central node wirelessly collects the data prior to analysis. As the battery in wireless sensors is both non-replaceable and non-rechargeable, it represents a key element. As a result, optimizing energy consumption in WSN has become a growing concern. One of the key challenges is consequently the creation of effective protocols for communication in WSNs. In this article, we provide a novel MSA (Mosquito Swarm Algorithm) technique for cluster formation and data routing. Simulations indicate that our proposed algorithm conserves the energy of the nodes and keeps them running for a greater number of survival rounds compared to LEACH (Low-Energy Adaptive Clustering Hierarchy) by a difference of 70.14%, PSO-R (Particle Swarm Optimization with routing) by a difference of 4.76%, and BA-R (Bat Algorithm with routing) by a difference of 2.52%. Our algorithm provides the highest throughput, surpassing LEACH by approximately 6.38%, PSO-R by almost 1%, and BA-R by 12.67%. Simulations indicate that our algorithm is highly effective at extending network longevity and increasing throughput, making it the preferred option to lower energy consumption in WSNs. Full article

This paper introduces a novel physical layer authentication technique for Internet of Things (IoT) networks, leveraging channel state information (CSI) data from Wi-Fi signals to distinguish between authorised and unauthorised nodes and thereby enhancing security without compromising performance. The core novelty lies in its integrated framework, which employs non-negative matrix factorization (NMF) for efficient feature selection and a Gaussian mixture model (GMM) for identifying complex patterns within the CSI data specifically adapted to the dynamic nature of IoT networks. NMF is utilised to mitigate the high dimensionality and redundancy inherent in raw CSI metrics, reducing processing load, extracting salient features, alleviating overfitting risks, and exhibiting superior resilience to noise. Following NMF, the GMM component is used for data classification, capitalising on its probabilistic and soft clustering attributes to represent intricate distributions and handle heterogeneous CSI data characteristics. This integrated proposed methodology not only exploits the inherent nonlinear and probabilistic characteristics of CSI data but also upholds computational efficiency, making it highly suitable for implementation in resource-constrained IoT wireless networks. The model achieves exceptional classification proficiency, with an accuracy rate of 99.83 percent and a recall of 100 percent, which are crucial for cybersecurity and anomaly detection. Furthermore, the system is designed for efficiency and minimal resource consumption, exhibiting good computational efficiency, reduced training duration, and lower energy consumption compared with more complex, heavily exploited architectures for CSI data processing like CNN and CNN + LSTM, making it particularly suitable for resource-constrained IoT environments. Full article

Wireless sensor networks (WSNs) are recognized as a promising enabling technology for health monitoring of elongated infrastructures such as bridges, tunnels and railways. However, the significant distribution span of WSN nodes within narrow spaces requires monitoring data to be transmitted to the base station via multi-hop routing, which poses higher demands on network energy efficiency and lifespan. This paper proposes a Multi-hop Cluster Routing Algorithm based on an Improved Sparrow Search Algorithm (ISSAMC) aimed at optimizing the optimal multi-hop path from cluster heads (CHs) to the base station, thereby extending the stability period and overall lifespan of WSNs in narrow spaces. The ISSAMC first employs a non-uniform clustering mechanism, taking into account the residual energy of nodes and the distance to the base station, to generate a CH distribution that aligns with the topological characteristics of the narrow structure. Next, a multi-objective fitness function is constructed to simultaneously minimize the total energy consumption of the CHs and the variance in energy consumption, along with a dynamic weight adjustment strategy to adapt to the time-varying characteristics of the network state. Finally, multi-hop path optimization is performed using an improved SSA that incorporates strategies such as population initialization based on Sobol sequences, discrete encoding and decoding mechanisms, and crossover techniques, resulting in high-quality multi-hop paths. Simulation results show that under the unified ideal simulation benchmark, compared with MH-LEACH, GAECH, BEBMCR and EBPSO algorithms, ISSAMC improves the network stability period by 231%, 94%, 60% and 49.5%, respectively, and extends the overall network lifetime by 55%, 31%, 25.5% and 24%, respectively. Full article

Conventional clustering techniques for urban water consumption profiling treat each household as an independent entity, thereby disregarding the spatial, socioeconomic, and infrastructural contexts that jointly govern demand behavior. This structural limitation prevents the extraction of contextually coherent consumption profiles—a critical shortcoming for utility managers who must design spatially targeted conservation interventions. To overcome this, we propose Simple GLAC, a novel graph clustering framework that leverages graph neural networks with an adaptive attention mechanism to dynamically model these complex interdependencies. The model’s end-to-end training jointly optimizes a latent representation for cluster cohesion, separation, and spatial homogeneity, where each household’s multi-month consumption record serves as the node feature vector encoding temporal consumption patterns. Evaluated on a large-scale real-world dataset of 4590 residential households across four distinct graph topologies, Simple GLAC consistently achieves superior multi-metric performance over both traditional and graph-based benchmarks, yielding interpretable and operationally actionable consumption profiles aligned with the spatial, administrative, socioeconomic, and infrastructural dimensions of urban water governance in the studied context. This work provides a data-driven tool for utility managers to deploy targeted water conservation strategies, with findings grounded in a Colombian mid-sized city and generalization to broader urban settings identified as a priority direction for future work. Full article

Mobile ad hoc networks (MANETs) are highly vulnerable to denial-of-service (DoS) attacks because their decentralized operation, rapidly changing topology, and constrained node resources limit the use of heavyweight security mechanisms. This paper presents an Adaptive Clustering and Random-Forest-based Intrusion Detection System (ACRF-IDS), a lightweight intrusion detection framework that combines mobility-aware adaptive clustering with supervised learning to detect network-layer DoS behaviors. Cluster heads are elected using a multi-metric utility (residual energy, link stability, and mobility) to stabilize observations under node movement. Within fixed monitoring windows, cluster heads aggregate routing-, forwarding-, and energy-related features and classify nodes using a Random Forest model; a temporal voting scheme further suppresses transient mobility-induced alarms. Using ns-2.35 simulations with Ad hoc On-Demand Distance Vector (AODV) and both flooding and blackhole DoS scenarios, ACRF-IDS is compared with (i) a static clustering-based threshold IDS, (ii) a non-clustered Support Vector Machine (SVM)-based IDS, and (iii) AIFAODV, which specializes in flooding. Across the evaluated network sizes (4–50 nodes), the proposed method achieves a higher detection rate and F1-score while maintaining a lower false positive rate than the baseline techniques. We additionally quantify network-level impact using PDR, throughput, and routing overhead, showing that ACRF-IDS improves availability under DoS while adding bounded overhead. Future work will extend the evaluation to more diverse attack behaviors and validate the approach in real-world MANET testbeds. Full article

Jiangnan water towns, as distinctive cultural landscapes in China, are confronting the dual challenge of surging tourist flows and imbalances in spatial distribution. Research on pedestrian dynamics has so far offered narrow coverage of influencing factors and limited insight into underlying mechanisms, falling short of a systemic perspective and an interpretable theoretical framework. This study uses Nanxun Ancient Town as a case study to address this gap. Pedestrian trajectories were captured using temporarily installed closed-circuit television (CCTV) cameras within the scenic area and extracted using the YOLOv8 object detection algorithm. These data were then integrated with quantified environmental indicators and analyzed through Random Forest regression with SHapley Additive exPlanations (SHAP) interpretation, enabling quantitative and interpretable exploration of pedestrian dynamics. The results indicate nonlinear and context-dependent effects of environmental factors on pedestrian dynamics and that tourist flows are jointly shaped by multi-level, multi-type factors and their interrelations, producing complex and adaptive impact pathways. First, within this enclosed scenic area, spatial morphology—such as lane width, ground height, and walking distance to entrances—imposes fundamental constraints on global crowd distributions and movement patterns, whereas spatial accessibility does not display its usual salience in this context. Second, perceptual and functional attributes—including visual attractiveness, shading, and commercial points of interest—cultivate local “visiting atmospheres” through place imagery, perceived comfort, and commercial activity. Finally, nodal elements—such as signboards, temporary vendors, and public service facilities—produce multi-scale, site-centered effects that anchor and perturb flows and reinforce lingering, backtracking, and clustering at bridgeheads, squares, and comparable nodes. This study advances a shift from static and global description to a mechanism-oriented explanatory framework and clarifies the differentiated roles and linkages among environmental factors by integrating video-based trajectory analytics with machine learning interpretation. This framework demonstrates the applicability of surveillance and computer vision techniques for studying pedestrian dynamics in small-scale heritage settings, and offers practical guidance for heritage conservation and sustainable tourism management in similar historic environments. Full article

Wireless Sensor Networks (WSNs) consist of numerous battery-powered sensor nodes that operate with limited energy, computation, and communication capabilities. Designing routing strategies that are both energy-efficient and attack-resilient is essential for extending network lifetime and ensuring secure data delivery. This paper proposes Adaptive Federated Reinforcement Learning-Hunger Games Search (AFRL-HGS), a Hybrid Routing framework that integrates multiple advanced techniques. At the node level, tabular Q-learning enables each sensor node to act as a reinforcement learning agent, making next-hop decisions based on discretized state features such as residual energy, distance to sink, congestion, path quality, and security. At the network level, Federated Reinforcement Learning (FRL) allows the sink node to aggregate local Q-tables using adaptive, energy- and performance-weighted contributions, with Polyak-based blending to preserve stability. The binary Hunger Games Search (HGS) metaheuristic initializes Cluster Head (CH) selection and routing, providing a well-structured topology that accelerates convergence. Security is enforced as a constraint through a lightweight trust and anomaly detection module, which fuses reliability estimates with residual-based anomaly detection using Exponentially Weighted Moving Average (EWMA) on Round-Trip Time (RTT) and loss metrics. The framework further incorporates energy-accounted control plane operations with dual-format HELLO and hierarchical ADVERTISE/Service-ADVERTISE (SrvADVERTISE) messages to maintain the routing tables. Evaluation is performed in a hybrid testbed using the Graphical Network Simulator-3 (GNS3) for large-scale simulation and Kali Linux for live adversarial traffic injection, ensuring both reproducibility and realism. The proposed AFRL-HGS framework offers a scalable, secure, and energy-efficient routing solution for next-generation WSN deployments. Full article

Graph clustering is an efficient method for deep clustering that utilizes graph convolution. Graph convolution effectively combines structure and content information, and lots of recent graph convolution-based methods have shown promising results in clustering performance on actual attribution networks. However, the established methods mainly employ a fixed graph convolution order, and limited studies have focused on the flexible choice of k-order graph convolution. When utilizing graph convolution with a fixed low order, only considering a few hops per node or neighbors within a set range of hops fails to maximize node relationships or account for the variations within the graphs. In this paper, we propose an adaptive method for graph clustering using a three-way decision idea. Our method enables the adaptive selection of k-order graph convolution for different graphs by searching for the k-order convolution kernel that best suits the subsequent clustering task. Additionally, our approach uses higher-order graph convolution to capture the global clustering structure. We assess the effectiveness of our approach through theoretical analysis and extensive experiments on benchmark datasets. Empirical evidence indicates that our method surpasses state-of-the-art techniques. Full article

This study proposes a computational framework that transforms eye-tracking analysis from statistical description to cognitive structure modeling, aiming to reveal the organizational features embedded in the viewing process. Using the designers’ observation of a traditional Chinese landscape painting as an example, the study draws on the goal-oriented nature of design thinking to suggest that such visual exploration may exhibit latent structural tendencies, reflected in patterns of fixation and transition. Rather than focusing on traditional fixation hotspots, our four-dimensional framework (Region, Relation, Weight, Time) treats viewing behavior as structured cognitive networks. To operationalize this framework, we developed a data-driven computational approach that integrates fixation coordinate transformation, K-means clustering, extremum point detection, and linear interpolation. These techniques identify regions of concentrated visual attention and define their spatial boundaries, allowing for the modeling of inter-regional relationships and cognitive organization among visual areas. An adaptive buffer zone method is further employed to quantify the strength of connections between regions and to delineate potential visual nodes and transition pathways. Three design-trained participants were invited to observe the same painting while performing a think-aloud task, with one participant selected for the detailed demonstration of the analytical process. The framework’s applicability across different viewers was validated through consistent structural patterns observed across all three participants, while simultaneously revealing individual differences in their visual exploration strategies. These findings demonstrate that the proposed framework provides a replicable and generalizable method for systematically analyzing viewing behavior across individuals, enabling rapid identification of both common patterns and individual differences in visual exploration. This approach opens new possibilities for discovering structural organization within visual exploration data and analyzing goal-directed viewing behaviors. Although this study focuses on method demonstration, it proposes a preliminary hypothesis that designers’ gaze structures are significantly more clustered and hierarchically organized than those of novices, providing a foundation for future confirmatory testing. Full article

Community detection in complex networks remains a significant challenge due to noise, outliers, and the dependency on predefined clustering parameters. This study introduces GraphDBSCAN, an adaptive community detection framework that integrates an optimized density-based clustering method with an enhanced graph partitioning approach. The proposed method refines clustering accuracy through three key innovations: (1) a K-nearest neighbor (KNN)-based strategy for automatic parameter tuning in density-based clustering, eliminating the need for manual selection; (2) a proximity-based feature extraction technique that enhances node representations while preserving network topology; and (3) an improved edge removal strategy in graph partitioning, incorporating additional centrality measures to refine community structures. GraphDBSCAN is evaluated on real-world and synthetic datasets, demonstrating improvements in modularity, noise reduction, and clustering robustness. Compared to existing methods, GraphDBSCAN consistently enhances structural coherence, reduces sensitivity to outliers, and improves community separation without requiring fixed parameter assumptions. The proposed method offers a scalable, data-driven approach to community detection, making it suitable for large-scale and heterogeneous networks. Full article

In urban gas network leakage monitoring, the optimized placement of sensors plays a pivotal role in ensuring public safety and minimizing system maintenance costs. This study introduces an innovative approach that integrates hierarchical clustering with ant colony optimization (ACO) to optimize sensor layouts in urban gas networks. The hierarchical clustering technique is first employed to evaluate the strategic importance of each monitoring node, which subsequently influences the pheromone importance parameter in the ACO algorithm. Furthermore, the proposed method accounts for soil types and gas diffusion characteristics, which affect the pheromone concentration gradient, as well as the physical distances between nodes, which determine the heuristic factors in the algorithm. By finely tuning these parameters, the method achieves a significant reduction in the number of sensors required while ensuring comprehensive network coverage, thereby improving economic and operational efficiency. The optimized sensor layout not only accelerates the response to gas leaks but also enhances the system’s adaptability to complex urban environments. Simulation and field test results validate the effectiveness of this optimization approach, demonstrating its practical value in advancing the safety management of urban gas networks. Full article

Subspace learning has achieved promising performance as a key technique for unsupervised feature selection. The strength of subspace learning lies in its ability to identify a representative subspace encompassing a cluster of features that are capable of effectively approximating the space of the original features. Nonetheless, most existing unsupervised feature selection methods based on subspace learning are constrained by two primary challenges. (1) Many methods only predominantly focus on the relationships between samples in the data space but ignore the correlated information between features in the feature space, which is unreliable for exploiting the intrinsic spatial structure. (2) Graph-based methods typically only take account of one-order neighborhood structures, neglecting high-order neighborhood structures inherent in original data, thereby failing to accurately preserve local geometric characteristics of the data. To pursue filling this gap in research, taking dual high-order graph learning into account, we propose a framework called subspace learning for dual high-order graph learning based on Boolean weight (DHBWSL). Firstly, a framework for unsupervised feature selection based on subspace learning is proposed, which is extended by dual-graph regularization to fully investigate geometric structure information on dual spaces. Secondly, the dual high-order graph is designed by embedding Boolean weights to learn a more extensive node from the original space such that the appropriate high-order adjacency matrix can be selected adaptively and flexibly. Experimental results on 12 public datasets demonstrate that the proposed DHBWSL outperforms the nine recent state-of-the-art algorithms. Full article

Power transformers are vital components of electrical power systems, ensuring reliable and efficient energy transfer between high-voltage transmission and low-voltage distribution networks. However, they are prone to various faults, such as insulation breakdowns, winding deformations, partial discharges, and short circuits, which can disrupt electrical service, incur significant economic losses, and pose safety risks. Traditional fault diagnosis methods, including visual inspection, dissolved gas analysis (DGA), and thermal imaging, face challenges such as subjectivity, intermittent data collection, and reliance on expert interpretation. To address these limitations, this paper proposes a novel distributed approach for multi-fault diagnosis of power transformers based on a self-organizing neural network combined with data augmentation and incremental learning techniques. The proposed framework addresses critical challenges, including data quality issues, computational complexity, and the need for real-time adaptability. Data cleaning and preprocessing techniques improve the reliability of input data, while data augmentation generates synthetic samples to mitigate data imbalance and enhance the recognition of rare fault patterns. A two-stage classification model integrates unsupervised and supervised learning, with k-means clustering applied in the first stage for initial fault categorization, followed by a self-organizing neural network in the second stage for refined fault diagnosis. The self-organizing neural network dynamically suppresses inactive nodes and optimizes its training parameter set, reducing computational complexity without sacrificing accuracy. Additionally, incremental learning enables the model to continuously adapt to new fault scenarios without modifying its architecture, ensuring real-time performance and adaptability across diverse operational conditions. Experimental validation demonstrates the effectiveness of the proposed method in achieving accurate, efficient, and adaptive fault diagnosis for power transformers, outperforming traditional and conventional machine learning approaches. This work provides a robust framework for integrating advanced machine learning techniques into power system monitoring, paving the way for automated, real-time, and reliable transformer fault diagnosis systems. Full article

Wireless body area networks (WBANs) have great potential to supply society with vital technical services, but the low power of network nodes severely hampers their development. To solve this problem, Energy-Efficient, a low-power cluster-based routing system intended for precise biological data gathering in WBANs, is presented in this study. This approach comprises three main stages: data aggregation, cluster head (CH) selection, and cluster creation. The suggested approach balances biosensor energy and optimizes energy usage by utilizing the modified snake swarm optimization algorithm (MSSOA) for routing and the adaptive binary bird swarm optimization algorithm (ABBSOA) for cluster formation and CH selection. The suggested technique outperforms the most recent WBAN routing protocols, including MT-MAC, ALOC, DHCO, and M-GWO, by using a power-balancing routing tree and considering biosensor distance and remaining energy. The experimental results demonstrate that the proposed ABBSOA-MSSOA model achieves a jitter protocol value of 0.3 ms at 100 nodes, a buffer occupancy ratio of 2.5%, a cluster lifetime of 600 s, a cluster building time of 12.2 s, an energy consumption of 42 mJ, a communication overhead of 8.3%, a packet delivery ratio of 98.2%, and an average end-to-end delay of 25 ms compared to other existing methods. Full article

The traditional power grid planning lacks consideration of the uncertainty and correlation between wind and solar joint output in the same region, which poses challenges to the stable operation of the power system. Therefore, it is greatly important to consider the environmental and economic dispatch in light of the uncertainties and correlations associated with wind and solar energy. To tackle these issues, this paper introduces a dynamic environmental economic dispatch model that accounts for the uncertainties and correlations between wind and photovoltaic power based on their output characteristics. Initially, a probability model for photovoltaic–wind joint power is established using the Copula function. Subsequently, the Latin hypercube sampling method is employed alongside an improved K-means clustering technique to derive typical output scenarios. An adaptive multi-objective fireworks algorithm, featuring a differential selection strategy, is then utilized to enhance the environmental economic dispatch model. Finally, the IEEE 39 node system is used as an example to demonstrate the solution of the dynamic environmental and economic scheduling model. Simulation results reveal that the method for generating typical output scenarios presented in this paper effectively captures the uncertainties and correlations of photovoltaic–wind joint power. Furthermore, when compared to other optimization algorithms, the improved adaptive multi-objective fireworks algorithm proves to be more efficient in addressing the dynamic environmental economic dispatch challenges within the power system. Full article