Skip to main content
EURASIP Journal on Wireless Communications and Networking
Figure 2 | EURASIP Journal on Wireless Communications and Networking

Figure 2

From: Transmission strategies with interference coordination in spectrum sharing cognitive radio networks under outage probability constraint

Figure 2

Binary Search Tree (BST). A binary search tree (BST) shown in Figure 2 is illustrated the recursive process of the BB algorithm. Each node in the BST represents a particular case when the relaxed SDP problem from (P2) is solved at a partial or complete binary solution. The depth of a node, D, is defined to be the number of determined binary variables in the partial binary solution at this node. At one particular node two child nodes will be created corresponding to two sub-problems in the relaxed SDP form of (P2) with b n = 0 and b n = 1, respectively.

Back to article page