BACKGROUND

Field

The present disclosure relates generally to communication systems, and more particularly, to base station assisted peer discovery to facilitate efficient peer-to-peer (P2P) communications.

Background

Wireless communication systems are widely deployed to provide various telecommunication services such as telephony, video, data, messaging, and broadcasts. Typical wireless communication systems may employ multiple-access technologies capable of supporting communication with multiple users by sharing available system resources (e.g., bandwidth, transmit power). Examples of such multiple-access technologies include code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, frequency division multiple access (FDMA) systems, orthogonal frequency division multiple access (OFDMA) systems, single-carrier frequency divisional multiple access (SC-FDMA) systems, and time division synchronous code division multiple access (TD- SCDMA) systems.

For many applications (e.g., social networking applications) it is important for a device to discover other devices within the vicinity. A device may broadcast a peer discovery signal which conveys an "expression" that can identify itself. The peer discovery information is usually very small. Note that although the peer discovery information may be fixed in a long time period, the bits that encode this information may change rapidly due to privacy concerns. The device may also need to detect other devices' peer discovery signal. Due to the fast decaying of radio signals, a device may not be able to directly detect another peer device's peer discovery signal. Further, different devices may operate in different frequency bands or under different operators, and it may not be feasible for a device to transmit/receive in all possible bands to detect all other device's peer discovery signal.

Base stations can receive peer devices' peer discovery information, exchange this information among base stations, and rebroadcast the information so that peer devices in a wide area may discover each other. With base station relayed peer discovery, periodic transmission of time varying peer discovery expressions to the base station may cause an excessive amount of short message traffic in the wide area network (WAN) and may result in excessive overhead communications. Therefore, a system and method to assist in facilitating efficient communication of a peer-to- peer communication discovery expression is desired.

SUMMARY

[0005] The following presents a simplified summary of one or more aspects in order to provide a basic understanding of such aspects. This summary is not an extensive overview of all contemplated aspects, and is intended to neither identify key or critical elements of all aspects nor delineate the scope of any or all aspects. Its sole purpose is to present some concepts of one or more aspects in a simplified form as a prelude to the more detailed description that is presented later.

[0006] In accordance with one or more aspects and corresponding disclosure thereof, various aspects are described in connection with base station assisted discovery to enable P2P communications. In one example, a UE is equipped to generate an expression associated with a wireless device for use in a peer discovery signal, generate an expression set from the expression, a first temporal frequency, and a first time duration, and transmit the generated expression set to a base station to allow the base station to broadcast each of the expressions included in the expression set at the first temporal frequency over the first time duration. In another example, a base station is equipped to receive an expression set from a wireless device, process the received expression set to determine each of one or more instances of an expression, and transmit each of the one or more instances of the expression.

[0007] According to related aspects, a method for base station assisted P2P discovery is provided. The method can comprise generating an expression associated with a wireless device for use in a peer discovery signal. Further, the method can include generating an expression set from the expression, a first temporal frequency, and a first time duration. Moreover, the method may include transmitting the generated expression set to a base station to allow the base station to broadcast each of the expressions included in the expression set at the first temporal frequency over the first time duration. Another aspect relates to a wireless communications apparatus enabled to use base station assistance for P2P discovery. The wireless communications apparatus can include means for generating an expression associated with a wireless device for use in a peer discovery signal. Further, the wireless communications apparatus can include means for generating an expression set from the expression, a first temporal frequency, and a first time duration. Moreover, the wireless communications apparatus can include means for transmitting the generated expression set to a base station to allow the base station to broadcast each of the expressions included in the expression set at the first temporal frequency over the first time duration.

Another aspect relates to a wireless communications apparatus. The apparatus can include a processing system configured to generate an expression associated with a wireless device for use in a peer discovery signal. Further, the processing system may be configured to generate an expression set from the expression, a first temporal frequency, and a first time duration. Moreover, the processing system may further be configured to transmit the generated expression set to a base station to allow the base station to broadcast each of the expressions included in the expression set at the first temporal frequency over the first time duration.

