# US 8,751,576 B2 · Methods and systems for service discovery management in peer-to-peer networks > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 8,751,576 B2 - Document ID: US8751576B2 - Status: Granted - Kind: B2 - Application number: 13/274,211 - Filed: 2011-10-14 - Published: 2012-02-09 - Granted: 2014-06-10 - Earliest claimed: 2009-08-26 - Assignees: QUALCOMM Incorporated - Applicants: Oliver Michaelis; J. Rodney Walton; John W. Ketchum - Inventors: Oliver Michaelis; J. Rodney Walton; John W. Ketchum - Web page: https://patentgrep.com/patent/US8751576B2 ## CPC - H04L 65/1069: Session establishment or de-establishment - H04L 67/04: specially adapted for terminals or networks with limited capabilities; specially adapted for terminal portability - H04L 67/51: Discovery or management thereof, e.g. service location protocol [SLP] or web services - H04W 48/08: Access restriction or access information delivery, e.g. discovery data delivery (signalling during connection H04W76/00) - H04W 76/20: Manipulation of established connections - H04L 67/52: specially adapted for the location of the user terminal - H04W 4/00: Services specially adapted for wireless communication networks; Facilities therefor - H04W 48/16: Discovering, processing access restriction or access information - H04W 92/18: between terminal devices - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) ## Abstract Certain embodiments of the present disclosure relate to a method and an apparatus for managing and optimizing service discovery in a peer-to-peer (P2P) wireless network. Nodes of the P2P network advertise their capabilities to their peers in the form of services. Efficient propagation and management of node's services to other nodes is proposed in the present disclosure. ## Claims ### Claim 1 A method for wireless communications by a wireless node of a peer-to-peer (P2P) network, comprising: receiving an advertisement including a list of one or more services offered by wireless nodes of the P2P network, the list prioritizing services offered by multiple ones of the wireless nodes according to distance corresponding to a number of hops associated with each one of the multiple wireless nodes; wherein a service is dropped from the list when a number of hops exceeds a predetermined number; and identifying at least one of the wireless nodes in the P2P network that offers a service of interest from the list. ### Claim 2 (depends on 1) The method of claim 1, wherein the advertisement contains, for at least one of the services listed, an identification of one or more of the wireless nodes offering that service. ### Claim 3 (depends on 2) The method of claim 2, wherein for at least one other of the services listed, the advertisement does not contain an identification of one or more of the wireless nodes offering that service. ### Claim 4 (depends on 1) The method of claim 1, wherein identifying the at least one wireless node in the P2P network that offers the service of interest comprises: sending a query to identify the at least one wireless node that offers the service of interest. ### Claim 5 An apparatus for wireless communications by a wireless node of a peer-to-peer (P2P) network, comprising: logic for receiving an advertisement including a list of one or more services offered by wireless nodes of the P2P network, the list prioritizing services offered by multiple ones of the wireless nodes according to a distance corresponding to a number of hops associated with each one of the multiple wireless nodes; wherein a service is dropped from the list when a number of hops exceeds a predetermined number and logic for identifying at least one of the wireless nodes in the P2P network that offers a service of interest from the list. ### Claim 6 (depends on 5) The apparatus of claim 5, wherein the advertisement contains, for at least one of the services listed, an identification of one or more of the wireless nodes offering that service. ### Claim 7 (depends on 6) The apparatus of claim 6, wherein for at least one other of the services listed, the advertisement does not contain an identification of one or more of the wireless nodes offering that service. ### Claim 8 (depends on 5) The apparatus of claim 5, wherein the logic for identifying the at least one wireless node in the P2P network that offers the service of interest comprises: logic for sending a query to identify the at least one wireless node that offers the service of Interest. ### Claim 9 An apparatus for wireless communications by a wireless node of a peer-to-peer (P2P) network, comprising: means for receiving an advertisement including a list of one or more services offered by wireless nodes of the P2P network, the list prioritizing services offered by multiple ones of the wireless nodes according to a distance corresponding to a number of hops associated with each one of the multiple wireless nodes; wherein a service is dropped from the list when a number of hops exceeds a predetermined number; and means for identifying at least one of the wireless nodes in the P2P network that offers a service of interest from the list. ### Claim 10 (depends on 9) The apparatus of claim 9, wherein the advertisement contains, for at least one of the services listed, an identification of one or more of the wireless nodes offering that service. ### Claim 11 (depends on 10) The apparatus of claim 10, wherein for at least one other of the services listed, the advertisement does not contain an identification of one or more of the wireless nodes offering that service. ### Claim 12 (depends on 9) The apparatus of claim 9, wherein the means for identifying the at least one wireless node in the P2P network that offers the service of interest comprises: means for sending a query to identify the at least one wireless node that offers the service of interest. ### Claim 13 A computer-program product for wireless communications by a wireless node of a peer-to-peer (P2P) network, comprising a non-transitory computer-readable storage device having instructions stored thereon, the instructions being executable by one or more processors and the instructions comprising: instructions for receiving an advertisement including a list of one or more services offered by wireless nodes of the P2P network, the list prioritizing services offered by multiple ones of the wireless nodes according to a distance corresponding to a number of hops associated with each one of the multiple wireless nodes; wherein a service is dropped from the list when a number of hops exceeds a predetermined number and instructions for identifying at least one of the wireless nodes in the P2P network that offers a service of interest from the list. ### Claim 14 (depends on 13) The computer-program product of claim 13, wherein the advertisement contains, for at least one of the services listed, an identification of one or more of the wireless nodes offering that service. ### Claim 15 (depends on 14) The computer-program product of claim 14, wherein for at least one other of the services listed, the advertisement does not contain an identification of one or more of the wireless nodes offering that service. ### Claim 16 (depends on 13) The computer-program product of claim 13, wherein the instructions for identifying the at least one wireless node in the P2P network that offers the service of interest comprise: instructions for sending a query to identify the at least one wireless node that offers the service of interest.