Identifying influential nodes in complex networks is of both theoretical and practical importance. Existing methods identify influential nodes based on their positions in the network and assume that the nodes are homogeneous. However, node heterogeneity （i.e., different attributes such as interest, energy, age, and so on ） ubiquitously exists and needs to be taken into consideration. In this paper, we conduct an investigation into node attributes and propose a graph signal pro- cessing based centrality （GSPC） method to identify influential nodes considering both the node attributes and the network topology. We first evaluate our GSPC method using two real-world datasets. The results show that our GSPC method effectively identifies influential nodes, which correspond well with the underlying ground truth. This is compatible to the previous eigenvector centrality and principal component centrality methods under circumstances where the nodes are homogeneous. In addition, spreading analysis shows that the GSPC method has a positive effect on the spreading dynamics.
In this paper, we consider the optimal problem of channels sharing with het-erogeneous traffic （real-time service and non-real-time service） to reduce the data conflict probability of users. Moreover, a multi-dimensional Markov chain model is developed to analyze the performance of the proposed scheme. Meanwhile, performance metrics are derived. Numerical results show that the proposed scheme can effectively reduce the forced termination probability, blocking probability and spectrum utilization.