Still another aspect relates to a computer program product, which can have a computer-readable medium including code for generating an expression associated with a wireless device for use in a peer discovery signal. Further, the computer- readable medium can include code for generating an expression set from the expression, a first temporal frequency, and a first time duration. Moreover, the computer-readable medium can include code for transmitting the generated expression set to a base station to allow the base station to broadcast each of the expressions included in the expression set at the first temporal frequency over the first time duration.

According to related aspects, a method for base station assisted P2P discovery is provided. The method can comprise receiving an expression set from a wireless device, wherein the expression set includes one or more instances of an expression, a first temporal frequency, and a first duration of time. Further, the method can include processing the received expression set to determine each of one or more instances of an expression for transmission at the first temporal frequency over the first duration of time. Moreover, the method may include transmitting each of the one or more instances of the expression at the first temporal frequency during the first duration of time.

Another aspect relates to a wireless communications apparatus enabled to use base station assistance for P2P discovery. The wireless communications apparatus can include means for receiving an expression set from a wireless device, wherein the expression set includes one or more instances of an expression, a first temporal frequency, and a first duration of time. Further, the wireless communications apparatus can include means for processing the received expression set to determine each of one or more instances of an expression for transmission at the first temporal frequency over the first duration of time. Moreover, the wireless communications apparatus can include means for transmitting each of the one or more instances of the expression at the first temporal frequency during the first duration of time.

Another aspect relates to a wireless communications apparatus. The apparatus can include a processing system configured to receive an expression set from a wireless device, wherein the expression set includes one or more instances of an expression, a first temporal frequency, and a first duration of time. Further, the processing system may be configured to process the received expression set to determine each of one or more instances of an expression for transmission at the first temporal frequency over the first duration of time. Moreover, the processing system may further be configured to transmit each of the one or more instances of the expression at the first temporal frequency during the first duration of time.

Still another aspect relates to a computer program product, which can have a computer-readable medium including code for receiving an expression set from a wireless device, wherein the expression set includes one or more instances of an expression, a first temporal frequency, and a first duration of time. Further, the computer-readable medium can include code for processing the received expression set to determine each of one or more instances of an expression for transmission at the first temporal frequency over the first duration of time. Moreover, the computer-readable medium can include code for transmitting each of the one or more instances of the expression at the first temporal frequency during the first duration of time.

To the accomplishment of the foregoing and related ends, the one or more aspects comprise the features hereinafter fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative features of the one or more aspects. These features are indicative, however, of but a few of the various ways in which the principles of various aspects may be employed, and this description is intended to include all such aspects and their equivalents.

BRIEF DESCRIPTION OF THE DRAWINGS

[0016] FIG. 1 is a diagram illustrating an example of a hardware implementation for an apparatus employing a processing system.

[0017] FIG. 2 is a diagram of a wireless peer-to-peer communications system.

[0018] FIG. 3 is a diagram illustrating an exemplary time structure for peer-to-peer communication between the wireless devices.

[0019] FIG. 4 is a diagram illustrating the channels in each frame of superframes in one grandframe.

[0020] FIG. 5 is a diagram illustrating an operation timeline of a miscellaneous channel and a structure of a peer discovery channel.

[0021] FIG. 6 is a diagram of a wireless wide area network communications system operable to support peer-to-peer communications according to an aspect.

[0022] FIG. 7 is a call flow diagram illustrating communications between a wireless device and a base station in a wireless peer-to-peer communications system.

[0023] FIG. 8 is a flow chart of a method of wireless communication.

[0024] FIG. 9 is a conceptual block diagram illustrating the functionality of an exemplary apparatus.

[0025] FIG. 10 is a flow chart of another method of wireless communication.

[0026] FIG. 11 is a conceptual block diagram illustrating the functionality of another exemplary apparatus.

DETAILED DESCRIPTION

[0027] The detailed description set forth below in connection with the appended drawings is intended as a description of various configurations and is not intended to represent the only configurations in which the concepts described herein may be practiced. The detailed description includes specific details for the purpose of providing a thorough understanding of various concepts. However, it will be apparent to those skilled in the art that these concepts may be practiced without these specific details. In some instances, well known structures and components are shown in block diagram form in order to avoid obscuring such concepts.

