CODING METHODS OF COMMUNICATING IDENTIFIERS IN PEER DISCOVERY IN A PEER-TO-PEER NETWORK

• US 20090016250A1
• Filed: 07/10/2007
• Published: 01/15/2009
• Est. Priority Date: 07/10/2007
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Tavildar, Saurabh, Richardson, Thomas, Laroia, Rajiv, Li, Junyi, Grokop, Leonard, WU, Xinzhou
• Granted Patent: US 8,520,704 B2
• Time in Patent Office: Days
• US Class Current: 370/310.100
• CPC Class Codes: H04W 28/06 Optimizing the usage of the radio link, e.g. header compression, information sizing , discarding information system modifying transmission characteristic according to link quality by modifying frame length H04L1/0007; dynamic adaptation of the packet size for flow control or congestion control H04L47/365
• CPC Class Codes: H04W 48/08 Access restriction or access information delivery, e.g. discovery data delivery signalling during connection H04W76/00
• CPC Class Codes: H04W 8/005 Discovery of network devices, e.g. terminals
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support
• CPC Class Codes: H04W 92/18 between terminal devices

Abstract

Systems and methodologies are described that facilitate identifying peers based upon encoded signals during peer discovery in a peer to peer network. For example, direct signaling that partitions a time-frequency resource into a number of segments can be utilized to communicate an identifier within a peer discovery interval; thus, a particular segment selected for transmission can signal a portion of the identifier, while a remainder can be signaled based upon tones communicated within the selected segment. Moreover, a subset of symbols within the resource can be reserved (e.g., unused) to enable identifying and/or correcting timing offset. Further, signaling can be effectuated over a plurality of peer discovery intervals such that partial identifiers communicated during each of the peer discovery intervals can be linked (e.g., based upon overlapping bits and/or bloom filter information).

Claims

1. A method that facilitates signaling an identifier over a plurality of peer discovery intervals, comprising:

transmitting a first partial identifier during a first peer discovery interval; and

transmitting a second partial identifier during a second peer discovery interval where X bits overlap within the first partial identifier and the second partial identifier, X is an integer.

2. The method of claim 1, wherein the first partial identifier and the second partial identifier each include 10 bits.

3. The method of claim 1, wherein a last X bits of the first partial identifier match a first X bits of the second partial identifier.

4. The method of claim 1, wherein X is 5.

5. The method of claim 1, wherein a linear constraint links the first partial identifier to the second partial identifier.

6. The method of claim 1, wherein the X bits that overlap enable a receiving wireless terminal to link the first partial identifier and the second partial identifier.

7. The method of claim 1, further comprising transmitting a third partial identifier during a third peer discovery interval, where X bits of the second partial identifier and third partial identifier overlap.

8. The method of claim 1, further comprising transmitting bloom filter information derived from the combination of the first partial identifier and the second partial identifier.

9. A wireless communications apparatus, comprising:

a memory that retains instructions related to transmitting a first partial identifier during a first peer discovery interval and transmitting a second partial identifier during a second peer discovery interval where X bits overlap within the first partial identifier and the second partial identifier, X is an integer; and

a processor, coupled to the memory, configured to execute the instructions retained in the memory.

10. The wireless communications apparatus of claim 9, wherein the first partial identifier and the second partial identifier each include 10 bits.

11. The wireless communications apparatus of claim 9, wherein a last X bits of the first partial identifier match a first X bits of the second partial identifier.

12. The wireless communications apparatus of claim 9, wherein a linear constraint links the first partial identifier to the second partial identifier.

13. The wireless communications apparatus of claim 9, wherein the X bits that overlap enable a receiving wireless terminal to link the first partial identifier and the second partial identifier.

14. The wireless communications apparatus of claim 9, wherein the memory further retains instructions for transmitting a third partial identifier during a third peer discovery interval, where X bits of the second partial identifier and third partial identifier overlap.

