Massive multiple-input multiple-output (MIMO) architecture is promising to be adopted in the 5G/6G communication systems to combat the severe attenuation of millimeter-wave and terahertz bands by implementing precoding and combining at the transmitter and receiver jointly. Nevertheless, such massive MIMO-based systems are highly susceptible to pilot spoofing attacks (PSAs) because of the openness of wireless channel and the public pilot sequences. These PSAs will not only render significant decrease in system capacity, but also make the transmitted information leak to the attackers. In this paper, a novel multi-cue detection and identification network (MCDI-net) is proposed to conduct spoofing detection and identify the attacked user simultaneously. The MCDI-net integrates a dual-branch convolutional neural network with squeeze-and-excitation (SE) attention modules to extract the complementary features from two distinct cues, which are in-phase/quadrature (I/Q) and statistical features derived from pilot correlation and projected average power. This multi-cue fusion approach can enhance the network’s ability to detect pilot spoofing and identify the attacked legitimate user accurately. Numerical results are presented to validate the superior performance of the MCDI-net framework in detection and identification accuracy compared to the existing ones.

Recruiting trust workers to achieve high data quality at low cost has become a promising approach in Mobile Crowdsensing (MCS). However, most existing trust evaluation methods only adopt a single-dimensional trust model, neglecting the fact that a worker's trustworthiness can vary across different task types, which leads to suboptimal task–worker matching, poor data quality, and inefficient cost utilization. To this end, we propose a Multidimensional Trust Evaluation and Task Matching (MTE-TM) based workers recruitment scheme to improve data quality while reducing costs for MCS. First, we represent worker trustworthiness by a composite of expected trust values and variance, enabling task-specific trust assessment that extends traditional single-dimensional trust to a multidimensional domain. A novel Expectation-Maximization (EM)-based trust evaluation mechanism is also introduced to improve accuracy. Second, we design a new worker selection method that combines a worker's trust level and the width of the confidence interval to compute their Upper Confidence Bound (UCB) index, which effectively guides worker selection toward optimal outcomes. Third, we propose an Optimized Data Quality Matching (ODQM) algorithm that assigns tasks to workers with high priority and low bid prices under budget constraints, thereby further improving data quality. The experimental results demonstrate the significant performance improvements of our scheme, achieving 45.54$\sim$95.55% optimization in trust evaluation, 65.01$\sim$72.95% improvement in data quality, and a notable reduction in regret.

Many studies on trust relationship establishment in Social Networks (SNs) have assumed that the trustworthiness of partners can be identified by participants through interaction. However, in practice, participants not only struggle to discern the trustworthiness of their counterparts but also find it difficult to effectively determine whether the messages they spread are Useful Messages (UMs) or Malicious Messages (MMs). Therefore, designing an efficient information propagation scheme that promotes UMs dissemination while blocking MMs remains a challenging issue in real-world SNs. In this paper, we propose an efficient Trust-based Distributed Incentive (TDI) scheme that aligns with actual SN practices. First, an effective Bidirectional Trust Identification (BTI) approach is proposed to verify the trustworthiness of messages and participants without assuming that interacting participants can evaluate each other's trustworthiness. In BTI, the trustworthiness of participants is evaluated based on their evaluations of trusted participants and reliable messages, while the trust of messages is verified through feedback from trusted participants, laying a foundation for trust information propagation. Then, a Trust-based Message Forwarding (TMF) mechanism is proposed to facilitate the dissemination of trusted messages while blocking the forwarding of low-trust messages. Finally, a Proactive Trust Evaluation (PTE) mechanism is introduced to accelerate and effectively obtain participants' reliable evaluations. Specifically, some UMs are disseminated as Probing Messages (PMs) to accurately evaluate the trustworthiness of participants based on whether they evaluate them truthfully. Extensive simulations demonstrate that the TDI scheme outperforms the existing main schemes in terms of accurately identifying message trust, increasing UMs dissemination, blocking the spread of MMs, and purifying SNs.

