KR20160101084A - Hash partial matching for discovery - Google Patents

Abstract

Methods, systems, and apparatus are described that allow partial matching of published services or service names, including compressed service names. The described features employ compression techniques including hashing; They allow partial matching of compressed service name strings. Various embodiments are described that provide for identifying a desired service (or attributes of a desired service) and comparing one or more advertised attributes. A comparison of desired and advertised attributes may be used to determine, select, and / or locate the advertised service.

Description

{HASH PARTIAL MATCHING FOR DISCOVERY}

Wireless communication systems are widely deployed to provide various types of communication of services and content, including voice, video, packet data, messaging, broadcast, and the like. These systems may be multiple access systems capable of supporting communication with multiple users by sharing available system resources (e.g., time, frequency, and power). Examples of such multiple access systems include Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, and Orthogonal Frequency Division Multiple Access (OFDMA) systems.

Wireless devices employing these or other techniques and operating in such systems may communicate with each other to convey information about a particular service. A device may, for example, disclose information relating to a particular service provided by the device. Other devices may receive the published information and attempt to use the published service if the device or published service matches a particular popular service. In some cases, techniques are used to limit or reduce the size of the disclosed information. For example, the name of a particular service may be reduced for public purposes. However, existing solutions that reduce such information may not allow devices to perform partial matching of information. Existing solutions may not allow the device to discover or use certain public services if the published name represents only a partial match for the desired service.

The described features generally relate to one or more methods, systems, and devices that may permit partial matching of published services or service names. Several protocols, such as those using reverse domain name system (DNS) style naming (for example, com.mycompany.myservice.mydevice), allow one device to publish services that other devices can discover and discover You may. In some cases, such a process of discovering related and / or desired services is referred to as matching. The "matching device" (the device searching for the service) may choose to perform a partial match by retrieving the complete service name string or by matching only the prefix of the published service name, for example. In such cases, the matching device may have an increased number of search results. For example, the search may be performed for DNS style names that include "com.mycompany.myservice" regardless of the name of the particular device that advertises such service. In such a scenario, a search employing a partial match criterion may return results for all available devices providing the service.

In some embodiments, a method of wireless communication includes generating a compressed first representation that includes one or more compressed desired attributes, receiving a compressed second representation that includes one or more compressed advertised attributes, Comparing the compressed advertised attributes with the compressed desired attributes, and determining whether at least one of the compressed desired attributes includes at least a partial match with at least one of the compressed advertised attributes do.

In some embodiments, a system for wireless communication includes means for generating a compressed first representation comprising one or more compressed desired attributes, means for receiving a compressed second representation comprising one or more compressed advertised attributes Means for comparing the compressed advertised attributes with compressed desired attributes, and means for determining whether at least one of the compressed desired attributes includes at least a partial match with at least one of the compressed advertised attributes .

In some embodiments, an apparatus for wireless communication includes a processor, a memory in electronic communication with the processor, and instructions stored in the memory. Instructions generate a compressed first representation that includes one or more compressed desired attributes, receive a compressed second representation that includes one or more compressed advertised attributes, compress the desired attributes and the compressed advertised attributes And determine whether at least one of the compressed desired attributes includes at least a partial match with at least one of the compressed advertised attributes.

In some embodiments, a non-transitory computer-readable medium storing code for wireless communication is configured to generate a compressed first representation comprising one or more compressed desired attributes and to perform a compression comprising one or more compressed advertised attributes And comparing at least one of the compressed desired attributes with at least one of the compressed advertised attributes to determine whether the at least one of the compressed desired attributes includes at least a partial match with the compressed advertised attributes Or < / RTI >

In certain instances, a method, system, apparatus, and / or non-transitory computer-readable medium may also include a compressed form of the compressed attributes, 2 representations, means, and / or instructions executable by the processor.

In certain instances, a method, system, apparatus, and / or non-volatile computer-readable medium may also include instructions for determining a location based at least in part on a compressed second representation, It may contain possible commands.

In some examples of methods, systems, devices, and / or non-transitory computer readable media, determining a location may include determining the location of the advertised service by the compressed second representation.

In some instances, a method, system, apparatus, and / or non-transitory computer readable medium may also be used to identify an uncompressed first representation that includes one or more uncompressed desired attributes, Steps, means, and / or instructions executable by the processor.

In some examples of methods, systems, devices, and / or non-transitory computer readable media, the compressed first representation may correspond to a reverse domain name system (DNS) style name string for the desired service, The representation may correspond to a reverse DNS style name string for the advertised service.

In certain examples of methods, systems, devices, and / or non-transitory computer readable media, each of the compressed desired attributes and the compressed advertised attributes may correspond to individual elements of one or more service names, The one or more service names may be reverse domain name system (DNS) style name strings.

In certain instances, a method, system, apparatus, and / or non-volatile computer-readable medium may also include steps, means, and / or methods for specifying criteria for comparing compressed and advertised attributes with compressed desired attributes And may include instructions executable by the processor.

In some examples of methods, systems, devices, and / or non-transitory computer readable media, at least one of the compressed first representation or the compressed second representation may comprise at least one wildcard attribute.

In some examples of methods, systems, apparatus, and / or non-transitory computer readable media, at least one of the compressed first representation or the compressed second representation may comprise a compressed size indicator.

In certain examples of methods, systems, apparatus, and / or non-volatile computer readable media, at least one of the compressed first representation or the compressed second representation may comprise a compression algorithm indicator.

In some examples of methods, systems, apparatus, and / or non-transitory computer readable media, at least one of the compressed first representation or the compressed second representation includes an end-of-expression indicator It is possible.