[0028] Several aspects of communication systems will now be presented with reference to various apparatus and methods. These apparatus and methods will be described in the following detailed description and illustrated in the accompanying drawing by various blocks, modules, components, circuits, steps, processes, algorithms, etc. (collectively referred to as "elements"). These elements may be implemented using electronic hardware, computer software, or any combination thereof. Whether such elements are implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system.

[0029] By way of example, an element, or any portion of an element, or any combination of elements may be implemented with a "processing system" that includes one or more processors. Examples of processors include microprocessors, microcontrollers, digital signal processors (DSPs), field programmable gate arrays (FPGAs), programmable logic devices (PLDs), state machines, gated logic, discrete hardware circuits, and other suitable hardware configured to perform the various functionality described throughout this disclosure. One or more processors in the processing system may execute software. Software shall be construed broadly to mean instructions, instruction sets, code, code segments, program code, programs, subprograms, software modules, applications, software applications, software packages, routines, subroutines, objects, executables, threads of execution, procedures, functions, etc., whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise. The software may reside on a computer-readable medium. The computer-readable medium may be a non- transitory computer-readable medium. A non-transitory computer-readable medium include, by way of example, a magnetic storage device (e.g., hard disk, floppy disk, magnetic strip), an optical disk (e.g., compact disk (CD), digital versatile disk (DVD)), a smart card, a flash memory device (e.g., card, stick, key drive), random access memory (RAM), read only memory (ROM), programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), a register, a removable disk, and any other suitable medium for storing software and/or instructions that may be accessed and read by a computer. The computer-readable medium may be resident in the processing system, external to the processing system, or distributed across multiple entities including the processing system. The computer-readable medium may be embodied in a computer-program product. By way of example, a computer-program product may include a computer-readable medium in packaging materials.

[0030] Accordingly, in one or more exemplary embodiments, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or encoded as one or more instructions or code on a computer-readable medium. Computer-readable media includes computer storage media. Storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media. Those skilled in the art will recognize how best to implement the described functionality presented throughout this disclosure depending on the particular application and the overall design constraints imposed on the overall system.

[0031] FIG. 1 is a conceptual diagram illustrating an example of a hardware implementation for an apparatus 100 employing a processing system 114. The processing system 1 14 may be implemented with a bus architecture, represented generally by the bus 102. The bus 102 may include any number of interconnecting buses and bridges depending on the specific application of the processing system 114 and the overall design constraints. The bus 102 links together various circuits including one or more processors and/or hardware modules, represented generally by the processor 104, and computer-readable media, represented generally by the computer-readable medium 106. The bus 102 may also link various other circuits such as timing sources, peripherals, voltage regulators, and power management circuits, which are well known in the art, and therefore, will not be described any further. A bus interface 108 provides an interface between the bus 102 and a transceiver 1 10. The transceiver 1 10 provides a means for communicating with various other apparatuses over a transmission medium.

The processor 104 is responsible for managing the bus 102 and general processing, including the execution of software stored on the computer-readable medium 106. The software, when executed by the processor 104, causes the processing system 114 to perform the various functions described infra for any particular apparatus. The computer-readable medium 106 may also be used for storing data that is manipulated by the processor 104 when executing software.

FIG. 2 is a drawing of an exemplary peer-to-peer communications system 200. The peer-to-peer communications system 200 includes a plurality of wireless devices 206, 208, 210, 212. The peer-to-peer communications system 200 may overlap with a cellular communications system, such as for example, a wireless wide area network (WWAN). Some of the wireless devices 206, 208, 210, 212 may communicate together in peer-to-peer communication, some may communicate with the base station 204, and some may do both. For example, as shown in FIG. 2, the wireless devices 206, 208 are in peer-to-peer communication and the wireless devices 210, 212 are in peer-to-peer communication. The wireless device 212 is also communicating with the base station 204.