In recent years, Mobile Edge Computing (MEC) has been widely used for latency-sensitive tasks, but task scheduling in dynamic edge environments still faces two key challenges. First, edge devices are prone to failures, and existing fault-tolerance mechanisms lack task-aware modeling, making it hard to ensure timeliness and reliability under failures. Second, due to limited perception, high communication costs, and complex task structures, current scheduling strategies still struggle with adaptability and stability in dynamic systems. In this paper, we propose a Fault-Tolerant Discrete Soft Actor-Critic scheduling algorithm (FT-DSAC). Initially, we design a Primary-Backup-based Fault-Tolerant (PBFT) scheduling mechanism, which constrains task offloading locations and start times to effectively mitigate the impact of failures on task execution. Furthermore, we incorporate the Centralized Training and Distributed Execution (CTDE) architecture, which enables implicit collaborative scheduling decisions among edge servers to optimize system performance and reduce communication overhead. Finally, We conduct extensive experiments using both simulated data generated by DAGGEN and real-world workflow data. Experimental results show that the proposed algorithm significantly improves task execution success rates by 6%-19% and reduces latency by 9%-27% compared to mainstream benchmarks.

In sparse mobile crowdsensing, the platform con-structs services based on low-cost data collection through data inference schemes, where the quality of the inferred data directly affects the service quality. Existing data inference schemes assume that workers report trustworthy data, which is not practical in SMCS. It is urgent to establish a high-quality data collection scheme for data inference that can tolerate false data to enhance inferred data quality. To address this challenge, we propose a Truthful Multi-Task Allocation (TMTA) scheme. First, we estimate the spatiotemporal correlation between areas for iden-tifying areas with high importance to the data inference process. Second, a trust-based multi-task allocation algorithm is proposed to ensure that the sensing data from high-importance areas have high trust levels. Third, a multi-armed bandit based trustworthy worker identification strategy is proposed to prioritize Multi-Task allocation for workers who can be effectively identified as trustworthy. Finally, a truthful discrete heuristic algorithm is proposed to optimize the multi-task allocation using the proposed hybrid neighbor-mode strategy, which reduces the difficulty of searching for high-utility multi-task allocations. Extensive exper-iments on two real-world air-quality datasets demonstrate that TMTA consistently outperforms six baseline methods, achieving average reductions of 24.70% in RMSE and 17.79% in sensing cost across five experimental scenarios.

Orchestration of Data as Services (ODS) at the Edge Layer (EL) in a Cloud-Edge-Seamless System (CESS) facilitates user access and avoids the long-distance transmission of massive raw data to Cloud Servers (CSs), thereby reducing network load. Building on this foundation, we argue that deploying both services and Data/Services Orchestration Programs (DSOPs), together with performing resource allocation at Edge Servers (ESs), further minimizing data processing time, service response time, and placement costs. To this end, we propose a novel service network architecture that integrates Service/DSOP placement and edge resource allocation to enhance overall system performance. First, a new service network architecture is proposed to jointly optimize Service/DSOP placement and resource allocation. Then, we design a Data-Driven Service/DSOP Placement (DDSDP) scheme that employs a Parameterized Deep$Q$-Network (P-DQN) to effectively tackle the hybrid action space optimization of such joint problem. Moreover, we develop a Demand-Calibrated Service/DSOP Placement (DCSDP) approach, which first leverages Long Short-Term Memory (LSTM) networks at the CS to capture spatio-temporal patterns of data and service demands, enabling ESs to dynamically train a demand-aware service/DSOP deployment model. Extensive simulations demonstrate that DDSDP and DCSDP significantly reduce service response time and adapt more effectively to network dynamics, achieving reductions of 47.89% and 53.88% compared to the baseline IFSP and P-DQN methods, respectively.

Edge computing (EC) reduces task processing and content download delay by providing computation and caching resources directly to task offloading (TO) users and content request (CR) users. However, existing studies often focus exclusively on either TO users or CR users within EC networks, neglecting the interaction between these two groups. To address this gap, we investigate the offloading and caching decision-making in scenarios where TO and CR users coexist. Furthermore, we employ full-duplex (FD) technology to enhance spectral utilization for edge-end transmissions. Specifically, we jointly optimize offloading and caching in FD-enabled EC networks. To accomplish this, we decompose the formulated optimization problem into three sub-problems using the alternating optimization (AO) method. We then propose a three-subproblem alternating iterative delay minimization algorithm to effectively tackle the challenges of offloading and caching. Additionally, we analyze the convergence and complexity of our proposed algorithm. Finally, we conduct extensive simulations to evaluate the effectiveness of our approach. The simulation results demonstrate that the delay reduction achieved by our algorithm is between 24.78% and 89.23% greater than that of comparative algorithms.