In some examples of methods, systems, devices, and / or non-transitory computer readable media, at least one of the compressed first representation or the compressed second representation may include attributes compressed with at least two compression algorithms have.

Further scope of applicability of the described methods and apparatus will become apparent from the following detailed description, claims and drawings. The details and specific examples, changes and modifications within the spirit and scope of the present disclosure will be apparent to those of ordinary skill in the art and are therefore given by way of example only.

A further understanding of the nature and advantages of the present invention may be realized by reference to the following drawings. In the accompanying drawings, similar components or features may have the same reference label. In addition, several components of the same type may be distinguished by a dash that identifies similar components and subsequent to the reference label by a second label. If only a first reference label is used in the specification, the detailed description is applicable to any of the similar components having the same first reference label regardless of the second reference label.
1A and 1B illustrate a wireless communication system (s) in accordance with various embodiments.
2 shows a block diagram of a device configured to operate in a wireless communication system according to various embodiments.
3 shows a block diagram of a device configured to operate in a wireless communication system in accordance with various embodiments.
4 illustrates a block diagram of a device configured to operate in a wireless communication network in accordance with various embodiments.
5 illustrates a call flow diagram of devices operating in a wireless communication system in accordance with various embodiments.
6 shows a flow diagram of a method of wireless communication in accordance with various embodiments.
7 shows a flow diagram of a method of wireless communication in accordance with various embodiments.
8 shows a flow diagram of a method of wireless communication in accordance with various embodiments.
9 shows a flow diagram of a method of wireless communication in accordance with various embodiments.

Systems, methods, and apparatus that may permit partial matching of published services or service names are described. The techniques described may use compression techniques such as hashing, and the partial matching techniques described herein may be referred to as hash partial matching. For example, the individual elements of the service name string may be compressed or hashed into fixed size chunks (e.g., 8, 12, or 16 bits), and the compressed elements may be concatenated to form a string of hashes .

In some examples, such as those using reverse DNS style naming, the words or words between each dot in the string may be hashed separately. The size of the hash string may be equal to the number of words in the service name string multiplied by the size of each individual hash. For example, "com.mycompany.myservice.mydevice" may have a hash string of 4 * (hash_size). This may allow partial matching of the hash string in a manner similar to matching the entire service string.

In some cases, a problem may arise if the length of the published name string exceeds the size of the data that can be transmitted over a particular discovery medium (e.g., 16 bytes for LTE-Direct). Hashing the entire string while allowing the name string to be transmitted may not allow partial matching. Hashing each individual element of the string, which may also be referred to as an attribute, may allow partial matching, however. Moreover, the chance of a false positive match decreases as the size of individual hashes and the number of words in the service name string increase.

Accordingly, the following description provides examples and is not a limitation on the scope, applicability, or configuration set forth in the claims. Changes may be made in the function and arrangement of the elements discussed without departing from the spirit and scope of the disclosure. Various embodiments may omit, replace, or add to the various procedures or components as appropriate. For example, the described methods may be performed in a different order than described, and the various steps may be added, omitted, or combined. In addition, the features described with respect to certain embodiments may be combined in other embodiments.

Referring first to FIG. 1A, FIG. 1A illustrates a wireless communication system 100 in accordance with various embodiments. The system 100 includes devices 115 within a region 120. Devices 115 may be referred to as user equipment or UE 115. The devices 115 may be computers, cellular phones, smart phones, tablets, laptop computers, notebook computers, netbook computers, PDAs, smart TVs, or other similar electronic devices. In some cases, the device 115 is a WLAN or WPAN router, a group owner, or an access point. The devices 115 may broadcast or otherwise transmit signals indicative of the particular service provided by each device 115. For example, In some cases, the devices 115 broadcast a signal indicating a service available at a location close to each device 115.

Next, FIG. 1B illustrates a wireless communication system 100-a in accordance with various embodiments. System 100-a may be an example of system 100. System 100-a may include devices 115, which may be examples of devices 115 described with reference to FIG. 1A. Devices 115 may be in region 120-a, which may be an example of region 120 in Fig. 1a.

A user of device 115-a may, for example, search for a particular service. Device 115-a may be a smartphone; The user may also use the application of the smartphone to enter a name to indicate the service to the device 115-a. For example, an application may include a user interface that may prompt the user to enter details of a desired service having multiple levels of specificity. In some cases, the user only enters a general description of the desired service, such as "restaurant" or "print ". In other scenarios, the user may be much more specific, for example by entering a particular cooking-type, price range, and the rating of the desired restaurant. These various details may be referred to as properties; When they are associated with the desired service, they may be referred to as desired attributes.

The device 115-a may accept input of a representation comprising one or more desired attributes, and may recognize or otherwise identify the representation. Because the desired attributes may be represented, for example, in word form, they may be referred to as desired attributes that are not compressed. For example, "casual restaurant", "green dry cleaner", "color printer", and "high-definition display" are examples of desired properties that are not compressed. An uncompressed representation may include a number of related uncompressed attributes. For example, an uncompressed representation could be a reverse DNS style name associated with a casual Italian restaurant called Giacomo's Pizza: "restaurant.casualdining.italian.giacomospizza".

The device 115-a may compress each of the desired attributes with a hash algorithm, for example. In some embodiments, an SHA-1 or MD5 hash algorithm is used. In other embodiments, multiple hash algorithms are used. One of ordinary skill in the art will recognize that any number of hash algorithms may be employed to compress the desired attributes. Device 115-a may generate a compressed representation that includes one or more of the compressed desired attributes. In some embodiments, the compressed representation is a concatenated string of hashed desired attributes. The compressed representation may thus be a hashed version of the reverse DNS style name string for the desired service, and each of the compressed desired attributes may include individual elements of the reverse DNS style name string (e.g., each word between dots ).

