Secure routing is crucial for wireless sensor networks (WSNs) because they are vulnerable to various attacks. In this paper, we propose a new secure routing protocol for WSNs in the presence of malicious nodes. For each relay node in the route, associated information such as its trust value and status is considered in the protocol. The trust value is defined as the attack probability of the node according to previous packet-forwarding behaviors, and the status is a hybrid metric that combines the residual energy and distance to the sink node. Therefore, the route generated by the protocol is secure against malicious attacks and globally optimal according to the associated information. We used an improved variant of the Dijkstra algorithm to generate the secure route for WSNs in the presence of malicious nodes. Compared with the Reputation-Based Mechanism to Stimulate Cooperation (RBMSC) model in the same simulation environment, the proposed model can maintain a higher delivery ratio, which verifies the effectiveness of the proposed model on the basis of global optimization. Furthermore, compared with the traditional Dijkstra algorithm, the packet loss ratio in the improved Dijkstra algorithm is lower because it can more effectively avoid malicious nodes, thus verifying the effectiveness of the improved algorithm.

Internal attack is a crucial security problem of WSN (wireless sensor network). In this paper, we focus on the internal attack detection which is an important way to locate attacks. We propose a state transition model, based on the continuous time Markov chain (CTMC), to study the behaviors of the sensors in a WSN under internal attack. Then we conduct the internal attack detection model as the epidemiological model. In this model, we explore the detection rate as the rate of a compromised state transition to a response state. By using the Bellman equation, the utility for the state transitions of a sensor can be written in standard forms of dynamic programming. It reveals a natural way to find the optimal detection rate that is by maximizing the total utility of the compromised state of the node (the sum of current utility and future utility). In particular, we encapsulate the current state, survivability, availability, and energy consumption of the WSN into an information set. We conduct extensive experiments and the results show the effectiveness of our solutions.

In dynamic Vehicular Edge Computing (VEC) environments, rapidly changing vehicle mobility and traffic lead to fluctuating edge resource demands, challenging task offloading and scheduling. Accurate prediction of future traffic flow and traffic-state-derived workload representations is thus crucial for proactive resource management. To address the limitations of existing methods in short-term dynamic characterization, complex spatial interaction modeling, and heterogeneous target prediction, this paper proposes a Spatio-Temporal Graph Attention Network (TA-STGAT). The proposed model constructs multi-dimensional RSU-level state sequences from simulated trajectories generated on a real-world road network and separately forecasts vehicle flow within RSU coverage areas and the associated traffic-state-derived workload representation under a unified spatio-temporal modeling framework. By integrating gated dilated temporal convolutions with a topology-constrained multi-head graph attention mechanism, the model captures multi-scale temporal dependencies and nonlinear spatial correlations. Experimental results show that, compared with the best-performing baseline in terms of RMSE for each forecasting task, TA-STGAT reduces RMSE by 10.89% and 11.29% in workload-representation prediction and traffic flow prediction, respectively, demonstrating its effectiveness for short-term edge-state forecasting.

In this paper, we propose an energy efficient cooperative detection scheme for wireless sentinel networks monitoring for surreptitious wireless communications. Our solution exploits the multiuser diversity in the network by proposing a cooperative randomized monitoring approach for individual sentinel nodes, that leads to more efficient resource expenditure and good detection and intruder localization performance for the network. A game theoretic framework is proposed to analyze the achievable operating point for the system. Simulation results show very good detection performance together with increased localization accuracy and energy efficient operation.

In highly dynamic and interactive vehicular environments, accurate and efficient trajectory prediction is critical for driving safety and traffic efficiency. To overcome the limitations of existing methods, including degradation of long-range historical context, high computational cost for long sequences, attention dispersion in spatial interactions, and limited explicit modeling of future interactions, this paper proposes a Hierarchical Mamba Graph Attention Network (HM-GAT) for vehicle trajectory prediction. A Mamba-based selective state-space model (SSM) encoder with linear complexity is employed to capture nonlinear temporal dynamics and transient maneuvering behaviors. For spatial modeling, a heterogeneous topology-driven dual-layer graph attention mechanism, combined with adaptive sparse filtering and a foresighted future graph, enables precise identification of neighboring vehicles with potential collision risks. The proposed architecture integrates global intention exploration, topology bridging, and residual refinement in a coarse-to-fine manner, achieving effective spatio-temporal decoupling. Experimental results show that HM-GAT reduces the average RMSE by 33.1% relative to the best-performing baseline on NGSIM, achieves competitive prediction accuracy on Argoverse 2 without HD-map priors, and achieves lower inference latency than the compared baseline methods on both datasets.