 Research
 Open access
 Published:
Energyefficient time and energy resource allocation in nonselfish symbiotic cognitive relaying sensor network with privacy preserving for smart city
EURASIP Journal on Wireless Communications and Networking volume 2021, Article number: 48 (2021)
Abstract
Energy efficiency and privacy preserving have become essential for the wireless sensor networks. In this paper, a joint energy and time resource allocation problem for the cognitive users (CUs) in a nonselfish symbiotic cognitive relaying scheme (NSCRS) is considered. We aim to maximize the total energy efficiency (EE) of the primary user and CUs with the consideration of information privacy under the total energy constraints of CUs. With full channel state information (CSI), an optimal energy and time resource allocation algorithm is proposed based on the exhaustive searching. Besides, in order to reduce the overhead of CSI feedback, a suboptimal algorithm, in which only the partial instantaneous CSI is required, is additionally proposed. Simulation results demonstrate the EE of primary and CUs in the NSCRS with consideration of information privacy can be greatly improved by the proposed algorithms.
1 Introduction
Recently, the wireless sensor network (WSN) with privacy preserving has been widely considered in the civilian fields [1, 2]. However, due to the limited power supply for sensor nodes, energy efficiency of relay assisted WSN has attracted more and more attention [3, 4]. In addition, owing to better spectrum efficiency via relays with cognitive function, the radio resource management for EE of cognitive relay assisted WSN with privacy preserving is valuable for researching.
Owing to a larger service coverage and a higher system capacity at a relatively low deployment cost, relays had been widely considered into WSN to prolong the lifetime of network [5,6,7,8,9,10]. There are usually two kinds of relays, amplifyandforward (AF) relay and decodedandforward (DF) relay. The AF relay simply forwards the received signal to the destination, whereas the DF relay needs to decode the signals before the transmission [11]. In [12], a threelayered architecture was proposed for randomly deployed heterogeneous wireless sensor networks, where a minimum energy consumption algorithm for relay node selection was presented to improve the network lifetime. The author in [13] investigated a load balancing strategy of optimal number of relays for deploying for a longer network lifetime. Meanwhile, a minimum number of relay nodes, which is utilized to enhance the outage probability, was obtained by the proposed relay deployment algorithm [14]. Besides, a novel connectivityaware approximation algorithm for best relay node placement was proposed to offer a major step forward in saving system overhead in the wireless sensor networks [15]. And a nonorthogonal AF (NAF) scheme, where all the relays were allowed to transmit signals in the same time and frequency simultaneously, was considered and a higher spectral efficiency could be achieved compared to the orthogonal AF scheme [16,17,18]. However, the EE as well as transmission model with privacy preserving was not considered in [5,6,7,8,9,10,11,12,13,14,15,16,17,18].
Meanwhile, a demandbased load balancing algorithm was addressed for energyefficiency in WSN to improve the network lifecycle and ensure the communication quality simultaneously in [19]. A cooperative privacy preserving scheme, in which an opportunistic user selection policy was investigated to optimize the secrecy performance, was proposed in multiuser relay network [20]. However, the cognitive relay function as well as the NAF relaying was not further considered in [19, 20]. Furthermore, cognitive radio is regarded as an effective approach for enhancing the utilization of the radio electromagnetic spectrum [21]. In [22], a distributed connection restoration algorithm, in which cognitive function based relays were considered, was proposed to ensure the connection of WSN with a minimum number of relays. The authors in [23] considered a WSN, where a cognitive relay assisted the primary transmitter was assumed, and thus, the throughput for both primary and secondary systems could be maximized. By optimizing the sensing time as well as the power allocation in multichannels, the EE of the WSN could be maximized with the assistance of multihops DF relay [24]. However, all the investigated schemes or algorithms in [22,23,24] only considered the orthogonal transmission among relays and the NAF relaying as well as the privacy preserving was not taken into account.
In this paper, we intend to maximize the overall energy efficiency by optimally allocating the energy and time among CUs, while minimizing the required interaction between primary and cognitive networks as well as the overhead of CSI feedback, in a WSN with consideration of privacy preserving, in which an access point (AP) is utilized to broadcast the artificial noise and such noise is eliminated at the destination node to protect the information privacy. We first formulate the energy and time allocation problem to maximize the energy efficiency of NSCRS [25] with privacy preserving under a sum energy constraint at CUs. Then, an optimal energy and time allocation algorithm is proposed based on the full CSI feedback. In order to reduce the overhead of CSI feedback, another optimal algorithm based on partial CSI feedback, in which only the instantaneous CSI of PU\(_s\)PU\(_d\), instantaneous CSI of PU\(_s\)CU\(_s\), and the average value of CSI between CUs and PU\(_d\) for each fading block rather than an instantaneous value are required, is proposed for the slow fading channel environment.
The remainder of this paper is organized as follows. Section 2 gives a detailed description of the system model. In Sect. 3, the optimal joint energy and time resource allocation problem for NSCRS is addressed. In Sect. 4, the proposed optimal and suboptimal algorithms are given in details. Intensive simulations are conducted to evaluate the proposed algorithms in Sect. 5. Finally, the paper is concluded in Sect. 6.
2 System model
In this section, the system model, including system architecture and transmission models for both conventional cognitive radio scheme (CCR) and NSCRS with consideration of privacy preserving, for the network with coexistence of primary and cognitive users is presented in detail.
2.1 System architecture for coexistence of primary and cognitive networks with consideration of privacy preserving
We consider a system that consists of primary and cognitive networks as shown in Fig. 1. We assume that the primary network is a time division multiple address (TDMA)based halfduplex network, in which the PU\(_s\) transmits messages to different PUs, i.e., PU\(_d\) , in different time slots and nodes cannot transmit and receive simultaneously. In the cognitive network, CUs seek opportunities to access the AP of cognitive network and CUs will cooperate with PU\(_s\) when the energy efficiency is better than that of the direct transmission from PU\(_s\) to PU\(_d\). For the symbiotic architecture, CUs can send messages to AP only when CUs have incentive time obtained from the cooperative transmission to the PU. Besides, there are undesired nodes, which are viewed as potential eavesdroppers, around PU\(_d\). Therefore, to prevent privacy leakage, it is assumed that the AP broadcasts two kinds of artificial noise (AN) in phases 1 and 2, respectively, when CUs are considered as relays. While the privacy preserving is assumed to be based on the acknowledgement of CSI at AP, which can be obtained by the handshake procedure [20]. Moreover, for simplicity, we assume that the channels among PU\(_s\), CUs, AP, and PU\(_d\) are quasistatic, independent and identically distributed (i.i.d.), which means that the channel state will remain constant within a fading block and vary independently and identically from one fading block to another. In addition, the flat Rayleigh fading channel is assumed, that is, the fading channel will remain almost unchanged over long enough duration for channel estimation, cooperation, and data transmission. Besides, a control channel for the delivery of CSI, cooperation parameters and incentive time allocation is also considered [25, 26].
2.2 Transmission methods for CCR and NSCRS with privacy preserving
The transmission method of CCR is shown in Fig. 2a. The PU\(_s\) has a constant power of \({{P}_{\text{PU}}}\) for both CCR and NSCRS. And the transmission time is assumed to be T seconds. For the privacy preserving, it is assumed that the AP will broadcast the AN, which is known at the PU\(_d\), in CCR. Therefore, the additive variable of AN at PU\(_d\) can be eliminated owing to the acknowledgement of AN. However, for the undesired nodes, the AN cannot be removed. Thus, the received signal power at desired PU, i.e., PU\(_d\), can be given as \({{P}_{D}}\),
where \({{E}_{\text{PU}}}\) denotes the total transmission energy at PU over time of T and \({\alpha }^{\text{PU}}\) is the channel gain of PU\(_s\)PU\(_d\) due to fading, path loss and shadowing. In addition, the energy consumption of AP in CCR is assumed to be \({{E}_{\text{AP}}}\).
And the received signaltonoise ratio (SNR) at PU\(_d\) for CCR, \({{\gamma }_{\text{PU}}}\), can be given as
where N represents the power of additive white Gaussian noise (AWGN). Then, the rate of primary transmission at PU\(_d\) in CCR can be given as
Thus, the number of transmitted information bits for the CCR can be represented as \({{R}_{\text{PU}}}T\).
Figure 2b depicts the transmission method of NSCRS with NAF relaying, in which the time slot consists of two phases with identical durations and incentive time. In phase 1, the PU\(_s\) sends pilots and information to the PU\(_d\). Then the CUs will estimate the energy efficiency by the received pilot and cooperate with PU\(_s\) in phase 2 if the energy efficiency of cooperation is better than that of CCR. Because of the higher transmission rate with cooperation, the time consumption of transmission for PU\(_d\) can be reduced to \({{\rho }_{T}}T\), where \({{\rho }_{\text{T}}}\) is a time allocation ratio parameter. The rest time \(\left( 1{{\rho }_{T}} \right) T\) is named as incentive time, in which the CUs can send their own information to the AP. The energy consumption of PU\(_s\) is denoted as \({{{E}_{\text{PU}}}{{\rho }_{T}}}/{2}\;\) in phase 1 and \({{E}_{\text{CUs}}}\) is considered as the total energy constraint of CUs. \({{E}_{\text{CUs}}}{{\rho }_{E}}\) is the energy consumption of CUs used for cooperation for PU\(_d\) in phase 2 and the rest energy of \(E{}_{\text{CUs}}(1{{\rho }_{E}})\) at CUs is utilized to transmit their own information to the AP, where \({{\rho }_{\text{E}}}\) is the energy allocation ratio parameter.
Moreover, to prevent information leakage, AP broadcasts two kinds of AN \(x_{N}^{1}\) and \(x_{N}^{2}\) in phase 1 and phase 2, respectively. Depending on the CSI information, \(x_{N}^{1}\) can be successfully eliminated by the \(x_{N}^{2}\) at the PU\(_d\). The energy consumption of AP during phases 1 and 2 is assumed to be \({{E}_{\text{AP}}}\). Thus, the transmit power of AP for AN can be described as \({{P}_{\text{AP}}}={{{E}_{\text{AP}}}}/{({{\rho }_{T}}T}\;)\).
As shown in Fig. 1, \({{\alpha }_{k}},{{\beta }_{k}},{{h}_{k}}\) represent the channel gains of PU\(_s\)CU\(_k\), CU\(_k\)PU\(_d\) and CU\(_k\)AP, respectively. Besides, the energy consumption at the kth CU for the cooperative transmission is denoted by \(E_{cu}^{k}\).
In phase 1, the PU\(_s\) transmits a signal to CUs and PU\(_d\), and AP broadcasts jamming signal \(x_{N}^{1}\). Thus, the signal received at the kth CU can be given as
where \({{x}_{S}}\) denotes the desired signal from PU\(_s\) and \(n_k\) is the AWGN. Thus, the signal received at the PU\(_d\) in phase 1, \(y_{d}^{1}\), can be described as,
In phase 2, the received signals at CUs are, respectively, amplified and retransmitted to the PU\(_d\), where the nonorthogonal AF relaying is considered and all the CUs are allowed to transmit their signals simultaneously. And AP broadcasts jamming signal \(x_{N}^{2}\). In order to remove the effect of AN at PU\(_d\), \(x_{N}^{2}\) is designed as
And the signal transmitted from the kth CU to the PU\(_d\) can be described by
Delay diversity can be used to combine the received signals from CUs in phase 2. It is assumed that the transmitted signals from CUs may arrive at the PU\(_d\) with different delays. Then, the PU\(_d\) can coherently combine the entire received signals along the paths by the Rake receiver with maximum ratio combining (MRC). Thus, the signal received at PU\(_d\) in phase 2 can be given by
Thus, based on (5) the total signal received at PU\(_d\) can be expressed as
After substitute (6) into (9), we can get (10), since (11) is satisfied.
For the received signal at the undesired nodes, the AN cannot be canceled since channel characteristics are unknown. Thus, the SNR of the undesired nodes is heavily degraded and the privacy preserving can be guaranteed.
Thanks to the excellent autocorrelation property of welldesigned spreading code or interference cancellation, the interference at the PU\(_d\) from CUs can be neglected. Then, after combining the received signals in phases 1 and 2 with MRC [27], the received SNR at the PU\(_d\) with cooperation from CUs, \(\gamma^{cu}\), and the corresponding transmission rate, \(R^{cu}\), can be, respectively, expressed as
The right two terms of (12) represent the received SNR at the PU\(_d\) in phase 1 and phase 2, respectively. Also, the received noises amplified by the CUs still remain in the denominator of the second term, while the interference from other CUs is neglected. The coefficient of 1/2 in (13) is caused by the half duplex AF relaying scheme with two identical duration phases.
Owing to the cooperation by the CUs, the required transmission time can be reduced to \({{\rho }_{T}}T\) and the rest of original time \(\left( 1{{\rho }_{T}} \right) T\) will be allocated to CUs as the incentive time. Simultaneously, to get the maximal transmission rate in the incentive time, the incentive time \((1{{\rho }_{T}})T\) will be allocated to the best CU, i.e., the hlCU which has the highest SNR to the AP among all the CUs. As a result, the \({{k}_{i}}\)th CU is selected based on (14).
where \({{h}_{i}}\), \(i\in [1,2,...,K]\), represents the channel gain from the ith CU to the AP. Thus, the corresponding transmission rate in the incentive time can be given as
3 Problem formulation
3.1 Energy efficiency of NSCRS
As a reward, an incentive time will be allocated to CUs if the cooperative transmission by CUs can offer a higher energy efficiency for the system. Otherwise, the \(PU_s\) will occupy the entire duration and no incentive time will be allocated to the CUs, i.e., CCR. So the energy efficiency, which is defined as the total number of transmitted bits divided by the total consumed energy, in NSCRS can be given as
where the function max(\(\cdot ,\cdot\)) will return the maximum value of the arguments. \(\eta^{\text{PU}}\) and \(\eta^{cu}\), respectively, represent the energy efficiency of CCR and NSCRS. \(\eta^{\text{PU}}\) and \(\eta^{cu}\) can be given as
The denominator of (18) represents the total consumed energy of NSCRS and the numerator of (18) is the total throughput of both primary and cognitive networks.
3.2 Problem formulation for NSCRS with privacy preserving
In this paper, we aim to maximize the energy efficiency of NSCRS through optimally allocating the time and energy resource of PU\(_s\) and CUs. According to (18), the energy efficiency optimization problem of NSCRS can be formulated as
The objective function in (19a) intends to maximize the energy efficiency of NSCRS by optimally allocating the energy of CUs and time of PU\(_s\) for the data transmission to the PU\(_d\). The constraint in (19b) means that the energy efficiency of NSCRS should be better than that of CCR. Constraint in (19c) implies that the total transmission bits of NSCRS should be larger than that of CCR. Constraint in (19d) denotes the summed as well as the individual power constraint of CUs. With the fixed \({{\rho }_{E}}\) and \({{\rho }_{T}}\), we can get the maximum of EE for NSCRS as (20a)(20d), and the related Proof is given in "Appendix".
where
and
According to (16), we can decompose the optimization problem into two cases.
Case 1. Consider \(\eta =\eta^{\text{PU}}\) as PU\(_s\) transmits the signals to the PU\(_d\) without the cooperation from CUs as in CCR.
Case 2. Consider \({{\eta }}=\eta^{cu}\) as PU\(_s\) transmits the signals to the PU\(_d\) with the cooperation of CUs.
4 Proposed energy efficiency algorithm with full or partial CSI
If the CSI of \({{\alpha }_{k}}\) and \({{\beta }_{k}}\) can be estimated by the CUs, then the full CSI of \(\alpha^{\text{PU}}\), \({{\alpha }_{k}}\), and \({{\beta }_{k}}\) will be available for the AP, which is called “Scenario 1” for NSCRS. Nevertheless, instantaneous \({{\beta }_{k}}\) may not be available at the AP. Thus, we further consider a “Scenario 2” for the NSCRS with only the partial CSI, that is, \(\alpha^{\text{PU}}\), \({{\alpha }_{k}}\) and an averaged CSI of by longterm observation rather than an instantaneous value. In this section, the energy and time allocation algorithms for both scenarios are investigated. In addition, an equal energy allocation algorithm (EPA), in which the total available energy of the CUs is equally distributed to the CUs, that is, \(E_{cu}^{k}={{E}_{\text{CUs}}}\cdot {{\rho }_{E}}/K\), is also considered.
4.1 Optimal energy and time allocation algorithm with full CSI
With full CSI, we can obtain the optimal solution of \({{\rho }_{T}}=0\) and \({{\rho }_{E}}=0\) for case 1. And for case 2, the optimal algorithm is proposed as follows, by which the optimal \({{\rho }_{T}}\) and \({{\rho }_{E}}\) can be obtained.
Optimal energy and time allocation algorithm with full CSI (OPA)  