Other devices 115, such as device 115-b, may broadcast signals 125 that represent compressed representations including compressed advertised attributes. These broadcasted compressed representations may be, for example, concatenated strings of hashed advertised attributes. Similar to the compressed desired attributes, the compressed (e.g., hashed) advertised attributes may correspond to the words in the service name; The compressed representation of advertised properties may be broadcast from a device that provides a particular service or that is associated with a particular service. For example, the advertised service name may be associated with a particular business and / or service provided by a particular device. In some embodiments, the broadcasted compressed representation (s) corresponds to a reverse DNS style name string for the advertised service. In such cases, the compressed advertised attributes correspond to the individual elements of one or more service names.

Device 115-a may receive a compressed representation that includes compressed advertised attributes. By way of example, a compressed representation broadcast from device 115-b may correspond to a reverse DNS style name associated with a casual Mexican restaurant called Diego's Tacos: "restaurant.casualdining.mexican.diegotacos" . The broadcasted compressed representation may be a hashed version of the reverse DNS style name. Upon receiving the broadcasted compressed representation, device 115-a may compare the compressed advertised attributes with the compressed desired attributes. This may include comparing each of the attributes according to their representative specificity level. For example, if the generated compressed representation corresponds to "restaurant.casualdining.italian.giacomospizza" and the broadcasted compressed representation corresponds to "restaurant.casualdining.mexican.diegostacos", then the minimum specific And the best specific attributes correspond respectively to "giacomospizza" and "diegostacos ".

Device 115-a may then determine whether there is a match between the compressed desired attributes and the compressed advertised attributes. In this example, device 115-a may be referred to as a matching device. Whether a match exists may be a function of a specified criterion for comparing attributes. The user interface of device 115-a may allow the user to specify one or more criteria to compare the compressed advertised attributes with the desired attributes that have been compressed. Alternatively, the device 115-a may automatically specify such criteria.

In some embodiments, a partial matching criterion may be specified. For example, the user may indicate that she wants to find a casual restaurant. Device 115-a may generate a compressed representation with compressed desired attributes corresponding to, for example, " restaurant.casualdining ". Device 115-a may receive a compressed representation having compressed advertised attributes corresponding to "restaurant.casualdining.mexican.diegostacos". In such an example, device 115-a may recognize a partial match because the received compressed representation advertises a casual restaurant-that is, a casual Mexican restaurant called Diego Stacos. Device 115-a may select a received representation to determine additional information for, for example, the advertised service, based on determining a partial match between the generated representation and the received representation.

Comparing the received representation to the generated representation, as opposed to comparing the received compressed representation to, for example, a table or database, allows for greater user-specificity. That is, the generated representation may represent any desired attributes of the user that are limited only by the particular application. However, lookup tables or databases may provide less flexibility.

In some cases, the device 115-a may use the received representation to determine a location that may be the location of the advertised service by the received compressed representation. For example, the received compressed representation may include attributes corresponding to physical locations. Alternatively, after selecting the received representation, the device 115-a may attempt to obtain additional information (e.g., coordinates or location information) from the device 115 associated with the advertised service.

In some embodiments, the compressed representation includes one or more wildcard attributes. For example, a user of device 115-c may pursue a large-format, color print service. The desired service may be a function or business service provided by a particular device-for example, the user may be in an office environment and looking for a printer, or she may be looking for a commercial printing business in a business park have. In any scenario, the user may not have any particular preferences regarding the printing technique and / or the waiting time, for example. The device 115-c may generate a compressed representation with one or more compressed desired attributes, which may be respective hashed elements of the reverse DNS style name string "printing.largeformat. *. Color ". In this example, "*" represents a wildcard value that may correspond to an attribute used to specify a printing technique (e.g., inkjet or laserjet). The wildcard value may thus allow for more possible matches.

The device 115-c may receive a compressed representation having one or more compressed advertised attributes from the device 115-d (e.g., via the broadcasted signal 125). The compressed representation is a reverse DNS style name that may be advertised properties for a while-you-wait, large-format, color, laserjet printing in a business called Jim's Print Shop It may also represent the string "prinint.largeformat.lasejet.color.whileyouwait.jimsprintshop". The device 115-c may compare the generated representation with the received representation and determine that a partial match (or a complete match) exists. Because the generated representation, in that example, employs a wildcard value for the printer technology, the device 115-c may determine that a complete match exists. Because the user has specified a wildcard value instead of a desired printing technique, any printing technique (e.g., laserjet) may constitute a match.

In various embodiments, the compressed representations may include additional elements to be used by the matching device 115 and / or compressed attributes. For example, the compressed representation may include a compressed size indicator. The compressed size indicator may be a compressed attribute or some other element that informs the device 115 that it matches one or more compressed attributes, or the number of bits used in the representation as a whole. In some cases, the compressed representation includes a compression algorithm indicator - e.g., encoded in a compression algorithm indicator. The compression algorithm indicator may be one or more bits that indicate to the device 115 that it matches the type (s) of algorithms used in compressing the attributes of the expression and / or generating (e.g., cascading) the representation. Additionally or alternatively, the compressed representation may include a termination of the representation that may notify the device 115 that matches the location where the end of the representation is present so that the matching device 115 may recognize that it received the complete representation and an end-of-expression indicator. The end-of-expression indicator may be, for example, one or more bits that the matching device 115 recognizes as an indication that a complete representation has been received.