Employing the caching resources of end users via Device-to-Device (D2D) communication to assist the edge server in microservice caching is promising to further alleviate the network congestion of the Internet of Things (IoT). However, significant extra energy consumption prevents the caching system from maximizing cache utility if all end users cache simultaneously. In this paper, we propose two novel end-edge collaborative microservice caching algorithms in D2D-assisted networks. First, we construct a D2D caching sharing link graph from the aspects of physical and social attributes of end users and introduce the Entropy-based Partitioning Around Medoid (EPAM) algorithm to identify critical users. Second, to address the challenges posed by unknown time-varying user preferences, we model the end-edge collaborative caching problem as a Multi-Agent Multi-Armed Bandit (MAMAB) problem, thus developing two caching decision schemes, i.e, Edge-Centric Scheme (ECS) and User-Centric Scheme (UCS), to accommodate different decision sequences. The simulation results show that the EPAM-ECS and EPAM-UCS have at least 29.2% and 39.3% improvement compared with other baseline algorithms.

Crowdsensing Data Trading (CDT) has emerged as a novel data trading paradigm, where market stability is crucial during the transaction matching process. However, most existing CDT systems usually assume that the preferences of both parties are known and the third-party trading platform is trustworthy, which is impractical in real-world scenarios and leads to significant challenges in reliability and privacy preservation. To address these challenges, we propose a Privacy-Preserving and Stable Data Trading for Unknown Market based on Blockchain and Bilateral Reputation (PPSDT-UMBBR) scheme in the decentralized CDT system. First, a privacy-preserving bilateral preference initialization method is designed to achieve the initial matching of buyers and sellers without exposing their location and attribute privacy. Then, a stable matching method based on dynamic bilateral preference updating is proposed, integrating Differential Privacy, Stable matching theory, and a strategy based on Asymmetric Bilateral Preferences with Multi-Armed Bandits (DPS-ABPMAB). Finally, we theoretically analyze the security and prove that the market outcome is$\delta$-stable. Furthermore, compared to other benchmark methods based on real datasets, our proposed DPS-ABPMAB algorithm improves the average accumulative reward by at least 4.22%, and reduces the average accumulative regret and the mean evaluation error rate by at least 66.86% and 7.35%, respectively.

Online multi-task allocation has become an essential research topic in Mobile Crowdsensing (MCS). Most existing studies merely focus on minimizing the total distance that workers need to travel, but ignore considering the total task rewards, which could lead to a reduction in the willingness of workers to complete tasks. In this paper, to incentivize workers to participate in tasks and protect their privacy, we propose a Location and Reward Privacy-Preserving based Secure Task Allocation(LRPP-STA) scheme. First, we design a secure distance computation method to obtain the distance from the workers to the tasks under location privacy preserving. Second, considering fixed reward for the task, we propose a Fixed Rewarding Secure Task Allocation(FR-STA) scheme, where a secure utility calculation method is proposed to calculate the encrypted utility of the worker upon completing tasks under rewards privacy preserving, along with the path planning for workers to maximize the total utility of the system through an Extended Maximum-Utility Flow model(EMUF). Third, considering the situation of dynamic task reward adjusted by requesters based on the supply and demand relationship as well as the urgency of the task, we propose a Dynamic Rewarding Secure Task Allocation(DR-STA) scheme to optimize the task allocation for workers while improving requesters satisfaction. Finally, we theoretically analyze the security of location and reward privacy-preserving scheme, and conduct extensive experiments with real-world datasets to verify that the secure task allocation scheme is effective in improving the total utility of workers compared to other baseline online tasking schemes.

