From: On achieving network throughput demand in cognitive radio-based home area networks
Symbol | Description |
---|---|
D | Demanded throughput |
\(\mathcal {H}_{0}\) | Hypothesis of the channel is idle |
\(\mathcal {H}_{1}\) | Hypothesis of the channel is occupied |
i | Channel’s number |
I | Total active in-band channel in the cluster |
j | CR-based HAN device’s number |
J | Total number of CR-based HAN devices in the HAN |
K | Total number of devices that decides the sensed channel |
 | is occupied |
L | Total number of local spectrum sensing samples within a |
 | sensing period |
N | Total number of cooperating nodes for cooperative |
 | spectrum sensing |
P f | Local probability of false alarm |
P d | Local probability of detection |
Q f | Cooperative probability of false alarm |
Q d | Cooperative probability of detection |
R | Achievable throughput |
u[ l] | Received incumbent signal during the l-th sample |
SNR p | SNR of the incumbent signal measured at the CR-device |
T f | Frame duration |
T css | Cooperative spectrum sensing time |
T s | Local spectrum sensing time |
T sr | Time duration for sending a single local sensing report |
T t | Data transmission time |
w[l] | Noise signal during the l-th sample |
α | Fraction of data transmission time from the frame time |
ε | Difference between the achievable and the demanded |
 | throughput |
Ï„ | Sampling time |
γ | Local spectrum sensing threshold |