(1) Collect \(\alpha^{\text{PU}}\), \({{\alpha }_{k}}\), and \({{\beta }_{k}}\) at the AP  
(2) For \({{\rho }_{T}}=0:0.01:1\), \({{\rho }_{E}}=0:0.01:1\).  
(3) Calculate the optimal SNR of PU\(_s\)CU\(_k\)PU\(_d\) to choose \({{k}^{'}}\)th CU by formula (22)  
(4) Calculate the total number in bits of transmitted messages by \(R^{cu}\cdot {{\rho }_{T}}\cdot T+{{R}_{inc}}\cdot (1{{\rho }_{T}})T\) and the energy efficiency of OPA by formula (20a)  
(5) Calculate the summed bits and energy efficiency in CCR by \({{R}_{\text{PU}}}\cdot T\) and \({{\eta }^{\text{PU}}}={{R}_{\text{PU}}}/({{E}_{\text{PU}}}+{{E}_{\text{AP}}})\)  
(6) Compare \(\eta^{cu}\) with \(\eta^{\text{PU}}\), \(R^{cu}\cdot {{\rho }_{T}}\cdot T+{{R}_{inc}}\cdot (1{{\rho }_{T}})T\) with \({{R}_{\text{PU}}}\cdot T\).  
if \(\eta^{cu}>\eta^{\text{PU}}\) and \([R^{cu}\cdot {{\rho }_{T}}\cdot T+{{R}_{inc}}\cdot (1{{\rho }_{T}})T]>R_{\text{PU}}\cdot T\), then choose NSCRS  
else choose CCR  
end for  
(7)Select the optimal \({{\rho }_{T}}\) and \({{\rho }_{E}}\) with which we can get the best energy efficiency 
Firstly, the CSI of \(\alpha^{\text{PU}}\), \({{\alpha }_{k}}\) and \({{\beta }_{k}}\) is collected at the AP. Then, we calculate the optimal SNR of PU\(_s\)CUkPU\(_d\) to choose \({{k}^{'}}\)th CU by formula (22) with given pair of \({{\rho }_{T}}\) and\({{\rho }_{E}}\)in the range of [0, 1]. Then, the total number in bits of transmitted messages and energy efficiency of OPA and CCR will be calculated, respectively. If the transmitted information bits as well as the energy efficiency of OPA are both larger than these of CCR, the NSCRS will be chosen. Otherwise, the CCR will be chosen. Finally, the optimal \({{\rho }_{T}}\) and \({{\rho }_{E}}\) can be obtained for the best energy efficiency.
4.2 Suboptimal energy and time allocation algorithm with partial CSI feedback
Although OPA is able to achieve the optimal solution in scenario 1, the full instantaneous CSI feedback is needed. Sometimes it is hard to get the feedback of \({{\beta }_{k}}\) immediately. For such case, it is assumed that the channel quality of CUsPU\(_d\) is much better than that of PU\(_s\)CUs, i.e., \({{P}_{C}}\cdot {{\beta }_{k}}>>{{P}_{\text{PU}}}\cdot {{\alpha }_{k}}\)and \({{P}_{C}}\cdot {{\beta }_{k}}>>N\), then \(2{{\rho }_{E}}{{E}_{\text{CUs}}}{{\beta }_{k}}/({{\rho }_{T}}T)>>{{E}_{\text{PU}}}{{\alpha }_{k}}/T\) and \(2{{\rho }_{E}}{{E}_{\text{CUs}}}{{\beta }_{k}}/({{\rho }_{T}}T)>>N\) can be satisfied. Thus, \(x_{N}^{2}\) can be described as
However, due to the lack of \({{\beta }_{k}}\), \(x_{N}^{2}\) is hard to be perfectly eliminated at the PU\(_d\). Rather than considering an instantaneous value of \({{\beta }_{k}}\), an averaged value of \({{{\bar{\beta }}}_{k}}\), which could be obtained by a longterm observation, is assumed to be adopted. Then, the interference power introduced by the AN can be given as \(2{{E}_{c{{u}_{k}}}}\left {{\beta }_{k}}\overline{{{\beta }_{k}}} \right /({{\rho }_{T}}T)\). Therefore, the received SNR at PU\(_d\) with cooperation from CUs, \({{\gamma }_{cu}}\), can be transformed to
Since the i.i.d slow block fading channel is considered in this paper, \({{\beta }_{k}}\approx \overline{{{\beta }_{k}}}\) can be satisfied during each fading block. Compared with the case with instantaneous value of \({{\beta }_{k}}\), \(\overline{{{\beta }_{k}}}\) is more easy to obtained via a longterm observation, and thus, the CSI feedback overhead of \({{\beta }_{k}}\)can be obviously reduced during each fading block. So the \({{\gamma }_{cu}}\) and the index of the selected CUs for incentive time can be, respectively, transformed to
Here, we define a ratio parameter,\(\theta ={{{\alpha }_{k}}}/{\alpha^{\text{PU}}}\;\), to decide whether the \({{\alpha }_{k}}\)is much better than\(\alpha^{\text{PU}}\) or not and the suboptimal algorithm for partial CSI feedback can be given as below.
Partial CSI feedback based suboptimal energy and time allocation algorithm (PPA)  

(1) Collect \(\alpha^{\text{PU}}\), \({{\alpha }_{k}}\) and \(\overline{{{\beta }_{k}}}\) at the AP  
(2) For \({{\rho }_{T}}=0:0.01:1\), \({{\rho }_{E}}=0:0.01:1\)  
(3) Decide the optimal method by comparing \(\theta\) with \({{\theta }_{th}}\), where \({{\theta }_{th}}\) is a predetermined threshold for deciding whether the cooperation from CUs to the PU\(_d\) is effective or not  
i)if \(\theta <{{\theta }_{th}}\), choose CCR  
ii)if \(\theta >{{\theta }_{th}}\), calculate the parameters as follows  
(4) Calculate the total number in bits of transmitted messages and the energy efficiency of both PPA and CCR by the \({{k}^{''}}\)th CU  
(5) Compare \(\eta^{cu}\) with \(\eta^{\text{PU}}\), \(R^{cu}\cdot {{\rho }_{T}}\cdot T+{{R}_{inc}}\cdot (1{{\rho }_{T}})T\) with \({{R}_{\text{PU}}}\cdot T\)  
if \(\eta^{cu}>\eta^{\text{PU}}\) and \([R^{cu}\cdot {{\rho }_{T}}\cdot T+{{R}_{inc}}\cdot (1{{\rho }_{T}})T]>R_{\text{PU}}\cdot T\), then choose NSCRS  
else choose CCR  
end for  
(6)Select the optimal \({{\rho }_{T}}\) and \({{\rho }_{E}}\) with which we can get the best energy efficiency 
Firstly, the CSI of \(\alpha^{\text{PU}}\), \({{\alpha }_{k}}\), and \(\overline{{{\beta }_{k}}}\) are collected at the AP, where \(\overline{{{\beta }_{k}}}\) is not needed to be feedback during a fading block. Then, \(\theta\) and \({{\theta }_{th}}\) are compared with each other to decide the optimal method. if \(\theta <{{\theta }_{th}}\) is satisfied, the CCR will be chosen. Otherwise, we further calculate the total number of bits of transmitted messages as well as the energy efficiency for both PPA and CCR. If the summed bits and energy efficiency of OPA are both larger than these of CCR, the NSCR will be selected. Otherwise, the CCR will be chosen. Finally, the optimal \({{\rho }_{T}}\) and \({{\rho }_{E}}\) can be obtained.
5 Methods
Figure 3 shows the simulation model for the networks of PUs, CUs, and AP. PU\(_s\), PU\(_d\), AP and CUs are placed within a 2dimensional area (500m*500m). PU\(_s\) and PU\(_d\) are, respectively, fixed at (0, 250) and(500, 250). 10 CUs are randomly placed within this region. In addition, we place a AP at (0, 0). A simple pass loss model of \(1/{{d}^{3}}\), where d is the distance between two points, is considered. Block Rayleigh fading channels are assumed among PU\(_s\), CUs, PU\(_d\), and AP. The AWGN power in this region is assumed to be 50dBm and the \({{P}_{\text{AP}}}\) is set to be 15dBm. We consider energy with a unit dBJ, where \(\text{dBJ}=10{{\log }_{10}}\text{J}\). The data to be transmitted from PU\(_s\) to PU\(_d\) are assumed large enough to guarantee the full time transmission between PU\(_s\)PU\(_d\) in case of CCR. Therefore, CUs have no chance to access the AP in the case of CCR. In addition \({{\theta }_{th}}\) is with a range of \([{{10}^{10}}<{{\theta }_{th}}<{{10}^{10}}]\) for a given pair of \(({{\rho }_{T}},{{\rho }_{E}})\).
6 Simulation results and discussion
Figure 4 shows the energy efficiency for NSCRS with OPA, PPA, and EPA compared to CCR under the constraint of \({{P}_{\text{PU}}}=30\text{dBm},{{E}_{\text{CUs}}}=0\text{dBJ}\).The CCR has the lowest EE compared to the OPA, PPA, and EPA. OPA always outperforms the others owning to the full CSI feedback and an optimal EE of NSCRS can be achieved at x=0.501, y=0.501, and z=2.264. Compared with the OPA, a small performance gap can be observed between OPA and PPA, since only partial CSI is fed back for the PPA rather than the full CSI feedback of OPA.
Figure 5a, b describe the energy efficiency for different algorithms as a function of \({{\rho }_{E}}\) and \({{\rho }_{T}}\), respectively. As \({{\rho }_{E}}\) changes in Fig. 5a, the energy efficiencies of OPA, PPA and EPA increase at first, since the cooperation from CUs is effective. However, when \({{\rho }_{E}}\) becomes very large, the transmission rate for CU’s data transmission becomes worse, which results in a decrease in terms of overall energy efficiency. In addition, when \({{\rho }_{E}}\) is small, EPA performs better than PPA, because condition that \(2{{\rho }_{E}}{{E}_{\text{CUs}}}{{\beta }_{k}}/({{\rho }_{T}}T)>>{{E}_{\text{PU}}}{{\alpha }_{k}}/T\) is not satisfied. However, when \({{\rho }_{E}}\) becomes larger, the condition of \(2{{\rho }_{E}}{{E}_{\text{CUs}}}{{\beta }_{k}}/({{\rho }_{T}}T)>>{{E}_{\text{PU}}}{{\alpha }_{k}}/T\) is satisfied and the performance of PPA becomes better than that of EPA. And as \({{\rho }_{T}}\) changes in Fig. 5b, the energy efficiencies of OPA, PPA and EPA increase at first owing to the transmission time allocated to PUs. However, when \({{\rho }_{T}}\) becomes large enough, the energy efficiencies decrease, because that there is too little incentive time allocated to CUs. Besides, when \({{\rho }_{T}}\) is small, PPA performs better than EPA, because condition that \(2{{\rho }_{E}}{{E}_{\text{CUs}}}{{\beta }_{k}}/({{\rho }_{T}}T)>>{{E}_{\text{PU}}}{{\alpha }_{k}}/T\) is satisfied. However, with the increase in \({{\rho }_{T}}\), that condition is not satisfied, which results that EPA performs better than PPA.
Figure 6 shows the energy efficiency for different algorithms as a function of \({{P}_{\text{PU}}}\) under constraints of \({{\rho }_{E}}={{\rho }_{T}}=0.5\) and \({{E}_{\text{CUs}}}=0\text{dBJ}\). The OPA always performs better than PPA and EPA owning to the full CSI feedback. When \({{P}_{\text{PU}}}\) is small, OPA, EPA and PPA can perform the transmission with the aid of CUs, which results in better performances compared to that of CCR. When \({{E}_{\text{PU}}}\) is smaller than \({{E}_{\text{CUs}}}\), the condition of \(2{{\rho }_{E}}{{E}_{\text{CUs}}}{{\beta }_{k}}/({{\rho }_{T}}T)>>{{E}_{\text{PU}}}{{\alpha }_{k}}/T\) is satisfied, so the performance of PPA is better than that of EPA. However, the condition of \(2{{\rho }_{E}}{{E}_{\text{CUs}}}{{\beta }_{k}}/({{\rho }_{T}}T)>>{{E}_{\text{PU}}}{{\alpha }_{k}}/T\) cannot be satisfied when \({{E}_{\text{PU}}}\) is larger than \({{E}_{\text{CUs}}}\), and a better performance of EPA can be observed compared to the PPA. Moreover, when \({{E}_{\text{PU}}}\) becomes large enough, CUs are not needed for cooperation, thus the EE of OPA, PPA, and EPA becomes the same, i.e., \({{P}_{\text{PU}}}\ge \text{50dBm}\).
Figure 7 shows the energy efficiency for different algorithms as a function of under constraints of \({{\rho }_{E}}={{\rho }_{T}}=0.5\) and \({{E}_{\text{PU}}}=0\text{dBJ}\). When \({{E}_{\text{CUs}}}\) is small, none of CUs can be utilized for the PU transmission in the cases of OPA, EPA and PPA. Thus, a similar EE can be observed among them. As the \({{E}_{\text{CUs}}}\) increases, OPA, EPA and PPA perform better than CCR owing to the assistance of CUs. When \({{E}_{\text{CUs}}}\) becomes much larger than that of PUs, the condition of \(2{{\rho }_{E}}{{E}_{\text{CUs}}}{{\beta }_{k}}/({{\rho }_{T}}T)>>{{E}_{\text{PU}}}{{\alpha }_{k}}/T\) is satisfied, which results in a better performance of PPA than that of EPA and the performance of PPA becomes similar to that of OPA. However, when \({{E}_{\text{CUs}}}\) becomes large enough, e.g., \({{E}_{\text{CUs}}}\ge \text{15dBJ}\), the performances of OPA, PPA and EPA will decrease to the level of CCR, since the energy consumption of CUs is too big to decrease the EE.
Figure 8 compares the normalized performance gain of OPA and PPA with an increase trend of \({{E}_{\text{CUs}}}\). For a better realization, the performance of EE for both OPA and PPA are normalized by that of CCR. When \({{E}_{\text{CUs}}}\) is very small, there is a big gap of performance gain between OPA and PPA as shown in Fig. 8a, b, since the condition of \(2{{\rho }_{E}}{{E}_{\text{CUs}}}{{\beta }_{k}}/({{\rho }_{T}}T)>>{{E}_{\text{PU}}}{{\alpha }_{k}}/T\) is not satisfied. However, as the \({{E}_{\text{CUs}}}\) increases, e.g.,\({{E}_{\text{CUs}}}=20dBJ\), the approximation of \(2{{\rho }_{E}}{{E}_{\text{CUs}}}{{\beta }_{k}}/({{\rho }_{T}}T)>>{{E}_{\text{PU}}}{{\alpha }_{k}}/T\) can be almost achieved. Thus, similar performance gains of OPA and PPA can be observed as shown in Fig. 8e, f. It implies that if the link quality from CUs to the PU\(_d\) is much better than those from PU\(_s\) to CUs, then the proposed PPA could be an alternative choice with lower instantaneous CSI feedback.
7 Conclusions
In this paper, the optimal energy and time allocation algorithm in NSCRS with consideration of privacy preserving was first investigated for energy efficiency maximization in the case of full CSI. To further reduce the overhead from CSI exchanging, a suboptimal energy and time allocation algorithm, where the instantaneous CSI from CUs to PU is not required to be fed back, is alternatively introduced. Simulation results demonstrated that the energy efficiency of primary and cognitive users in the NSCRS can be greatly improved by the proposed OPA and PPA algorithms with the consideration of privacy preserving. Moreover, compared with the OPA, the PPA could achieve a similar performance as that of OPA with a smaller CSI feedback overhead.
Data availibility
Data sharing is not applicable to this article as no datasets are generated or analyzed during the current study.
Abbreviations
 NSCRS:

Nonselfish symbiotic cognitive relaying scheme
 PU:

Primary user
 CUs:

Cognitive users
 CSI:

Channel state information
 WSN:

Wireless sensor network
 EE:

Energy efficiency
 AF:

Amplifyandforward
 DF:

Decodedandforward
 NAF:

Nonorthogonal AF
 AP:

Access point
 CCR:

Conventional cognitive radio scheme
 TDMA:

Time division multiple address
 AN:

Artificial noise
 SNR:

Signaltonoise ratio
 AWGN:

Additive white Gaussian noise
 EPA:

Equal energy allocation algorithm
 OPA:

Optimal energy and time allocation algorithm with full CSI
 PPA:

Partial CSI feedback based suboptimal energy and time allocation algorithm
References
L. Bai, G. Li, H. Zhu, Privacy protection algorithm based on linear directional phantom source node in WSN, in: 2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS), Beijing, (2017)pp. 851–854
P.K. Roy, J.P. Rimjhim, Singh, P. Kumar, An efficient privacy preserving protocol for source location privacy in wireless sensor networks, in: 2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET), Chennai (2016), pp. 1093–1097
T. Rault, A. Bouabdallah, Y. Challal, Energy efficiency in wireless sensor networks: a topdown survey. Comput. Netw. 67(4), 104–122 (2014)
M. Bagaa, A. Chelli, D. Djenouri, T. Taleb, I. Balasingham, K. Kansanen, Optimal placement of relay nodes over limited positions in wireless sensor networks. IEEE Trans. Wirel. Commun. 16(4), 2205–2219 (2017)
Y. Zhao, R. Adve, T.J. Lim, Improving amplifyandforward relay networks: optimal power allocation versus selection. IEEE Trans. Wirel. Commun. 6(8), 3114–3123 (2007)
K.T. Phan, T. LeNgoc, S.A. Vorobyov, C. Tellambura, Power allocation in wireless multiuser relay networks. IEEE Trans. Wirel. Commun. 8(5), 2535–2545 (2009)
P. Gong, P. Xue, D. Park, D.K. Kim, Optimum power allocation in a nonorthogonal amplifyandforward relayassisted network. IEEE Trans. Veh. Technol. 60(3), 890–900 (2011)
M. Elsaadany, W. Hamouda, Performance analysis of nonorthogonal AF relaying in cognitive radio networks. IEEE Wirel. Commun. Lett. 4(4), 373–376 (2015)
Y. Jing, H. Jafarkhani, Single and multiple relay selection schemes and their achievable diversity orders. IEEE Trans. Wirel. Commun. 8(3), 1414–1423 (2009)
I. Kim, D. Kim, Minimizing operational power cost in remotearea wireless sensor networks with a DF relay and outage constraints. IEEE Commun. Lett. 19(2), 247–250 (2015)
K. Hamdi, M.O. Hasna, A. Ghrayeb, K.B. Letaief, Opportunistic spectrum sharing in relayassisted cognitive systems with imperfect CSI. IEEE Trans. Veh. Technol. 63(5), 2224–2235 (2014)
N. Tuah, M. Ismail, Extending lifetime of heterogenous wireless sensor network using relay node selection, in: 2013 International Conference of Information and Communication Technology (ICoICT), Bandung (2013), pp. 17–21
M. Saber, M. Naznin, Saving relay time in a heterogeneous wireless sensor network, in: 2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN), Washington (2018), pp. 122–124
S. Sapre, S. Mini, Relay node placement to establish full connectivity in directional sensor networks, in: 2017 Fourteenth International Conference on Wireless and Optical Communications Networks (WOCN), Mumbai (2017), pp. 1–5
C. Ma, W. Liang, M. Zheng, H. Sharif, A connectivityaware approximation algorithm for relay node placement in wireless sensor networks. IEEE Sens. J. 16(2), 515–528 (2016)
K. Azarian, H. El Gamal, P. Schniter, On the achievable diversitymultiplexing tradeoff in halfduplex cooperative channels. IEEE Trans. Inf. Theory 51(12), 4152–4172 (2005)
L.J. Rodriguez, N.H. Tran, T. LeNgoc, On the capacity of the static halfduplex nonorthogonal AF relay channel. IEEE Trans. Wirel. Commun. 13(2), 1034–1046 (2014)
M. Elsaadany, Optimal power allocation in cognitive networks using nonorthogonal AF relays, in: 39th Annual IEEE Conference on Local Computer Networks, Edmonton (2014), pp. 410–413
L. Guo, B. Wang, W. Wang, Research of energyefficiency algorithm based on ondemand load balancing for wireless sensor networks, in: 2009 International Conference on Test and Measurement, Hong Kong, vol. 2 (2009), pp. 22–26
H. Xu, L. Sun, P. Ren, Q. Du, Y. Wang, Cooperative privacy preserving scheme for downlink transmission in multiuser relay networks. IEEE Trans. Inf. Forensics Secur. 12(4), 825–839 (2017)
S. Haykin, Cognitive radio: brainempowered wireless communications. IEEE J. Sel. Areas Commun. 23(2), 201–220 (2005)
N. ul Hasan, W. Ejaz, M.K. Atiq, H.S. Kim, Distributed connectivity restoration using cognitive relay nodes positioning in damaged wireless sensor network, in: 2013 IEEE Symposium on Wireless Technology Applications (ISWTA), Kuching (2013), pp. 159–162
K. Tang, R. Shi, J. Dong, Throughput analysis of cognitive wireless acoustic sensor networks with energy harvesting. Future Gener Comput Syst 86, 1218–1227 (2017)
B. Han, M. Zeng, Q. Guo, H. Jiang, Q. Zhang, L. Feng, Energyefficient sensing and transmission for multihop relay cognitive radio sensor networks. China Commun 15(9), 106–117 (2018)
P. Gong, J.H. Park, J.M. Yoo, B. Yu, D.K. Kim, Throughput maximization with multiuser nonselfish cognitive relaying in CR networks, in: 2009 4th International Symposium on Wireless Pervasive Computing, Melbourne (2009), pp. 1–5
O. Simeone, I. Stanojev, S. Savazzi, Y. BarNess, U. Spagnolini, R. Pickholtz, Spectrum leasing to cooperating secondary ad hoc networks. IEEE J. Sel. Areas Commun. 26(1), 203–213 (2008)
A. Mercado, B. AzimiSadjadi, Power efficient link for multihop wireless network, in: Proceedings of the 41st Allerton Conference on Communication, Control, and Computing, Monticello, USA (2003), pp. 1837–1847
Acknowledgements
The authors thank the person who provided meticulous and valuable suggestions for improving the paper.
Funding
This work was supported in part by the National Natural Science foundation of China under Grant 62073039 and National Key Research and Development Program of China under Grant 2018YFC0823003.
Author information
Authors and Affiliations
Contributions
PL and PG proposed the overall research direction and ideas. LH and PG designed the system model and the resource allocation algorithm. LH and XG drafted the article and designed and the simulations. HL read the relevant literature and revised the manuscript. The authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
First, when we fix \({{\rho }_{T}}\) and \({{\rho }_{E}}\) the problem can be rewritten in the following form:
where A, B, C and D are all nonnegative constants.
Obviously, due to the monotonicity of \({{\log }_{2}}(x)\) with respect to x, the problem in (27) can be converted to maximizing L, where
We can rewrite (29) as
where \({{a}_{0}}\), \({{a}_{k}}\) and \({{b}_{k}}\)are nonnegative coefficients, but \({{b}_{0}}\) is a positive coefficient. Then, we only need to prove the equation as follows
We prove (31) by means of the mathematical induction.
Firstly, in the case of \(K=2\), we will prove the following equation
It indicates that the maximum is obtained at either \((E_{cu}^{1},E_{cu}^{2})=(0,E_{\text{CUs}})\) or \((E_{cu}^{1},E_{cu}^{2})=(E_{\text{CUs}},0)\). By plugging \(E_{cu}^{2}=E_{\text{CUs}}E_{cu}^{1}\) into \(f(E_{cu}^{1},E_{cu}^{2},...,E_{cu}^{K})\) for \(K=2\), we get the equivalent form
Therefore, (33) has the maximum at one of the boundary points \(E_{cu}^{1}=0\) or \(E_{cu}^{1}=E_{\text{CUs}}\) as long as we prove the monotonicity of \(g(E_{cu}^{1})\). We differentiate \(g(E_{cu}^{1})\) with respect to \(E_{cu}^{1}\)
The denominator of (34) is constant positive. Hence, the monotonicity of \(g(E_{cu}^{1})\) depends on the sign of the numerator, which proves (32).
We assume that (31) is true of \(K=L\), and we prove that (32) is also true of \(K=L+1\). For \(K=L+1\), we have
with constraints of \(\sum _{k=1}^{L+1}{E_{cu}^{k}}=E_{\text{CUs}}\) and \(E_{cu}^{k}\ge 0\). We Apply (31) for \(K=L\) to (35) and obtain
We switch the maximum operations on the righthand side to have
Due to the monotonicity of (32), we can easily get
Therefore, (31) also holds for \(K=L+1\), which proves (20a) by mathematical induction.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Li, P., Liu, Y., Gao, X. et al. Energyefficient time and energy resource allocation in nonselfish symbiotic cognitive relaying sensor network with privacy preserving for smart city. J Wireless Com Network 2021, 48 (2021). https://doi.org/10.1186/s13638021019039
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13638021019039