In recent years, the mobile crowdsensing (MCS) paradigm has enabled a diverse array of emerging sensing applications by harnessing the collective efforts of ubiquitous mobile users, who collaborate to carry out specific sensing tasks using smart devices. However, the majority of existing works concentrate on a single MCS platform, which struggles to accommodate diverse service requirements. Moreover, these existing researches either consider opportunistic users (OUs) or participatory users (PUs) for task execution, which leads to low task coverage or high recruitment costs, while reducing the sensing quality of tasks. Therefore, in this paper, we introduce a multi-platform scenario where OUs and PUs are combined to complement each other. Then, we formulate a multi-platform hybrid user recruitment (MPHUR) problem within the limited platform budget and user time budget and decompose it into two NP-hard subproblems. To maximize the total sensing quality of tasks, we propose a Two-phase cross-platform Hybrid User recruitment Strategy called THUS. In the first phase, we present a greedy-based opportunistic user recruitment algorithm to match the user-task pair iteratively with maximum sensing quality according to the shortage degree of PUs. In the second phase, the MCS platforms assign PUs to complete the tasks that OUs fail to cover based on their residual budget. We propose a multi-task minimum-cost flow algorithm to recruit PUs for the remaining tasks. The extensive experiments are conducted on two real-world datasets to demonstrate the effectiveness of our proposed THUS.

The rapid growth of IoT devices has led to an increase in computation-intensive and latency-sensitive tasks, making traditional cloud computing insufficient. Cloud-edge-terminal collaboration can enhance offload efficiency by optimizing processing latency, energy consumption, and price cost. However, in real-world networks, computational results often need to be transmitted to multiple users, increasing the offloading complexity. This paper proposes a three-tier collaborative offloading architecture for interacting users, considering constraints such as service caching and various types of resources. The optimization problem of computation latency and price cost is modeled as a Markov Decision Process. To address the problem, we propose a deep reinforcement learning algorithm based on the soft actor-critic framework. Given the discrete-continuous hybrid action space, the algorithm incorporates a dual-head mechanism. After that, transfer learning is incorporated into the training strategy to improve adaptability in dynamic environments. The simulation results demonstrate that the proposed approach outperforms existing performance, convergence, and adaptability methods.

Task scheduling as an effective strategy can improve application performance on computing resource-limited devices over distributed networks. However, existing evaluation mechanisms for application completion fail to depict the complexity of diverse applications and time-varying networks, which involve dependencies among tasks, computing resource requirements, multi-dimensional quality of service (QoS) constraints, and limited contact duration among devices. Furthermore, traditional QoS-oriented task scheduling strategies struggle to meet the performance requirements without considering differences in satisfaction and acceptance of the application, leading to application failures and resource wastage. To tackle these issues, a quality of experience (QoE) cost model is designed to evaluate application completion, depicting the relationship among application satisfaction, communications, and computing resources over the time-varying distributed networks. Specifically, considering the sensitivity and preference of QoS, we model the different dimensional QoS degradation cost functions for dependent tasks, which are then integrated into the QoE cost model. Based on the QoE model, the dependent task scheduling problem is formulated as the minimization of overall QoE cost, aiming to improve the application performance over the time-varying distributed networks, which is proven Np-hard. Moreover, a heuristic Hierarchical Multi-queue Task Scheduling (HMTS) algorithm is proposed to address the QoE-oriented task scheduling problem among multiple dependent tasks, which utilizes hierarchical multiple queues to determine the optimal task execution order and location according to different dimensional QoS priorities. Finally, extensive experiments demonstrate that the proposed algorithm can significantly improve the satisfaction of applications.

Federated learning (FL) is a prominent paradigm of 6G edge intelligence (EI), which mitigates privacy breaches and high communication pressure caused by conventional centralized model training in the artificial intelligence of things (AIoT). The execution of multimodal federated perception (MFP) services comprises three sub-processes, including sensing-based multimodal data generation, communication-based model transmission, and computing-based model training, ultimately competitive on available underlying multi-domain physical resources such as time, frequency, and computing power. How to reasonably coordinate the multi-domain resources scheduling among sensing, communication, and computing, therefore, is vital to the MFP networks. To address the above issues, this article explores service-oriented resource management with integrated sensing, communication, and computing (ISCC). Specifically, employing the incentive mechanism of the MFP service market, the resources management problem is defined as a social welfare maximization problem, where the concept of “expanding resources” and “reducing costs” is used to enhance learning performance gain and reduce resource costs. Experimental results demonstrate the effectiveness and robustness of the proposed resource scheduling mechanisms.

Modern communication and computing technology is the basic support of the industrial intelligent systems (IIS). As a key component of IIS, the smart port is essential to be offered low-complexity and high-reliability communication service, especially for driverless engineering vehicles. However, it is combined and nonconvex to find the optimal association between vehicles and the road side units (RSUs). Besides, due to the mobility of vehicles and the severe path loss of mmWave links, beam switching and reassociation between vehicles and RSUs are required frequently, which brings a great challenge to the communication for the IIS. A low complexity closed-loop strategy based on distributed cooperation for mmWave communication in IIS is proposed in this study, in which user association and beam tracking with the assistance of beam pools is proposed. Many-to-many user association is established based on distributed multiagent reinforcement learning, where the vehicle can independently select the set of serving RSUs based on the local observation without information exchange with others, reducing the signaling overhead and computational complexity while improving system throughput. Furthermore, multipoint-cooperation soft switching of beams based on beam tracking improves the reliability of mmWave communication with the smaller training cost. Extensive analysis and simulation results demonstrate that the proposed solution significantly reduces the complexity of the mmWave communication while improving the throughput and stability in IIS.