15. The wireless communications apparatus of claim 9, wherein the memory further retains instructions for transmitting bloom filter information derived from the combination of the first partial identifier and the second partial identifier.

16. A wireless communications apparatus that enables signaling an identifier over a plurality of peer discovery intervals, comprising:

means for transmitting a first partial identifier during a first peer discovery interval; and

means for transmitting a second partial identifier during a second peer discovery interval where X bits overlap within the first partial identifier and the second partial identifier, X is an integer.

17. The wireless communications apparatus of claim 16, wherein the first partial identifier and the second partial identifier each include 10 bits.

18. The wireless communications apparatus of claim 16, wherein a last X bits of the first partial identifier match a first X bits of the second partial identifier.

19. The wireless communications apparatus of claim 16, wherein a linear constraint links the first partial identifier to the second partial identifier.

20. The wireless communications apparatus of claim 16, wherein the X bits that overlap enable a receiving wireless terminal to link the first partial identifier and the second partial identifier.

21. The wireless communications apparatus of claim 16, further comprising means for transmitting a third partial identifier during a third peer discovery interval, where X bits of the second partial identifier and third partial identifier overlap.

22. The wireless communications apparatus of claim 16, further comprising means for transmitting bloom filter information derived from the combination of the first partial identifier and the second partial identifier.

23. A machine-readable medium having stored thereon machine-executable instructions for:

transmitting a first partial identifier during a first peer discovery interval; and

transmitting a second partial identifier during a second peer discovery interval where X bits overlap within the first partial identifier and the second partial identifier, X is an integer.

24. The machine-readable medium of claim 23, wherein the first partial identifier and the second partial identifier each include 10 bits.

25. The machine-readable medium of claim 23, wherein a last X bits of the first partial identifier match a first X bits of the second partial identifier.

26. The machine-readable medium of claim 23, wherein a linear constraint links the first partial identifier to the second partial identifier.

27. The machine-readable medium of claim 23, wherein the X bits that overlap enable a receiving wireless terminal to link the first partial identifier and the second partial identifier.

28. The machine-readable medium of claim 23, the machine-executable instructions further comprise transmitting a third partial identifier during a third peer discovery interval, where X bits of the second partial identifier and third partial identifier overlap.

29. The machine-readable medium of claim 23, the machine-executable instructions further comprise transmitting bloom filter information derived from the combination of the first partial identifier and the second partial identifier.

30. In a wireless communication system, an apparatus comprising:

a processor configured to;

transmit a first partial identifier during a first peer discovery interval; and

transmit a second partial identifier during a second peer discovery interval where X bits overlap within the first partial identifier and the second partial identifier, X is an integer.

31. A method that facilitates linking partial identifiers obtained during differing peer discovery intervals based upon overlapping information, comprising:

receiving a first set of partial identifiers during a first peer discovery interval;

receiving a second set of partial identifiers during a second peer discovery interval; and

matching partial identifiers from the first set and the second set based upon bit overlap.

32. The method of claim 31, wherein the first peer discovery interval and the second peer discovery interval are adjacent peer discovery intervals.

33. The method of claim 31, matching the partial identifiers further comprises evaluating a constraint applied to the partial identifiers.

34. The method of claim 33, wherein the constraint is a linear constraint.

35. The method of claim 31, further comprising linking a particular partial identifier from the first set with a corresponding partial identifier from the second set when a last X bits of the particular identifier match a first X bits of the corresponding partial identifier.

36. The method of claim 31, further comprising linking additional partial identifiers from disparate sets related to differing peer discovery intervals to form a complete identifier of a transmitting wireless terminal.

37. The method of claim 31, further comprising evaluating received bloom filter information to verify linking of the partial identifiers from the first set and the second set.

38. A wireless communications apparatus, comprising:

a memory that retains instructions related to receiving a first set of partial identifiers during a first peer discovery interval, receiving a second set of partial identifiers during a second peer discovery interval, and matching partial identifiers from the first set and the second set based upon bit overlap; and

