Title of Invention

METHOD AND APPARATUS FOR SIGNALING AN AD-HOC GROUP OF MOBILE UITS

Abstract Various embodiments are described for signaling an ad-hoc group of mobile units (MUs). The ad-hoc group may be a group of MUs for which signaling awaits transmission via a wireless communication resource (111). Signaling such a group involves deriving a mobile unit group identifier (MUGI) by combining individual mobile unit identifiers (MUIs) of the targeted ad-hoc group. The individual MUIs are either an identifier of each MU or derived from an identifier of each MU. The derived MUGI is then included in combined signaling that is transmitted (by RAN 121, e.g.) via the wireless communication resource. A receiving MU (101) determines whether the MUGI could have been derived from its MUI in combination with at least one other MU"s MUI. When it determines that the MUGI could have been derived from its MUI, the receiving MU processes the signaling as directed to itself.
Full Text WO 2006/113616

PCT/US2006/014396

1
METHOD AND APPARATUS FOR SIGNALING AN AD-HOC GROUP OF
MOBILE UNITS
Reference(s) to Related Application(s)
The present application claims priority from provisional application,
Serial No. 60/673077, entitled "METHOD AND APPARATUS FOR
SIGNALING AN AD-HOC GROUP OF MOBILE UNITS," filed April 20, 2005,
which is commonly owned and incorporated herein by reference in its entirety.
Field of the Invention
The present invention relates generally to communication systems
and, in particular, to signaling an ad-hoc group of mobile units.
Background of the Invention
In existing wireless communication systems, common signaling
channels such as paging channels (PCHs) are in need of greater bandwidth.
Today, short message service (SMS) and voice mail notification (VMN)
consume a large part of PCH bandwidth, for example. The introduction of new
services such as push-to-talk (PTT), presence, and "push" (which refers
generally to network initiated services) will continue to worsen the PCH
bandwidth situation going forward.
In today's CDMA 2000 systems a General Page Message (GPM) is
used for paging. Keeping the GPM to a single frame is important, especially
during times of congestion, because of the PCH bandwidth situation. In
practice, only one page, addressed by IMSI (international mobile subscriber

WO 2006/113616 PCT/US2006/014396
2
identity), can be placed in a single frame GPM, although as many as four
pages addressed by IMSI can be packed into a two-frame GPM. However,
using such two-frame GPMs can result in some negative effects on latency,
battery life and reliability. Thus, a method and apparatus that enabled two or
more mobile units to be paged in a single PCH frame would be very
desirable.
Brief Description of the Drawings
FIG. 1 is a block diagram depiction of a wireless communication
system in accordance with multiple embodiments of the present invention.
FIG. 2 is a block diagram depiction of a group page message in
accordance with multiple embodiments of the present invention.
FIG. 3 is a logic flow diagram of functionality performed by a radio
access network (RAN) in accordance with multiple embodiments of the
present invention.
FIG. 4 is a logic flow diagram of functionality performed by a mobile
unit (MU) in accordance with multiple embodiments of the present invention.
Specific embodiments of the present invention are disclosed below
with reference to FIGs. 1-4. Both the description and the illustrations have
been drafted with the intent to enhance understanding. For example, the
dimensions of some of the figure elements may be exaggerated relative to
other elements, and well-known elements that are beneficial or even
necessary to a commercially successful implementation may not be depicted
so that a less obstructed and a more clear presentation of embodiments may
be achieved. Simplicity and clarity in both illustration and description are
sought to effectively enable a person of skill in the art to make, use, and best
practice the present invention in view of what is already known in the art. One

