In order to improve the throughput of cognitive radio(CR), optimization of sensing time and cooperative user allocation for OR-rule cooperative spectrum sensing was investigated in a CR network that includes multiple ...In order to improve the throughput of cognitive radio(CR), optimization of sensing time and cooperative user allocation for OR-rule cooperative spectrum sensing was investigated in a CR network that includes multiple users and one fusion center. The frame structure of cooperative spectrum sensing was divided into multiple transmission time slots and one sensing time slot consisting of local energy detection and cooperative overhead. An optimization problem was formulated to maximize the throughput of CR network, subject to the constraints of both false alarm probability and detection probability. A joint optimization algorithm of sensing time and number of users was proposed to solve this optimization problem with low time complexity. An allocation algorithm of cooperative users was proposed to preferentially allocate the users to the channels with high utilization probability. The simulation results show that the significant improvement on the throughput can be achieved through the proposed joint optimization and allocation algorithms.展开更多
The optimal transmission lines assignment with maximal reliabilities (OTLAMR) in the multi-source multi-sink multi-state computer network (MMMCN) was investigated. The OTLAMR problem contains two sub-problems: the MMM...The optimal transmission lines assignment with maximal reliabilities (OTLAMR) in the multi-source multi-sink multi-state computer network (MMMCN) was investigated. The OTLAMR problem contains two sub-problems: the MMMCN reliabilities evaluation and multi-objective transmission lines assignment optimization. First, a reliability evaluation with a transmission line assignment (RETLA) algorithm is proposed to calculate the MMMCN reliabilities under the cost constraint for a certain transmission lines configuration. Second, the non-dominated sorting genetic algorithm II (NSGA-II) is adopted to find the non-dominated set of the transmission lines assignments based on the reliabilities obtained from the RETLA algorithm. By combining the RETLA and the NSGA-II algorithms together, the RETLA-NSGA II algorithm is proposed to solve the OTLAMR problem. The experiments result show that the RETLA-NSGA II algorithm can provide efficient solutions in a reasonable time, from which the decision makers can choose the best solution based on their preferences and experiences.展开更多
Due to the inherent complexity, traditional ant colony optimization (ACO) algorithm is inadequate and insufficient to the reactive power optimization for distribution network. Therefore, firstly the ACO algorithm is...Due to the inherent complexity, traditional ant colony optimization (ACO) algorithm is inadequate and insufficient to the reactive power optimization for distribution network. Therefore, firstly the ACO algorithm is improved in two aspects: pheromone mutation and re-initialization strategy. Then the thought of differential evolution (DE) algorithm is proposed to be merged into ACO, and by producing new individuals with random deviation disturbance of DE, pheromone quantity left by ants is disturbed appropriately, to search the optimal path, by which the ability of search having been improved. The proposed algorithm is tested on IEEE30-hus system and actual distribution network, and the reactive power optimization results are calculated to verify the feasibility and effectiveness of the improved algorithm.展开更多
This paper investigates channel allocation and cognitive radio networks. The color-sensitive graph power control schemes in OFDM-based multi-hop coloring (CSGC) model is viewed as an efficient solution to the spectr...This paper investigates channel allocation and cognitive radio networks. The color-sensitive graph power control schemes in OFDM-based multi-hop coloring (CSGC) model is viewed as an efficient solution to the spectrum assignment problem. The model is extended to combine with the power con- trol strategy to avoid interference among secondary users and adapt dynamic topology. The optimiza- tion problem is formulated encompassing the channel allocation and power control with the interfer- ence constrained below a tolerable limit. Meanwhile, the proposed resource allocation scheme takes the fairness of secondary users into account in obtaining the solution of optimization. Numerical re- suits show that the proposed strategy outperforms the existing spectrum assignment algorithms on the performance of both the network throughput and minimum route bandwidth of all routes, as well as the number of connected multi-hop routes which implies the fairness among secondary users.展开更多
基金Project(61471194)supported by the National Natural Science Foundation of ChinaProject(BK20140828)supported by the Natural Science Foundation of Jiangsu Province,ChinaProject supported by the Scientific Research Foundation for the Returned Overseas Chinese Scholars,Ministry of Education,China
文摘In order to improve the throughput of cognitive radio(CR), optimization of sensing time and cooperative user allocation for OR-rule cooperative spectrum sensing was investigated in a CR network that includes multiple users and one fusion center. The frame structure of cooperative spectrum sensing was divided into multiple transmission time slots and one sensing time slot consisting of local energy detection and cooperative overhead. An optimization problem was formulated to maximize the throughput of CR network, subject to the constraints of both false alarm probability and detection probability. A joint optimization algorithm of sensing time and number of users was proposed to solve this optimization problem with low time complexity. An allocation algorithm of cooperative users was proposed to preferentially allocate the users to the channels with high utilization probability. The simulation results show that the significant improvement on the throughput can be achieved through the proposed joint optimization and allocation algorithms.
基金Projects(61004074,61134001,21076179)supported by the National Natural Science Foundation of ChinaProject(2009BAG12A08)supported by the National Key Technology Support Program of China+1 种基金Project(2010QNA5001)supported by the Fundamental Research Funds for the Central Universities of ChinaProjects(2012AA06A404,2006AA04Z184)supported by the National High Technology Research and Development Program of China
文摘The optimal transmission lines assignment with maximal reliabilities (OTLAMR) in the multi-source multi-sink multi-state computer network (MMMCN) was investigated. The OTLAMR problem contains two sub-problems: the MMMCN reliabilities evaluation and multi-objective transmission lines assignment optimization. First, a reliability evaluation with a transmission line assignment (RETLA) algorithm is proposed to calculate the MMMCN reliabilities under the cost constraint for a certain transmission lines configuration. Second, the non-dominated sorting genetic algorithm II (NSGA-II) is adopted to find the non-dominated set of the transmission lines assignments based on the reliabilities obtained from the RETLA algorithm. By combining the RETLA and the NSGA-II algorithms together, the RETLA-NSGA II algorithm is proposed to solve the OTLAMR problem. The experiments result show that the RETLA-NSGA II algorithm can provide efficient solutions in a reasonable time, from which the decision makers can choose the best solution based on their preferences and experiences.
文摘Due to the inherent complexity, traditional ant colony optimization (ACO) algorithm is inadequate and insufficient to the reactive power optimization for distribution network. Therefore, firstly the ACO algorithm is improved in two aspects: pheromone mutation and re-initialization strategy. Then the thought of differential evolution (DE) algorithm is proposed to be merged into ACO, and by producing new individuals with random deviation disturbance of DE, pheromone quantity left by ants is disturbed appropriately, to search the optimal path, by which the ability of search having been improved. The proposed algorithm is tested on IEEE30-hus system and actual distribution network, and the reactive power optimization results are calculated to verify the feasibility and effectiveness of the improved algorithm.
基金Supported by the National Natural Science Foundation of China(No.61461006)the Guangxi Province Natural Science Foundation(No.2013GXNSFBA19271)
文摘This paper investigates channel allocation and cognitive radio networks. The color-sensitive graph power control schemes in OFDM-based multi-hop coloring (CSGC) model is viewed as an efficient solution to the spectrum assignment problem. The model is extended to combine with the power con- trol strategy to avoid interference among secondary users and adapt dynamic topology. The optimiza- tion problem is formulated encompassing the channel allocation and power control with the interfer- ence constrained below a tolerable limit. Meanwhile, the proposed resource allocation scheme takes the fairness of secondary users into account in obtaining the solution of optimization. Numerical re- suits show that the proposed strategy outperforms the existing spectrum assignment algorithms on the performance of both the network throughput and minimum route bandwidth of all routes, as well as the number of connected multi-hop routes which implies the fairness among secondary users.