a processor, coupled to the memory, configured to execute the instructions retained in the memory.

39. The wireless communications apparatus of claim 38, wherein the first peer discovery interval and the second peer discovery interval are adjacent peer discovery intervals.

40. The wireless communications apparatus of claim 38, wherein the memory further retains instructions for matching the partial identifiers further comprises evaluating a constraint applied to the partial identifiers.

41. The wireless communications apparatus of claim 40, wherein the constraint is a linear constraint.

42. The wireless communications apparatus of claim 38, wherein the memory further retains instructions for linking a particular partial identifier from the first set with a corresponding partial identifier from the second set when a last X bits of the particular identifier match a first X bits of the corresponding partial identifier.

43. The wireless communications apparatus of claim 38, wherein the memory further retains instructions for linking additional partial identifiers from disparate sets related to differing peer discovery intervals to form a complete identifier of a transmitting wireless terminal.

44. The wireless communications apparatus of claim 38, wherein the memory further retains instructions for evaluating received bloom filter information to verify linking of the partial identifiers from the first set and the second set.

45. A wireless communications apparatus that enables linking partial identifiers obtained during differing peer discovery intervals based upon overlapping information, comprising:

means for receiving a first set of partial identifiers during a first peer discovery interval;

means for receiving a second set of partial identifiers during a second peer discovery interval; and

means for matching partial identifiers from the first set and the second set based upon bit overlap.

46. The wireless communications apparatus of claim 45, wherein the first peer discovery interval and the second peer discovery interval are adjacent peer discovery intervals.

47. The wireless communications apparatus of claim 45, further comprising means for matching the partial identifiers further comprises evaluating a constraint applied to the partial identifiers.

48. The wireless communications apparatus of claim 47, wherein the constraint is a linear constraint.

49. The wireless communications apparatus of claim 45, further comprising means for linking a particular partial identifier from the first set with a corresponding partial identifier from the second set when a last X bits of the particular identifier match a first X bits of the corresponding partial identifier.

50. The wireless communications apparatus of claim 45, further comprising means for linking additional partial identifiers from disparate sets related to differing peer discovery intervals to form a complete identifier of a transmitting wireless terminal.

51. The wireless communications apparatus of claim 45, further comprising means for evaluating received bloom filter information to verify linking of the partial identifiers from the first set and the second set.

52. A machine-readable medium having stored thereon machine-executable instructions for:

receiving a first set of partial identifiers during a first peer discovery interval;

receiving a second set of partial identifiers during a second peer discovery interval; and

matching partial identifiers from the first set and the second set based upon bit overlap.

53. The machine-readable medium of claim 52, wherein the first peer discovery interval and the second peer discovery interval are adjacent peer discovery intervals.

54. The machine-readable medium of claim 52, the machine-executable instructions further comprise matching the partial identifiers further comprises evaluating a constraint applied to the partial identifiers.

55. The machine-readable medium of claim 54, wherein the constraint is a linear constraint.

56. The machine-readable medium of claim 52, the machine-executable instructions further comprise linking a particular partial identifier from the first set with a corresponding partial identifier from the second set when a last X bits of the particular identifier match a first X bits of the corresponding partial identifier.

57. The machine-readable medium of claim 52, the machine-executable instructions further comprise linking additional partial identifiers from disparate sets related to differing peer discovery intervals to form a complete identifier of a transmitting wireless terminal.

58. The machine-readable medium of claim 52, the machine-executable instructions further comprise evaluating received bloom filter information to verify linking of the partial identifiers from the first set and the second set.

59. In a wireless communication system, an apparatus comprising:

a processor configured to;

receive a first set of partial identifiers during a first peer discovery interval;

receive a second set of partial identifiers during a second peer discovery interval; and

match partial identifiers from the first set and the second set based upon bit overlap.