Energy-efficient distributed heterogeneous clustered spectrum-aware cognitive radio sensor network for guaranteed quality of service in smart grid

The development of a modern electric power grid has triggered the need for large-scale monitoring and communication in smart grids for efficient grid automation. This has led to the development of smart grids, which utilize cognitive radio sensor networks, which are combinations of cognitive radios and wireless sensor networks. Cognitive radio sensor networks can overcome spectrum limitations and interference challenges. The implementation of dense cognitive radio sensor networks, based on the specific topology of smart grids, is one of the critical issues for guaranteed quality of service through a communication network. In this article, various topologies of ZigBee cognitive radio sensor networks are investigated. Suitable topologies with energy-efficient spectrum-aware algorithms of ZigBee cognitive radio sensor networks in smart grids are proposed. The performance of the proposed ZigBee cognitive radio sensor network model with its control algorithms is analyzed and compared with existing ZigBee sensor network topologies within the smart grid environment. The quality of service metrics used for evaluating the performance are the end-to-end delay, bit error rate, and energy consumption. The simulation results confirm that the proposed topology model is preferable for sensor network deployment in smart grids based on reduced bit error rate, end-to-end delay (latency), and energy consumption. Smart grid applications require prompt, reliable, and efficient communication with low latency. Hence, the proposed topology model supports heterogeneous cognitive radio sensor networks and guarantees network connectivity with spectrum-awareness. Hence, it is suitable for efficient grid automation in cognitive radio sensor network–based smart grids. The traditional model lacks these capability features.

Energy-Efficient Cognitive Radio Sensor Networks: Parametric and Convex Transformations

Designing energy-efficient cognitive radio sensor networks is important to intelligently use battery energy and to maximize the sensor network life. In this paper, the problem of determining the power allocation that maximizes the energy-efficiency of cognitive radio-based wireless sensor networks is formed as a constrained optimization problem, where the objective function is the ratio of network throughput and the network power. The proposed constrained optimization problem belongs to a class of nonlinear fractional programming problems. Charnes-Cooper Transformation is used to transform the nonlinear fractional problem into an equivalent concave optimization problem. The structure of the power allocation policy for the transformed concave problem is found to be of a water-filling type. The problem is also transformed into a parametric form for which a ε-optimal iterative solution exists. The convergence of the iterative algorithms is proven, and numerical solutions are presented. The iterative solutions are compared with the optimal solution obtained from the transformed concave problem, and the effects of different system parameters (interference threshold level, the number of primary users and secondary sensor nodes) on the performance of the proposed algorithms are investigated.

Energy-Efficient Cognitive Radio Sensor Networks: Parametric and Convex Transformations

Designing energy-efficient cognitive radio sensor networks is important to intelligently use battery energy and to maximize the sensor network life. In this paper, the problem of determining the power allocation that maximizes the energy-efficiency of cognitive radio-based wireless sensor networks is formed as a constrained optimization problem, where the objective function is the ratio of network throughput and the network power. The proposed constrained optimization problem belongs to a class of nonlinear fractional programming problems. Charnes-Cooper Transformation is used to transform the nonlinear fractional problem into an equivalent concave optimization problem. The structure of the power allocation policy for the transformed concave problem is found to be of a water-filling type. The problem is also transformed into a parametric form for which a ε-optimal iterative solution exists. The convergence of the iterative algorithms is proven, and numerical solutions are presented. The iterative solutions are compared with the optimal solution obtained from the transformed concave problem, and the effects of different system parameters (interference threshold level, the number of primary users and secondary sensor nodes) on the performance of the proposed algorithms are investigated.