Parameter adjustment that maximizes the energy efficiency of cognitive radio networks is studied in this paper where it can be investigated as a complex discrete optimization problem. Then a quantum-inspired bacterial...Parameter adjustment that maximizes the energy efficiency of cognitive radio networks is studied in this paper where it can be investigated as a complex discrete optimization problem. Then a quantum-inspired bacterial foraging algorithm(QBFA)is proposed. Quantum computing has perfect characteristics so as to avoid local convergence and speed up the optimization of QBFA. A proof of convergence is also given for this algorithm.The superiority of QBFA is verified by simulations on three test functions. A novel parameter adjustment method based on QBFA is proposed for resource allocation of green cognitive radio. The proposed method can provide a globally optimal solution for parameter adjustment in green cognitive radio networks. Simulation results show the proposed method can reduce energy consumption effectively while satisfying different quality of service(Qo S)requirements.展开更多
Recently, the barrier coverage was proposed and received much attention in wireless sensor network (WSN), and the degree of the barrier coverage, one of the critical parameters of WSN, must be re-studied due to the di...Recently, the barrier coverage was proposed and received much attention in wireless sensor network (WSN), and the degree of the barrier coverage, one of the critical parameters of WSN, must be re-studied due to the difference between the barrier coverage and blanket coverage. In this paper, we propose two algorithms, namely, local tree based no-way and back (LTNWB) algorithm and sensor minimum cut sets (SMCS) algorithm, for the opened and closed belt regions to determine the degree of the barrier coverage of WSN. Our main objective is to minimize the complexity of these algorithms. For the opened belt region, both algorithms work well, and for the closed belt region, they will still come into existence while some restricted conditions are taken into consideration. Finally, the simulation results demonstrate the feasibility of the proposed algorithms.展开更多
基金supported by the National Natural Science Foundation of China(61102106)the China Postdoctoral Science Foundation(2013M530148)+1 种基金the Heilongjiang Postdoctoral Fund(LBH-Z13054)the Fundamental Research Funds for the Central Universities(HEUCF140809)
文摘Parameter adjustment that maximizes the energy efficiency of cognitive radio networks is studied in this paper where it can be investigated as a complex discrete optimization problem. Then a quantum-inspired bacterial foraging algorithm(QBFA)is proposed. Quantum computing has perfect characteristics so as to avoid local convergence and speed up the optimization of QBFA. A proof of convergence is also given for this algorithm.The superiority of QBFA is verified by simulations on three test functions. A novel parameter adjustment method based on QBFA is proposed for resource allocation of green cognitive radio. The proposed method can provide a globally optimal solution for parameter adjustment in green cognitive radio networks. Simulation results show the proposed method can reduce energy consumption effectively while satisfying different quality of service(Qo S)requirements.
文摘Recently, the barrier coverage was proposed and received much attention in wireless sensor network (WSN), and the degree of the barrier coverage, one of the critical parameters of WSN, must be re-studied due to the difference between the barrier coverage and blanket coverage. In this paper, we propose two algorithms, namely, local tree based no-way and back (LTNWB) algorithm and sensor minimum cut sets (SMCS) algorithm, for the opened and closed belt regions to determine the degree of the barrier coverage of WSN. Our main objective is to minimize the complexity of these algorithms. For the opened belt region, both algorithms work well, and for the closed belt region, they will still come into existence while some restricted conditions are taken into consideration. Finally, the simulation results demonstrate the feasibility of the proposed algorithms.
