Connectivity restoration is essential for ensuring continuous operation in wireless sensor networks (WSNs). However, existing works lack enough network robustness when suffering from the secondary external damages. In this article, we propose a novel connectivity restoration scheme to address this problem. This scheme comprises three connectivity mechanisms regarding relay segment selection in different regions. The first one is a data traffic decentralization mechanism, which establishes more transmission paths near the sink for reliability improvement and traffic load balancing. The second one is a segment shape selection mechanism, in which the segments with high-reliability preferably become the relay segments for greater network robustness. The third one is a traffic load transfer mechanism, in which data traffic is transferred from a high-load segment to a low-load segment for balancing energy depletion of the network. The distinctive characteristics of this work are twofold: different regions perform diverse connectivity restoration approaches according to the demand diversity of different regions, and traffic load can be balanced from upstream regions rather than only from downstream regions. Extensive simulation experiments validate the effectiveness and advantages of our proposed scheme in terms of connection cost, network robustness, load balance degree, and network longevity.

The text-attributed graph (TAG) is one kind of important real-world graph-structured data with each node associated with raw texts. For TAGs, traditional few-shot node classification methods directly conduct training on the pre-processed node features and do not consider the raw texts. The performance is highly dependent on the choice of the feature pre-processing method. In this paper, we propose P2TAG, a framework designed for few-shot node classification on TAGs with graph pre-training and prompting. P2TAG first pre-trains the language model (LM) and graph neural network (GNN) on TAGs with self-supervised loss. To fully utilize the ability of language models, we adapt the masked language modeling objective for our framework. The pre-trained model is then used for the few-shot node classification with a mixed prompt method, which simultaneously considers both text and graph information. We conduct experiments on six real-world TAGs, including paper citation networks and product co-purchasing networks. Experimental results demonstrate that our proposed framework outperforms existing graph few-shot learning methods on these datasets with +18.98% ~ +32.14% improvements.

Abstract As vehicular technology advances, intelligent vehicles generate numerous computation‐intensive tasks, challenging the computational resources of both the vehicles and the Internet of Vehicles (IoV). Traditional IoV struggles with fixed network structures and limited scalability, unable to meet the growing computational demands and next‐generation mobile communication technologies. In congested areas, near‐end Mobile Edge Computing (MEC) resources are often overtaxed, while far‐end MEC servers are underused, resulting in poor service quality. A novel network framework utilizing sixth‐generation mobile communication (6G) and digital twin technologies, combined with task migration, promises to alleviate these inefficiencies. To address these challenges, a task migration and re‐offloading model based on task attribute classification is introduced, employing a hybrid deep reinforcement learning (DRL) algorithm—Dueling Double Q Network DDPG (QDPG). This algorithm merges the strengths of the Deep Deterministic Policy Gradient (DDPG) and the Dueling Double Deep Q‐Network (D3QN), effectively handling continuous and discrete action domains to optimize task migration and re‐offloading in IoV. The inclusion of the Mini Batch K‐Means algorithm enhances learning efficiency and optimization in the DRL algorithm. Experimental results show that QDPG significantly boosts task efficiency and computational performance, providing a robust solution for resource allocation in IoV.

Although smart healthcare has achieved rapid development and has gained considerable attention from academia and industry, pressing challenges exist, such as resource limitation and stringent security demand. To tackle the issues, a blockchain-based and trust-aware task-offloading strategy (BBTAS) is proposed in this work, whereby task-offloading requests are published as blockchain transactions that are automatically yet securely performed by smart contracts (SCs). An SC is a set of codes implementing predefined rules agreed by the participants involved. When a rule meets certain criteria or triggered by some events or transactions, an SC can perform by itself and generate verifiable results, which can be validated and securely stored in the blockchain. The proposed recommendation filtering method (RFM) and trust penalty measure (TPM)-based trust mechanism is powerful in resisting network insider attacks, and the inherent time-inefficiency problem of blockchain can be alleviated by integrating trust factor, which is theoretically analyzed in this work. To optimize the selection of service node, a utility-based decision-making method (UB-DMM) is proposed, which can maximize the system utility on the basis of fully considering multiple significant performance metrics of the system. Extensive simulations have been carried out to validate the effectiveness and superiority of the proposed measures.

Abstract With more and more interconnected smart devices (ISDs) accessing the Internet of Things (IoT), massive and diverse tasks need to be transformed and computed. Mobile edge computing enables the offloading of tasks to nearby servers to enhance processing efficiency, which makes ISDs idle, causing resource waste and failing to satisfy the high real‐time requirements of tasks. Besides, when tasks with different priorities are processed in the order they are generated, it will be difficult for IoT to guarantee a timely response to high‐priority tasks. To address the aforementioned issues, we establish an edge‐terminal‐local architecture by software‐defined networking to centrally manage idle ISD resource (2ISDR). Then the proposed two‐step scheduling mechanism with preemptive priority queue ensures the real‐time responses to high‐priority tasks, and the minimum resource allocation coefficients make offloading effective. Finally, we also propose a modified NSGA‐III algorithm named MNSGA‐III, which is designed to make decisions about offloading and solve resource allocation for tasks, and we correct infeasible solutions by a two‐step correction function to ensure the feasibility of MNSGA‐III. Experimental results show that the method can ensure a timely response to high‐priority tasks and optimize processing time, energy consumption, and economic cost through the utilization of 2ISDR.

Abstract In recent years, mobile edge computing (MEC) has become a promising solution to solve the shortage of technical resources in wireless body area networks (WBANs). However, the existing research work has not fully utilized the communication and computing resources in WBANs scenarios. To solve this problem, a task offloading framework that combined with cellular, WiFi networks and device‐to‐device communications is proposed, that makes full use of resources to improve system reliability. Considering that a single MEC server may be overloaded by a large number of patients, the total task offloading cost and load variance is formulated into a multi‐objective optimization problem (MOOP). A non‐dominated sorting genetic algorithm with smart mobile device ‐ patient connection matrix (NSGA ‐SPCM) to solve the MOOP. In view that an SDM may connect multiple patients at the same time during chromosome crossing, the SPCM can quickly detect the unfeasible gene location and mutate it into viable. Simulation results show that the proposed framework and algorithm have good performance.

Abstract Recently, with the fast development of IoT, Internet of medical things (IoMT) has drawn wide attention from both industry and academia. However, pressing challenges exist in practical implementation of IoMT, such as service provision with stringent latency. To address the challenges, fog computing is generally employed in IoMT systems. However, it raises additional concerns of trust and security. To tackle the issue, the authors introduce the security measure of trust into this work, and a superior heterogeneous stacking ensemble learning measure for trustworthiness prediction (SEM‐TP) of fog services is proposed. Besides, to reduce unnecessary time cost incurred by unimportant features, an efficient voting‐based feature selection (FS) strategy called voting‐based feature selection method is proposed to select significant features, which is based on diverse FS measures. Extensive experiments are conducted and the results show that the proposed framework outperforms commonly used single classifiers and competing stacking models in terms of Accuracy, Precision, Recall, F1‐score, Kappa coefficient, and Hamming distance under different conditions, validating the effectiveness, robustness, and superiority of the proposed trustworthiness prediction and FS methods.