Next, FIG. 2 illustrates a block diagram 200 of a device 115-e configured to operate in a wireless communication system in accordance with various embodiments. The device 115-e may be an example of the devices 115 described with reference to Figs. 1A and / or 1B, or may include aspects thereof, or one or more of them. The device 115-e may be a means for performing the functions described with reference to the device 115, for example. The device 115-e may include a receiver module 210, a controller module 220, and / or a transmitter module 230. Each of the modules may communicate with each other. In some embodiments, at least one of the modules is a processor.

Controller module 220 may be configured to identify an uncompressed representation comprised of one or more uncompressed desired attributes. Controller module 220 may be configured to compress desired attributes and to generate a compressed representation having compressed desired attributes. The controller module 220 may also compare the generated representation with other compressed representations that may be received by the receiver module 210. For example, the controller module 220 may compare the generated representation with a received representation comprised of one or more compressed advertised attributes that may correspond to services advertised by different devices 115.

In some embodiments, the controller module 220 is also configured to determine whether the generated and received compressed representations include matching attributes. For example, the controller module 220 may determine whether one or more of the compressed advertised attributes match, in whole or in part, with one or more of the desired attributes that have been compressed.

In some embodiments, the transmitter module 230 is configured to transmit the generated representation. For example, if device 115-e is configured to advertise a service, transmitter module 230 may transmit (e.g., broadcast) a signal indicative of a compressed representation corresponding to the advertised service .

The components of device 115-e may be implemented with one or more ASICs configured to perform some or all of the functions that are separately or collectively applied in hardware. Alternatively, the functions may be performed by one or more other processing units (or cores) on one or more integrated circuits. Other types of integrated circuits may be used (e.g., structured / platform ASICs, FPGAs, and other semi-custom ICs) that may be programmed in any manner known in the art . The functions of each unit may also be implemented with instructions stored in memory, formatted to be executed, in whole or in part, by one or more general purpose or application specific processors.

FIG. 3 shows a block diagram 300 of a device 115-f configured to operate in a wireless communication system in accordance with various embodiments. The device 115-f may be an example of the devices 115 described with reference to Figs. 1A, 1B, and / or 2, or may include aspects of the devices, one or more of the devices. The device 115-f may include means for performing the functions described with reference to the devices 115. [ For example, the device 115-f may include a receiver module 210-a, a controller module 220-a, and / or a transmitter module 230-a, Or perform functions similar to those of the devices described herein.

The controller module 220-a may include a presentation module 305 and / or a comparison module 310. In some embodiments, the presentation module 305 includes an identification module 315, an attribute compression module 320, and / or a generation module 325. The identification module 315 may be configured to identify an uncompressed representation - e.g., a reverse DNS style name string composed of desired attributes that are not compressed. Attribute compression module 320 may be configured to compress a desired attribute using, for example, one or more hash algorithms. The generating module 325 may be configured to generate a compressed representation composed of the desired attributes that have been compressed. In some cases, the creation module 325 chains the desired attributes that are compressed to form a string of hashes. Additionally or alternatively, the generating module 325 generates a compressed representation having one or more of a wildcard attribute, a compressed size indicator, or an end-of-expression indicator.

In some embodiments, the comparison module 310 includes a decision module 330, a selection module 335, and / or a location module 340. The determination module 330 may be configured to compare the compressed representation generated by the generation module 325 with the received compressed representation-the compressed representation received by the receiver module 210, for example. In some embodiments, the determination module 330 is configured to recognize criteria for comparing the generated and received compressed representations, or user-specified criteria for comparing the same. The decision module 330 may also be configured to determine whether the attributes of the received compressed representation match the compressed representation that is generated in part as a whole. In some cases, the selection module 335 is configured to select the received compressed representation when it is determined that there is a match (e.g., a partial match). Additionally or alternatively, the location module 340 may be configured to determine the location of the advertised service, or the location of the device advertising the service, based on the received compressed representation.

Each of the modules of device 115-f may communicate with each other. In some embodiments, one or more of the modules of device 115-f are processors. Moreover, the various components of device 115-f may be implemented with one or more ASICs configured to perform some or all of the functions that are separately or collectively implemented in hardware. Alternatively, the functions may be performed by one or more other processing units (or cores) on one or more integrated circuits. Other types of integrated circuits may be used (e.g., structured / platform ASICs, FPGAs, and other semi-custom ICs) that may be programmed in any manner known in the art . The functions of each unit may also be implemented with instructions stored in memory, formatted to be executed, in whole or in part, by one or more general purpose or application specific processors.

Referring now to Fig. 4, a block diagram 400 of a device 115-g configured to operate in a wireless communication network in accordance with various embodiments is shown. G., Laptop computers, netbook computers, tablet computers, etc.), cellular phones, PDAs, smartphones, digital < May also be aspects of larger devices such as video recorders (DVRs), Internet appliances, gaming consoles, e-readers, printers, scanners, copiers, ATMs, automated information kiosks, have. The device 115-g may have an internal power supply (not shown) such as a small battery to facilitate the move operation. In some embodiments, the mobile device 115-g may be, or may include, aspects of the devices 115 described with reference to Figs. 1A, 1B, 2, and / or 3.