UAVs-enabled Mobile Crowdsensing (UMCS) has gained considerable attention recently, but it is challenging to meet the data collection needs of the entire city using only the UAV with limited energy. Furthermore, how to effectively minimize Age-of-Information (AoI) and ensure data quality has not been well solved in previous studies. Therefore, this paper proposes a hybrid optimization framework for AoI minimization, which recruits massive distributed workers as the main force for data collection, while the UAV acts as a data collection collaborator and is more inclined to fly to the SNs that cannot establish connections with workers, To mitigate the potential security threats incurred by dishonest workers of the MCS system, we first provide a Greedy-based Multi-worker Task Assignment (GMTA) strategy, aiming to assign more urgent data collection tasks to reliable workers under workload constraints. Then, we propose a Deep-Reinforcement-Learning-based Global AoI Minimization (DRL-GAM) strategy for the UAV path planning to find a set of optimal actions to minimize the global AoI. Based on the real dataset, our simulation experiments show that compared with traditional strategies, our DRL-GAM strategy can reduce the global AoI by an average of 6.49%$\sim$68.21% in various network sizes, and is more stable for the average standard deviation is only 51.75% of other strategies.

The time-varying characteristics of user mobility, node and services connections, and edge resources in Mobile Edge Computing (MEC) scenarios pose significant challenges for designing efficient service migration strategies to enhance system performance. This paper introduces and quantifies affinity and anti-affinity metrics to evaluate the discrepancies between the resource requirements of containers and the available resources of nodes, as well as the competition level of computing resources during the migration of containers among different nodes within the Kubernetes cluster. To adapt to the complexity of the edge environment, such metrics are integrated into the reward update mechanism of the Deep Deterministic Policy Gradient (DDPG) reinforcement algorithm. Besides, the Multi-Objective Evolutionary Algorithm (MOEA) is employed to dynamically adjust the weights of various reward objectives, forming a self-adaptive online container migration strategy named MO-DDPG. Finally, we construct a real-world heterogeneous Kubernetes edge node cluster in experiments and use a public dataset to simulate multi-modal connections between mobile user trajectories and service demands. Compared to the greedy and heuristic strategies that consider only single metrics, our experiment results show that the proposed strategy improves energy efficiency and reduces latency by 21.30% and 29.49%, respectively. Moreover, the MO-DDPG improves resource utilization of the node cluster compared to the default Kubernetes scheduler.

Edge Intelligence aims to push deep learning (DL) services to network edge to reduce response time and protect privacy. In implementations, proximity deployment of DL models and timely updates can improve the quality of experience (QoE) for users, but increase the operation cost as well as pose a challenge for task assignment. To address the challenge, a joint online optimization problem for DL model deployment (including placement and update) and freshness-sensitive task assignment is formulated to improve QoE and application service provider (ASP) profit. In the problem, we introduce the age of information (AOI) to quantify the freshness of the DL model and represent user QoE as an AOI based utility function. To solve the problem, an online model placement, update, and task assignment (MPUTA) algorithm is proposed. It first converts the time-slot coupled problem into a single time-slot problem using the regularization technique, and decomposes the single time-slot problem into model deployment and task assignment subproblems. Then, using the randomized round technique to deal with the model deployment subproblem and the graph matching technique to solve the task assignment subproblem. In simulation experiments, MPUTA is shown to outperform other benchmark algorithms in terms of both user QoE and ASP profit.

Existing methods for decomposing monolithic applications into microservices in cloud environments primarily rely on the call relationships within itself. However, these methods are difficult to apply directly in resource-constrained and distributed edge network scenarios without considering the heterogeneity of the device. Therefore, this paper proposes a clustering method that ensembles graph structures and device features based on attention mechanism, which utilizes attention encoders to learn node embeddings and employs a spectral clustering algorithm to obtain decomposition results, optimizing the affinity and matching degree between microservices and devices. Experimental results demonstrate that the proposed method exhibits excellent performance in terms of functional independence, modularity, and adaptability of microservices.

Mobile Crowd Sensing (MCS) has become a prevalent large-scale and low-cost data collection paradigm by employing workers, and the location and bid privacy of both task and workers should not be leaked to the third party to prevent the adversary from attacking. Existing privacy preserving worker recruitment schemes have taken the location and quality into consideration, but ignore the bid privacy. To tackle this issue, a two-stage Location and Bid Privacy Preserving based Quality-aware Worker Recruitment (LBPP-QWR) scheme is proposed in this paper. In the first stage, to select those workers who satisfy the specified location and bid range of the task in the encrypted state, we propose a hybrid encryption scheme of matrix encryption and asymmetric encryption technique in the MCS platform. For the second stage, after obtaining the preliminary worker set via the platform, we propose a Knapsack Worker Selection (KWS) algorithm to recruit those high-quality and low bid workers under the budget constraint in the Data Requester (DR). Considering that there are quality-unknown workers, we further propose an improved.-KWS algorithm based on.-greedy algorithm by combining the exploration and exploitation mechanism to learn the quality of worker. Extensive experiments conducted on real-world datasets demonstrate that our proposed scheme can improve the average total quality by 17.96%-83.34%, and the cost efficiency by 27.99%-67.90% for the DR compared with other benchmark methods.

