Optimizing Collaborative Crowdsensing: A Graph Theoretical Approach to Team Recruitment and Fair Incentive Distribution.

Collaborative crowdsensing is a team collaboration model that harnesses the intelligence of a large network of participants, primarily applied in areas such as intelligent computing, federated learning, and blockchain. Unlike traditional crowdsensing, user recruitment in collaborative crowdsensing not only considers the individual capabilities of users but also emphasizes their collaborative abilities. In this context, this paper takes a unique approach by modeling user interactions as a graph, transforming the recruitment challenge into a graph theory problem. The methodology employs an enhanced Prim algorithm to identify optimal team members by finding the maximum spanning tree within the user interaction graph. After the recruitment, the collaborative crowdsensing explored in this paper presents a challenge of unfair incentives due to users engaging in free-riding behavior. To address these challenges, the paper introduces the MR-SVIM mechanism. Initially, the process begins with a Gaussian mixture model predicting the quality of users' tasks, combined with historical reputation values to calculate their direct reputation. Subsequently, to assess users' significance within the team, aggregation functions and the improved PageRank algorithm are employed for local and global influence evaluation, respectively. Indirect reputation is determined based on users' importance and similarity with interacting peers. Considering the comprehensive reputation value derived from the combined assessment of direct and indirect reputations, and integrating the collaborative capabilities among users, we have formulated a feature function for contribution. This function is applied within an enhanced Shapley value method to assess the relative contributions of each user, achieving a more equitable distribution of earnings. Finally, experiments conducted on real datasets validate the fairness of this mechanism.

Asynchronous dissipative stabilization for stochastic Markov-switching neural networks with completely- and incompletely-known transition rates.

The asynchronous dissipative stabilization for stochastic Markov-switching neural networks (SMSNNs) is investigated. The aim is to design an output-feedback controller with inconsistent mode switching to ensure that the SMSNN is stochastically stable with extended dissipativity. Two situations, which involve completely- and incompletely-known transition rates (TRs), are taken into account. The situation that all TRs are exactly known is considered first. By applying a mode-dependent Lyapunov-Krasovskii functional, Dynkin's formula, and several matrix inequalities, a criterion for the desired performance of the closed-loop SMSNN is derived and a design method for determining the asynchronous controller is developed. Then, the study is generalized to the situation where some TRs are allowed to be uncertain or even fully unknown. An inequality is established for judging the upper bound of the product of the TRs with the Lyapunov matrix by making full use of accessible information on the incompletely-known TRs. Based on the inequality, performance analysis and control synthesis are presented without imposing the zero-sum hypothesis of the uncertainties in the TR matrix. Finally, an example with numerical calculation and simulation is provided to verify the validity of the stabilizing approaches.

Event-triggered stabilization for networked control systems under random occurring deception attacks.

This paper copes with event-triggered stabilization for networked control systems subject to deception attacks. A new switched event-triggered scheme (ETS) is designed by introducing a term regarding the last triggering moment in the trigger condition. This increases the difficulty of triggering, thus reducing trigger times compared to some existing ETSs. Furthermore, to cater for actual deception attack behavior, the occurrence of deception attacks is assumed to be a time-dependent stochastic variable that obeys the Bernoulli distribution with probability uncertainty. By means of a piecewise-defined Lyapunov function, a sufficient condition is developed to assure that the close-loop system under deception attacks is exponentially stable in regards to mean square. On the basis of this, a joint design of the desired trigger and feedback-gain matrices is presented. Finally, a simulation example is given to confirm the validity of the design method.