A Novel On-Demand Cognitive Pilot Channel Enabling Dynamic Spectrum Allocation
A Novel On-Demand Cognitive Pilot Channel Enabling Dynamic Spectrum Allocation
(
I m = BGEO + N OP BOP + N RAT ( BRAT + N FREQ BFREQ ) )
Frequency Range #n
(1)
RAT # j
in-band CPC
RAT 2
RAT 3
AI Null
AI Null
AI Null
AI Null
AI 1
AI 2
AI 3
Mesh Mesh Mesh Mesh Mesh Mesh Mesh
MT 1 MT 1 MT 1 MT 1 MT 2 MT 2 MT 2
transmit the information only when needed and requested by a
t
terminal. RACPC (UL)
TS
Collision
TS
The on-demand CPC makes use of both the uplink and MT4
downlink components and it consists in the following logical MT1 MT2 MT3 MT3
• Random Access CPC (RACPC): It consists of an Figure 7. Operation of the on-demand CPC
uplink slotted channel where the mobiles operating
with CPC send requests to retrieve the CPC The proposed implementation of the on-demand CPC
information corresponding to their meshes. Each including both an uplink and a downlink channel enables a
request basically contains an indicator of the wider range of CPC-based applications in addition to the
geographical coordinates of the mobile terminal. An retrieval of the information about operators, RATs and
operation according to a simple access protocol such as frequency lists. For example, the CPC could eventually be
S-ALOHA can be envisaged for this channel. used by the terminals to retrieve other terminal-dependent
• Acquisition Indicator CPC (AICPC): This downlink information, such as software downloads to enhance the
channel follows the same slotted structure of the uplink reconfigurable terminal capabilities. Furthermore, the uplink
RACPC and is devoted to indicate that a request has channel could also be used to ensure that the information has
been successfully received. The channel consists in been delivered correctly thus improving the integrity and the
Acquisition Indicators (AI) each one indicating the security in the transmitted information.
identifier of the terminal whose request has been
On the other hand, notice that the interaction with the
received or the value Null if no request has been
received. mobiles in the on-demand CPC allows the network operator
and the spectrum regulator having eventually a higher control
• Downlink On-Demand CPC (DODCPC): This of the terminals accessing CPC than if the broadcast approach
downlink logical channel is used to transmit the CPC was used. In that sense, it is easier to fit the CPC operation
information corresponding to the mesh of each within specific business models and exploitation plans e.g. for
received request from a Mobile Terminal (MT). a controlled secondary use of the spectrum.
The operation of these channels is illustrated in Figure 7. VI. EVALUATION MODEL
The uplink and the downlink channels are organised in slots of
duration TS. The AICPC and the DODCPC are multiplexed on In the following, a model to evaluate the performance of
the same time slots by making use of different fields of a the two approaches for CPC delivery implementation
certain burst structure. In Figure 7, the terminal MT1 sends a described in Section V is provided. Let assume a scenario in
request in slot #1. This request simply contains the which each CPC transmitter sends the information
geographical coordinates of the terminal and a short random corresponding to Nm meshes. A number of wireless devices or
identifier. Since there is no collision in the transmission, the terminals require getting the CPC information corresponding
slot #2 in the AICPC indicates that MT1 request has been to the mesh where they are located. Then, let λ (requests/s) be
successfully received by means of the Acquisition Indicator the arrival ratio of requests corresponding to these devices in
(AI) including the random identifier sent by MT1. Then, the the whole area of one CPC transmitter, assumed to follow a
transmission of the CPC information corresponding to the Poisson distribution. Terminals are uniformly distributed in
mesh of MT1 starts in the DODCPC during a total of the area and meshes are of the same size, so the arrival rate is
the same in all the meshes. Let Im be the total number of part can be computed as [13]:
information bits to be transmitted for a single mesh. For
comparison purposes, it is assumed that the slot duration TS 1+ q 1 1
and the downlink net bit rate of the CPC channel Rb (i.e. DRA = TS + − (4)
including only information bits, without considering other bits qps 2 q
for channel coding, synchronisation, etc.) is the same in both where ps is the success access probability (i.e. the probability
the broadcast and the on-demand CPC. that there is no collision in one slot) and is given by:
A. Broadcast CPC
In this case, since the downlink channel is slotted, the
ps = e − λT TS (5)
number of slots to transmit the information of one mesh is
where λT is the total access rate including retransmissions and
given by:
can be related with the arrival rate λ as:
I
N S ,B = m (2) λ = λT e − λ T
T S
(6)
RbTS
From (6), it is possible to derive the value of λT as:
Where x denotes the lowest integer high than or equal to
x. So the total transmission time of one mesh in the broadcast W ( λTS )
CPC is Tm,B=NS,B·TS. λT = − (7)
TS
Then, assuming that one CPC transmitter sends the
information of Nm meshes, the total CPC broadcast period is where W(x) is the Lambert W-function, which can be
T=Tm,B·Nm. Consequently, assuming that users are always computed from its series expansion as [14]:
synchronised with the CPC channel and that a user requires
( −1) n n− 2 x n
n −1
∞
getting the CPC information randomly with equal probability
W ( x) = ∑ (8)
in any time between 0 and T and the arrival can correspond to
any mesh with equal probability, the average delay in getting
n =1 ( n − 1)!
the information will be: After the random access phase, the system can be
modelled as a M/D/1 queue with arrival rate λ and service
N time Tm,OD, corresponding to the transmission time of the
DB = Tm, B m + 1 (3)
2 information of one mesh. Assuming that the bit rate of the
downlink channel is Rb, that it is organised in slots of duration
Notice that the first term in (3) accounts for the average TS and that in each slot a number of IAI bits should be
time until the start of the desired mesh (i.e. T/2) while the transmitted for the AICPC, the total number of slots for
second term accounts for the time to transmit the information transmitting the information of one mesh is given by:
of this mesh.
B. On-demand CPC Im
N S ,OD = (9)
In this case, the total delay in getting the information of the RbTS − I AI
desired mesh can be computed as the sum of two delays, as
depicted in Figure 8, corresponding to the uplink access phase Then, the service time to transmit the information of one
to send the request and the time to send the information of the mesh is Tm,OD=NS,OD·TS and the total delay including service
required mesh in the DODCPC. and queuing time is given by [15]:
λ (reqs/s)
λ (reqs/s) Rb (b/s)
λTm2,OD
DS = + Tm ,OD (10)
2 (1 − λTm ,OD )
Random Access
DODCPC: M/D/1 system Finally, the total delay corresponding to the on-demand
CPC is computed as:
Figure 8. Delay model of the on-demand CPC
DOD = DRA + DS (11)
For the random access phase a simple S-ALOHA model is
considered, with slots of duration TS. It is assumed that VII. RESULTS
terminals know at the beginning of one slot if a collision has
occurred in the previous slot. Then, after a collision, a This section presents some illustrative results for the CPC
geometric back-off is used for retransmissions, meaning that operation. For illustration purposes, the amount of information
retransmissions are carried out in the next slot with probability corresponding to a mesh is Im=4253 bits, corresponding to one
q. Taking this into account, the delay of the random access of the combinations in Table I. The rest of parameters are
detailed in the following:
• Time slot duration: TS=10 ms. This would be the case load also increases with the range. Consequently, the figure
of e.g. one UMTS frame or approximately two GSM shows that both the delay of the on-demand CPC and the
frames. broadcast CPC increase with the range, but the delay
experienced in the broadcast case is in general much higher
• Bit rate of the downlink CPC: Rb=10 kb/s. Notice that,
in case of the broadcast CPC, the 10 kb/s are devoted than that of the on-demand CPC. Assuming a maximum delay
to CPC information while in the case of the on-demand of e.g. 5 s in getting the CPC information, it can be observed
CPC the 10 kb/s are shared between AICPC and that, for these conditions, the maximum range for CPC
DODCPC. In any case, Rb corresponds to the net bit operation with the on-demand approach is around 1.05 km. On
rate of information bits, without including redundancy the contrary, for the broadcast CPC the maximum range for a
bits for channel encoding, synchronisation bits, etc. delay below 5 s would be only about 300m. This observation
reflects that, for a given range, the broadcast CPC would
• Concerning the uplink requests in the RACPC the require a higher bit rate than the on-demand CPC in order to
mobiles simply have to transmit a random identifier achieve comparable performances. Notice that the difference
(e.g. 5 bits like in the GSM random access procedure) could even be higher if a lower maximum delay bound below
and a set of coordinates, thus having a total of
5 s was set.
Ir=5+41=46 bits.
It is worth mentioning that, for a given mesh size, it would
• The number of bits for the acquisition indication is
be preferred to operate the CPC with high transmitter ranges,
simply the random identifier of the mobile whose
request has been received, thus requiring IAI=5 bits. because this reduces the infrastructure cost required for the
deployment, consequently, the likely operating region of the
• A scenario with a homogeneous user density of η CPC would be the right side of the horizontal axis, where the
users/km2 is considered. Each user or wireless device differences between on-demand CPC and broadcast CPC are
generates a total of λu=0.0003 requests/s to access the higher.
CPC (i.e. around 1 request per hour).
2
• The area covered by a CPC transmitter is assumed to
1.8
be circular with a radius R km. Then, the total amount
1.6
of requests per second in this area is given by: Nm=1, OnDemand
1.4
Nm=1, Broadcast
λ = ηλuπ R 2
(12) 1.2
Delay (s)
delay for the broadcast CPC and the on-demand CPC in the 0.6
total user density η for a fixed number of meshes, Nm=1 (i.e. 0.2
0
mesh area of around 1700m×1700m) and Nm=30 (i.e. mesh 0 500 1000 1500 2000
area around 320m×320m), respectively. It can be observed User density (users/km2)
50 100
40 80
30 60
20
40
10
20
0
0 0.2 0.4 0.6 0.8 1 1.2 0
CPC range R (km) 0 2500 5000 7500 10000 12500 15000 17500 20000
I m (bits)
Figure 11. Total delay as a function of the CPC range for a mesh size of
100m×100m Figure 13. Required net bit rate for the on-demand CPC to ensure a
maximum delay of 5s with a mesh size of 100m×100m as a function of the
1000
number of bits to be transmitted per mesh Im for different transmitter ranges R.
On Demand
Broadcast 18
16
100
Bit rate (kb/s)
14
12
RbBroad /RbOD
10 R=500 m
10
R=1 km
8
R=1.5 km
6 R=2 km
1 4
0 0.5 1 1.5 2
2
CPC range R (km)
0
0 2500 5000 7500 10000 12500 15000 17500 20000
Figure 12. Required CPC net bit rate to ensure a maximum delay of 5s as a I m (bits)
function of the CPC range for a mesh size of 100m×100m.
On the other hand, with respect to the mesh size, if small Figure 14. Ratio between the required net bit rate for broadcast CPC and for
meshes are considered a better spectrum usage can be on-demand CPC to ensure a maximum delay of 5s with a mesh size of
100m×100m as a function of the number of bits to be transmitted per mesh I m
achieved because in this case there is more granularity when for different transmitter ranges R.
identifying the different interference conditions in each region.
Notice that the inclusion of low range technologies (e.g. Finally, in order to analyse the sensitivity with respect to
deployment of WLAN hotspots) will tend to introduce more the amount of bits to be transmitted per mesh Im, Figure 13
variability in the way how the different frequencies are used in plots the required downlink net bit rate with the on-demand
a given region and therefore smaller mesh sizes could be CPC to ensure a maximum delay of 5s as a function of the
number of bits Im for different CPC transmitter ranges with a facilities. In that sense, it may be easier to fit the CPC
mesh size of 100m×100m, and Figure 14 plots the operation within specific business models and exploitation
corresponding gain of the on-demand CPC with respect to the plans e.g. for a controlled secondary use of the spectrum.
broadcast CPC (measured as the ratio of bit rate requirements
for the two approaches to ensure the maximum delay of 5s). ACKNOWLEDGMENTS
From Figure 13, it can observed that the bit rate requirements This work was performed in project E2R II which has
increase linearly with the number of bits per mesh for the on- received research funding from the Community's Sixth
demand CPC. This is also valid for the broadcast CPC case, Framework program. This paper reflects only the authors'
although in this case the bit rate requirements are between 12 views and the Community is not liable for any use that may be
and 16 times (i.e. more than one order of magnitude) higher made of the information contained therein. The contributions
than those of the on-demand CPC, as shown in Figure 14. As a of colleagues from E2R II consortium are hereby
result of this behaviour, Figure 14 reveals as a general trend an acknowledged. The work is also partially funded by the
asymptotically increase in the gain achieved by the on-demand Spanish Research Council under COSMOS (Ref. TEC2004-
CPC with the number of bits Im, being the gain approximately 00518) grant.
constant for values of Im higher than around 4000-5000 bits
for the considered transmitter ranges in the figure. On the REFERENCES
contrary, for small values of Im the gain is smaller because of [1] J. A. Hoffmeyer, “Regulatory and Standardization Aspects of DSA
the fixed overhead of IAI bits per slot required for the AICPC Technologies – Global Requirements and Perspectives”, 1st IEEE
international Symposium on New Directions in Dynamic Spectrum
with the on-demand approach, which becomes more Access Networks (DySPAN), Baltimore, MD, November, 2005.
significant for low values of Im. [2] M. Buddhikot, P. Kolodzy, S. Miller, K. Ryan, J. Evans “ DIMSUMNet:
New Directions in Wireless Networking Using Coordinated Dynamic
VIII. CONCLUSIONS Spectrum Access”, IEEE International Symposium on a World of
Wireless, Mobile and Multimedia Networks (IEEE WoWMoM),
This paper has analysed different implementations of the Taormina/Giardini Naxos, Italy, June, 2005.
Cognitive Pilot Channel, recently proposed in the literature as [3] M. Buddhikot, K. Ryan, “Spectrum Management in Coordinated
an enabler for supporting the operation of reconfigurable Dynamic Spectrum Access Based Cellular Networks”, 1st IEEE
terminals in scenarios with DSA in which the allocation of international Symposium on New Directions in Dynamic Spectrum
Access Networks (DySPAN), Baltimore, MD, November, 2005.
frequencies to RATs is not fixed and known a priori. Then, the
[4] H. R. Karimi, T.W.Ho, H. Claussen, L. G. Samuel, “Evolution towards
use of a CPC channel avoids the scanning time for detecting dynamic spectrum sharing in mobile communications”, IEEE PIMRC
available RATs and frequencies at the mobile terminal. Conference, Helsinki, September, 2006.
Furthermore, thanks to identifying the used frequency bands [5] “End to End Reconfigurability Phase II (E2R2)”, IST Project,
in a given region, the CPC also allows a secondary use of the http://e2r2.motlabs.com
temporary unused bands for different applications like e.g. [6] D. Raychaudhuri, X. Jing “A Spectrum Etiquette Protocol for Efficient
Coordination of Radio Devices in Unlicensed Bands”, 14th IEEE 2003
establishment of ad-hoc networks, communication of devices International Symposium on Persona1,lndoor and Mobile Radio
in personal area networks, etc. Communication Proceedings (PIMRC), Beijing, September, 2003.
Focusing on the implementation of the delivery of CPC [7] P. Houzé, S. Ben Jemaa, P. Cordier “Common Pilot Channel for Network
Selection”, IEEE VTC in Spring Conference, Melbourne, May, 2006.
information, the paper has proposed an on-demand CPC as [8] E. Mohyeldin, J. Luo, J. Pan, P. Slanina, “Common Pilot Method
opposite to the broadcast mechanism. Both approaches have Enabling Network Assisted Fast Scanning for Reconfigurable
been studied by means of an analytical model and it has been Terminals”, 4th Karlsruhe Workshop on Software Radios, Karlsruhe,
obtained that the proposed approach is able to achieve the March, 2006.
same performance in terms of delay to retrieve the information [9] P. Cordier et al., “E2R Cognitive Pilot Channel concept”, IST Summit,
Mykonos, June, 2006.
requiring a significantly lower net bit rate of the CPC channel.
[10] L. Giupponi, R. Agustí, J. Pérez-Romero, O. Sallent “Joint Radio
Specifically, differences in around one order of magnitude Resource Management algorithm for multi-RAT networks”, IEEE
have been observed in the required bit rate for the two Globecom, Saint Louis, USA, November, 2005.
approaches. [11] J. Nasreddine, O. Sallent, J. Pérez-Romero, R. Agusti “Dynamic
Spectrum Management Methodology for WCDMA Systems Based on
The proposed on-demand CPC can be implemented either Inter-Cell Interaction Approach”, IEEE WPMC Conference, San Diego,
using the out-band CPC or the in-band CPC architectures. USA, September, 2006
Furthermore, it enables a wider range of CPC-based [12] 3GPP TS 23.003 “Numbering, addressing and identification”
applications. For example, the CPC could eventually be used [13] Y. Yang, T-S.P.Ym, “Delay Distributions of Slotted ALOHA and
by the terminals to retrieve terminal-dependent information, CSMA”, IEEE Transactions on Communications, Vol. 51, No. 11,
November, 2003, pp. 1846-1857.
such as software downloads to enhance the reconfigurable
[14] E. W. Weisstein,. “Lambert W-Function.” From MathWorld--A Wolfram
terminal capabilities and to ensure that the information has Web Resource. http://mathworld.wolfram.com/LambertW-Function.html
been delivered correctly thus improving the integrity and the [15] L. Kleinrock, Queueing Systems. Volume I: Theory, Ed. John Wiley &
security in the transmitted information. Similarly, thanks to Sons, 1975.
the interaction with the mobiles existing in this approach, it is
possible for the network operator and the spectrum regulator
to have a higher control of the terminals using the CPC