Interference alignment(IA) is one of the promising measures for the multi-user network to manage interference. The rank constraints rank minimization means that interference spans the lowest dimensional subspace and t...Interference alignment(IA) is one of the promising measures for the multi-user network to manage interference. The rank constraints rank minimization means that interference spans the lowest dimensional subspace and the useful signal spans all available spatial dimensions. In order to improve the performance of two-way relay network, we can use rank constrained rank minimization(RCRM) to solve the IA problem. This paper proposes left reweighted nuclear norm minimization-γalgorithm and selective coupling reweighted nuclear norm minimization algorithm to implement interference alignment in two-way relay networks. The left reweighted nuclear norm minimization-γ algorithm is based on reweighted nuclear norm minimization algorithm and has a novel γ choosing rule. The selective coupling reweighted nuclear norm minimization algorithm weighting methods choose according to singular value of interference matrixes. Simulation results show that the proposed algorithms considerably improve the sum rate performance and achieve the higher average achievable multiplexing gain in two-way relay interference networks.展开更多
There is an increasing number of Internet applications, which leads to an increasing network capacity and availability. Internet traffic characterisation and application identification are, therefore, more important f...There is an increasing number of Internet applications, which leads to an increasing network capacity and availability. Internet traffic characterisation and application identification are, therefore, more important for efficient network management. In this paper, we construct flow graphs from detailed Internet traffic data collected from the public networks of Internet Service Providers. We analyse the community structures of the flow graph that is naturally formed by different applications. The community size, degree distribution of the community, and community overlap of 10 Internet applications are investigated. We further study the correlations between the communities from different applications. Our results provide deep insights into the behaviour Internet applications and traffic, which is helpful for both network management and user behaviour analysis.展开更多
基金supported by the National Science Foundation of China (NO.61271240, 61671253)
文摘Interference alignment(IA) is one of the promising measures for the multi-user network to manage interference. The rank constraints rank minimization means that interference spans the lowest dimensional subspace and the useful signal spans all available spatial dimensions. In order to improve the performance of two-way relay network, we can use rank constrained rank minimization(RCRM) to solve the IA problem. This paper proposes left reweighted nuclear norm minimization-γalgorithm and selective coupling reweighted nuclear norm minimization algorithm to implement interference alignment in two-way relay networks. The left reweighted nuclear norm minimization-γ algorithm is based on reweighted nuclear norm minimization algorithm and has a novel γ choosing rule. The selective coupling reweighted nuclear norm minimization algorithm weighting methods choose according to singular value of interference matrixes. Simulation results show that the proposed algorithms considerably improve the sum rate performance and achieve the higher average achievable multiplexing gain in two-way relay interference networks.
基金supported by the National Natural Science Foundation of Chinaunder Grant No.61171098the Fundamental Research Funds for the Central Universities of Chinathe 111 Project of China under Grant No.B08004
文摘There is an increasing number of Internet applications, which leads to an increasing network capacity and availability. Internet traffic characterisation and application identification are, therefore, more important for efficient network management. In this paper, we construct flow graphs from detailed Internet traffic data collected from the public networks of Internet Service Providers. We analyse the community structures of the flow graph that is naturally formed by different applications. The community size, degree distribution of the community, and community overlap of 10 Internet applications are investigated. We further study the correlations between the communities from different applications. Our results provide deep insights into the behaviour Internet applications and traffic, which is helpful for both network management and user behaviour analysis.
