16 January 2023 in IEEE Wireless Communications Letters
At present, the number of incoming devices and mobile data traffic has seen explosive growth, and spectrum resources are difficult to meet the increasing demand. The traditional centralized spectrum management model suffers from low spectrum utilization, high maintenance costs, and data security issues. The decentralized and secure nature of blockchain technology is a natural advantage in solving the problems faced by the current spectrum management model. However, when introducing traditional blockchain technology into spectrum management, it faces problems such as high latency and high resource consumption. In this paper, we design a new blockchain-enabled spectrum trading framework consisting of the access layer, distribution layer, and core layer, and then propose a user benefit-maximum spectrum trading matching scheme. To solve the problem of latency and energy consumption of consensus algorithms in blockchains, the dynamic credit aggregate-signature Byzantine fault tolerance (DCABFT) algorithm based on the Boneh-Lynn-Shacham (BLS) aggregated signature is proposed. Simulation results demonstrate that the proposed scheme can greatly improve the transaction latency and users’ quality of service.
1 August 2021 in Journal of Physics: Conference Series
The traditional k-means algorithm has been widely used as a simple and efficient clustering method. However, the algorithm uses a random initialization method that does not guarantee unique clustering results. In this paper, a novel method for selecting initial cluster centers on the basis of a complex network is proposed. The data set to be clustered is represented as a complex network. The clustering coefficients of a vertex and those of its adjacent vertices are used to introduce the novel concepts of “valley point” and “peak point,” which can be used to construct a set of candidates of the initial cluster centers. Finally, an algorithm for selecting the initial cluster centers from the constructed set of candidates is proposed. The time complexity of the proposed algorithm is O(n 2), where n is the number of data points. The proposed algorithm is applied to four data sets with different dimensions to compute the initial cluster centers for the k-means algorithm. Compared with the random initialization and maximin methods, the proposed algorithm demonstrates superior clustering performance in obtaining the initial cluster centers for the k-means algorithm.