Mixed-integer programming based techniques for resource allocation in underlay cognitive radio networks: A survey

Abstract

For about the past decade and a half research efforts into cognitive radio networks (CRNs) have increased dramatically. This is because CRN is recognized as a technology that has the potential to squeeze the most out of the existing spectrum and hence virtually increase the effective capacity of a wireless communication system. The resulting increased capacity is still a limited resource and its optimal allocation is a critical requirement in order to realize its full benefits. Allocating these additional resources to the secondary users (SUs) in a CRN is an extremely challenging task and integer programming based optimization tools have to be employed to achieve the goals which include, among several aspects, increasing SUs throughput without interfering with the activities of primary users (PUs). The theory of the optimization tools that can be used for resource allocations (RA) in CRN have been well established in the literature; convex programming is one of them, in fact the major one. However when it comes to application and implementation, it is noticed that the practical problems do not fit exactly into the format of well established tools and researchers have to apply approximations of different forms to assist in the process. In this survey paper, the optimization tools that have been applied to RA in CRNs are reviewed. In some instances the limitations of techniques used are pointed out and creative tools developed by researchers to solve the problems are identified. Some ideas of tools to be considered by researchers are suggested, and direction for future research in this area in order to improve on the existing tools are presented.

Blockchain‐oriented location privacy preserving for cooperative spectrum sensing in 6G wireless networks

“…Pham et al's usage of a hidden Markov model (HMM) for CSS and spectrum hand-off in a CRN is unscalable due to the solution's completely cooperative character. Briefly put, traditional optimization techniques are unsuitable for CR-IoT applications due to the lack of a complete environment model [19], the fact that they are not scalable to support massive IoT connectivity [20,21], and the fact that they are unable to adapt to the changing and dynamic environments [21]. Many different intelligent MU detections have been developed by researchers for empowering user security such as FoF [22], TTA [23], and so on that are discovered with high accuracy.…”

On the Optimal Deployment of Power Beacons for Massive Wireless Energy Transfer

“…Since the domain of the objective is |B| ∈ N, P1 is a mixedinteger programming problem which is in general nondeterministic polynomial (NP) complete [32]. However, we can overcome this issue by searching over the space of candidate solutions for which the positions of the PBs are optimized.…”

A matching‐based context‐aware relay assignment scheme with power control in ad‐hoc wireless networks

“…To decrease the complexity of computational, most of the works assume a subset of the joint optimization problems [7][8][9][10][11]. Because the relay selection and channel assignment are naturally combinatorial, matching-based approaches are adopted in some articles [12][13][14][15]. The problems solved by the matching-based algorithms are mostly divided into three categories: one-to-one matching, many-to-one (known as college admission) matching, and many-to-many matching.…”