This paper presents a new routing strategy by introducing a tunable parameter into the minimum information path routing strategy we proposed previously.It is found that network transmission capacity can be considerably enhanced by adjusting the parameter with various allocations of node capability for packet delivery.Moreover,the proposed routing strategy provides a traffic load distribution which can better match the allocation of node capability than that of traditional efficient routing strategies,leading to a network with improved transmission performance.This routing strategy,without deviating from the shortest-path routing strategy in the length of paths too much,produces improved performance indexes such as critical generating rate,average length of paths and average search information.
The shortcomings of traditional methods to find the shortest path are revealed,and a strategy of finding the selforganizing shortest path based on thermal flux diffusion on complex networks is presented.In our method,the shortest paths between the source node and the other nodes are found to be self-organized by comparing node temperatures.The computation complexity of the method scales linearly with the number of edges on underlying networks.The effects of the method on several networks,including a regular network proposed by Ravasz and Baraba'si which is called the RB network,a real network,a random network proposed by Ravasz and Baraba'si which is called the ER network and a scale-free network,are also demonstrated.Analytic and simulation results show that the method has a higher accuracy and lower computational complexity than the conventional methods.
In this paper, three robust zero-watermark algorithms named Direct Current coefficient RElationship (DC-RE), CUmulant combined Singular Value Decomposition (CU-SVD), and CUmulant combined Singular Value Decomposition RElationship (CU-SVD-RE) are proposed. The algorithm DC-RE gets the feature vector from the relationship of DC coefficients between adjacent blocks, CU-SVD gets the feature vector from the singular value of third-order cumulants, while CU-SVD-RE combines the essence of the first two algorithms. Specially, CU-SVD-RE gets the feature vector from the relationship between singular values of third-order cumulants. Being a cross-over studying field of watermarking and cryptography, the zero-watermark algorithms are robust without modifying the carrier. Numerical simulation obviously shows that, under geometric attacks, the performance of CU-SVD-RE and DC-RE algorithm are better and all three proposed algorithms are robust to various attacks, such as median filter, salt and pepper noise, and Gaussian low-pass filter attacks.