Ensuring secrecy information transmission with enhanced energy efficiency is one of the critical issues in unmanned aerial vehicles (UAVs)-assisted wireless systems owing to the open nature of wireless channels and the limited battery power. In this article, the secrecy energy efficiency (SEE) is investigated for a more critical scenario, where an UAV acts as a bidirectional relay exchanging information between the two ground users and a malicious terminal attempts to implement eavesdropping and interfering on the confidential information simultaneously. Multiple parameters, such as time scheduling, power allocation, UAV trajectory within a given flight cycle, and both multiple access (MA) and broadcast (BC) phases are optimized jointly to maximize the system SEE. To address this nonconvex optimization problem involved with coupled variables tightly, we employ the block coordinate descent (BCD) method and develop an iterative algorithm that leverages successive convex approximation (SCA) and the Dinkelbach algorithm to obtain the optimal solution. Meanwhile, simulation results are presented to demonstrate the superiority of our proposed scheme in terms of SEE.

In mobile crowd sensing (MCS), how to obtain accurate truth estimation under privacy preservation has gained much attention. It is important to prevent the leakage of the sensing data, weight, estimated truth, and intermediate truth to third parties to avoid attacks from adversaries when aggregating a large amount of data collected by workers. In addition, dishonest or malicious workers may report false or malicious data. Therefore, we propose a weight-based trust identification for privacy-preserving truth discovery (WTIPPTD) scheme to enhance the accuracy of truth discovery by identifying the trust and data qualities of workers, and then recruiting trusted high-quality workers. First, the garbled circuit (GC) is used for weight update in the encrypted state, and a trust evaluation scheme is proposed based on weight credibility. Second, a data quality evaluation scheme for workers is designed, and the trusted high-quality workers are recruited to improve the accuracy of truth discovery while reducing the recruitment cost. Finally, we conduct experiments with a large number of real and synthetic data sets, and the results show that our proposed scheme significantly improves the accuracy of truth discovery by 17.80%–98.61% and substantially reduces worker recruitment cost by 16.43%–26.50%.

Product codes (PCs) are typically decoded using iterative bounded distance decoding (iBDD) to ensure a low decoding complexity. To obtain further performance gain, a soft-aided decoding algorithm, termed the iBDD with scaled reliability (iBDD-SR), was proposed for PCs. In this paper, we propose an enhanced iBDD-SR by introducing threshold and memory when passing messages between the component decoders. The resulting algorithm is referred to as the threshold-based binary message passing (TB-BMP) with memory. In the proposed decoding algorithm, the soft reliability of the BDD output at the current half-iteration is a weighted sum of the BDD output, the channel reliability, and the content of the memory unit, where the content of the memory unit at the current half-iteration is related to the selected threshold and the BDD output at last half-iteration. Due to the existence of memory, the Bayesian network is used to model the decoding process of the TB-BMP. Based on the Bayesian network, we derive the density evolution (DE) equations for the TB-BMP under the constraint of extrinsic message passing (EMP). The analytical results of the DE analysis can be used to guide the selection of the parameters of the TB-BMP decoder. Extensive simulation results show that the TB-BMP decoder outperforms the iBDD-SR over the binary-input additive white Gaussian noise (Bi-AWGN) channels. In particular, for a PC based on a two-error-correcting extended Bose-Chaudhuri-Hocquenghem (BCH) code of length 256, the TB-BMP decoder performs about 0.28 dB better than the iBDD-SR at a bit error rate (BER) of 10-7.

