Abstract: The invention concerns a method for transmitting beacon services to a User Equipment (UE) roaming in an area covered by several Radio Access Technologies (RAT s) the area comprising a plurality of geographical zones each geographical zone comprising at least one network base station using several frequencies and at least one RAT among the plurality of RAT s the User Equipment (UE) having various RAT capabilities and preferences and supporting several frequencies the method comprising the step of periodically transmitting to the UE at least a beacon message M comprising information about the RAT s and the frequencies deployed in each zone of the area and data indicating at least a validity period of the RAT s and the frequencies information.
DESCRIPTION
STAMPINGMECHANISM FOR BEACON MESSAGE TRANSMISSION
PRIORITY CLAIM
Priority is claimed on European Patent Application No. 10157561.1, filed March
24, 2010, the content of which is incorporated herein by reference.
TECHNICAL FIELD
The invention pertains to telecommunication field and concerns a method for
transmitting beacon services to a User Equipment (UE) roaming in an area covered by
several Radio Access Technologies (RAT's), the area comprising a plurality of
geographical zones, each geographical zone comprising at least one network base station
using several frequencies and at least one Radio Access Technology (RAT) among the
plurality of RAT's, the User Equipment (UE) having various RATcapabilities and
preferences and supporting several frequencies.
The invention also concerns a beacon base station for transmitting the Beacon
services and a User Equipment (UE) adapted to receive the beacon services transmitted
by the Beacon base station.
BACKGROUND ART
A user roaming in an area covered by several telecommunication networks may
choose an operator, a RAT(Radio Access Technology), and/or a frequency of
communication based on roaming agreements between operators in this area and on the
capabilities and preferences of its User Equipment (UE).
Cognitive Pilot Channel (CPC) is a kind of Beacon channel that may be used in
cognitive radio to provide information to cognitive mobiles about the available operators,
Radio Access Technologies (RAT's) and Frequencies available in the geographical area.
The CPC is used to support a terminal during the "start-up" phase and
"on-going" phase:
- During the start-up phase, beginning, at "switch on" of the mobile terminal,
the mobile terminal is searching for a candidate network to camp on; and
- In the "on-going" phase, the mobile terminal is camping on a network with a
dedicated RAT and is able to listen to CPC message broadcasted through
the network in order to rapidly detect changes in the environment due to
either variation of the mobile position or network reconfigurations.
From this two mobile state, different CPC deployment approaches are possible:
- In the out-band CPC solution, where the CPC is conceived as a radio
channel outside the component Radio Access Technologies, the CPC either
uses a new radio interface, or alternatively uses an adaptation of legacy
technology with appropriate characteristics; and
- In the in-band CPC solution, the CPC is conceived as a logical channel
within the technologies of the heterogeneous radio environment.
For both deployments, a CPC manager broadcasts CPC information
continuously and periodically for all mobiles presents in the CPC area.
Two major concepts for Cognitive Pilot Channel are proposed by the E3 project
and ETSI RRS Group in order to organize RAT's information according to a
geographical area: Mesh based approach and Coverage area approach.
- In Mesh based concept, a geographical area covered by a beacon channel, is
divided into a plurality of zones, called meshes and information is provided
about operators, RAT and frequencies available in each mesh.
- In Coverage area concept, information about all the RAT's and frequencies
available with respective RAT's coverage area in the area covered by a
beacon channel is broadcasted in the geographical area.
FIG. 1 illustrates a geographical area 2 divided in different zones 4, each zone
being covered by a network base station 6 using a Radio Access Technology (RAT) and
receiving Beacon services from a Beacon base station 8.
In Mesh based concept, CPC information represents a large quantity of data to
be sent especially if the mesh size is small. This forces mobile phones roaming in area
2 to listen to CPC channel longer than coverage area approach. It is to be noted that
CPC information are updated according to the network load (new frequencies available
or not) and network structure update (new technology, new frequencies, new operator).
The frequency update is low between several posts of CPC message, therefore a mobile
phone will receive several time the same information.
One of the proposed methods to reduce the CPC data rate is to transmit one CPC
message for the whole CPC area, not to meshes of the CPC area, and transmit the
coverage area for each technology and frequency. The problem with this kind of
approach is that coverage areas are not easily characterized and transmitting a detailed
coverage area may result in a large data-rate as well.
DISCLOSURE OF INVENTION
The invention aims at optimizing the UE's radio use to improve the UE's power
saving.
The object of the invention is achieved by means of method for transmitting
beacon services to a User Equipment (UE) roaming in an area covered by several Radio
Access Technologies (RAT's), the area comprising a plurality of geographical zones, each
geographical zone comprising at least one network base station using several frequencies
and at least one RAT among the plurality of RAT's, the User Equipment (UE) having
various RATcapabilities and preferences and supporting several frequencies.
The method according to the invention comprises the step of periodically
transmitting to the UE at least a beacon message M comprising information about the
RAT's and the frequencies deployed in each zone of the area, and data indicating at least
a validity period of the RAT's and the frequencies information.
The method according to the invention further comprises the step of regularly
updating the information carried by the beacon message M based on feedback
information are provided by the network base stations and/or a CPC database and/or a
PMSE database (program making and social events) cooperating with the network base
station 6 in the area.
It is to be noted that the validity period of the information carried by the beacons
messages may be a fixed period scheduled (e.g. expired in 60s or after ten CPC messages
broadcasting) with a predefined recurrence (e.g. 60s, everyday or every 2 hours).
In another variant, the validity period is a predefined period the validly of which
is defined by means of an expiry date (e.g. 1/1/10 at 10 a.m.), the expiry date being
scheduled with a predefined recurrence (e.g. every day or every 2 hours).
Upon reception of a beacon message M, the UE reads the data indicating the
validity period, and enters in an idle state if the validity period has not yet expired, or
reads the beacon message received subsequently in order to get updated information if
the validity period has already expired.
The feedback information used to update the information carried by the beacon
message M may comprise the UE location in the given zone, the current network base
station load in a given zone, and/or a PMSE (program making and social events)
predictable in the given zone.
In a particular embodiment of the invention, the method comprises the steps of:
defining in the area n specific sub- zones Zi (i=l to n), n being an integer,
defining the beacon message M as a set of successive sub-messages Mi (i=l to n),
each sub-message Mi carrying information about a specific RATand/or a specific
frequency deployed in a specific sub-zone Zi of the area, the validity period Vi of the
specific information, and an identifier IDi of the sub-message Mi,
including in each sub-message Mi (i=l to n) the identifiers of the sub-messages
Mi (i=l to n) carrying information previously updated,
broadcasting the set of sub-messages Mi in the area,
retrieving by the UE the identifiers of sub-messages Mi carrying updated
information,
reading by the UE only the sub-messages Mi corresponding to the retrieved
identifiers.
The method according to the invention may be implemented in a geographical
area comprising a plurality of meshes, in which the beacon message M is transmitted
over a CPC (Cognitive Pilot Channel).
The beacon services are broadcasted in the Equipment (UE) roaming area by a
Beacon base station comprising means for periodically broadcasting in the roaming area
at least a beacon message M comprising information about the RAT's and the frequencies
deployed in each zone of the area, and data indicating at least a validity period of the
RAT's and the frequencies information.
The Beacon base station further comprises means for regularly updating the
information carried by the beacon message M based on feedback information received
from the network base stations.
In the particular embodiment of the invention, the Beacon base station
comprises:
means for defining in the area n specific sub-zones Zi (i=l to n), n being an
integer,
means for defining the beacon message M as a set of successive sub-messages
Mi (i=l to n), each sub-message Mi carrying information about a specific RAT and/or a
specific frequency deployed in a specific sub-zone Zi of the area, the validity period Vi
of the specific information, and an identifier IDi of the sub-message Mi,
means for including in each sub-message Mi (i=l to n), the identifiers of the
sub-messages Mi (i=l to n), the identifiers indicating to the UE the sub-messages Mi
carrying updated information.
Thanks to the invention, information relating to RAT and frequency available in
a geographic area can be grouped together in temporally way within one or several
beacon message(s) enabling optimization of the battery consumption and also a
permanent storage of the information in memory of the User Equipment.
BRIEF DESCRIPTION OF THE DRAWINGS
The foregoing summary, as well as the following detailed description, will be
better understood when read in conjunction with the appended figures illustrating an
exemplary embodiment of the invention in which:
FIG. 1 schematically represents a UE roaming area divided in zones covered by
different RAT's;
FIGS. 2A to 2D represent a diagram illustrating an example of periodic
broadcast of a beacon message in the area of FIG. 1 and the UE equipment behavior upon
reception of the message according to the invention;
FIG. 3 schematically illustrates a system for implementing a preferred
embodiment of the invention;
FIG. 4 is a flow chart illustrating beacon messages transmission/reception in the
architecture of FIG. 3;
FIG. 5 schematically illustrates an example of load prediction method for one
frequency of a network base station used in the method according to the invention in case
of no PMSE event in the area;
FIG. 6 schematically illustrates an example of load prediction method for one
frequency of a network base station used in the method according to the invention in case
of a PMSE event in the area;
FIG. 7 is a flow chart illustrating an embodiment of the method according to the
invention; and
FIG. 8 is a flow chart illustrating an example of exploitation by the UE of
information received in a beacon message.
EMBODIMENTS FOR CARRYING OUT THE INVENTION
The invention will be described when implemented in a geographical area 2
divided into n elementary zones 4, as illustrated at FIG. 1, each zone being covered by a
network base station 6 using a specific RAT and a specific frequency for communication.
A beacon base station 8, supervised by a beacon base manager, periodically
transmits information on operators, Radio Access technologies (RAT's) and radio
frequencies available in the geographical area 2 to cognitive UEs 10 such as mobile
phones, PDA, or laptops roaming in the area 2 to allow the UEs to choose the most
convenient operator, RAT and frequency available in the geographical area.
In a first embodiment of the invention, at the operator side, the beacon base
station 8 generates a beacon message M comprising information about the RAT's and the
frequencies deployed in each zone of the area 2, computes the validity period of the
information and includes the computed validity period in beacon message M.
Preferably, an error rate of the computed validity period is also included in the beacon
message M. The UE 10 will use its CPC radio resources depending on a predefined
error threshold.
In the example illustrated at FIG. 2A, the beacon message M is broadcasted over
a CPC (Cognitive Pilot Channel) channel and is composed of a set of three successive
sub-messages Mi (i=l to 3), each sub-message Mi carrying information about a specific
RAT and/or a specific frequency deployed in a specific sub-zone Zi (i=l to 3) of the area
2. Each sub-messages Mi (i=l to 3) carries the validity period Vi (i=l to 3) of the
specific information, and identifier IDi (i=l to 3) of the the sub-message Mi.
The sub-message Mi are then broadcasted periodically in the area 2 as illustrated
at FIG. 2A.
The beacon base station 8 transmits each set of sub-messages Mi (i=l to 3) at
successive times tO to t2, ti to ti+2, tj to tj+2, ... , tk to tk+2, and so on.
FIG. 2B illustrates the UE 10 behavior upon reception of the sub-message Mi
(i=l to 3).
The UE 10 receives the set of sub-messages Mi (i=l to 3), at successive times tO
to t2, ti to ti+2, tj to tj+2, ... , tk to tk+2, and so on.
To avoid unnecessary reception of non updated information, for each
sub-message Mi (i=l to 3), the UE 10 compares the validity period Vi with the duration
that elapsed between the time of receipt of the sub-message Mi (i=l to 3), during the
current reception period and the time of receipt of the sub-message Mi (i=l to 3), during
the previous reception period. If the validity period Vi is greater than the duration, the
UE 10 does not use its CPC resources for receiving the information carried by the
sub-message Mi (i=l to 3), else, the UE 10 use its CPC resources for receiving the
information carried by the sub-message Mi (i=l to 3).
In the example illustrated by FIGS. 2A and 2B, it is assumed that the
sub-message M2 is updated a first time at time ti+1, the sub-message Ml is updated at
time tj, and the sub-message M2 is updated again at time tj+1 . The validity period of
the updated information carried by the sub-message M2 has been modified consequently
at time ti+1 , and at time tj+1 respectively to V2' and V2". In this case, the new validity
periods V2' and V2" of the updated information carried by the messages M2' and M2" are
also updated.
At the reception side, at time ti+1, after the comparison procedure described
above, the UE 10 finds that the updated validity periods V2' of the updated information
carried by sub-message M2' is less than the duration that elapsed between the time ti+1
and the time of receipt of sub-message M2 during the previous reception period.
Similarly, at time tj, the UE 10 finds that the updated validity periods VI' of the updated
information carried by sub-message is less than the duration that elapsed between
the time tj and the time of receipt of the sub-message during the previous reception
period. At tj+1, the UE 10 finds that the updated validity period V2" of the updated
information carried by sub-message M2" is less than the duration that elapsed between
the time tj+1 and the time of receipt of the sub-message M2" during the previous
reception period. Consequently, in this case, based on the assessment of the validity
periods Vi (i=l to 3) of each sub-message Mi (i=l to 3), the UE 0 will open its radio
when validity period Vi is elapsed, in order to decode only the updated information.
Thanks to the assessment of the validity periods, the UE 10 is able to reduce its
CPC radio activity and listen back to the CPC only when the CPC information has been
or should be updated.
Referring now to FIGS. 2C and 2D, illustrating the situation of FIGS. A and 2B
with the occurrence f an unpredictable event in the geographical area 2 that modifies one
or all the validity periods Vi (i=l to 3). Such event may be for example office hour,
shopping, social event, UE 10 moving from an area to another area, etc.
As illustrated at FIG. 2C, we assume that such event occurs after the computing
by the beacon base station of the validity periods Vi (i=l to 3). The UE 10 will have the
same behavior as in case depicted by FIG. 2B. However, if the event that occurred
modifies VI, i.e., if the information carried by sub-message Ml has been updated due to
this event, the UE 10 would be mislead by the previous validity period VI and will
therefore erroneously discard sub-message Ml carrying updated information.
To avoid such situation, the beacon base manager at the beacon base station
includes in sub-message M2" the identifier of sub-message Ml to indicate to the UE 10
that information carried by sub-message Ml has been updated following the unexpected
event. In this way, when the UE 10 reads the content of sub-message M2", it is
informed about the new situation and gets back to sub-message Ml in the next decoding
period in order to retrieve the updated information carried by sub-message MY.
Thanks to the inclusion of the identifier of sub-message Ml in sub-message M2",
the UE 10 is able to listen back to the CPC that has been updated after the computing by
the beacon base station of the validity periods Vi (i=l to 3).
In a preferred embodiment of the invention, the computing of the validity
periods Vi is realized based on feedback information received from the network base
stations 6.
Preferably, an error rate of the computed validity period is also included in the
beacon message M.
FIG. 3 illustrates a system in which the beacon base station 8 cooperates with,
the network base stations 6 deployed in the area 2, with a CPC database 12 and with a
PMSE database 14 to gather feedback information for computing the validity periods Vi
(i=l to 3) of the information carried by each CPC sub-message Mi (i=l to 3).
In this architecture, each network base station 6 regularly transmits to the
beacon base station 8 traffic load information in his area of radio coverage, the CPC
database 12 regularly transmits to the beacon base station 8 previous overload and traffic
load information, while the PMSE database 14 regularly transmits to the beacon base
station 8 event list information in the area 2. The beacon base station 8 generates a
frequency load curve based on the information received from the network base stations,
the CPC database 12, and PMSE database 14, and uses the curves for predicting the
validity periods of RAT and frequency information in each sub-zone of the area 2 based
on the gathered information. Such prediction may use for example a Linear Prediction
technique based on MMSE (Minimum Mean Square Error) applied on previous and
current network information. The beacon base station 8 may for example acquire
network information from the LTE (Long Term Evolution) X2 interface that enables an
exchange of overload and traffic information.
FIG. 4 illustrates the exchange of information between the beacon base station
(BBS) 8, a network base station (NBS) 6, a UE 10 roaming in the coverage area of the
NBS, the CPC database (CPCDB) 12, and the PMSE database (PMSEDB) 14.
At step 20, the BBS 8 transmits to the NBS 6 a request for current load
information in the area coverage of the NBS 6. The BBS 8 gets network information
from, for example, the LTE X2 interface. The feature load management enables to
exchange overload and traffic load information.
At step 22, the NBS 6 transmits to the BBS 8 information about the overload
and traffic load in its area coverage.
At step 24, the NBS 8 stores the information received from the BBS 6.
At step 26, the BBS 8 transmits to the CPCDB 12 a request for previous load
information in the area coverage of the NBS 6.
At step 28, the CPCDB 12 transmits to the BBS 8 the requested information.
At step 30, the NBS 8 stores the information received from the CPCDB 12.
At step 32, the CPCDB 12 transmits to the PMSEDB 14 a request for
information about current and the dates of scheduled events in the area coverage of the
NBS 6.
At step 34, the PMSEDB 14 transmits to the CPCDB 12 a list of current event
and the dates of scheduled event in coverage area of the NBS 6.
At step 36, the NBS 8 stores the information received from the PMSEDB 14.
At step 38, the BBS 8 generates a frequency load curve illustrating the time
variation of the availability of a given frequency in the coverage area of the NBS 6.
The Linear Prediction technique based on MMSE (Minimum Mean Square Error) is
applied on previous and current network information. Then, the BBS 8 computes from
the curve the validity period (step 40), and the error rate (step 42) of the information
concerning the availability of the frequency in the coverage area. That is, the values VP
and ER are extracted from generated frequency load curve.
At step 44, the BBS 8 defines a CPC message M based on the information
received from the NBS 6, and on the validity period and the error rate computed at steps
40 and 42.
At step 46, the BBS 8 broadcasts the message M to the UE 10 present in the
beacon area.
At step 48, the BBS 8 transmits the load information of the beacon area for the
current date to the CPCDB 1 for storage.
At step 50, the CPCDB 12 transmits an acknowledgement message to the BBS
8.
FIGS. 5 and 6 depict an example of curves generated by the BBS 8 respectively
in case of no PMSE event (FIG. 5) and in case of the occurrence of a PMSE event (FIG.
6) in the coverage area of the UE 10.
In FIGS. 5 and 6, "error rate" shown in the figures is an average value of the
difference between the previous and current network information. "Validity period" is
computed from the predicted curve thanks to the linear prediction technique based on
MMSE applied on previous and current network information. Above threshold,
frequency is removed from Beacon message, and below the threshold, frequency is
present into Beacon message. In FIG. 6, during the periods from Ti to Tj, a special
event occurs at t=Tk, then validity period is not only based on predicated value but
truncated because radio environment can be different due to this event present in the area.
FIG. 7 illustrates the UE 10 behavior while roaming in area 2. The UE 10 is
provided with a CPC module adapted for running a program for implementing the
method according to the invention in the UE side.
At step 60, the CPC module starts CPC features, opens Radio for CPC channel
(step 62), initializes variables relating to information validity period (T), error rate
computed by the BBS 8 at step 42, services (S) and messages (M) (step 64) and loads the
UE 10 database (step 66).
At step 68, the CPC module reads the parameters of the service currently used
by the UE's and stores the parameters in a service memory storage.
At step 70, the CPC module verifies whether the error rate computed by the
BBS 8 is appropriated to the UE 10 service or not.
If the error rate computed by the BBS 8 is appropriated to the UE 10, the CPC
module verifies, at step 72, whether the validity period T of the information relating to
the service currently used is elapsed or not.
If the validity period T is not elapsed, it is decremented by the CPC module at
step 74.
At step 76, the CPC module removes obsolete CPC messages from the UE CPC
database, and gets UE geographical position at step 78.
At step 80, the CPC module checks if there is a valid CPC message in the CPC
database or message M which could be used for the current UE's position.
If this is not the case, the process continues from step 68.
Else, the UE 10 exploits (step 82) the valid RAT and frequencies information
defined for its current position.
At step 84, the CPC module reads the exploitation result.
At step 86, the CPC module checks whether the UE 10 continues to listen to the
CPC channel or not.
If so, the process continues from step 68.
Else, the CPC module unloads CPC database and close UE' S radio for CPC
channel at step 88, and closes the UE's CPC features at step 90.
If the error rate computed by the BBS 8 Is not appropriated to the UE's 10
service currently used, or if the validity period T of the information relating to the last
CPC message received is elapsed, the CPC module initializes the variable M relating to
CPC messages to zero (step 100) and configures the UE 10 to listen to the CPC channel
(step 102).
At step 104, the CPC module Verifies whether information is received from the
BBS 8 or not.
If no information is received, the process continues from step 76.
Else, the CPC module reads the validity period value at step 106 and the error
rate value at step 108.
At step 110, the CPC module verifies whether the validity period is elapsed or
not.
If so, the CPC module stores the CPC message in the UE CPC database (step
112).
Else, the CPC module stores the CPC message in the UE 10 (step 114) and
continues the process from step 76.
FIG. 8 illustrates an example of the exploitation step 82 of the valid RAT and
frequencies information received by the UE 10 from the BBS 8.
This process starts from step 200 in FIG. 8. At this step, the CPC module gets
RAT information from selected CPC message.
At step 202, the CPC module verifies whether the UE 10 is already camped on a
zone covered by a NBS 6 or not.
If no, the UE 10 connects to a NBS 6 using the RAT and frequencies
information defined for the current UE geographical position (step 204).
Else, the CPC module verifies feedback information relating to the quality of the
radio environment (step 206).
If the quality of the radio environment is bad, the CPC module makes a
reselection using the RAT and frequencies information defined for the current UE
geographical position (step 208).
The process continues at step 210 in which, the CPC module verifies whether
the NBS connection is successful or not.
If so, the CPC module stores, at step 112, the exploitation result which is "STOP
to listen to the CPC channel".
Else, the CPC module stores, at step 114, the exploitation result which is
"CONTINUE to listen to the CPC channel".
If the quality of the radio environment is good, the process continues from step
112.
Embodiments of this invention have been described in detail above with
reference to the drawings. However, the specific structure of this invention is not
limited to these embodiments and other designs and the like are also included insofar as
they do not depart from the scope of this invention.
INDUSTRIAL APPLICABILITY
The present invention is applicable to telecommunication field and particularly
to beacon services to a UE roaming in an area covered by RAT's to improve the UE's
power saving.
CLAIMS
1. A method for transmitting beacon services to a User Equipment (UE) roaming in
an area covered by several Radio Access Technologies (RAT's), said area comprising a
plurality of geographical zones, each geographical zone comprising at least one network
base station using several frequencies and at least one RATamong said plurality of RAT's,
said UE having various RATcapabilities and preferences and supporting several
frequencies, said method characterized by periodically transmitting to the UE at least a
beacon message M comprising information about the RAT's and the frequencies
deployed in each zone of said area, and data indicating at least a validity period of said
RAT's and said frequencies information.
2. A method according to claim 1, further comprising the step of regularly updating
the information carried by said beacon message M based on feedback information
provided by the network base stations.
3. A method according to claim 2, wherein said feedback information may be
provided by a cognitive pilot channel (CPC) database and/or a program making and
social events (PMSE) database cooperating with said network base station in said area.
4. A method according to claim 3, wherein, upon reception of a beacon message M,
the UE reads the data indicating said validity period, and enters in an idle state if said
validity period has not yet expired, or reads the beacon message received subsequently in
order to get updated information if said validity period has already expired.
5. A method according to claim 3, wherein said feedback information comprise the
UE location in said area, the current network base station load in said area, a PMSE
(program making and social events) predictable in said area.
6. A method according to claim 1 comprising the steps of:
defining in said area n specific sub- zones Zi (i=l to n), n being an integer;
defining in said area n specific sub- zones Zi (i= 1 to n), n being an integer; and
defining the beacon message M as a set of successive sub-messages Mi (i=l to n),
each sub-message Mi carrying information about a specific RAT and/or a specific
frequency deployed in a specific sub-zone Zi of said area, the validity period Vi of said
specific information, and an identifier IDi of said sub-message Mi.
7. A method according to claim 6, further comprising the steps of:
including in each sub-message Mi (i=l to n), the identifiers of the sub-messages
Mi (i=l to n) carrying information previously updated;
broadcasting said set of sub-messages Mi in said area;
retrieving by the UE (10) the identifiers of sub-messages Mi carrying updated
information; and
reading by said UE (10) only the sub-messages Mi corresponding to the
retrieved identifiers.
8. A method according to claim 5, wherein said plurality of geographical zones
consist of a plurality of meshes, and wherein said beacon message M is transmitted over
a Cognitive Pilot Channel (CPC).
9. A Beacon base station for broadcasting beacon services to a User Equipment
(UE) roaming in area, said area covered by several Radio Access Technologies (RAT's)
and comprising a plurality of geographical zones, each geographical zone comprising at
least one network base station using several frequencies and at least one RAT among said
plurality of RAT's, said User Equipment having various RATcapabilities and preferences
and supporting several frequencies, wherein said Beacon base station comprises means
for periodically transmitting to the UE at least a beacon message M comprising
information about the RAT's and the frequencies deployed in each zone of said area, and
data indicating at least a validity period of said RAT's and said frequencies information.
10. A Beacon base station according to claim 9, further comprising means for
regularly updating the information carried by said beacon message M based on feedback
information provided by the network base stations, and/or a CPC database and/or a
program making and social events (PMSE) database cooperating with said network base
station in said area.
11. A Beacon base station according to claim 10, further comprising:
means for defining in said area n specific sub-zones Zi (i=l to n), n being an
integer; and
means for defining the beacon message M as a succession of successive
sub-messages Mi (i=l to n), each sub-message Mi carrying information about a specific
RAT and/or a specific frequency deployed in a specific sub-zone Zi of said area, the
validity period Vi of said specific information, and identifier IDi of said sub-message Mi.
12. A Beacon base station according to claim 11, further comprising:
means for including in each sub-message Mi (i=l to n), the identifiers of the
sub-messages Mi (i=l to n) carrying information previously updated, said identifiers
indicating to the UE the sub-messages Mi carrying updated information.
13. A Beacon base station according to claim 1 , further comprising:
means for including an error rate of the computed validity period in said beacon
message M.
14. A User Equipment (UE) adapted to receive beacon services transmitted by a
Beacon base station according to claim 12.
15. A User Equipment (UE) according to claim 14, comprising a CPC module
adapted for receiving CPC messages broadcasted by said beacon base station, said CPC
module comprising means for verifying whether the validity period of the information
carried by said CPC messages is elapsed or not.
16. A system for broadcasting beacon services to a User Equipment (UE) roaming in
an area, said area covered by several Radio Access Technologies (RAT's), said area
comprising a plurality of geographical zones, each geographical zone comprising at least
one network base station using several frequencies and at least one RATamong said
plurality of RAT's, said User Equipment (UE) having various RATcapabilities and
preferences and supporting several frequencies, said system comprising a CPC base
station, a CPC database and a PMSE database, said CPC base station cooperating with
said network base station and with said PMSE database to gather feedback information
for computing the validity periods of the information carried by CPC sub-messages
broadcast by said CPC base station.
17. A system according to claim 16, wherein each network base station is
configured for regularly transmitting to the CPC base station traffic load information in
this area of radio coverage, the network database is configured for regularly transmitting
to the CPC base station previous overload and traffic load information, and the PMSE
database is configured for regularly transmitting to the CPC base station event list
information in the area, and wherein, said CPC base station generates a frequency load
curve based on the information received from the network base stations, from the CPC
database, and from the PMSE database, and uses said curves for predicting the validity
periods of RATand frequency information in each sub- zone of the area based on the
gathered information.
| # | Name | Date |
|---|---|---|
| 1 | 8836-CHENP-2012 POWER OF ATTORNEY 16-10-2012.pdf | 2012-10-16 |
| 2 | 8836-CHENP-2012 PCT PUBLICATION 16-10-2012.pdf | 2012-10-16 |
| 3 | 8836-CHENP-2012 FORM-5 16-10-2012.pdf | 2012-10-16 |
| 4 | 8836-CHENP-2012 FORM-3 16-10-2012.pdf | 2012-10-16 |
| 5 | 8836-CHENP-2012 FORM-2 FIRST PAGE 16-10-2012.pdf | 2012-10-16 |
| 6 | 8836-CHENP-2012 FORM-1 16-10-2012.pdf | 2012-10-16 |
| 7 | 8836-CHENP-2012 DRAWINGS 16-10-2012.pdf | 2012-10-16 |
| 8 | 8836-CHENP-2012 DESCRIPTION (COMPLETE) 16-10-2012.pdf | 2012-10-16 |
| 9 | 8836-CHENP-2012 CORRESPONDENCE OTHERS 16-10-2012.pdf | 2012-10-16 |
| 10 | 8836-CHENP-2012 CLAIMS SIGNATURE LAST PAGE 16-10-2012.pdf | 2012-10-16 |
| 11 | 8836-CHENP-2012 CLAIMS 16-10-2012.pdf | 2012-10-16 |
| 12 | 8836-CHENP-2012 FORM-18 16-10-2012.pdf | 2012-10-16 |
| 13 | 8836-CHENP-2012.pdf | 2012-10-17 |
| 14 | 8836-CHENP-2012 FORM-3 11-03-2013.pdf | 2013-03-11 |
| 15 | 8836-CHENP-2012 CORRESPONDENCE OTHERS 11-03-2013.pdf | 2013-03-11 |
| 16 | abstract8836-CHENP-2012.jpg | 2014-01-31 |
| 17 | 8836-CHENP-2012 CORRESPONDENCE OTHERS 11-06-2014.pdf | 2014-06-11 |
| 18 | 8836-CHENP-2012 FORM-6 21-11-2014.pdf | 2014-11-21 |
| 19 | lenovo gpa.pdf | 2014-11-24 |
| 20 | LENOVO COPY OF ASSIGNMENT.pdf | 2014-11-24 |
| 21 | 8836 Form 6.pdf | 2014-11-24 |
| 22 | 8836-CHENP-2012-FER.pdf | 2018-09-04 |
| 23 | 8836-CHENP-2012-AbandonedLetter.pdf | 2019-03-06 |
| 1 | 8836ss_31-08-2018.pdf |