01.03.2014  Ausgabe 2/2014 Open Access
Distributed and Centralized Schemes for Channel Sensing Order Setting in Multiuser Cognitive Radio Networks
 Zeitschrift:
 Wireless Personal Communications > Ausgabe 2/2014
1 Introduction
2 Related Works
3 System Model
4 Sensing Order Selection for Distributed Case
4.1 Greedy Search Algorithm for Single User Scenario
4.2 Greedy Search Algorithm for Multiuser Scenario

Step 1: Negotiation. Users exchange their channel free probability and channel achievable rate information, \({\varvec{\uptheta }}\) and R, with their neighbors on a common control channel;

Step 2: Initialization. \(k=1\), the set of already chosen channels of user \(m\) is \(L_m^{k1} =L_m^0 =\varnothing \).

Step 3: Find the kth channel in the optimal sensing order, \(S_{m,k} =\mathop {\arg \max }\limits _{i\in \{1,2,\ldots ,N\}\backslash L_m^{k1} } g_m^{\mathrm{mod} } (i,k)\). And \(L_m^{k1} =L_m^{k1} \cup \{S_{m,k} \}\).

Step 4: If \(k=N\), end; else, \(k=k+1\), go to step 3.