Mobile crowdsourcing aims to recruit enough workers holding mobile devices to collect data. Nevertheless, the platform will have cold start problems when the number of workers is limited. Existing studies have proposed solving this problem by propagating tasks to social networks for social recruitment. However, they neglect to verify workers’ propagation, leading to malicious workers reducing the platform's utility. Furthermore, during propagation verification, it is imperative to protect the privacy of social relationships among workers, as it can significantly influence the propagation. Therefore, this paper proposes Zero-knowledge Propagation Verification based on Social Relationship Encryption (ZPV-SRE) to improve the platform's utility. Specifically, we transform the propagation verification problem into a problem of computing the solution of the function. Then, the Zero-knowledge proof is used to prove the propagation, in which the worker's social relationship is protected through homomorphic encryption. Considering that ZPV-SRE will incur a significant time cost, we propose Trust-guided Zero-knowledge Propagation Verification based on Social Relationship Encryption (TZPV-SRE), which updates the worker's trust based on the verification results and selects suspicious workers for verification. The experimental results show ZPV-SRE improves the platform's utility as high as 104.05% over the state-of-the-art methods, while TZPV-SRE reduces time costs and ensures improvement.

Mobile Crowdsourcing (MCS) has become a novel paradigm for enabling data collection by worker recruitment, and the reputation plays a crucial role in achieving high-quality data. Although identity, data, and bid privacy preserving have been thoroughly investigated with the advance of blockchain technology, existing literature barely focuses on reputation privacy, which prevents malicious workers from submitting false data that could affect truth discovery for data requester. Therefore, we propose a Blockchain-Based Reputation Privacy Preserving for Quality-Aware Worker Recruitment Scheme (BRPP-QWR). First, we design a lightweight privacy preserving scheme for the whole life cycle of the worker’s reputation, which adopts sub-address retrieval technique combined with Pedersen Commitment and Compact Linkable Spontaneous Anonymous Group (CLSAG) signature to enable fast and anonymous verification of the reputation update process. Subsequently, to tackle the unknown worker recruitment problem, we propose a Reputation, Selfishness, and Quality-based Multi-Armed Bandit (RSQ-MAB) learning algorithm to select reliable and high-quality workers. Lastly, we implement a prototype system on Hyperledger Fabric to evaluate the performance of the reputation management scheme. The results indicate that the execution latency for the reputation score verification and retrieval latency can be reduced by an average of 6.30%–56.90% compared with ARMS-MCS. In addition, experimental results on both real and synthetic datasets show that the proposed RSQ-MAB algorithm achieves an increase of at least 20.05% in regard to the data requester’s total revenue and a decrease of at least 48.55% and 3.18% in regret and Multi-round Average Error (MAE), respectively, compared with other benchmark methods.

The widespread adoption of mobile smart devices has ushered in the era of Mobile Crowd Sensing (MCS), serving as an efficient method for large-scale data collection. Inherently location-sensitive, the service construction of MCS faces a crucial challenge of Location Privacy Preservation (LPP). Prior studies for LPP often necessitate a Trusted Third Party (TTP), which is not always feasible. Moreover, these privacy-preserving techniques may inadvertently obscure dishonest or malicious behaviors, leading to compromised Quality of Service (QoS). Motivated by this, we propose a Quality-enabled Bilateral Location Privacy-Preserving (Q-BLPP) service construction scheme, ensuring Bilateral LPP without TTP, while maintaining QoS. To achieve bilateral LPP, we introduce a novel BI-LBE algorithm using Bloom Indexing (BI) and Location-Based Encryption (LBE). Additionally, for high-quality recruitment, we present a Combinatorial Multi-Armed Bandit (CMAB) approach to balance exploration and exploitation. Furthermore, to ensure privacy during recruitment, worker profiles are anonymized using differential privacy. To our knowledge, our approach is the first to integrate QoS and LPP in MCS, with theoretical proofs of truthfulness and individual rationality. Simulations demonstrate that our Q-BLPP scheme strikes a favorable balance between computational efficiency, privacy security, and service quality, outperforming existing schemes.

Convolutional neural networks (CNNs) have been widely used in various complicated problems, such as image classification, objection detection, semantic segmentation. To meet diversified CNN structures, the deep learning processing unit (DPU) is designed as a general accelerator on field programmable gate array (FPGA) to support various CNN layers, such as convolution, pooling, activation, etc. However, low DPU utilization and schedule efficiency appear when DPU used to multitask application completed by CNN models. In this paper, an effective design including multi-core with different size (MCDS) and DPU Plus is proposed to improve the efficiency of DPUs usage from the two dimensions of time and space. Through increasing the number of DPU cores on an FPGA and the utilization of single DPU core, the design of MCDS can effectively improve the overall throughput with restricted on-chip resources. Furthermore, the design of DPU Plus is proposed to improve the schedule efficiency of DPUs through simultaneously implementing DPU with other significant auxiliary modules of the application system on the same FPGA. Finally, a color space conversion module is implemented cooperate to the DPU cores to testify its performance, and the experimen shows that compared with running on the the CPU completely, it achieves16.2x acceleration, and increases the throughput of the entire system by 3.0x.

