Dynamic control for cooperative jamming with a non-altruistic node

Cooperative jamming approach in secure communication typically assumes dedicated and/or altruistic jamming nodes, investing their resources for the good of the whole system. In this paper, we consider a cognitive radio network with non-altruistic jamming nodes, from which a source node utilizes jamming service, compensating them with a fraction of its bandwidth for transmission of its data. The nodes only know the distribution of the gains of channels to the eavesdropper. Particularly, the primary node injects confidential data and secondary nodes inject open data at rates in order to maximize global utility function, while keeping data queues stable and meeting a constraint on the secrecy outage probability. The constraint on the secrecy outage probability is met with the help of jamming service obtained from the secondary nodes. Our scheme achieves a utility, arbitrarily close to the maximum achievable utility.