Digital watermarking is a widely adopted authentication technique and one of its primary concerns in practical usage is robustness. However, existing audio watermarking methods face challenges in countering desynchronization attacks and replay attacks, which can easily lead to watermark extraction failure. In this paper, we introduce a learning-based scheme, named DRAW (Dual-decoder-based Robust Audio Watermarking), to overcome the robustness issue. Specifically, a watermark encoder embeds payloads together with synch codes into audio frames with high imperceptibility. For reliable watermark extraction, two separate decoders are designed, one for Fixed Length Synchronization Decoding (FLSD) and the other for Variable Length Payload Decoding (VLPD). The dual decoders are trained with the encoder with different weights in the loss function by considering their different roles for watermark extraction. To better resist attacks, a distortion layer is incorporated in-between the encoder and the decoders to simulate distortion and facilitate end-to-end learning. For the more challenging replay attacks, a pre-trained Replay Attack Simulation Network (RASN) is applied to simplify the simulation of re-recording with background noise and reverberation. Extensive experimental results show that the proposed method can be applied to variable-length audio clips with better auditory quality, and it outperforms state-of-the-art methods in robustness against various kinds of attacks.

Network Function Virtualization (NFV) can provide the resource according to the request and can improve the flexibility of the network. It has become the key technology of the Internet of Things (IoT). Resource scheduling for the virtual network function service chain (VNF‐SC) is the key issue of the NFV. Energy consumption is an important indicator for the IoT; we take the energy consumption into the objective and define a novel objective to satisfying different objectives of the decision‐maker. Due to the complexity of VNF‐SC deployment problem, through taking into consideration of the heterogeneity of nodes (each node only can provide some specific VNFs), and the limitation of resources in each node, a novel optimal model is constructed to define the problem of VNF‐SC deployment problem. To solve the optimization model effectively, a weighted center opposition‐based learning is introduced to brainstorm optimization to find the optimal solution (OBLBSO). To show the efficiency of the proposed algorithm, numerous of simulation experiments have been conducted. Experimental results indicate that OBLBSO can improve the accuracy of the solution than compared algorithm.

Watermarking is a solution for copyright protection and forensics tracking, but recapturing and de-synchronization attacks may be used to effectively remove audio watermarks. Although much effort has been made in recent years, the robustness of audio watermarking against recapturing and de-synchronization attacks is still a challenging issue. Specifically, we first construct the frequency-domain coefficients logarithmic mean (FDLM) feature of digital audio. By theoretical analysis, we conclude that the residual of the two groups' FDLM feature is robust against recapturing attack. We then propose a robust audio watermarking method based on this feature using the patchwork framework. Compared with the method having the best robustness performance against recapturing attack, the BER value of our method is decreased by 7%. Besides that, the proposed method outperforms the state-of-the-art patchwork-based watermarking methods notably, under recapturing and post-processed with signal processing operations and de-synchronization attacks.

In order to efficiently transfer data, rate control and route scheduling are critical in deep space scenarios. The major challenge is the long-haul and intermittent links, which easily leads to low link utilization. However, Traditional backpressure algorithms can not acquire accurate queue information and maintain long queues at each node. Therefore, we devise a system model for deep space networks, which divides the network into different clusters according to different distance scales. Then, we propose a two-scale geographic back-pressure algorithm whose goal is to improve throughput and decrease propagation delays. In one cluster, we introduce a delay cost function with geographic location information of nodes. And we implement two types of queues at each node between different clusters. The simulation results demonstrate that our algorithm can get smaller average queue lengths and reduce end-to-end delays by 23% compared to original back-pressure algorithms.