WO 2006/113616 PCT/US2006/014396
3
of skill in the art will appreciate that various modifications and changes may
be made to the specific embodiments described below without departing from
the spirit and scope of the present invention. Thus, the specification and
drawings are to be regarded as illustrative and exemplary rather than
restrictive or all-encompassing, and all such modifications to the specific
embodiments described below are intended to be included within the scope of
the present invention.
Detailed Description of Embodiments
Various embodiments are described for signaling an ad-hoc group of
mobile units (MUs). The ad-hoc group may merely be a group of MUs for
which signaling awaits transmission via a wireless communication resource.
Signaling such a group involves deriving a mobile unit group identifier (MUG1)
by combining individual mobile unit identifiers (MUls) of the targeted ad-hoc
group. The individual MUls are either an identifier of each ML) or derived from
an identifier of each ML). The derived MUGI is then included in combined
signaling that is transmitted via the wireless communication resource. A
receiving ML) determines whether the MUGI could have been derived from its
MUI in combination with at least one other MU's MUI. When it determines that
the MUGI could have been derived from its MUI, the receiving MU processes
the signaling as directed to itself.
The disclosed embodiments can be more fully understood with
reference to FIGs. 1-4. FIG. 1 is a block diagram depiction of a wireless
communication system 100 in accordance with multiple embodiments of the
present invention. At present, standards bodies such as OMA (Open Mobile
Alliance), 3GPP (3rd Generation Partnership Project), 3GPP2 (3rd
Generation Partnership Project 2) and IEEE (Institute of Electrical and
Electronics Engineers) 802 are developing standards specifications for
wireless telecommunications systems. (These groups may be contacted via
http://www.openmobilealliance.com. http://www.3qpp.org/.
http://www.3qpp2.com/ and http://www.ieee802.org/. respectively.)

WO 2006/113616 PCT/US2006/014396
4
Communication system 100 represents a system having an architecture in
accordance with one or more of the 3GPP2 technologies (e.g., IS-2000 and
IS-2001), suitably modified, as needed, to implement the present invention.
Alternative embodiments of the present invention may be implemented in
communication systems that employ other or additional technologies such as,
but not limited to, others described in the 3GPP2 specifications (e.g., HRPD
(also known as 1xEV-DO)), those described in the 3GPP specifications (e.g.,
GSM, GPRS, EDGE, W-CDMA, UTRAN, FOMA, UMTS, HSDPA, and
HSUPA), those described in the IEEE's 802 specifications, those described in
the IS-136 (TDMA Third Generation Wireless Standards) specification, those
described in the IS-95 (CDMA) specification, "IxEV-DV technologies, and
integrated dispatch enhanced network technologies.
More specifically, communication system 100 comprises mobile unit
(MU) 101, radio access network (RAN) 121, packet data network 141, IP
(internet protocol) network 145, mobile switching center (MSC) 131, and
public switched telephone network (PSTN) 135. Those skilled in the art will
recognize that FIG. 1 does not depict all of the network equipment necessary
for system 100 to operate but only those system components and logical
entities particularly relevant to the description of embodiments herein.
For example, packet data networks are known to comprise devices
such as packet data serving nodes (PDSNs), serving GPRS support nodes
(SGSNs) and/or gateway GPRS support nodes (GGSNs). Also, RANs are
known to comprise devices such as base transceiver stations (BTSs), access
points (APs), packet control functions (PCFs), packet control units (PCUs),
base site controllers (BSCs), and/or radio network controllers (RNCs),
depending on which technology is employed. However, none of these devices
are specifically shown in FIG. 1.
Instead, RAN 121 is depicted in FIG. 1 as comprising controller 125
and transceiver 127. In general, components such as RAN controllers and
RAN transceivers are well-known. For example, RAN controllers are known to
comprise basic components such as, but not limited to, microprocessors,
memory devices, network interface circuitry, application-specific integrated
circuits (ASICs), and/or logic circuitry. Such RAN components are typically

WO 2006/113616 PCT/US2006/014396
5
adapted to implement algorithms and/or protocols that have been expressed
using high-level design languages or descriptions, expressed using computer
instructions, expressed using messaging flow diagrams, and/or expressed
using logic flow diagrams.
Thus, given an algorithm, a logic flow, a messaging/signaling flow, a
call flow, and/or a protocol specification, those skilled in the art are aware of
the many design and development techniques available to implement a RAN
that performs the given logic. Furthermore, those skilled in the art will
recognize that aspects of the present invention may be implemented in and
across various physical components and none are necessarily limited to
single platform implementations. For example, the RAN aspect of the present
invention may be implemented in a base transceiver station, in a base/packet
controller, or across both a base transceiver station and a base/packet
controller.
Thus, RAN 121 represents a known RAN that has been adapted, in
accordance with the description herein, to implement multiple embodiments
of the present invention. Furthermore, controller 125 and transceiver 127 is
not intended to precisely correspond to a base/packet controller and base
transceiver station, respectively. Rather, controller 125 and transceiver 127
each represent devices that can extend across separate physical components
that perhaps are not even co-located.
As depicted in FIG. 1, RAN 121 uses an air interface comprising
channel groups 111 and 113 for communication with MU 101. IS-2000
channel group 111 comprises a variety of well-known non-traffic channel
types, such as broadcast, paging, access, and control (both shared and
common). In contrast, IS-2000 channel group 113 comprises well-known
traffic channel types, which are dynamically assigned and de-assigned to
support user services.
Standards terminology refers to mobile units by terms such as mobile
stations (MSs), user equipment (UE), access terminals (ATs), terminal
equipment and mobile nodes (MNs). MU platforms are known to refer to a
wide variety of consumer electronic platforms such as, but not limited to, cell
phones, gaming devices, personal computers, and personal digital assistants

WO 2006/113616

PCT/US2006/014396

6
(PDAs). In particular, MU 101 comprises processing unit 105, transceiver 107,
a keypad (not shown), a speaker (not shown), a microphone (not shown), and
a display (not shown). Processing units, transceivers, keypads, speakers,
microphones, and displays as used in MUs are all well-known in the art.
For example, MU processing units are known to comprise basic
components such as, but not limited to, microprocessors, digital signal
processors (DSPs), microcontrollers, memory devices, application-specific
integrated circuits (ASICs), and/or logic circuitry. Such MU components are
typically adapted to implement algorithms and/or protocols that have been
expressed using high-level design languages or descriptions, expressed using
computer instructions, expressed using messaging flow diagrams, and/or
expressed using logic flow diagrams. Thus, given an algorithm, a logic flow, a
messaging/signaling flow, a call flow, and/or a protocol specification, those
skilled in the art are aware of the many design and development techniques
available to implement user equipment that performs the given logic.
Therefore, MU 101 represents a known MU that has been adapted, in
accordance with the description herein, to implement embodiments of the
present invention.
Operation of various embodiments in accordance with the present
invention occur substantially as follows. In general, the various embodiments
involve signaling an ad-hoc group of mobile units (MUs). The group signaled
is ad-hoc in the sense that the members may only be associated or related to
one another for the purpose of this signaling. They may be otherwise related
or associated, perhaps as members of a call group, for example, but they
need not be otherwise related. The ad-hoc group is signaled using a mobile
unit group identifier (MUGI), which is derived by combining the individual
mobile unit identifiers (MUls) of the MUs in the ad-hoc group. Each MU's MUI
may either be an identifier of the MU or a derivation of an identifier of the MU.
There are many possible MU identifiers upon which an MU's MUI may
be based. Examples of MU identifiers include, but are not limited to, an
international mobile subscriber identity (IMSI), an international mobile
equipment identifier (IMEI), a mobile equipment identifier (MEID), an
electronic serial number (ESN), a user identity module identifier (UIMJD), a

WO 2006/113616 PCT/US2006/014396
7
UMTS subscriber information module identifier (USIMJD), a subscriber
identity module identifier (SIMJD), a temporary subscription identifier (TMS1),
a media access control (MAC) identifier, a Unicast Access Terminal Identifier
(UATI), and an Internet Protocol (IP) address. In some embodiments, an
MU's individual MUI is derived by applying a hashing function to one of the
MU's identifiers, or perhaps, to a part of the identifier.
One function that may be used for this hashing is a modulo function. In
addition, whatever function is used, the result may be expressed in a variety
of formats. For example, in some embodiments, the modulo result is
represented by setting a single bit in a bitmap. Thus, for a bitmap having M
bits, the n th bit of the M bits may be set, where n equals one plus modulo M
of the MU identifier (or part of the MU identifier).
To make each MU's individual MUI more unique, its derivation may
include multiple bitmaps of different lengths. For example, each MUI may
include a bitmap where M=29, a bitmap where M=31, a bitmap where M=33,
and a bitmap where M=35. Each of these bitmaps would have the n th bit set,
where n equals one plus modulo M of the MU identifier (or part of the MU
identifier).
As described above, an ad-hoc group of MUs can then be signaled
using a MUGI, derived by combining the MUs' individual MUls. For
embodiments in which one or more bitmaps are employed, the individual
MUls of the ad-hoc group members may be combined by performing a bitwise
logical OR of all the individual MUls. Thus, the resulting MUGI includes one or
more bitmaps having M bits, where M differs for each bitmap (e.g., M=29,
M=31, M=33, and M=35), where an n th bit of the M bits is set for each MU of
the ad-hoc group, and where n, for each MU of the ad-hoc group, equals one
plus modulo M of the respective MU's identifier.
Embodiments in which MUls and MUGIs have four bitmaps, with
M=29, M=31, M=33, and M=35, have some desirable addressing properties.
With four bitmaps, each MUI can be seen as a "point" in a 4-dimensional
space, with each dimension of the "space" corresponding to one of the four
bitmaps. The informational entropy of the representation scheme is fairly
close to maximal for the total space (128 bits= 29 + 31 + 33 +35) and number

WO 2006/113616 PCT/US2006/014396
8
of dimensions (4), since the 4 moduli are all very close to the 128/4 = 32
value and prime relative to each other. This results in a statistically balanced
(uniform) distribution of the addresses among the bitmaps.
For a single address, the uniqueness coefficient is 1 in 29*31*33*35 =
1038345, i.e., approximately 1 in 1 million. This corresponds to an information
entropy of roughly 20 bits. Thus, the target MU address used in computation
is I MSI mod 220, which is the same as a positive integer given by the 20 least
significant bits of the IMSI.
Since the MUGI-based signaling is intended to target several MUs
concurrently, the address uniqueness coefficient goes down sharply with the
4th (because there are 4 dimensions in the space) power of the number of
MUs being targeted. (The address uniqueness coefficient is the maximum
theoretical size of a set of MUs, such that random targeting of one MU from
the set will not probabilistically result in more than one MS being addressed. It
assumes that all MUs in the set have unique identity addresses which are
uniformly distributed in the addressing space.) The table below shows the
variation of the uniqueness coefficient with the number of targeted MUs. In
particular, it shows the equivalent uniqueness for different paging scenarios,
where a MUGI is used to address a paging message.

Number of
targeted
MUs Uniqueness
coefficient per
1 paging slot Equivalent uniqueness
coefficient per 16 paging
slots (SCI = 0) Equivalent
uniqueness coefficient
per 8 paging slots
(SCI = -1)
1 1 in 1000000 1 in 16000000 1 in 8000000
2 1 in 62500 1 in 1000000 1 in 500000
3 1 in 12000 1 in 192000 1 in 96000
4 1 in 3900 1 in 62400 1 in 31200
5 1 in 1600 1 in 25600 1 in 12800
6 1 in 770 1 in 12300 1 in 6160
7 1 in 415 1 in 6640 1 in 3320
8 1 in 240 1 in 3840 1 in 1920

WO 2006/113616 PCT/US2006/014396
9
Targeting MUs using this ad-hoc signaling approach may not always
be beneficial. Again, the use of MUGIs in paging is considered. If only one
mobile is targeted, signaling using a MUGI does not save any bandwidth
since the current General Page Message (GPM) also requires a single frame.
If two MUs are targeted, signaling using a MUGI is beneficial, potentially
doubling PCH bandwidth.
For more than two MUs, however, the uniqueness coefficient should
be considered when evaluating the benefit. A uniqueness coefficient of above
1 in 10,000 is probably selective enough to not result in too many potential
false positives, even for very large paging zones. ("False positives" refer to
MUs that are inadvertently addressed (or paged) as a result of MUGIs not
being unique identifiers of the group of MUs targeted.) As the coefficient goes
down, but remains above 1 in 3000, signaling using a MUGI may still be
beneficial for moderate to large paging zones. Below the 1 in 3000 value, the
number of potential false positives may be considered too large for MUGI-
based signaling to be beneficial. However, it should be noted that "false
positives" are not necessarily wasted, since they can be used to refresh
presence, status, and tracking information as is described in more detail
below.
As depicted in FIG. 1, RAN 121 comprises RAN controller 125 and
RAN transceiver 127, while MU 101 comprises MU processing unit 105 and
MU transceiver 107. RAN 121 and MU 101 communicate via non-traffic
channel group 111 and traffic channel group 113. RAN controller 125 derives
a MUGI by combining individual MUls of targeted MUs (such as MU 101) for
which signaling awaits transmission. RAN controller 125 then transmits, via
transceiver 127 and channel group 111, combined signaling comprising the
derived MUGI.
MU processing unit 105 receives, via channel group 111 and
transceiver 107, the combined signaling comprising the MUGI. Processing
unit 105 then determines whether the MUGI could have been derived from an
MUI of MU 101 in combination with one or more other MUls of other MUs.
Depending on the embodiment, this determination may simply involve
performing a bitwise logical AND of the MUGI and an MUI of MU 101 to see if

WO 2006/113616 PCT/US2006/014396
10
the MUI results. This of course works for embodiments in which the individual
MUls are bitwise ORed together to derive the MUGI.
Also, for simplicity it is desirable that MU 101 and RAN 121 use the
same identifier (or identifier portion) and derivational process to derive the
MUI used by MU 101. As a matter of implementation, MU 101 will probably
store the MUI that it uses for quick retrieval whenever the MUI is needed
rather than deriving it over and over. However, in some embodiments, MU
101 may store/derive multiple MUls, perhaps based on different MU
identifiers and/or different derivational processes, for MUGI-based signaling
with different RANs, for different applications, using different channels, or for
different RAN operating conditions.
When processing unit 105 determines that the MUGI could have been
derived from a MUI of MU 101, processing unit 105 processes the combined
signaling as directed to MU 101. The combined signaling can take a variety of
forms. The signaling may comprise control messaging on a shared or
common control channel. It may also comprise signaling over a paging
channel (PCH), such as paging messages, broadcast messages, SMS
messages, and/or VMN messages. As an example, combined signaling using
a MUGI will be described below for the case of paging a group of MUs using a
group page message.
FIG. 2 is a block diagram depiction of group page message 200 in
accordance with multiple embodiments of the present invention. Generally, in
addition to a MUGI, a group page message may include many assorted
indications to the ad-hoc group of MUs targeted. Some examples that may be
included, depending on the embodiment, follow: an indication of whether an
acknowledgment to a response to the group page message should be
requested by a responding MU, an indication of a persistence level with which
a responding MU should respond to the group page message (the
persistence level may be based on an estimated size of the group of MUs that
may respond to the group page message, including the number targeted by
the MUGI and/or expected to false), an indication of what type of signaling in
response to the group page message is requested from a responding MU, an
indication of a communication service to which the group page message

WO 2006/113616 PCT/US2006/014396
11
pertains (this may take the form of a compressed service option field that only
includes the most often used service options, e.g.), an indication to switch to
an unslotted mode, an indication to switch to a semi-dormant mode, an
indication to switch to a page monitoring mode using an RSCI (reduced slot
cycle index), and an indication of whether the group page message is the last
group page message in the present paging slot.
As a specific example, group page message 200 is presented as a
"single frame" (i.e., 20ms) message to be sent on a full-rate (9600 bps) PCH.
The message can also be employed as a two (consecutive) frame message
to be sent on a half-rate (4800 bps) PCH. Either way, the information payload
is intended be the same, 138 bits.
The MUGI of message 200 is depicted as HB1_BITMAP_29,
HB1_BITMAP_31, HB1_BITMAP__33, and HB1_BITMAP_35. Thus, the MUGI
of message 200 is in accordance with the embodiments of a 4-bitmap MUGI
described above. A specific description of the bit definitions for the
information payload follow:
RESERVED - Reserved.
The base station sets this field to '00'.
ACK_REQ - Acknowledgment required.
The base station sets this field to '1' if the response to this message is
to be sent by the mobile station in assured mode; otherwise, the base station
sets this field to '0'.
PERSISTENCE - Persistence level.
The base station sets this field to '0' if the response to this message is
not required (ACK_REQ was set to '0') or if the response to this message is
required (ACK_REQ was set to '1') to be sent using the same persistence
level as the Page Response Message. The base station sets this field to '1', if
the response to this message is to be sent by the mobile station using the
lowest allowed persistence level for that mobile station.

WO 2006/113616

PCT/US2006/014396

12
RESPONSE_MSG - Response message
The base station sets this field '0' if the requested response is a BS
Ack or Radio Environment Report Message; the base station sets this field to
'1' if the requested response is a Page Response Message.
SERVICEJD - id of the service
The base station sets this field according to the definitions in the
applicable standard.
GRP_PGS_DONE - No more messages in the page slot indicator.
The base station sets this field to '1' if this message is the last Group
Page Message in the paging slot; otherwise the base station sets this field to
'0'.
HB1_BITMAP_29 - Hash bucket number 1.
For each mobile station that is paged, the base station computes the
number i = 1 + (IMSI mod 29) and sets the ith bit (from the left) of this field to
'1'. The base station sets to '0', all the other bits in the field.
HB2_BITMAP_31 - Hash bucket number 2.
For each mobile station that is paged, the base station computes the
number i = 1 + (IMSI mod 31) and sets the i,h bit (from the left) of this field to
'1'. The base station sets to '0', all the other bits in the field.
HB3_BITMAP_33 - Hash bucket number 3.
For each mobile station that is paged, the base station computes the
number i = 1 + (IMSI mod 33) and sets the ith bit (from the left) of this field to
'1'. The base station sets to '0', all the other bits in the field.
HB4_BITMAP_35 - Hash bucket number 4.
For each mobile station that is paged, the base station computes the
number i = 1 + (IMSI mod 35) and sets the ith bit (from the left) of this field to
'1'. The base station sets to '0', all the other bits in the field.

WO 2006/113616 PCT/US2006/014396
13
FIG. 3 is a logic flow diagram of functionality performed by a RAN in
accordance with multiple embodiments of the present invention. For some
embodiments, logic flow 300 begins (301) with the RAN determining (303)
that a wireless communication resource has insufficient bandwidth to convey
signaling individually to a group of MUs during a targeted time period. For
example, in the case of PCH signaling, the RAN may determine that there are
more pages to be transmitted during a paging slot than PCH bandwidth will
allow if the pages are transmitted individually. Another example would be
situations where the targeted time period is not necessarily a paging slot but
is dictated by user expectations of how responsive the system or application
should be.
The RAN then selects (305) an ad-hoc group of MUs to target as a
group. Determining how many and which MUs to target can depend on many
different combinations of factors depending on the embodiment. Some
potential factors include the following: whether a quick paging channel
(QPCH) is provided in a paging area, a transmit power level of the QPCH, a
slot cycle index (SCI) used in the paging area, a present loading level of an
access channel (ACH) associated with the communication resource, a
number of MUs known to be registered in the paging area, a number of MUs
known to be registered in the paging area that also support group signaling of
MUs, which communication service is targeted, a present loading level of the
communication resource (e.g., how many MUs need to be signaled in the
target time period), and/or an estimated number of MUs that may respond
(those targeted and/or those potentially falsing).
In addition to these, there also may be some factors that would
eliminate a potential MU from being included in the ad-hoc group targeted.
Some of these factors include the following: a service class associated with
the potential MU, whether the potential MU has been recently targeted by an
ad-hoc group but did not respond, a battery level of the potential MU, a
plugged-in / battery-only operating mode of the potential MU, and/or the
number of other MUs expected to false if the potential MU is included (the

WO 2006/113616 PCT/US2006/014396
14
RAN may be able to check its list of Mils in the paging area, such as semi-
dormant MUs, to predict possible falsing).
In contrast, there also may be some factors that would provide a strong
reason for including a potential MU in the ad-hoc group. Some of these
factors include the following: the potential MU is a member of a PTT (push-to-
talk) group that is being signaled, the potential MU has low priority signaling
awaiting transmission, the potential MU needs to be paged for a multicast,
and/or the potential MU has a presence update request awaiting
transmission.
Having selected the ad-hoc group of MUs, the RAN derives a MUG I by
combining the MUls associated with the selected MUs. The RAN then
transmits (307) combined signaling comprising the derived MUGI via the
wireless communication resource. In response, the RAN receives (309)
signaling from an MU and determines (311) whether the responding MU is a
selected member of the ad-hoc group targeted by the MUGI or a falsing MU.
In the case where the responding MU was a member of the ad-hoc group, the
RAN processes (313) the responsive signaling in accordance with the
combined signaling directed to the MU.
However, in the case where the responding MU is falsing, the RAN
may either ignore (315) the responsive signaling or opportunistically make
use of it. For example, the RAN may perform one or more of the following
actions in response to the signaling from the falsing MU: update the location
of the MU, register the falsing MU, perform a semi-dormant update for the
falsing MU, signal the falsing MU, and/or interpret the responsive signaling
from the falsing MU as a presence update. Thus, logic flow 300 ends (317);
however, in order to perform the signaling of an ad-hoc group of MUs,
functionality not depicted in FIG. 3 may be additionally performed while
certain depicted functionality may not be performed, depending on the
particular embodiment of the present invention.
FIG. 4 is a logic flow diagram of functionality performed by a mobile
unit (MU) in accordance with multiple embodiments of the present invention.
Logic flow 400 begins (401) with the MU receiving (403) signaling that
comprises a MUGI via a wireless communication resource. The MU

WO 2006/113616 PCT/US2006/014396
15
determines (405) whether the MUGI could have been derived from an MUI of
the MU in combination with one or more other MU's MUls. If (407) so, the MU
processes (409) the signaling as directed to the MU.
However, depending on whether (411) certain conditions are present,
the MU may either respond (413) to the signaling as appropriate or determine
not to respond. Some conditions that may cause the MU to not respond
include the following: the MU has a low battery, the MU has an associated
service class that provides enhanced battery life, the MU does not participate
in a communication service indicated by the signaling, and/or the MU detects
subsequent signaling that indicates that another MU responded to the
signaling (e.g., another MU that derives the same MUI). Thus, logic flow 400
ends (415); however, in order to perform the receiving of signaling for an ad-
hoc group of MUs, functionality not depicted in FIG. 4 may be additionally
performed while certain depicted functionality may not be performed,
depending on the particular embodiment of the present invention.
Benefits, other advantages, and solutions to problems have been
described above with regard to specific embodiments of the present
invention. However, the benefits, advantages, solutions to problems, and any
element(s) that may cause or result in such benefits, advantages, or
solutions, or cause such benefits, advantages, or solutions to become more
pronounced are not to be construed as a critical, required, or essential feature
or element of any or all the claims. As used herein and in the appended
claims, the term "comprises," "comprising," or any other variation thereof is
intended to refer to a non-exclusive inclusion, such that a process, method,
article of manufacture, or apparatus that comprises a list of elements does
not include only those elements in the list, but may include other elements not
expressly listed or inherent to such process, method, article of manufacture,
or apparatus.
The terms a or an, as used herein, are defined as one or more than
one. The term plurality, as used herein, is defined as two or more than two.
The term another, as used herein, is defined as at least a second or more.
The terms including and/or having, as used herein, are defined as comprising
(i.e., open language). The term coupled, as used herein, is defined as

WO 2006/113616 PCT/US2006/014396
16
connected, although not necessarily directly, and not necessarily
mechanically. The terms program, computer program, and computer
instructions, as used herein, are defined as a sequence of instructions
designed for execution on a computer system. This sequence of instructions
may include, but is not limited to, a subroutine, a function, a procedure, an
object method, an object implementation, an executable application, an
applet, a servlet, a shared library/dynamic load library, a source code, an
object code and/or an assembly code.

WE CLAIM:
1. A method for signaling an ad-hoc group of mobile units (MUs), the method
comprising:
deriving a mobile unit group identifier (MUGI) by combining individual mobile
unit identifiers (MUls) of a plurality of MUs for which signaling awaits transmission via
a wireless communication resource;
transmitting, via the wireless communication resource, combined signaling
comprising the derived MUGI.
2. The method of claim 1, further comprising determining, prior to transmitting the
page message, that the wireless communication resource has insufficient bandwidth
to convey signaling individually to the plurality of mobile units during a targeted time
period.
3. The method of claim 1, wherein the MUI of each MU of the plurality of MUs is
derived from an identifier of each MU from the group consisting of:
an international mobile subscriber identity (IMSI),
an international mobile equipment identifier (IMEI),
a mobile equipment identifier (MEID),
an electronic serial number (ESN),
a user identity module identifier (UIMJD),
a UMTS subscriber information module identifier (USIMJD),
a subscriber identity module identifier (SIMJD),
a temporary subscription identifier (TMSI),
a media access control (MAC) identifier,
a Unicast Access Terminal Identifier (UATI), and
an Internet Protocol (IP) address.
17

4. The method of claim 1, wherein combining individual MUls comprises
performing a bitwise logical OR of all the individual MUls.
5. The method of claim 1, wherein deriving the MUGI comprises hashing at least
a portion of each identifier of the plurality of MUs to produce the individual MUls.
6. The method of claim 1, wherein transmitting combined signaling comprises
paging a group of MUs using a group page message and
wherein the group page message comprises the MUGI and at least one paging
indicator from the group consisting of
an indication of whether an acknowledgment to a response to the group page
message is to be requested by a responding MU,
an indication of what type of signaling in response to the group page message
is requested from a responding MU,
an indication of a persistence level with which a responding MU should
respond to the group page message,
an indication of a communication service to which the group page message
pertains,
an indication to switch to an unslotted mode,
an indication to switch to a semi-dormant mode,
an indication to switch to a page monitoring mode using a RSCI (reduced slot
cycle index), and
an indication of whether the group page message is the last group page
message in the present paging slot.
7. A method for receiving signaling directed to an ad-hoc group of mobile units,
the method comprising:
receiving, by a mobile unit (MU) via a wireless communication resource,
signaling that comprises a mobile unit group identifier (MUGI);
determining, by the MU, whether the MUGI could have been derived from a
18

mobile unit identifier (Mill) of the MU in combination with at least one other
MUI from at least one other MU;
when the MU determines that the MUGI could have been derived from the MUI
of the MU, processing the signaling as directed to the MU.
8. The method of claim 7, wherein determining whether the MUGI could have
been derived from the MUI of the MU comprises
performing a bitwise logical AND of the MUGI and the MUI of the MU.
9. The method of claim 7, further comprising
when the MU determines that the MUGI could have been derived from the MUI
of the MU, determining not to send a response to the signaling based on at least one
condition from the group consisting of the MU has a low battery,
the MU has an associated service class that provides enhanced battery
life,
the MU does not participate in a communication service indicated by the
signaling, and
the MU detects subsequent signaling that indicates that another MU
responded to the signaling.
10. A radio access network (RAN) comprising:
a transceiver;
a controller, communicatively coupled to the transceiver,
adapted to derive a mobile unit group identifier (MUGI) by combining
individual mobile unit identifiers (MUls) of a plurality of mobile units (MUs) for which
signaling awaits transmission via a wireless communication resource;
adapted to transmit, via the transceiver and the wireless communication
resource, combined signaling comprising the derived MUGI.
19

11. A mobile unit (MU) comprising:
a transceiver;
a processing unit, communicatively coupled to the transceiver,
adapted to receive, via a wireless communication resource and the
transceiver, signaling that comprises a mobile unit group identifier (MUGI);
adapted to determine whether the MUGI could have been derived from
a mobile unit identifier (MUI) of the MU in combination with at least one other
MUI from at least one other MU;
adapted to process the signaling as directed to the MU when the MU
determines that the MUGI could have been derived from the MUI of the MU.
20

Various embodiments are described for signaling an ad-hoc group of mobile units (MUs). The ad-hoc group may be a group of MUs for which signaling awaits transmission via a wireless communication resource (111). Signaling such a group involves deriving a mobile unit group identifier (MUGI) by combining individual mobile unit identifiers (MUIs) of the targeted ad-hoc group. The individual MUIs are either an identifier of each MU or derived from an identifier of each MU. The derived MUGI
is then included in combined signaling that is transmitted (by RAN 121, e.g.) via the wireless communication resource. A receiving MU (101) determines whether the MUGI could have been derived from its MUI in combination with at least one other MU's MUI. When it determines that the MUGI could have been derived from its MUI, the receiving MU processes the signaling as directed to itself.

Documents:

04023-kolnp-2007-abstract.pdf

04023-kolnp-2007-claims 1.0.pdf

04023-kolnp-2007-claims 1.1.pdf

04023-kolnp-2007-claims 1.2.pdf

04023-kolnp-2007-correspondence others.pdf

04023-kolnp-2007-description complete.pdf

04023-kolnp-2007-drawings.pdf

04023-kolnp-2007-form 1.pdf

04023-kolnp-2007-form 13.pdf

04023-kolnp-2007-form 3.pdf

04023-kolnp-2007-form 5.pdf

04023-kolnp-2007-gpa.pdf

04023-kolnp-2007-international publication.pdf

04023-kolnp-2007-international search report.pdf

04023-kolnp-2007-pct priority document notification.pdf

04023-kolnp-2007-pct request form.pdf

4023-KOLNP-2007-(18-10-2007)-FORM-13.pdf

4023-KOLNP-2007-ASSIGNMENT.pdf

4023-KOLNP-2007-CORRESPONDENCE OTHERS 1.1.pdf

4023-KOLNP-2007-CORRESPONDENCE-1.2.pdf

4023-KOLNP-2007-FORM 13.pdf

4023-kolnp-2007-form-18.pdf

4023-KOLNP-2007-OTHERS.pdf

4023-KOLNP-2007-PA.pdf

abstract-04023-kolnp-2007.jpg


Patent Number 263537
Indian Patent Application Number 4023/KOLNP/2007
PG Journal Number 45/2014
Publication Date 07-Nov-2014
Grant Date 31-Oct-2014
Date of Filing 18-Oct-2007
Name of Patentee MOTOROLA SOLUTIONS, INC.
Applicant Address 1303 EAST ALGONQUIN ROAD, SCHAUMBURG, IL 60196, UNITED STATES OF AMERICA
Inventors:
# Inventor's Name Inventor's Address
1 HARRIS JOHN M 2232 N. KENMORE AVENUE, #1,, CHICAGO, ILLINOIS 60614
2 OPRESCU-SURCOBE VALENTIN 2143 WALTERS, NORTHBROOK, ILLINOIS 60062
3 KELLY SEAN S 4951 N. TAMARACK DRIVE, BARRINGTON, ILLINOIS 60010
PCT International Classification Number H04Q 7/00, H04Q 7/20
PCT International Application Number PCT/US2006/014396
PCT International Filing date 2006-04-18
PCT Conventions:
# PCT Application Number Date of Convention Priority Country
1 11/403349 2006-04-13 U.S.A.
2 60/673077 2005-04-20 U.S.A.