Deduplication is a data redundancy elimination technique, designed to save system storage resources by reducing redundant data in cloud storage systems. With the development of cloud computing technology, deduplication has been increasingly applied to cloud data centers. However, traditional technologies face great challenges in big data deduplication to properly weigh the two conflicting goals of deduplication throughput and high duplicate elimination ratio. This paper proposes a similarity clustering-based deduplication strategy (named SCDS), which aims to delete more duplicate data without significantly increasing system overhead. The main idea of SCDS is to narrow the query range of fingerprint index by data partitioning and similarity clustering algorithms. In the data preprocessing stage, SCDS uses data partitioning algorithm to classify similar data together. In the data deletion stage, the similarity clustering algorithm is used to divide the similar data fingerprint superblock into the same cluster. Repetitive fingerprints are detected in the same cluster to speed up the retrieval of duplicate fingerprints. Experiments show that the deduplication ratio of SCDS is better than some existing similarity deduplication algorithms, but the overhead is only slightly higher than some high throughput but low deduplication ratio methods.

In recent years, correlation filter based trackers have significantly advanced the state-of-the-art in visual tracking. However, most existing correlation filter based tracking algorithms update target object model assuming that target appearances change smoothly over time. This assumption may not be appropriate for handling more challenging situations such as occlusion, deformation, illumination variation, and abrupt motion, which may break temporal smoothness assumption. To address these issues, in this paper, we propose a novel treestructured correlation filters (TCF) for diverse target object appearance modeling, where multiple correlation filters collaborate to estimate target states and determine the desirable paths for online model updates in the tree. As a result, the proposed TCF tracker has the advantages of both CNNs and correlation filter based trackers. Furthermore, our TCF tracker can preserve model reliability by smoothly updating deep correlation filters along the path in the tree, and make the learned appearance models sufficiently diverse and discriminative. Extensive experimental results on two challenging benchmark datasets demonstrate that the proposed TCF tracking algorithm performs favorably against the state-of-the-art trackers.

In industrial Internet of things (IIoT), peer-to-peer (P2P) energy trading ubiquitously takes place in various scenarios, e.g., microgrids, energy harvesting networks, and vehicle-to-grid networks. However, there are common security and privacy challenges caused by untrusted and nontransparent energy markets in these scenarios. To address the security challenges, we exploit the consortium blockchain technology to propose a secure energy trading system named energy blockchain. This energy blockchain can be widely used in general scenarios of P2P energy trading getting rid of a trusted intermediary. Besides, to reduce the transaction limitation resulted from transaction confirmation delays on the energy blockchain, we propose a credit-based payment scheme to support fast and frequent energy trading. An optimal pricing strategy using Stackelberg game for credit-based loans is also proposed. Security analysis and numerical results based on a real dataset illustrate that the proposed energy blockchain and credit-based payment scheme are secure and efficient in IIoT.

Rapid, reliable and energy-efficient programing code dissemination is a challenging issue and offers a programmable and flexible network architecture for software-defined wireless networks (SDWNs). However, many schemes for programing codes in large-scale network incur a longer dissemination convergence time (DCT) and lower energy efficient in loss nature of wireless channels. In this paper, an adaptive broadcast dissemination (ABD) scheme is proposed to achieve low DCT and high network lifetime for SDWNs. An ABD scheme makes full use of energy left of nodes in areas far from the sink. In an ABD scheme, codes are broadcast constantly few times by nodes near the sink to save energy, and many times by nodes in areas far from the sink to rapidly spread software codes. Thus, an ABD scheme can reduce transmission delay for spreading software code while retaining network lifetime. Theoretical analysis and experimental results show that DCT in an ABD scheme is reduced by 28.12–29.86% compared with the hybrid scheme, while retaining network lifetime.