Message-Passing Algorithms for Optimal Utilization of Cognitive Radio Networks
Cognitive Radio has been proposed as a key technology to significantly improve spectrum usage in wireless networks by enabling unlicensed users to access unused resource. We present new algorithms that are needed for the implementation of opportunistic scheduling policies that maximize the throughput utilization of resources by secondary users, under maximum interference constraints imposed by existing primary users. Our approach is based on the Belief Propagation (BP) algorithm, which is advantageous due to its simplicity and potential for distributed implementation. We examine convergence properties and evaluate the performance of the proposed BP algorithms via simulations and demonstrate that the results compare favorably with a benchmark greedy strategy.
Cognitive Radio Networks (CRNs) have recently been proposed as a promising approach to improve spectrum usage, by enabling unlicensed users to access unused wireless resources . The key technology is cognitive radio that can dynamically adjust its channel allocation depending on spectrum availability. Therefore, in CRNs, we distinguish between: Primary Users (PU), who have licensed rights to network resources, and (unlicensed) Secondary Users (SU) equipped with cognitive radios, who access underutilized spectrum channels. A basic requirement is that secondary users must not adversely impact the performance of primary users. This can be ensured by a coordination mechanism, under the terms of an agreement between users, but in many practical cases such extensive coordination is unfeasible. In contrast, an approach that leverages the cognitive radio capabilities consists in secondary users monitoring the spectrum and exploiting opportunistically channels unemployed by primary users. Combined with the dynamic wireless environment this poses important challenges as the channel access algorithms must be very efficient for the access to be updated continuously, and distributed to allow for uncoordinated opportunistic operation.
In this paper, we present new algorithms needed for opportunistic scheduling, which maximize the utility of the secondary users, under maximum interference constraints imposed by existing primary users. The utility can be a function of actual or stochastic traffic and communication rates, or corresponding queue lengths; such choices can be formulated with the goal to maximize the achievable network throughput using Lyapunov Optimization techniques (see the seminal paper , and  for an application in CRNs). Our aim is to select sets of links between secondary users and free primary channels that can be activated simultaneously, such as to maximize the total utility of secondary users, without causing disruptive interference to existing primary users. Hence, the optimization problem in our framework, which we describe in Section 2, is a generalization of Maximum Weight Matching (MWM), with additional interference constraints.
Our approach is based on the Belief Propagation (BP) algorithm, which is advantageous due to its simplicity and potential for distributed implementation. BP is an iterative message-passing algorithm, that was discovered independently in the information theory , machine learning  and statistical physics  communities. It has been used, with spectacular experimental success, in many application areas, for instance iterative decoding and combinatorial optimization, which involve graphs with cycles. The physical interpretation of message-passing algorithms and in particular belief propagation was later explained by statistical mechanics studies of disordered systems [4, 11, 5], consolidating BP and its generalizations to a very powerful tool that provides practical solutions to hard problems. Additionally, BP has been shown to solve the classical Maximum Weight Matching exactly in bipartite graphs with cycles .
Cognitive radio networks have attracted significant research interest (see  for a survey), including work on optimal spectrum scheduling. However, the problem of efficient and fully distributed throughput optimization under interference remains challenging. A recent paper  proposes affinity propagation based algorithms for spectrum access in CRNs, in the specific case where primary users permit secondary users access as long as they consent to act as relays. The study that is closest to our approach is , which introduces a general framework using the Lyapunov Optimization technique to design a scheduling policy for flow control and resource allocation in CRNs. It motivates the formulation of the optimization problem we aim to address; specifically, the policy proposed in  is required to solve a certain deterministic optimization problem at each time slot, which imposes a computational bottleneck when interference is taken into account. In this paper, our contribution is complementary as we focus on a more general algorithmic solution, and the problem we address can be used to solve the optimization problem discussed above, in contrast to  that merely presents a greedy algorithm for the simplified case of no interference.
The paper is organized as follows: we present a general modeling framework for opportunistic cognitive radio networks and formulate the problem of optimal channel allocation with interference control in Section 2; in Section 3, we develop two new Belief Propagation algorithms, which can be fully decentralized, to solve the optimization problem for hard and soft interference constraints, respectively; in Section 4, we show the convergence and evaluate the performance of the proposed BP algorithms via simulation scenarios in a realistic Signal to Interference plus Noise (SINR) based model of cognitive radio networks and demonstrate that the results compare favorably with a benchmark greedy scheduling strategy.
The model adopts a hierarchical access structure with primary and secondary users. The basic idea is to open channel frequencies to secondary users while considering the interference experienced by primary users (licensees). Fig 1 illustrates a CRN. Primary users (red colored) are first to be served by channels. Secondary users, in non-cooperative scenario can not access channels if they are occupied by a primary user.
We assume that information about primary user communications are provided reliably. Each primary user has its own channel frequency which is not shared with others. Thus, primary users can send data over their own licensed channels to their respective access points simultaneously. Secondary users do not have such channels and opportunistically try to send their data to receivers by utilizing idle primary channels. Formally we define a CRN by secondary users and primary users. Each secondary user may have access to a subset of primary channels (see Fig. 1) according to their Euclidean distance. Throughout this paper primary users are denoted by and secondary users by . We define a binary metric for each secondary user and primary channel where indicates accessibility of primary channel to secondary user .
We present the problem in which message-passing technique can be used to find optimal scheduling in CRNs. Consider a CRN where a subset of primary users are inactive at each time slot. Each cognitive user can access a primary channel if the channel is accessible and if its corresponding primary user is inactive. However, at the same time it should not interfere with transmissions of other active primary users. We define an interference matrix which measures the interfere experienced at primary user when secondary user is connected to a free channel. Note that is different from the accessibility matrix because a secondary user might not have access to a primary channel () but have a non-zero interference with (active) primary user () when it is connected to another free channel. To each secondary user , we assign a binary variable where indicates secondary user connected to a free channel and stands for the case where is not connected to any primary channel. We now introduce a factor graph representation of the CRN (Fig. 2). It is a bipartite graph which includes secondary and primary users as different factor nodes, shown by circles and squares, respectively. Secondary and primary users are connected to each other according to the accessibility and interference matrices. We assume that the first primary users are idle at the time and only primary users are active (indexed by ).
In order to distinguish which primary channel is assigned to a secondary user, we introduce variable for user and its accessible free primary channel such that when is connected to . By definition we have
where is the step function. The ultimate goal is to efficiently connect secondary users to free primary channels. Secondary users might have different priority to be connected according to their different tasks. The problem then can be expressed as an optimization problem to find the best assignment such that the following cost function is minimized
Here is the task (priority) of secondary user . Clearly secondary users with higher priority have preference to be connected. However the interference and accessibility constraints must both be satisfied which makes the problem hard. Note that it is possible to extend the current prior task vector to more general cases where secondary users have different priorities to access different unused channels.
In what follows we describe two different optimization objectives in solving the CRN optimization problem. The first approach is based on hard constraints induced by active primary users while the second is based on soft constraints where interferences between secondary users and primary users are tolerated but the cost function is modified accordingly.
2.1 Model A
To formulate the hard interference constraints imposed by active primary users, we introduce a
quenched variable for every primary user
to indicate the maximum interference tolerated. We assume that the sum over interferences from all secondary users connected to free channels must be smaller than the active primary user threshold.
The optimization problem then is to minimize the cost function Eq. 2
such that following conditions are satisfied, which must be solved in conjunction with Eq. 1:
hard interference constraints imposed by active primary users
each secondary user is connected to at most one free channel
and each free channel to at most one secondary user
2.2 Model B
An alternative approach is to relax the hard interference constraints between secondary users and active primary channels. We modify the cost function such that the solution minimizes the interference between secondary users and active primary channels. We consider a quadratic cost of the interferences between SUs and active PUs.
where the goal is to find that minimizes the cost function (Eq. 6), conditioned on constraints introduced in Eqs. 4 and 5. This objective represents a trade-off between maximizing the number of connected secondary users and minimizing the induced interference.
In both models, we assume a stationary state described by the Boltzmann distribution , where the parameter is analogous to inverse temperature and is a measure of how strictly the minimization in enforced. In the limit , it will be concentrated to the minimum of the cost function.
3 Belief propagation
In a system with a given cost function, the problem of finding the global minimum or calculating marginal probabilities can be solved approximately by the BP algorithm.
To implement BP we exchange a set of messages between the different nodes in a factor graph. The type of messages to be exchanged between secondary users and active primary users are essentially different from those exchanged between secondary users and inactive primary users. To an active primary user the important information is whether a secondary user with non-zero interference is connected to any free channel, irrespective of the channel. On the other hand, for free channels it is important to take into account the information about the specific connections (see constraints 4 and 5). We introduce four different messages as follows
is a messages sent from secondary user to free channel with non-zero accessibility metric . It gives the probability of observing .
is the reverse message sent from available primary user to secondary user .
is a message sent from secondary user to active primary user with non-zero interference metric (). It gives the probability of secondary user to be connected (not-connected) to one of its available free channel ().
is the corresponding reverse message from active primary user to secondary user .
Belief propagation equations are to be solved iteratively. We assign an initial (unbiased) condition to each message and iterate all messages until a fixed point is reached. This is a fully decentralized procedure and can be applied efficiently. Once the fixed point is reached, the marginal probabilities for each secondary user can be computed. Each marginal probability represents the probability of connecting corresponding secondary users to a free channel.
Note that in order to update message we have to take a summation over where is the average connectivity for active primary users. For sparse interference/connectivity matrices the algorithm provides a fast solution while for dense matrices the corresponding computational complexity grows exponentially and becomes infeasible.
For Model B, we will show that computational complexity remains manageable even in the regime where active primary users experience interference from many secondary users. To simplify the BP equations we introduce the BP field messages . The corresponding new BP equations for model B become
The advantage of this new version of BP is that all equations involve summations over a finite number of terms.
4 Simulation results
In this section, we investigate the performance of BP and compare it to a greedy benchmark algorithm. We show how BP outperforms the latter in finding the better assignment of secondary users to the available free channels.
We consider a cell-based simulation scenario, where base stations are placed uniformly at random in a unit square (accounting for irregular urban terrain) and each base station has one associated channel allocated to a primary user. The secondary users attempt to opportunistically send data to the base-stations using idle primary channels; we thus concentrate on uplink communication.
Power attenuation at distance is , where is the path-loss exponent (we take ) and is a non-negative random variable accounting for fading and shadowing, with unit mean. We assume a Rayleigh fading inspired model, where g is distributed exponentially and is i.i.d. for each secondary user/base-station pair. We also consider a cut-off value below which the received power is assumed to be (this is realistic in practice, and the sum of interference contributions below the threshold can be assumed to be taken into account as background noise). Secondary users can connect to a free channel if the SNR (signal to noise ratio) from the corresponding base-station is above a predefined threshold. Similarly the interference constraint is a different predetermined threshold.
We also propose a greedy algorithm strategy as a simple benchmark to compare with our message passing approach. For Model A, the algorithm is the following: we iteratively choose among the remaining links the one of largest weight (i.e., largest ) and mark it as active as long as the active links constitute a matching and the interference constraints are satisfied for all active primary users; otherwise, the link is removed from the remaining link set. To solve model B, we apply the same algorithm with a simple modification: for each link we subtract from its weight the sum of squared interference it generates and omit the interference constraints.
Through our simulations we set the priority of secondary users to for all users () therefore the absolute value of cost function in model A is equivalent to the number of connected secondary users (see Eq. 2). The higher this number is the better the algorithm performs. All interference thresholds are also set to (). Fig. 4 compares results obtained by BP and the greedy algorithm for a cognitive radio networks with secondary and primary users. As we increase the number of active primary users (), we end up with less free channel frequency to be shared with secondary users and hence the number of connected secondary users decreases. For all values of active primary users BP outperforms the greedy algorithm as is shown in the figure.
To investigate the optimal solution found by BP we plot the results obtained for various values of (Fig. 5). As mentioned earlier, we expect to find the optimal solution by taking the limit . However, the number of connected secondary users converges already for .
Similar behavior is observed for Model B with soft interference constraints. Fig. 6 compares results obtained by BP and the greedy algorithm. It shows the optimal cost value obtained by the different methods for various numbers of active primary users. For all parameters BP finds a better solution (lower minimal cost) compared to the greedy algorithm.
The performance of BP in model B is examined by monitoring the two parts of cost function: interference and the number of connected secondary users for different values of . As expected, the interference part of cost function () vanishes as increases. Figure 7 shows the average results for 10 realizations of cognitive networks with , and . As we increase the interference decreases and the number of connected secondary users increases.
We have applied BP to find the optimal resource utilization in cognitive radio networks. We have cast the task into a optimization problem where the number of connected secondary users is to be maximized under hard and soft interference constraints. A greedy algorithm is used as a benchmark for the BP results; the latter outperforms the former in all the experiments carried out and is computationally efficient.
- F. Akyildiz, W.-Y. Lee, M. C. Vuran, and S. Mohanty. Next generation/ dynamic spectrum access/cognitive radio wireless networks: a survey. Computer Networks Journal, 50:2127–2159, 2006.
- M. Bayati, D. Shah, and M. Sharma. Max-product for maximum weight matching: convergence, correctness, and lp duality. IEEE Transactions on Information Theory, 54(3):1241–1251, 2008.
- R.G. Gallager. Low-Density Parity-Check Codes, Research monograph series. Number 21. MIT Press, Cambridge,MA, 1963.
- Y. Kabashima and D. Saad. Belief propagation vs. TAP for decoding corrupted messages. Europhys. Lett., 44:668–674, 1998.
- M. Mezard and A. Montanari. Information, physics, and computation. Oxford University Press, USA, 2009.
- M. Mézard, G. Parisi, and M.A. Virasoro. Spin Glass Theory and Beyond. World Scientific Publishing Co., Singapore, 1987.
- J. Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, 1988.
- M. Shamaiah, S. H. Lee, S. Vishwanath, and H. Vikalo. Distributed algorithms for spectrum access in cognitive radio relay networks. IEEE Journal on Sel. Areas in Communications, 30(10):1947–1957, 2012.
- L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12):1936–1949, 1992.
- R. Urgaonkar and M.J. Neely. Opportunistic scheduling with reliability guarantees in cognitive radio networks. In INFOCOM 2008.
- J.S. Yedidia, W.T. Freeman, and Y. Weiss. Generalized belief propagation. Advances in neural information processing systems, pages 689–695, 2001.