RESUMO
Graph-learning methods, especially graph neural networks (GNNs), have shown remarkable effectiveness in handling non-Euclidean data and have achieved great success in various scenarios. Existing GNNs are primarily based on message-passing schemes, that is, aggregating information from neighboring nodes. However, the diversity and complexity of complex systems from real-world circumstances are not sufficiently taken into account. In these cases, the individual should be treated as an agent, with the ability to perceive their surroundings and interact with other individuals, rather than just be viewed as nodes in existing graph approaches. Additionally, the pairwise interactions used in existing methods also lack the expressiveness for the higher-order complex relations among multiple agents, thus limiting the performance in various tasks. In this work, we propose a Multiagent Hypergraph Force-learning method dubbed MHGForce. First, we formalize the multiagent system (MAS) and illustrate its connection to graph learning. Then, we propose a generalized multiagent hypergraph-learning framework. In this framework, we integrate message-passing and force-based interactions to devise a pluggable method. The method empowers graph approaches to excel in downstream tasks while effectively maintaining structural information in the representations. Experimental results on the Cora, Citeseer, Cora-CA, Zoo, and NTU2012 datasets in node classification demonstrate the effectiveness and generality of our proposed method. We also discuss the characteristics of the MHGForce and explore its role through parametric analysis and visualization. Finally, we give a discussion, conclude our work, and propose future directions.
RESUMO
The increasing popularity of portable smart devices has led to the emergence of vehicular crowdsensing as a novel approach for real-time sensing and environmental data collection, garnering significant attention across various domains. Within vehicular crowdsensing, task assignment stands as a fundamental research challenge. As the number of vehicle users and perceived tasks grows, the design of efficient task assignment schemes becomes crucial. However, existing research solely focuses on task deadlines, neglecting the importance of task duration. Additionally, the majority of privacy protection mechanisms in the current task assignment process emphasize safeguarding user location information but overlook the protection of user-perceived duration. This lack of protection exposes users to potential time-aware inference attacks, enabling attackers to deduce user schedules and device information. To address these issues in opportunistic task assignment for vehicular crowdsensing, this paper presents the minimum number of participants required under the constraint of probability coverage and proposes the User-Based Task Assignment (UBTA) mechanism, which selects the smallest set of participants to minimize the payment cost while measuring the probability of accomplishing perceived tasks by user combinations. To ensure privacy protection during opportunistic task assignment, a privacy protection method based on differential privacy is introduced. This method fuzzifies the sensing duration of vehicle users and calculates the probability of vehicle users completing sensing tasks, thus avoiding the exposure of users' sensitive data while effectively assigning tasks. The efficacy of the proposed algorithm is demonstrated through theoretical analysis and a comprehensive set of simulation experiments.
RESUMO
Indoor localization is one of the key techniques for location-based services (LBSs), which play a significant role in applications in confined spaces, such as tunnels and mines. To achieve indoor localization in confined spaces, the channel state information (CSI) of WiFi can be selected as a feature to distinguish locations due to its fine-grained characteristics compared with the received signal strength (RSS). In this paper, two indoor localization approaches based on CSI fingerprinting were designed: amplitude-of-CSI-based indoor fingerprinting localization (AmpFi) and full-dimensional CSI-based indoor fingerprinting localization (FuFi). AmpFi adopts the amplitude of the CSI as the localization fingerprint in the offline phase, and in the online phase, the improved weighted K-nearest neighbor (IWKNN) is proposed to estimate the unknown locations. Based on AmpFi, FuFi is proposed, which considers all of the subcarriers in the MIMO system as the independent features and adopts the normalized amplitudes of the full-dimensional subcarriers as the fingerprint. AmpFi and FuFi were implemented on a commercial network interface card (NIC), where FuFi outperformed several other typical fingerprinting-based indoor localization approaches.
RESUMO
With the rapid development of Artificial Intelligence (AI) and Internet of Things (IoTs), an increasing number of computation intensive or delay sensitive biomedical data processing and analysis tasks are produced in vehicles, bringing more and more challenges to the biometric monitoring of drivers. Edge computing is a new paradigm to solve these challenges by offloading tasks from the resource-limited vehicles to Edge Servers (ESs) in Road Side Units (RSUs). However, most of the traditional offloading schedules for vehicular networks concentrate on the edge, while some tasks may be too complex for ESs to process. To this end, we consider a collaborative vehicular network in which the cloud, edge and terminal can cooperate with each other to accomplish the tasks. The vehicles can offload the computation intensive tasks to the cloud to save the resource of edge. We further construct the virtual resource pool which can integrate the resource of multiple ESs since some regions may be covered by multiple RSUs. In this paper, we propose a Multi-Scenario offloading schedule for biomedical data processing and analysis in Cloud-Edge-Terminal collaborative vehicular networks called MSCET. The parameters of the proposed MSCET are optimized to maximize the system utility. We also conduct extensive simulations to evaluate the proposed MSCET and the results illustrate that MSCET outperforms other existing schedules.
RESUMO
Anonymous tracking technology of network watermarking is limited by the deployment of tracking devices in traditional network structure, resulting in poor scalability and reusability. Software Defined Network (SDN) boasts more freedom thanks to its separation of the control plane from the data plane. In this paper, a new anonymous communication tracking model SDN-based Anonymous Communication Tracking (SACT) is proposed, which introduces network watermarking into SDN and combines IP time hidden channel and symbol expansion technology. In addition, we introduce a hopping protection mechanism to improve the anti detection ability of the watermark as well. The experimental results show that in a variety of simulated network environments, SACT achieves excellent detection rate and bit error rate, thus it is sufficient to determine the communication relationship between the two parties. Meanwhile, SACT solves the deployment problem of anonymous tracking and improves the availability and scalability of covert communication.