The wireless device may alternatively be referred to by those skilled in the art as user equipment, a mobile station, a subscriber station, a mobile unit, a subscriber unit, a wireless unit, a wireless node, a remote unit, a mobile device, a wireless communication device, a remote device, a mobile subscriber station, an access terminal, a mobile terminal, a wireless terminal, a remote terminal, a handset, a user agent, a mobile client, a client, or some other suitable terminology. The base station may alternatively be referred to by those skilled in the art as an access point, a base transceiver station, a radio base station, a radio transceiver, a transceiver function, a basic service set (BSS), an extended service set (ESS), a Node B, an evolved Node B, or some other suitable terminology.

The exemplary methods and apparatuses discussed infra are applicable to any of a variety of wireless peer-to-peer communications systems, such as for example, a wireless peer-to-peer communication system based on FlashLinQ, WiMedia, Bluetooth, ZigBee, or Wi-Fi based on the IEEE 802.1 1 standard. To simplify the discussion, the exemplary methods and apparatus are discussed within the context of FlashLinQ. However, one of ordinary skill in the art would understand that the exemplary methods and apparatuses are applicable more generally to a variety of other wireless peer-to-peer communication systems.

[0036] FIG. 3 is a diagram 300 illustrating an exemplary time structure for peer-to-peer communication between the wireless devices 100. An ultraframe is 512 seconds and includes 64 megaframes. Each megaframe is 8 seconds and includes 8 grandframes. Each grandframe is 1 second and includes 15 superframes. Each superframe is approximately 66.67 ms and includes 32 frames. Each frame is 2.0833 ms.

[0037] FIG. 4 is a diagram 400 illustrating the channels in each frame of superframes in one grandframe. In a first superframe (with index 0), frame 0 is a reserved channel (RCH), frames 1-10 are each a miscellaneous channel (MCCH), and frames 11-31 are each a traffic channel (TCCH). In the 2 ^nd through 7 ^th superframes (with index 1 :6), frame 0 is a RCH and frames 1-31 are each a TCCH. In an 8 ^th superframe (with index 7), frame 0 is a RCH, frames 1-10 are each a MCCH, and frames 1 1-31 are each a TCCH. In the 9 ^th through 15 ^th superframes (with index 8: 14), frame 0 is a RCH and frames 1-31 are each a TCCH. The MCCH of superframe index 0 includes a secondary timing synchronization channel, a peer discovery channel, a peer page channel, and a reserved slot. The MCCH of superframe index 7 includes a peer page channel and reserved slots. The TCCH includes connection scheduling, a pilot, channel quality indicator (CQI) feedback, a data segment, and an acknowledgement (ACK).

[0038] FIG. 5 is a diagram 500 illustrating an operation timeline of the MCCH and an exemplary structure of a peer discovery channel. As discussed in relation to FIG. 4, the MCCH of superframe index 0 includes a secondary timing synchronization channel, a peer discovery channel, a peer paging channel, and a reserved slot. The peer discovery channel may be divided into subchannels. For example, the peer discovery channel may be divided into a long range peer discovery channel, a medium range peer discovery channel, a short range peer discovery channel, and other channels. Each of the subchannels may include a plurality of blocks/resources for communicating peer discovery information. Each block may include a plurality of orthogonal frequency-division multiplexing (OFDM) symbols (e.g., 72) at the same subcarrier. FIG. 5 provides an example of a subchannel (e.g., short range peer discovery channel) including blocks in one megaframe, which includes the MCCH superframe index 0 of grandframes 0 through 7. Different sets of blocks correspond to different peer discovery resource identifiers (PDRIDs). For example, one PDRID may correspond to one of the blocks in the MCCH superframe index 0 of one grandframe in the megaframe.

[0039] Upon power up, a wireless device listens to the peer discovery channel for a period of time (e.g., two megaframes) and selects a PDRID based on a determined energy on each of the PDRIDs. For example, a wireless device may select a PDRID corresponding to block 502 (7=2 and 7=15) in a first megaframe of an ultraframe. The particular PDRID may map to other blocks in other megaframes of the ultraframe due to hopping. In blocks associated with the selected PDRID, the wireless device transmits its peer discovery signal. In blocks unassociated with the selected PDRID, the wireless device listens for peer discovery signals transmitted by other wireless devices.

[0040] The wireless device may also reselect a PDRID if the wireless device detects a