Mobile device 115-g may include components for two-way voice and data communications, typically including components that transmit communications and components that receive communications. Mobile device 115-g may include antenna (s) 405, a transmitter (e.g., a modulator), a plurality of antennas, and the like, each of which may directly or indirectly communicate with each other (e.g., via one or more busses 490) A memory 480 that includes a module 410, a receiver (e.g., demodulator) module 415, a processor module 470, and software (SW) 485. Transmitter module 410 and receiver module 415 may be implemented in a transceiver module and may be coupled to one or more separate devices and antenna (s) 405 and / or one or more wired or wireless links Lt; RTI ID = 0.0 > bi-directionally < / RTI > The transmitter module 410 and the receiver module 415 are configured to modulate the packets and provide the modulated packets to the antenna (s) 405 for transmission and to demodulate the packets received from the antenna (s) It may be a modem or a modem. Although the device 115-g may include a single antenna 405, the mobile device 115-g may include a plurality of antennas 405 capable of transmitting and / or receiving multiple radio transmissions simultaneously. . The transmitter module 410 and the receiver module 415 may also be capable of simultaneously communicating with a plurality of devices 115.

The memory 480 may include a random access memory (RAM) and a read only memory (ROM). The memory 480, when executed, may cause the processor module 470 to perform various functions described herein (e.g., to evaluate signal measurements, determine whether a difference specification exceeds a threshold, enable an override threshold Computer-readable, computer-executable software / firmware code 485 that includes instructions configured to cause the computer to perform various functions (e.g., Alternatively, the software / firmware code 485 may not be directly executable by the processor module 470, but may be configured (e.g., compiled and executed) to allow the computer to perform the functions described herein . Processor module 470 may include an intelligent hardware device, such as a central processing unit (CPU), a microcontroller, an application specific integrated circuit (ASIC), or the like.

According to the architecture of Fig. 4, the device 115-g may be a presentation module 305-a that may be substantially identical to the corresponding module (s) of the devices 115 of Figs. 2 and / Or a comparison module 310-a. In some embodiments, presentation module 305-a is configured to perform the functions of identification module 315, attribute compression module 320, and / or creation module 325 described with reference to FIG. And in some cases, the comparison module 310-a is configured to perform one or more of the functions of the decision module 330, the selection module 335, and the location module 340.

By way of example, the presentation module 305-a and the comparison module 310-a are the components of the device 115-g, and they can communicate with other (e.g., via the bus 490) Communicates with the components. Alternatively, the functionality of the presentation module 305-a and the comparison module 310-a may be implemented as one or more of the other modules of the device 115-g, such as the processor module 470. [ In some embodiments, the functionality of the presentation module 305-a and / or the comparison module 310-a is implemented as code stored on non-transitory computer readable media.

Next, FIG. 5 illustrates a call flow diagram 500 of devices 115 operating in a wireless communication system in accordance with various embodiments. The devices 115 may be, or may include, aspects of the devices 115 described with reference to FIGS. 1A, 1B, 2, 3, and / or 4. The first device 115-h may identify 505 an uncompressed first representation that may consist of one or more uncompressed attributes. The first representation may correspond to a string of desired attributes, for example. The first device 115-h may then compress (510) the attributes of the first representation and generate a compressed first representation of these compressed attributes (515).

Independently, and in some cases, concurrently, the second device 115-i may identify (520) an uncompressed second representation that may consist of one or more uncompressed attributes. The second representation may correspond to a string of advertised attributes. The second device 115-i may then compress (525) the attributes of the second representation and generate a compressed second representation of these compressed attributes (530). The second device 115-i may broadcast the compressed second representation (535).

The first device 115-h may receive the compressed second representation (535). The first device 115-h may then compare the attributes of the generated compressed first representation with the attributes of the received compressed second representation (540). In some cases, based on user-specified criteria for comparison, the first device 115-h may determine whether there is an exact or partial match between the attributes of the compressed first and second representations (545). If the first device determines that at least a partial match exists, it may select the second representation (550).

FIG. 6 shows a flow diagram of a method 600 of wireless communication, according to various embodiments. The method 600 may be implemented by one or more of the devices 115 of FIGS. 1A, 1B, 2, 3, 4, and / or 5.

At block 605, the method may include generating a compressed first representation that includes one or more compressed desired attributes. The operations of block 605 may be performed by the controller module 220 of Figures 2 and / or 3, the representation module 305 of Figure 3 and / or Figure 4, and the generation module 325 of Figure 3 in various embodiments. Lt; / RTI >

In some embodiments, the compressed first representation corresponds to a reverse DNS style name string for the desired service. Additionally or alternatively, each of the compressed desired attributes may correspond to individual elements of one or more service names. The compressed first representation may also include at least one wildcard attribute. In some cases, the compressed first representation may further include at least one of a compressed size indicator, a compression algorithm indicator, and an end indicator of the representation. The compressed first representation may also include attributes compressed with at least two compression algorithms.

At block 610, the method may include receiving a compressed second representation comprising one or more compressed advertised attributes. The operations of block 610 may be performed by receiver module 210 of FIGS. 2 and 3 and / or by antennas 405 and receiver module 415 of FIG.

In some embodiments, the compressed second representation corresponds to a reverse DNS style name string for the advertised service. Additionally or alternatively, each of the compressed advertised attributes may correspond to individual elements of one or more service names. The compressed second representation may also include at least one wildcard attribute. In some cases, the compressed second representation also includes at least one of a compressed size indicator, a compression algorithm indicator, and an indication of the end of the representation. The compressed second representation may include attributes compressed with at least two compression algorithms.

At block 615, the method may involve comparing the compressed advertised attributes with the compressed desired attributes. The operations of block 615 may be performed by controller module 220 of Figures 2 and / or 3, comparison module 310 of Figure 3 and / or Figure 4 and / or decision module 330 of Figure 3 have.

At block 620, the method may include determining if at least one of the compressed desired attributes is at least a partial match with at least one of the compressed advertised attributes. The operations of block 620 may include, in various embodiments, the controller module 220 of Figures 2 and / or 3, the comparison module 310 of Figure 3 and / or Figure 4 and / or the determination module 330 of Figure 3 ).

Next, FIG. 7 shows a flow diagram of a method 700 of wireless communication, according to various embodiments. The method 700 may be an example of the method 600 and it may be implemented by one or more of the devices 115 of FIGS. 1A, 1B, 2, 3, 4 and / or 5.

At block 705, the method may include generating a compressed first representation that includes one or more compressed desired attributes. The operations of block 705 are similar to those of controller module 220 of FIG. 2 and / or FIG. 3, representation module 305 of FIG. 3 and / or FIG. 4, and generation module 325 of FIG. 3 in various embodiments Lt; / RTI >

At block 710, the method may include receiving a compressed second representation comprising one or more compressed advertised attributes. The operations of block 710 may be performed by receiver module 210 of FIG. 2 and / or FIG. 3, and / or by antennas 405 and receiver module 415 of FIG.

At block 715, the method may involve comparing the compressed desired properties to the compressed advertised attributes. The operations of block 715 may also be performed by the controller module 220 of Figures 2 and / or 3, the comparison module 310 of Figure 3 and / or Figure 4 and / or the decision module 330 of Figure 3 have.

At block 720, if the desired compressed attributes are not a partial match with the compressed advertised attributes, the method may include repeating one or more of the preceding steps. If the compressed desired attributes and the compressed advertised attributes constitute at least a partial match, the method may include the operations of blocks 725 and 730. [

At block 725, the method may include selecting a compressed second representation. The operations of block 725 may also be performed by controller module 220 of FIG. 2 and / or FIG. 3, comparison module 310 of FIG. 3 and / or FIG. 4 and / or selection module 335 of FIG. have.

At block 730, the method may further comprise determining a location based at least in part on the compressed second representation. The operations of block 730 may include, in various embodiments, the controller module 220 of Figures 2 and / or 3, the comparison module 310 of Figures 3 and / or 4 and / or the location module 340 of Figure 3 ). In some embodiments, determining the location includes determining a location of the advertised service by the compressed second representation.

Next, FIG. 8 shows a flow diagram of a method 800 of wireless communication, according to various embodiments. Method 800 may be an example of method 600 and / or 700, which may be implemented by one or more of the devices 115 of FIGS. 1A, 1B, 2, 3, 4 and / .

At block 805, the method may involve identifying an uncompressed first representation comprised of one or more uncompressed desired attributes. The operations of block 805 may include, in various embodiments, the controller module 220 of Figures 2 and / or 3, the presentation module 305 of Figures 3 and / or 4, and / or the identification module 315 ).

At block 810, the method may include compressing each of the one or more uncompressed desired attributes. The operations of block 810 may be performed by the controller module 220 of Figures 2 and / or 3, the presentation module 305 of Figure 3 and / or Figure 4 and / or the attribute compression module 320 of Figure 3 It is possible.

At block 815, the method may include generating a compressed first representation that includes one or more of the compressed desired attributes. The operations of block 815 may be performed by the controller module 220 of Figures 2 and / or 3, the presentation module 305 of Figure 3 and / or Figure 4 and / or the generation module 325 of Figure 3 in various embodiments. Lt; / RTI >

At block 820, the method may include receiving a compressed second representation comprising one or more compressed advertised attributes. The operations of block 820 may be performed by receiver module 210 of FIG. 2 and / or FIG. 3, and / or by antennas 405 and receiver module 415 of FIG.

At block 825, the method may involve comparing the compressed advertised attributes to the compressed desired attributes. The operations of block 825 may be performed by controller module 220 of FIG. 2 and / or FIG. 3, comparison module 310 of FIG. 3 and / or FIG. 4 and / or decision module 330 of FIG. 3 have.

At block 830, the method may include determining whether at least one of the compressed desired attributes is at least a partial match with at least one of the compressed advertised attributes. The operations of block 830 may be performed by controller module 220 of Figures 2 and / or 3, comparison module 310 of Figure 3 and / or Figure 4 and decision module 330 of Figure 3 in various embodiments .

FIG. 9 illustrates a flow diagram of a method 900 of wireless communication, according to various embodiments. The method 900 may be an example of methods 600, 700 and / or 800, which may be performed on one or more of the devices 115 of FIGS. 1A, 1B, 2, 3, 4 and / ≪ / RTI >

At block 905, the method may include generating a compressed first representation that includes one or more compressed desired attributes. The operations of block 905 may be performed by the controller module 220 of Figures 2 and / or 3, the presentation module 305 of Figure 3 and / or Figure 4 and / or the generation module 325 of Figure 3 in various embodiments. Lt; / RTI >

At block 910, the method may include receiving a compressed second representation comprising one or more compressed advertised attributes. The operations of block 910 may be performed by receiver module 210 of FIG. 2 and / or FIG. 3, and / or by antennas 405 and receiver module 415 of FIG.

At block 915, the method may also involve specifying criteria to compare the compressed advertised attributes with the compressed desired attributes. The operations of block 915 may be performed by controller module 220 of Figures 2 and / or 3, comparison module 310 of Figure 3 and / or Figure 4 and / or decision module 330 of Figure 3 have.

At block 920, the method may involve comparing the compressed advertised attributes with the compressed desired attributes, based on the specified criteria. The operations of block 920 may be performed by controller module 220 of Figures 2 and / or 3, comparison module 310 of Figure 3 and / or Figure 4 and / or decision module 330 of Figure 3 have.

At block 925, the method may include determining whether at least one of the compressed desired attributes is at least a partial match with at least one of the compressed advertised attributes. The operations of block 925 are performed by controller module 220 of FIGS. 2 and / or 3, comparison module 310 of FIG. 3 and / or FIG. 4 and / or decision module 330 of FIG.

Those skilled in the art will recognize that the methods 600, 700, 800, and 900 are exemplary implementations of the tools and techniques described herein. The methods may be performed with more or fewer steps; They may be performed in an order other than that shown.

The techniques described above may be used for various wireless communication systems, such as CDMA, TDMA, FDMA, OFDMA, SC-FDMA, and other systems. The terms "system" and "network" are often used interchangeably. CDMA systems may implement wireless technologies such as CDMA2000, Universal Terrestrial Radio Access (UTRA), and the like. CDMA2000 covers IS-2000, IS-95, and IS-856 standards. IS-2000 releases 0 and A are typically referred to as CDMA2000 1X, 1X, and the like. IS-856 (TIA-856) is commonly referred to as CDAM 2000 1xEV-DO, High Speed Packet Data (HRPD), and the like. UTRA includes wideband CDMA (WCDMA) and other variants of CDMA. The TDMA system may implement a radio technology such as Global System for Mobile Communications (GSM). OFDMA systems may implement wireless technologies such as UMB (Ultra Mobile Broadband), Evolved UTRA (E-UTRA), IEEE 802.11 (WiFi), IEEE 802.16 (WiMAX), IEEE 802.20, and Flash-OFDM. UTRA and E-UTRA are part of the Universal Mobile Telecommunication System (UMTS). 3GPP Long Term Evolution (LTE) and LTE-Advanced (LTE-A) are new releases of UMTS using E-UTRA. UTRA, E-UTRA, UMTS, LTE, LTE-A, and GSM are described in documents from a device named "Third Generation Partnership Project" (3GPP). CDMA2000 and UMB are described in documents from an organization named "3rd Generation Partnership Project 2" (3GPP2).

The techniques described herein may be used for other systems and wireless technologies as well as the above-mentioned systems and wireless technologies. For example, the techniques may refer to a network based on protocols described in various IEEE 802.11 standards (e.g., IEEE 802.11a / g, 802.11n, 802.11 ac, 801.11 ad, 802.11 models, etc.) Or may be implemented in a wireless local area network (WLAN) or a Wi-Fi network. Additionally or alternatively, the techniques may be employed in a wireless personal area network (WPAN) such as a Bluetooth network, a network employing the IEEE 802.15 family of standards. In some embodiments, Wi-Fi Direct (e.g., WFDS ASP), Universal Plug and Play (UPnP), and / or IEEE 802.11 ad (WiGig) protocols may be employed. However, in many of the above detailed descriptions, LTE terminology is used, but the techniques are applicable beyond LTE applications.

The detailed description set forth above in conjunction with the appended drawings describes exemplary embodiments and does not represent the only embodiments that may be or may be practiced within the scope of the claims. The detailed description includes specific details for the purpose of providing an understanding of the techniques described. These techniques, however, may also be practiced without these specific details. In some instances, well-known structures and devices are shown in block diagram form in order to avoid obscuring the concepts of the described embodiments.

The information and signals may be represented using any of a variety of different techniques and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may refer to voltages, currents, electromagnetic waves, , Optical fields or particles, or a combination thereof.

The various illustrative blocks and modules described in connection with the disclosure herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, , Discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but, in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

The functions described herein may be implemented in hardware, software executed by a processor, firmware, or any combination thereof. When implemented in software executed by a processor, the functions may be stored or transmitted as one or more instructions or code on a computer-readable medium. Other examples and implementations are within the scope and spirit of the present disclosure and appended claims. For example, due to the nature of the software, the functions described above may be implemented using software, hardware, firmware, hardwiring, or any combination thereof executed by the processor. Features that implement functions may also be physically located at various locations, including that portions of the functions are distributed such that they are implemented in different physical locations. Also, as used herein, the inclusion of "or" as used in the list of items followed by "at least one of" in the claims refers to, for example, a list of "at least one of A, B, Quot; A " refers to A or B or C or AB or AC or BC or ABC (i.e., A and B and C).

Computer-readable media includes computer storage media and communication media including any medium that facilitates the transfer of computer programs from one place to another. The storage medium may be any available media that can be accessed by a general purpose or special purpose computer. By way of non-limiting example, a computer-readable medium may be embodied as a computer readable medium, such as RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or a general purpose or special purpose computer, And any other medium that can be used to carry or store desired program code means in the form of instructions or data structures. Also, the connection is appropriately referred to as a computer-readable medium. For example, if the software is transmitted from a web site, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio and microwave , Coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of the medium. Disks and discs as used herein include compact discs (CD), laser discs, optical discs, digital versatile discs (DVD), floppy discs and Blu- Discs usually reproduce data magnetically, while discs reproduce data optically as lasers. Combinations of the above are also included within the scope of computer readable media.

The foregoing description of the disclosure is provided to enable any person skilled in the art to make or use the disclosure. Various modifications to the disclosure will be readily apparent to those of ordinary skill in the art, and the generic principles defined herein may be applied to other variations without departing from the spirit or scope of the disclosure. Throughout this disclosure, the term "exemplary" or "exemplary " indicates an example or illustration and does not imply or suggest any preference for the mentioned examples. Accordingly, the present disclosure should not be limited to the examples and designs described herein, but should be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (30)

A method of wireless communication,
Generating a compressed first representation comprising one or more compressed desired attributes;
Receiving a compressed second representation comprising one or more compressed advertised attributes;
Comparing the compressed desired attributes with the compressed advertised attributes; And
And determining whether at least one of the compressed desired attributes includes at least a partial match with at least one of the compressed advertised attributes. The method according to claim 1,
And selecting the compressed second representation if one of the compressed desired attributes includes at least a partial match with at least one of the compressed advertised attributes. 3. The method of claim 2,
And determining a location based at least in part on the compressed second representation. The method of claim 3,
Wherein the determining the location comprises determining a location of the advertised service by the compressed second representation. The method according to claim 1,
Identifying an uncompressed first representation comprising one or more uncompressed desired attributes; And
And compressing each of the one or more uncompressed desired attributes. The method according to claim 1,
Wherein the compressed first representation corresponds to a reverse domain name system (DNS) style name string for the desired service,
Wherein the compressed second representation corresponds to a reverse DNS style name string for the advertised service. The method according to claim 1,
Wherein each of said compressed desired attributes and said compressed advertised attributes corresponds to respective elements of one or more service names,
Wherein the one or more service names include reverse domain name system (DNS) style name strings. The method according to claim 1,
Further comprising specifying a criterion for comparing the compressed advertised attributes with the compressed desired attributes. The method according to claim 1,
Wherein at least one of the compressed first representation or the compressed second representation comprises:
And further comprising at least one wildcard attribute. The method according to claim 1,
Wherein at least one of the compressed first representation or the compressed second representation comprises:
A method of wireless communication, further comprising a compressed size indicator. The method according to claim 1,
Wherein at least one of the compressed first representation or the compressed second representation comprises:
Further comprising a compression algorithm indicator. The method according to claim 1,
Wherein at least one of the compressed first representation or the compressed second representation comprises:
A method of wireless communication, the method further comprising an end-of-expression indicator. The method according to claim 1,
Wherein at least one of the compressed first representation or the compressed second representation comprises:
Lt; / RTI > further comprising compressed attributes with at least two compression algorithms. A system for wireless communication,
Means for generating a compressed first representation comprising one or more compressed desired attributes;
Means for receiving a compressed second representation comprising one or more compressed advertised attributes;
Means for comparing the compressed advertised attributes with the compressed desired attributes; And
And means for determining whether at least one of the compressed desired attributes includes at least a partial match with at least one of the compressed advertised attributes. 15. The method of claim 14,
And means for selecting the compressed second representation if one of the compressed desired attributes includes at least a partial match with at least one of the compressed advertised attributes. 16. The method of claim 15,
And means for determining a location based at least in part on the compressed second representation. 15. The method of claim 14,
Means for identifying an uncompressed first representation comprising one or more uncompressed desired attributes; And
Further comprising means for compressing each of the one or more uncompressed desired attributes. 15. The method of claim 14,
Wherein the compressed first representation corresponds to a reverse domain name system (DNS) style name string for the desired service,
Wherein the compressed second representation corresponds to a reverse DNS style name string for the advertised service. 15. The method of claim 14,
Wherein each of said compressed desired attributes and said compressed advertised attributes corresponds to respective elements of one or more service names,
Wherein the one or more service names include reverse domain name system (DNS) style name strings. 15. The method of claim 14,
Further comprising means for specifying criteria for comparing the compressed advertised attributes with the compressed desired attributes. An apparatus for wireless communication,
A processor;
A memory in electronic communication with the processor; And
Instructions stored in the memory,
The instructions include:
Generate a compressed first representation comprising one or more compressed desired attributes;
Receiving a compressed second representation comprising one or more compressed advertised attributes;
Compare the compressed desired attributes with the compressed advertised attributes; And
To determine whether at least one of the compressed desired attributes includes at least a partial match with at least one of the compressed advertised attributes
Wherein the processor is executable by the processor. 22. The method of claim 21,
The instructions include:
And to select the compressed second representation if one of the compressed desired attributes includes at least a partial match with at least one of the compressed advertised attributes. 23. The method of claim 22,
The instructions include:
And to determine a location based at least in part on the compressed second representation. 22. The method of claim 21,
The instructions include:
Identify an uncompressed first representation comprising one or more uncompressed desired attributes; And
To compress each of the one or more uncompressed desired attributes
Wherein the processor is executable by the processor. 22. The method of claim 21,
The instructions include:
And to specify a criterion for comparing the compressed advertised attributes with the compressed desired attributes. 1. A non-transitory computer readable medium storing a code for wireless communication,
The code includes:
Generate a compressed first representation comprising one or more compressed desired attributes;
Receiving a compressed second representation comprising one or more compressed advertised attributes;
Compare the compressed desired attributes with the compressed advertised attributes; And
To determine whether at least one of the compressed desired attributes includes at least a partial match with at least one of the compressed advertised attributes
Executable instructions. ≪ Desc / Clms Page number 13 > 27. The method of claim 26,
The instructions include:
And select the compressed second representation if one of the compressed desired attributes includes at least a partial match with at least one of the compressed advertised attributes. 28. The method of claim 27,
The instructions include:
And determine a location based at least in part on the compressed second representation. 27. The method of claim 26,
The instructions include:
Identify an uncompressed first representation comprising one or more uncompressed desired attributes; And
To compress each of the one or more uncompressed desired attributes
Executable, non-transitory computer readable medium. 27. The method of claim 26,
The instructions include:
And to specify a criterion for comparing the compressed advertised attributes with the compressed desired attributes.

Images