PDRID collision. That is, a wireless device may listen rather than transmit on its available peer discovery resource in order to detect an energy on the peer discovery resource corresponding to its PDRID. The wireless device may also detect energies on other peer discovery resources corresponding to other PDRIDs. The wireless device may reselect a PDRID based on the determined energy on the peer discovery resource corresponding its PDRID and the detected energies on the other peer discovery resources corresponding to other PDRIDs.

[0041] FIG. 6 is a drawing of an exemplary wireless wide area network (WWAN) communications system 600. The peer-to-peer communications system 600 includes a plurality of wireless devices 602, 606, 610, and may include one or more base stations 604, 608. In one aspect, base stations 604 and 608 may be connected over a network connection 616.

[0042] Wireless device 602 may generate an expression for discovery for peer-to-peer communications. As used herein an expression may be a unique naming structure defined by an application and may allow applications to discover one another. In one aspect, an expression may include a public expression and/or a private expression. A public expression may include an expression name and a corresponding expression code that may be efficiently transmitted over the air. Further, a private expression includes an expression name and a corresponding expression key that may have a time-varying hash function applied to them prior to being sent over the air. One way to keep the expression private is encryption. The device 602 may generate a private expression and a particular group of devices may share a common key, which may be used to encrypt/decrypt the private expression. This key may be changed from time to time and the key sequence as a function of time may be known by the device 602 and the group of devices with which the device 602 intends to share (e.g., 606). As such, devices with the key sequence can decrypt the expression. In one aspect, the expression may be included in a short bit string. For example, in FlashLinQ, the expression may include 70 bits of information. Further, in one aspect, a device's expression can be time variant.

Further, wireless device 602 may process the expression to generate an expression set 612. In one aspect, the expression set 612 may be aggregated over a period of time and sent to the base station 604 using an uplink channel. As an example, the expression may be 70 bits long, and a peer discovery period may be 8ms. Device 602 may aggregate all the expressions over the next hour (e.g., approximately 4K byte) in a packet and send the packet (e.g., expression set 612) to the base station. After receiving the aggregated expression set 612, the base station can reproduce the 70 bits expression for each 8 ms peer discover period and broadcast only the corresponding 70 bits expression 614 every 8 ms. In one aspect, base station 604 may communicate the expression set 612 and/or the expression 614 over the network connection 616 to base station 608 to transmit the expression. In such an aspect, wireless device 610 may receive the expression 614 associated with wireless device 602 even though it is served by a different base station 608. In one aspect, base station 604 may receive the expression set 612 using a first frequency band and may transmit the expression 614 using one or more other frequency bands.

FIG. 7 illustrates an example wireless communications network 700 including wireless device 702, base station 704, and one or more peer devices 706. Wireless communications network 700 allows for improved base station assisted peer discovery processes to be implemented in a peer-to-peer network.

At act 708, a wireless device 702 may generate an expression to be communicated as part of a peer discovery process.

At act 710, the wireless device 702 may preprocess the expression so as to make the information accessible to various peer devices 706. For example, the expression may be preprocessed as a private expression. One way to keep the expression private is encryption. The wireless device 702 with the private expression and a particular group of devices 706 may share a common key, which is used to encrypt/decrypt the expression. In one aspect, the key may be changed from time to time. In such an aspect, this key sequence, as a function of time, may be known by the device 702 and the group of devices 706. Thus only devices with the key sequence can decrypt the expression.

[0047] At act 712, the wireless device 702 may generate an aggregated expression value.

In one aspect, wireless device 703 may aggregate expressions over a certain period of time. As an example, assume that the expression is 70 bits long, and the peer discovery period is 8 seconds. Wireless device 702 may aggregate all the expressions over the next hour (e.g., about 4K byte) into an aggregated expression packet. At act 714, the aggregated expression packet may be transmitted to base station 704.

[0048] At act 716, base station 704 may reproduce wireless device 702 expressions and at act 718, base station 704 may broadcast the expressions at a determined temporal frequency to various peer devices 706. In other words, after base station 704 receives the aggregated expression, the base station 704 can reproduce the 70 bits expression for each 8 second peer discover period and broadcast only the corresponding 70 bits expression every 8 seconds. In one aspect, if wireless device 702 does not want to be discovered by other devices 706, it may send a message (not shown) to the base station 704 to stop the broadcasting of its expression. As such, an uplink transmission may be used over a time duration (e.g., an hour), and overhead associated with sending expressions to the base station 704 may be greatly reduced.

[0049] FIG. 8 is a flow chart 800 of an exemplary method. The method is performed by a wireless device. At block 802, the wireless device may generate an expression for use in a peer discovery signal. In one aspect, the expression may be encrypted using one or more keys. At block 804, the wireless device may generate an expression set from the expression, a temporal frequency and a time duration. In one aspect, the temporal frequency may be a temporal frequency used for broadcasting a peer discovery signal. In one aspect, the expression set may be encrypted using one or more keys. In another aspect, separately encrypted expressions may be aggregated into the expression set. At block 806, the wireless device may transmit the expression set to a base station for eventual broadcasting of the expressions at the temporal frequency during the time duration. In one aspect, one or more rules may also be transmitted with the expression set. In such an aspect, the rules may be used by the base station to process the expression set to obtain each expression. Further, the one or more rules may indicate how to change an expression over time. For example, a time dependent hash function may be used to obtain each expression from the expression set. In another example, one or more time dependent encryption keys may be applied to each expression from the expression set.

[0050] FIG. 9 is a conceptual block diagram 900 illustrating the functionality of an exemplary apparatus 602'. The apparatus 602' includes an expression generation module 902 that is operable to generate an expression associated with the wireless device 602' for use in a peer discovery signal. The apparatus 602' may also include an expression set generation module 904 that is operable to generate an expression set from the expression 908, a temporal frequency 910 and a time duration 912. In such an aspect, the temporal frequency may coincide with a temporal frequency used for peer discovery transmissions. The apparatus 602' may further include a transmission module 906 that is operable to transmit the expression set 914 to a base station 604. In one aspect, transmission module 906 may further include one or more rules with the expression set 914 to assist base station 604 in derive the expression 908 from the expression set 914. In an optional aspect, apparatus 602' may further include an encryption module 916 that may be operable to encrypt expressions and/or expression sets using one or more keys 918. The apparatus 602' may include additional modules that perform each of the steps in the aforementioned flow charts. Each step in the aforementioned flow charts may be performed by a module and the apparatus 100/602' may include one or more of those modules.

[0051] Referring to FIGs. 1, 6, and 9, in one configuration, the apparatus 100/602/602' for wireless communication includes means for generating an expression associated with a wireless device for use in a peer discovery signal, means for generating an expression set from the expression, a first temporal frequency, and a first time duration, and means for transmitting the generated expression set to a base station to allow the base station to broadcast each of the expressions included in the expression set at the first temporal frequency over the first time duration. In one aspect, the means for generating an expression set may further include means for encrypting the expression set using one or more keys. In another aspect, the means for generating an expression set may further include means for encrypting each expression separately in the expression set, and means for aggregating each separately encrypted expression into the expression set. In one aspect, the means for transmitting may further include means for transmitting one or more rules for generating an expression to transmit based on each expression in the expression set. In such an aspect, the one or more rules may include information indicating how to change the expression over time. The aforementioned means is the processing system 114 configured to perform the functions recited by the aforementioned means.

[0052] FIG. 10 is a flow chart 1000 of an exemplary method. The method is performed by a wireless device. At block 1002, the base station may receive an expression set from a wireless device including one or more instances of an expression, a temporal frequency and a time duration. In one aspect, the expression set may be received in a first frequency band. In one aspect, the expression set is encrypted used one or more keys. In such an aspect, the expression set may be decrypted by the base station and/or each expression may be separately decrypted by the base station. Further, the base station may re-encrypt each expression in the expression set prior to a subsequent transmission.

[0053] At block 1004, the received expression set may be processed to obtain each instance of an expression. In one aspect, the expression set may be received with one or more rules to assist the base station in processing the received expression set. In such an aspect, the one or more rules may include information indicating how to change the expression over time. For example, a time dependent hash function may be used on each expression from the expression set. In another example, one or more time dependent encryption keys may be applied to each expression from the expression set.

[0054] At block 1006, the base station may transmit each instance of the expression at the determined temporal frequency for the duration of time. In one aspect, the base station may transmit each instance of the expression to one or more other base stations to allow the one or more other base station to also transmit the expression. In another aspect, the base station may transmit the expression set to the one or more other base stations to allow the one or more other base stations to extract and to transmit the expression.

[0055] FIG. 11 is a conceptual block diagram 1 100 illustrating the functionality of an exemplary apparatus 604'. The apparatus 604' includes a reception module 1102 that is operable to receive an expression set 1 108 from a wireless device 602. In one aspect, the expression set may also be received one or more rules to assist in processing the expression set. Further, the expression set 1108 may include one or more instances of an expression 1 1 10, a temporal frequency 11 12, and a time duration 1 114. The apparatus 604' may further include expression set processing module 1 104 that may be operable determine each of the one or more instance of an expression 1 116 by processing the expression set 1108. In an optional aspect, where a received expression set 1108 is encrypted, decryption/encryption module 11 18 may assist expression set processing module 1 104 is decrypting and/or processing the encrypted expression set. The apparatus may further include transmission module 1106 that may transmit each expression 1 1 16 at the temporal frequency 11 12 for the time duration 1 114. In one optional aspect, the apparatus 604' may communication at least one of the expression set 1108 or each instance of the expression to one or more other base stations to allow the one or more other base stations to transmit the expression. Further, in an optional aspect, where the each expression 11 16 is encrypted, decryption/encryption module 11 18 may assist expression set processing module 1 104 is re-encrypting the expression 11 16. In one aspect, transmission module 1106 may transmit the expression 1 116 over a one or more different frequency bands than upon which the expression set 1 108 was received. The apparatus 604' may include additional modules that perform each of the steps in the aforementioned flow charts. Each step in the aforementioned flow charts may be performed by a module and apparatuses 100/604' may include one or more of those modules.

Referring to FIGs. 1, 6, and 1 1, in one configuration, the apparatus 100/604/604' for wireless communication includes means for receiving an expression set from a wireless device, wherein the expression set includes one or more instances of an expression, a first temporal frequency, and a first duration of time, means for processing the received expression set to determine each of one or more instances of an expression for transmission at the first temporal frequency over the first duration of time, and means for transmitting each of the one or more instances of the expression at the first temporal frequency during the first duration of time. In one aspect, the means for receiving may further include means for receiving within a first frequency band, and the means for transmitting may further include means for transmitting within one or more other frequency bands. In one aspect, where the expression set is encrypted, the apparatus 704' may further include means for decrypting the encrypted expression set, and means for separately re-encrypt each expression in the expression set. In one aspect, where each expression is separately encrypted, the apparatus 704' may further include means for decrypting each expression in the expression set. In one aspect, the means for receiving may further include means for receiving one or more rules for generating an expression to transmit based on each expression in the expression set. In such an aspect, the one or more rules may include information indicating how to change the expression over time. In one aspect, the means for transmitting may further include means for transmitting each of the one or more instances of the expression to one or more other base stations to allow the one or more other base stations to transmit the one or more instances of the expression. In another aspect, the means for transmitting may further include means for transmitting the expression set to one or more other base stations to allow the one or more other base stations to process the expression set and transmit the one or more instances of the expression. The aforementioned means is the processing system 114 configured to perform the functions recited by the aforementioned means.

[0057] It is understood that the specific order or hierarchy of steps in the processes disclosed is an illustration of exemplary approaches. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged. The accompanying method claims present elements of the various steps in a sample order, and are not meant to be limited to the specific order or hierarchy presented.

[0058] The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown herein, but is to be accorded the full scope consistent with the language claims, wherein reference to an element in the singular is not intended to mean "one and only one" unless specifically so stated, but rather "one or more." Unless specifically stated otherwise, the term "some" refers to one or more. All structural and functional equivalents to the elements of the various aspects described throughout this disclosure that are known or later come to be known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the claims. Moreover, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is explicitly recited in the claims. No claim element is to be construed as a means function unless the element is expressly recited using the phrase "means for."

WHAT IS CLAIMED IS: