US 8,010,601 B2Grant
Contiguous location-based user networks
Issue Date:2011-08-30
•21 Claims
•13 Drawing Sheets
Abstract
A system and method are provided for creating location-based user networks. In general, a proximity group including a number of users is identified. Each user in the proximity group is within a proximate area of at least one other user in the proximity group and has an area of interest. The areas of interest of the users in the proximity group are aggregated to provide an aggregate area of interest for the proximity group. Other users within the aggregate area of interest are identified as neighbors of each of the users in the proximity group. Once the neighbors are identified, each of the users in the proximity group may use the neighbors as members, or potential members, for a user network.
Metadata
Assignee
- Waldeck Technology, LLC
Inventors
- Kenneth Jennings
- Steven L. Petersen
Application Information
Application Number:US 12/013,186
Filing Date:2008-01-11
Priority Date:2007-12-21
Art Unit:2455
Classifications
IPC:
G06F15/16
Patent Drawings (13 sheets)
Description
Related Applications
[0001] This application claims the benefit of provisional patent application Ser. No. 61/016,084, filed Dec. 21, 2007, the disclosure of which is hereby incorporated by reference in its entirety.
Field of the Invention
[0002] The present invention relates to location-based user networks.
Background of the Invention
[0003] In today's digital world there are various types of user networks. A user network may be, for example, a social network formed on online social networking websites such as MySpace, a contacts list in a communications application such as an email application or an instant messaging application, a digital content sharing network such as a photo sharing network or a music sharing network, or the like. Other user networks may be, for example, location-based ad-hoc networks. Regardless of the type of user network, it is often desirable to identify new users to add to the user network. Thus, there is a need for a system and method for identifying new users for a user network.
Summary of the Invention
[0004] The present invention provides a system and method for creating location-based user networks. In general, a proximity group including a number of users is identified. Each user in the proximity group is within a proximate area of at least one other user in the proximity group and has an area of interest. Both the proximate area and the area of interest of a user are geographic areas, wherein the area of interest is larger than the proximate area. The areas of interest of the users in the proximity group are aggregated to provide an aggregate area of interest for the proximity group. Other users within the aggregate area of interest are identified as neighbors of each of the users in the proximity group. Once the neighbors are identified, each of the users in the proximity group may use the neighbors as members, or potential members, for a user network.
[0005] For example, assume that the proximity group includes a first user and a second user. The first user has a first proximate area in which the second user is located and a first area of interest. The second user has a second proximate area in which the first user is located and a second area of interest. Additional users within the aggregate of the first and second areas of interest are identified as neighbors of both the first and second user. As a result, the first and second areas of interest of the first and second users are effectively expanded. More specifically, additional users outside the first area of interest but within the second area of interest are identified as neighbors of both the first and second users. Likewise, additional users outside the second area of interest but within the first area of interest are identified as neighbors of both the first and second users. Additional users within both the first and second areas of interest are also identified as neighbors of both the first and second users.
[0006] Those skilled in the art will appreciate the scope of the present invention and realize additional aspects thereof after reading the following detailed description of the preferred embodiments in association with the accompanying drawing figures.
Brief Description of the Drawing Figures
[0007] The accompanying drawing figures incorporated in and forming a part of this specification illustrate several aspects of the invention, and together with the description serve to explain the principles of the invention.
[0008] FIG. 1 illustrates an exemplary system for identifying users for location-based user networks;
[0009] FIG. 2 illustrates a user having an associated proximate area and an associated area of interest (AOI) according to one embodiment of the present invention;
[0010] FIG. 3 illustrates the creation of a proximity group and the aggregation of the AOIs of the members of the proximity group according to one embodiment of the present invention;
[0011] FIG. 4 illustrates the addition of a new user to the proximity group of FIG. 3 according to one embodiment of the present invention;
[0012] FIGS. 5 and 6 illustrate the merger of two proximity groups according to one embodiment of the present invention;
[0013] FIGS. 7 and 8 illustrate the severing of a proximity group in response to a user being removed from a proximity group according to one embodiment of the present invention;
[0014] FIGS. 9A through 9C illustrate a flow chart describing the operation of the system of FIG. 1 according to one embodiment of the present invention;
[0015] FIG. 10 is a block diagram of an exemplary embodiment of the central server system of FIG. 1 ; and
[0016] FIG. 11 is a block diagram of an exemplary embodiment of one of the user devices of FIG. 1 .
Detailed Description of the Preferred Embodiments
[0017] The embodiments set forth below represent the necessary information to enable those skilled in the art to practice the invention and illustrate the best mode of practicing the invention. Upon reading the following description in light of the accompanying drawing figures, those skilled in the art will understand the concepts of the invention and will recognize applications of these concepts not particularly addressed herein. It should be understood that these concepts and applications fall within the scope of the disclosure and the accompanying claims.
[0018] FIG. 1 illustrates an exemplary system 10 for creating location-based user networks according to one embodiment of the present invention. In general, the system 10 includes a central server system 12 and a number of user devices 14-1 through 14-N communicatively coupled via a network 16. The network 16 may be any type or combination of Wide Area Network (WAN) or Local Area Network (LAN). For example, the network 16 may be the Internet. Further, the network 16 may include wired components, wireless components, or both wired and wireless components. The user devices 14-1 through 14-N are associated with corresponding users 18-1 through 18-N.
[0019] The central server system 12 may be implemented as a single server or as multiple servers operating in a collaborative manner. The central server system 12 includes a location matching function 20 and stores or otherwise has access to user network profiles 22 for the users 18-1 through 18-N and, in this embodiment, proximity group definitions 24. The location matching function 20 is preferably implemented in software. However, the present invention is not limited thereto. The location matching function 20 may be implemented in software, hardware, or a combination thereof.
[0020] The user network profiles 22 include a user network profile for each of the users 18-1 through 18-N. Using the user 18-1 as an example, the corresponding user network profile 22 includes: (1) information identifying the user 18-1, (2) information identifying a current location of the user 18-1, (3) information defining an Area of Interest (AOI) of the user 18-1, (4) optionally, information defining a proximate area for the user 18-1, (5) a list of neighbors of the user 18-1, and (6) information identifying or referring to a proximity group definition 24 for a proximity group of which the user 18-1 is a member, if any. The information identifying the user 18-1 may be any type of identification information such as, for example, a user identifier (ID), name, email address, or the like. The information identifying the current location of the user 18-1 may be, for example, coordinates obtained from the Global Positioning System (GPS) or any other type of information capable of identifying the location of the user 18-1.
[0021] The AOI of the user 18-1 is generally a geographical area surrounding the user 18-1. As such, the information identifying the AOI of the user 18-1 may be any type of system-defined or user-defined information defining or otherwise identifying a geographic area. For example, the AOI of the user 18-1 may be a circular area where the information defining the AOI of the user 18-1 is a system-defined or user-defined radius from the current location of the user 18-1. Similarly, the proximate area of the user 18-1 is a geographical area surrounding the user 18-1 that is typically substantially smaller than the AOI of the user 18-1. However, the size of the proximate area of the user 18-1 may be any size less than or equal to the size of the AOI of the user 18-1. As such, the information identifying the proximate area of the user 18-1 may be any type of system-defined or user-defined information defining or otherwise identifying a geographical area. For example, the information defining the proximate area of the user 18-1 may be a radius from the current location of the user 18-1, a maximum response time to the user 18-1, or the like. Note that the exemplary information defining the AOI and proximate area of the user 18-1 are for illustrative purposes only and not intended to limit the scope of the present invention. Numerous variations will be apparent to one of ordinary skill in the art upon reading this disclosure.
[0022] The list of neighbors of the user 18-1 is a list identifying other users from the users 18-2 through 18-N that are within the AOI of the user 18-1. The information identifying the proximity group of which the user 18-1 is a member is information referencing or otherwise identifying a proximity group definition 24 for a proximity group of which the user 18-1 is a member. As discussed below, the user 18-1 may or may not be a member of a proximity group. If the user 18-1 is a member of a proximity group, the proximity group of the user 18-1 includes the user 18-1 and a number of proximate neighbors of the user 18-1, where the proximate neighbors of the user 18-1 are other users from the user 18-2 through 18-N that are within the proximate area of the user 18-1. In addition, the proximity group may include second level proximate neighbors that are proximate to the proximate neighbors of the user 18-1, a third level of proximate neighbors that are proximate to the second level proximate neighbors, and so on. As discussed below, the proximity group is used to expand the AOI of the user 18-1, as well as the AOIs of the other members of the proximity group, to an aggregate of the AOIs of the members of the proximity group. As a result, the neighbors of each member of the proximity group become neighbors of all other members of the proximity group.
[0023] The proximity group definitions 24 include a proximity group definition 24 for each of a number of proximity groups. As discussed below, a proximity group is a group of two or more of the users 18-1 through 18-N, where each user in the proximity group is within the proximate area of at least one other user in the proximity group. The users in a proximity group are referred to herein as members of the proximity group. Each member of a proximity group is a proximate neighbor of at least one other member of the proximity group. Thus, using user 18-1 as an example, a proximity group including the user 18-1 would include the user 18-1 and one or more other users from the users 18-2 through 18-N that are proximate to the user 18-1. In addition, the proximity group may include other users from the users 18-2 through 18-N that are proximate neighbors of the proximate neighbors of the user 18-1. Thus, assuming that the user 18-2 is a proximate neighbor of the user 18-1, the proximity group of the user 18-1 would include the user 18-1 and the user 18-2. Then, if the user 18-3 is a proximate neighbor of the user 18-2 but not the user 18-1, the proximity group would further include the user 18-3. The proximity group may also include the proximate neighbors of the user 18-3, the proximate neighbors of the proximate neighbors of the proximate neighbors of the user 18-3, and so on.
[0024] In addition to a list of the members of the proximity group, the proximity group definition 24 for the proximity group includes an aggregate neighbors list. The aggregate neighbors list is an aggregate list of the neighbors of all of the members of the proximity group. Thus, if the proximity group includes the users 18-1 through 18-3, the aggregate neighbors list is an aggregate of the neighbors of the user 18-1, the neighbors of the user 18-2, and the neighbors of the user 18-3. The aggregate neighbors list preferably does not include duplicates.
[0025] The user devices 14-1 through 14-N include location reporting functions 26-1 through 26-N, location determination functions 28-1 through 28-N, and social networking applications 30-1 through 30-N, respectively. The following discussion is focused on the user device 14-1. However, the discussion is equally applicable to the other user devices 14-2 through 14-N. The location reporting function 26-1 may be implemented in software, hardware, or a combination thereof. The location reporting function 26-1 operates to report a location of the user device 14-1, and thus a location of the user 18-1, to the central server system 12. The location of the user device 14-1 may be reported periodically, reported when requested or polled by the central server system 12, or reported in response to a change in the location of the user device 14-1.
[0026] The location determination function 28-1 may be implemented in software, hardware, or a combination thereof. In one embodiment, the location determination function 28-1 is a GPS receiver. However, the present invention is not limited thereto. The location determination function 28-1 may determine the location of the user device 14-1 using any known technique. For example, the location determination function 28-1 may operate to receive the location of the user device 14-1 from an associated mobile telecommunications network, which may use a technique such as triangulation to determine a location of the user device 14-1. The location determination function 28-1 may report the location of the user device 14-1 to the location reporting function 26-1. Alternatively, the location reporting function 26-1 may query the location determination function 28-1 when needed or desired.
[0027] The social networking application 30-1 is preferably implemented in software. However, the present invention is not limited thereto. The social networking application 30-1 may be any type of application that leverages or uses a network of users. For example, the social networking application 30-1 may be a social recommendation system such as that disclosed in commonly owned and assigned U.S. patent application Ser. No. 11/484,130, entitled P2P NETWORK FOR PROVIDING REAL TIME MEDIA RECOMMENDATIONS, which was filed on Jul. 11, 2006 and is hereby incorporated herein by reference in its entirety. As another example, the social networking application 30-1 may be a text-based or voice-based chat or messaging application maintaining a buddy list or similar user network. As a final example, the social networking application 30-1 may be a media content sharing system where users form a user network for sharing media content such as videos, songs, previews of songs, or the like. For example, the social networking application 30-1 may enable the user device 14-1 to broadcast or otherwise share music with other user devices from the user devices 14-2 through 14-N associated with other users in the social network of the user 18-1.
[0028] As discussed below, the location matching function 20 operates to identify neighbors for each of the users 18-1 through 18-N. Using the user 18-1 as an example, the neighbors of the user 18-1 include other users from the users 18-2 through 18-N that are located within the AOI of the user 18-1. In addition, if the user 18-1 is a member of a proximity group, the neighbors of the user 18-1 further include other users located within the AOIs of the other members of the proximity group. In one embodiment, the neighbors of the user 18-1 may be used as potential members of a user network for the user 18-1. Members for the user network of the user 18-1 may then be identified by using, for example, a manual process where the user 18-1 manually selects one or more of the neighbors of the user as a member of his or her user network. In addition or alternatively, an automated process such as user profile matching may be used to identify members for the user network of the user 18-1 from the neighbors of the user 18-1. User profile matching may use information such as demographic information, biographical information, user preferences such as preferred music genres or artists, or the like in order to select one or more of the neighbors of the user 18-1 as members of the user network of the user 18-1.
[0029] FIGS. 2 through 8 graphically depict the operation of the location matching function 20 according to one embodiment of the present invention. In FIGS. 2 through 8 , the users 18-1 through 18-N are indicated by letters A, B, C, etc. FIG. 2 illustrates a proximate area 32 and an AOI 34 of a user A. In this example, the proximate area 32 is defined by a first radius R1, and the AOI 34 is defined by a second radius R2. Note that the proximate area 32 is substantially smaller than the AOI 34. For example, the proximate area 32 may be 25% of the AOI 34. However, the present invention is not limited thereto. Also note that the proximate area 32 may be system-defined or user-defined. Likewise, the AOI 34 may be system-defined or user-defined. A user B is located within the proximate area 32 of the user A and is therefore referred to herein as a proximate neighbor of the user A. The user B is also said to be proximate to the user A. A user C is not within the proximate area 32 of the user A but is within the AOI 34 of the user A. As such, the user C is referred to herein as a neighbor of the user A. Note that the user B is both a proximate neighbor of the user A and a neighbor of the user A.
[0030] FIG. 3 illustrates the aggregation of the AOIs of two proximate neighbors according to one embodiment of the present invention. In this example, a user A has a proximate area 36 and an AOI 38. The user B is located within the proximate area 36 of the user A. The users B through G are located within the AOI 38 of the user A. The user B has a proximate area 40 and an AOI 42. The user A is located within the proximate area 40 of the user B. The users A, F, B, G, and H through K are located within the AOI 42 of the user B. Note that if the AOIs 38 and 42 of the users A and B, respectively, were not aggregated, the users C through E would not be neighbors of the user B and the users H through K would not be neighbors of the user A. Thus, even though users A and B are close to one another, they would have access to different users for their user networks. In order to expand the AOI 38 of the user A to cover the additional users H through K and to expand the AOI 42 of the user B to cover the additional users C through E, the AOIs 38 and 42 are aggregated to form an aggregate AOI 44, which is indicated by the solid line.
[0031] More specifically, in one embodiment, the AOIs 38 and 42 are aggregated by creating a proximity group for the users A and B. The users A and B are referred to herein as members of the proximity group. The neighbors of the users A and B are then aggregated to provide an aggregate neighbors list for the proximity group. Thus, in this example, the user A may have the following user network profile 22:
[0032] User A: ID
[0033] Location: XX, YY
[0034] Proximate Area: R1
[0035] AOI: R2
[0036] Neighbors: B, C, D, E, F, G
[0037] Proximity Group: P0.
The user B may have the following user network profile 22:
[0038] User B: ID
[0039] Location: XX, YY
[0040] Proximate Area: R1
[0041] AOI: R2
[0042] Neighbors: A, F, G, H, I, J, K
[0043] Proximity Group: P0.
Thus, the proximity group definition including the aggregate neighbors list may be:
[0044] Proximity Group: P0
[0045] Members: A, B
[0046] Aggregate Neighbors List: C, D, E, F, G, H, I, J, K.
[0047] Using the aggregate neighbors list, the users C through K are identified as neighbors of both the user A and the user B. In addition, the user B is a neighbor of the user A, and the user A is neighbor of the user B. By aggregating the neighbors of the users A and B, the AOIs 38 and 42 of the users A and B are effectively aggregated to provide the aggregate AOI 44. Note that the technique for aggregating the AOIs of the members of a proximity group discussed herein is exemplary and not intended to limit the scope of the present invention. Other techniques may be used.
[0048] FIG. 4 illustrates the addition of a new member to the proximity group of FIG. 3 according to one embodiment of the present invention. More specifically, in this example, a user L enters the proximate area 40 of the user B. The user L has a proximate area 46 and an AOI 48. As a result of being proximate to the user B, the user L is added to the proximity group, and the neighbors of the user L are added to the aggregate neighbors list for the proximity group. Thus, continuing the example from above, the user A may have the following user network profile 22:
[0049] User A: ID
[0050] Location: XX, YY
[0051] Proximate Area: R1
[0052] AOI: R2
[0053] Neighbors: B, C, D, E, F, G, L
[0054] Proximity Group: P0.
The user B may have the following user network profile 22:
[0055] User B: ID
[0056] Location: XX, YY
[0057] Proximate Area: R1
[0058] AOI: R2
[0059] Neighbors: A, F, G, H, I, J, K, L
[0060] Proximity Group: P0.
The user L may have the following user network profile 22:
[0061] User L: ID
[0062] Location: XX, YY
[0063] Proximate Area: R1
[0064] AOI: R2
[0065] Neighbors: A, B, F, G, H, I, J, K, M, N, O
[0066] Proximity Group: P0.
Thus, the proximity group definition 24 including the aggregate neighbors list may be:
[0067] Proximity Group: P0
[0068] Members: A, B, L
[0069] Aggregate Neighbors List: C, D, E, F, G, H, I, J, K, M, N, O.
[0070] Using the aggregate neighbors list, the users C through K and the users M through O are identified as neighbors of each of the users A, B, and L. In addition, the users B and L are neighbors of the user A, the users A and L are neighbors of the user B, and the users A and B are neighbors of the user L. By aggregating the neighbors of the users A, B, and L, the AOIs 38, 42, and 48 of the users A, B, and L are effectively aggregated to provide an aggregate AOI 50, which is indicated by a solid line.
[0071] FIGS. 5 and 6 illustrate the merger of two proximity groups when a member of the first proximity group enters the proximate area of a member of the second proximity group according to one embodiment of the present invention. In this example, the users A and B are members of a first proximity group, as discussed above with respect to FIG. 3 . Users L and M are proximate to one another and are therefore members of a second proximity group. The user L has a proximate area 52 and an AOI 54, and the user M has a proximate area 56 and an AOI 58. Users M through Q are neighbors of the user L. Users L, O, P, and Q through S are neighbors of the user M. As such, the users N through P and Q through S are included in an aggregate neighbors list for the second proximity group, thereby effectively aggregating the AOIs 54 and 58 of the users L and M to provide an aggregate AOI 60 for the second proximity group, which is indicated by a solid line.
[0072] FIG. 6 illustrates the merger of the first and second proximity groups when the user L enters the proximate area 40 of the user B. In order to merge the two proximity groups, a new proximity group is defined, or one of the previous proximity groups is modified, such that the users A, B, L, and M are the members of the new proximity group. The users C through K and N through S form the aggregate neighbors list for the new proximity group.
[0073] More specifically, in one embodiment, prior to the merger of the proximity groups, the user A may have the following user network profile 22:
[0074] User A: ID
[0075] Location: XX, YY
[0076] Proximate Area: R1
[0077] AOI: R2
[0078] Neighbors: B, C, D, E, F, G
[0079] Proximity Group: P0.
The user B may have the following user network profile 22:
[0080] User B: ID
[0081] Location: XX, YY
[0082] Proximate Area: R1
[0083] AOI: R2
[0084] Neighbors: A, F, G, H, I, J, K
[0085] Proximity Group: P0.
Thus, the first proximity group P0 may have the following proximity group definition:
[0086] Proximity Group: P0
[0087] Members: A, B
[0088] Aggregate Neighbors List: C, D, E, F, G, H, I, J, K.
[0089] In a similar fashion, the user L may have the following user network profile 22:
[0090] User L: ID
[0091] Location: XX, YY
[0092] Proximate Area: R1
[0093] AOI: R2
[0094] Neighbors: M, N, O, P, Q
[0095] Proximity Group: P1.
The user M may have the following user network profile 22:
[0096] User M: ID
[0097] Location: XX, YY
[0098] Proximate Area: R1
[0099] AOI: R2
[0100] Neighbors: L, O, P, Q, R, S
[0101] Proximity Group: P1.
Thus, the second proximity group P1 may have the following proximity group definition:
[0102] Proximity Group: P1
[0103] Members: L, M
[0104] Aggregate Neighbors List: N, O, P, Q, R, S
[0105] After the merger of the first and second proximity groups, the user network profiles of the users A, B, L, and M reference the new proximity group definition, which in this case is proximity group P2. As a result of the merger, the new proximity group P2 may have the following proximity group definition:
[0106] Proximity Group: P2
[0107] Members: A, B, L, M
[0108] Aggregate Neighbors List: C, D, E, F, G, H, I, J, K, N, O, P, Q, R, S
[0109] Using the aggregate neighbors list, the users C through K and the users N through S are identified as neighbors of each of the users A, B, L, and M. In addition, the users B, L, and M are neighbors of the user A. The users A, L, and M are neighbors of the user B. The users A, B, and M are neighbors of the user L, and the users A, B, and L are neighbors of the user M. By aggregating the neighbors of the users A, B, L, and M, the AOIs 38, 42, 54, and 58 of the users A, B, L, and M are effectively aggregated to provide an aggregate AOI 62, which is indicated by a solid line.
[0110] FIGS. 7 and 8 illustrate an exemplary process for removing a member from a proximity group according to one embodiment of the present invention. FIG. 7 illustrates a proximity group including users A through E as members. The user A has a proximate area 64 and an AOI 66. The user B has a proximate area 68 and an AOI 70. The user C has a proximate area 72 and an AOI 74. The user D has a proximate area 76 and an AOI 78, and the user E has a proximate area 80 and an AOI 82. As discussed above, the AOIs 66, 70, 74, 78, and 82 of the users A through E are combined to provide an aggregate AOI 84 for the proximity group, which is indicated by a solid line. Users F through S are within the aggregate AOI 84 of the proximity group and are therefore included in the aggregate neighbors list for the proximity group. As such, the users F through S are neighbors of each of the users A through E in the proximity group.
[0111] FIG. 8 illustrates a process for removing a member from the proximity group of FIG. 7 according to one embodiment of the present invention. In this example, the user C is to be removed from the proximity group because the user C is no longer proximate to any of the other members (users A, B, D, and E) of the proximity group. Normally, when a user is to be removed as a member of a proximity group, the user is removed from the list of members for the proximity group, and the neighbors within only the AOI of that user and not within the AOI of any other member of the proximity group are removed from the aggregate neighbors list for the proximity group. However, in this example, the proximity group is severed by the removal of the user C. More specifically, once the user C is removed, the users A and B are proximate to one another, and the users D and E are proximate to one another. However, neither of the users A or B are proximate to either of the users D or E. The chain of proximate relationships between the users A through E, which is referred to herein as a proximity chain, has been broken.
[0112] As a result, the proximity group must be severed into two proximity groups. A first proximity group including the users A and B is formed. A second proximity group including the users D and E is formed. The first proximity group including the users A and B has an aggregate AOI 86, which is indicated by a solid line. As such, the users F through N are considered neighbors of each of the users A and B in the first proximity group. As a result of severing the original proximity group, the users P through S are no longer neighbors of the users A and B in the first proximity group. The second proximity group including the users D and E has an aggregate AOI 88, which is indicated by a solid line. As such, the users K through S are considered neighbors of each of the users D and E in the second proximity group. As a result of severing the original proximity group, the users F through J are no longer neighbors of the users D and E in the second proximity group.
[0113] FIGS. 9A through 9C illustrate a flow chart describing the operation of the location matching function 20 (FIG. 1 ) according to one embodiment of the present invention. First, the location matching function 20 receives location information from the user devices 14-1 through 14-N identifying or otherwise providing the locations of the user devices 14-1 through 14-N (step 200). For this discussion, the locations of the user devices 14-1 through 14-N are also the locations of the users 18-1 through 18-N and are used as such. The location matching function 20 may receive location information from the user devices 14-1 through 14-N in any desired manner. For example, the user devices 14-1 through 14-N may provide the location information to the location matching function 20 periodically. Alternatively, the user devices 14-1 through 14-N may provide updates to their locations in response to changes in their locations. As a final example, the location matching function 20 may query the user devices 14-1 through 14-N for their locations periodically or as needed.
[0114] The location matching function 20 monitors the locations of the users 18-1 through 18-N to identify a first user, which is referred to as user X, that has entered or is otherwise new to the proximate area of a second user, which is referred to as user Y (step 202). If there are no new users within the proximate area of any other user, the process proceeds to step 228. Assuming that a user X has entered the proximate area of a user Y and that the users X and Y are not already members of the same proximity group, the location matching function 20 then determines whether the user Y is a member of a proximity group (step 204). In one embodiment, the user Y has a corresponding user network profile 22 (FIG. 1 ). If the user Y is a member of a proximity group, the user network profile 22 of the user Y includes a reference to that proximity group. If the user network profile 22 does not include a reference to a proximity group or if the reference to the proximity group is null, the user Y is not a member of a proximity group.
[0115] If the user Y is a member of a proximity group, the location matching function 20 then determines whether the user X is a member of a proximity group (step 206). If not, the location matching function 20 adds the user X as a member of the proximity group of user Y (step 208), and adds the neighbors of user X to the aggregate neighbors list for the proximity group of user Y (step 210). The neighbors of user X are other users within the AOI of the user X. Once the user X is added to the proximity group, the neighbors of user X become not only the original neighbors of user X located within the AOI of user X but also neighbors of all other users within the aggregate AOI of the proximity group.
[0116] Returning to step 206, if the user X is a member of a proximity group, then the users X and Y are members of separate proximity groups. As such, the location matching function 20 merges the proximity groups of users X and Y to provide a merged proximity group (step 212). In one embodiment, in order to merge the proximity groups, the location matching function 20 may merge the proximity group definition 24 of the proximity group of user X into the proximity group definition 24 of the proximity group of user Y, or vice versa. Alternatively, the location matching function 20 may merge the proximity group definitions 24 of the two proximity groups into a new proximity group definition 24 for the merged proximity group. In either case, the members of the merged proximity group are the members of the proximity group of user X and the members of the proximity group of user Y. In addition, the aggregate neighbors lists for the original proximity groups are merged to provide a single aggregate neighbors list for the merged proximity group. The user network profiles 22 of the members of the merged proximity group are updated, if necessary, to reference or otherwise identify the proximity group definition 24 of the merged proximity group.
[0117] Returning to step 204, if the user Y is not a member of a proximity group, the location matching function 20 determines whether the user X is a member of a proximity group (step 214, FIG. 9B ). If not, the location matching function 20 creates a proximity group for the users X and Y (step 216). In one embodiment, the proximity group is created by creating a proximity group definition 24 listing the users X and Y as members. The location matching function 20 then aggregates the users located within the AOI of the user X and the users located within the AOI of the user Y to provide an aggregate neighbors list for the proximity group (step 218). The user network profiles 22 of the users X and Y are updated to reference or otherwise identify the proximity group definition 24 for their proximity group. As a result, the user X has neighbors including its neighbors located within its AOI as well as the neighbors of the user Y located within the AOI of the user Y. Likewise, the user Y has neighbors including its neighbors located within its AOI as well as the neighbors of the user X located within the AOI of the user X.
[0118] Returning to step 214, if the user X is a member of a proximity group, the location matching function 20 adds the user Y as a member of the proximity group of user X (step 220) and adds the neighbors of the user Y to the aggregate neighbors list for the proximity group (step 222). Note that if some of the neighbors of user Y are already included in the aggregate neighbors list as a result of also being the neighbors of other members of the proximity group, those users do not need to be added to the aggregate neighbors list.
[0119] At this point, whether proceeding from step 210 (FIG. 9A ), step 212 (FIG. 9A ), step 218 (FIG. 9B ), or step 222 (FIG. 9B ), the location matching function 20 determines whether there are additional proximate users to process (step 224, FIG. 9C ). More specifically, based on the locations of the users 18-1 through 18-N, the location matching function 20 determines whether there are any more users having a new proximate neighbor that needs to be processed. If there are additional sets of proximate users to process, the location matching function 20 repeats steps 204 through 224 for each additional set of proximate users to be processed (step 226).
[0120] Once there are no additional proximate users to process, the location matching function 20 identifies a user, which is referred to as user Z, that is no longer proximate to any other member of his proximity group (step 228). If there are no such users, then the process returns to step 200. Assuming that there is a user Z that is no longer proximate to any other member of his proximity group, the location matching function 20 determines whether the removal of the user Z from the proximity group will sever the proximity group as discussed above with respect to FIGS. 7 and 8 (step 230). If not, the location matching function 20 removes the user Z as a member of the proximity group (step 232). The location matching function 20 also removes users within the AOI of the user Z but not within the AOI of any other member of the proximity group from the aggregate neighbors list (step 234). Returning to step 230, if the proximity group is severed by the removal of user Z, the location matching function 20 splits the proximity group into two or more proximity groups as discussed above with respect to FIGS. 7 and 8 (step 236).
[0121] At this point, the location matching function 20 determines whether there are any additional users to be removed from their proximity groups (step 238). If so, the next user to remove from his corresponding proximity group is identified (step 240). Steps 230 through 240 are repeated until there are no more users to remove from their proximity groups. At that point, the process returns to step 200 (FIG. 9A ).
[0122] It should be noted that it may be desirable to limit the growth of the proximity groups discussed herein. Growth may be limited in a number of ways. For example, the proximate areas of the users may be hard-coded to a relatively small size as compared to the AOIs of the users. As another example, the proximate areas may be defined in a dynamic manner such that the proximate areas are limited to being relatively small as compared to the AOIs of the user. For example, the proximate areas of the users may be limited to 25% of the size of the AOIs of the users. As a third example, the proximate areas may be controlled by the users. As such, the users may control the sizes of their proximate areas in a manner that limits the size of their proximity group. As a fourth example, there may be a user-defined or system-defined limit on the number of members in a proximity group. As a final example, there may be a user-defined or system-defined limit on the size of the aggregate AOI of a proximity group.
[0123] FIG. 10 is a block diagram of the central server system 12 according to one embodiment of the present invention. In general, the central server system 12 includes a control system 90 having associated memory 92. In this embodiment, the location matching function 20 is implemented in software and stored in the memory 92. However, the present invention is not limited thereto. The central server system 12 may also include one or more digital storage units 94 for storing the user network profiles 22 and the proximity group definitions 24 (FIG. 1 ). However, the user network profiles 22 and/or the proximity group definitions 24 may alternatively be stored in the memory 92. The central server system 12 also includes a communication interface 96 enabling the central server system 12 to send and receive messages to the user devices 14-1 through 14-N via the network 16 (FIG. 1 ). The central server system 12 may also include a user interface 98, which may include components such as, for example, a display, one or more user input devices, and the like.
[0124] FIG. 11 is a block diagram of the user device 14-1 according to one embodiment of the present invention. This discussion is equally applicable to the other user devices 14-2 through 14-N. In general, the user device 14-1 includes a control system 100 having associated memory 102. In this embodiment, the location reporting function 26-1 and the social networking application 30-1 are implemented in software and stored in the memory 102. However, the present invention is not limited thereto. The user device 14-1 also includes a location determination function 28-1 and a communication interface 104 enabling the user device 14-1 to communicate with the central server system 12 via the network 16 (FIG. 1 ). The user device 14-1 may also include a user interface 106, which may include components such as, for example, a display, one or more user input devices, and the like.
[0125] The present invention provides substantial opportunity for variation without departing from the spirit or scope of the present invention. For example, while the social networking applications 30-1 through 30-N of FIG. 1 are illustrated as being implemented on the user devices 14-1 through 14-N, the present invention is not limited thereto. For example, a social networking application such as an online social networking website may be implemented on a central server system such as, but not limited to, the central server system 12. As another example, while the location matching function 20 is described herein as being implemented on the central server system 12, the present invention is not limited thereto. The present invention may alternatively be implemented in a Peer-to-Peer (P2P) architecture. For example, the location matching function 20, the user network profiles 22, and the proximity group definitions 24 may be implemented on one of the user devices 14-1 through 14-N or distributed among two or more of the user devices 14-1 through 14-N.
[0126] Those skilled in the art will recognize improvements and modifications to the preferred embodiments of the present invention. All such improvements and modifications are considered within the scope of the concepts disclosed herein and the claims that follow.
Claims
What is claimed is:
1. A method comprising:
identifying a first proximity group comprising a first plurality of users, each user of the first plurality of users being within a proximate area of at least one other user of the first plurality of users and having an area of interest; and
identifying at least one additional user within an aggregate of the areas of interests of the first plurality of users in the first proximity group as a neighbor of each of the first plurality of users in the first proximity group;
wherein:
the first proximity group comprises a first user and a second user, the first user having a first proximate area within which the second user is located and a first area of interest that is larger than the first proximate area and the second user having a second proximate area within which the first user is located and a second area of interest that is larger than the second proximate area; and
identifying the at least one additional user within the aggregate of the areas of interest of the first plurality of users in the first proximity group comprises identifying at least one first additional user located within the second area of interest of the second user and outside of the first area of interest of the first user as a neighbor of both the first and second users.
2. The method of claim 1 wherein for each user of the first plurality of users in the first proximity group, the area of interest of the user is larger than the proximate area of the user.
3. The method of claim 1 wherein identifying the at least one additional user within the aggregate of the areas of interest of the first plurality of users in the first proximity group further comprises identifying at least one second additional user within the first area of interest of the first user and outside of the second area of interest of the second user as a neighbor of both the first and second users.
4. The method of claim 3 wherein identifying the at least one additional user within the aggregate of the areas of interest of the first plurality of users in the first proximity group further comprises identifying at least one third additional user within both the first and second areas of interest as a neighbor of both the first and second users.
5. The method of claim 1 wherein for each user of the first plurality of users in the first proximity group, the neighbor is used as a potential member of a user network of the user.
6. The method of claim 5 wherein the user network is a user network selected from a group consisting of: a social network and a peer-to-peer recommendation network.
7. The method of claim 1 further comprising:
identifying a new user that is located within the proximate area of at least one of the first plurality of users in the first proximity group; and
adding the new user to the first proximity group.
8. The method of claim 1 further comprising:
identifying a user of the first plurality of users that is no longer within the proximate area of any other user of the first plurality of users; and
removing the user as a member of the first proximity group.
9. The method of claim 8 further comprising removing at least one user that is located within the area of interest of the user removed from the first proximity group and not located within the area of interest of any other user of the first plurality of users remaining in the first proximity group as a neighbor of the other users of the first plurality of users remaining in the first proximity group.
10. A method comprising:
identifying a first proximity group comprising a first plurality of users, each user of the first plurality of users being within a proximate area of at least one other user of the first plurality of users and having an area of interest;
identifying at least one additional user within an aggregate of the areas of interests of the first plurality of users in the first proximity group as a neighbor of each of the first plurality of users in the first proximity group;
identifying a new user that is located within the proximate area of at least one of the first plurality of users in the first proximity group, the new user being a member of a second proximity group comprising a second plurality of users including the new user;
merging the first and second proximity groups to provide a merged proximity group comprising the first and second pluralities of users; and
identifying at least one additional user within an aggregate of the areas of interest of the first and second pluralities of users in the merged proximity group as a neighbor of each of the first and second pluralities of users in the merged proximity group.
11. A method comprising:
identifying a first proximity group comprising a first plurality of users, each user of the first plurality of users being within a proximate area of at least one other user of the first plurality of users and having an area of interest;
identifying at least one additional user within an aggregate of the areas of interests of the first plurality of users in the first proximity group as a neighbor of each of the first plurality of users in the first proximity group;
identifying a user of the plurality of users that is no longer within the proximate area of any other user of the plurality of users; and
removing the user as a member of the first proximity group;
wherein removing the user as a member of the first proximity group severs a chain of proximity between at least two subsets of the first plurality of users, and the method further comprises:
splitting the first proximity group into at least two separate proximity groups, each comprising one of the at least two subsets of the first plurality of users; and
for each subset of the first plurality of users from the at least two subsets, identifying at least one additional user within an aggregate of the areas of interest of the subset of the first plurality of users as a neighbor of each of the subset of the first plurality of users.
12. A system comprising:
a communication interface for communicating with a plurality of user devices via a network, the plurality of user devices associated with a plurality of users; and
a control system associated with the communication interface and adapted to:
identify a first proximity group comprising at least two first users of the plurality of users, each user of the at least two first users being within a proximate area of at least one other user of the at least two first users and having an area of interest; and
identify at least one additional user from the plurality of users within an aggregate of the areas of interests of the at least two first users in the first proximity group as a neighbor of each of the at least two first users in the first proximity group;
wherein:
the first proximity group comprises a first user and a second user, the first user having a first proximate area within which the second user is located and a first area of interest that is larger than the first proximate area and the second user having a second proximate area within which the first user is located and a second area of interest that is larger than the second proximate area; and
the control system is further adapted to identify at least one first additional user located within the second area of interest of the second user and outside of the first area of interest of the first user as a neighbor of both the first and second users.
13. The system of claim 12 wherein for each user of the at least two first users in the first proximity group, the area of interest of the user is larger than the proximate area of the user.
14. The system of claim 12 wherein the control system is further adapted to identify at least one second additional user within the first area of interest of the first user and outside of the second area of interest of the second user as a neighbor of both the first and second users.
15. The system of claim 14 wherein the control system is further adapted to identify at least one third additional user within both the first and second areas of interest as a neighbor of both the first and second users.
16. The system of claim 12 wherein for each user of the at least two first users in the first proximity group, the neighbor is used as a potential member of a user network of the user.
17. The system of claim 16 wherein the user network is a user network selected from a group consisting of: a social network and a peer-to-peer social recommendation network.
18. The system of claim 12 wherein the control system is further adapted to:
identify a new user from the plurality of users that is located within the proximate area of at least one of the at least two first users in the first proximity group; and
add the new user to the first proximity group.
19. The system of claim 12 wherein the control system is further adapted to:
identify one of the at least two first users that is no longer within the proximate area of any other user of the at least two first users; and
remove the one of the at least two first users as a member of the first proximity group.
20. A system comprising:
a communication interface for communicating with a plurality of user devices via a network, the plurality of user devices associated with a plurality of users; and
a control system associated with the communication interface and adapted to:
identify a first proximity group comprising at least two first users of the plurality of users, each user of the at least two first users being within a proximate area of at least one other user of the at least two first users and having an area of interest;
identify at least one additional user from the plurality of users within an aggregate of the areas of interests of the at least two first users in the first proximity group as a neighbor of each of the at least two first users in the first proximity group;
identify a new user from the plurality of users that is located within the proximate area of at least one of the at least two first users in the first proximity group, the new user being a member of a second proximity group comprising at least two second users from the plurality of users including the new user;
merge the first and second proximity groups to provide a merged proximity group comprising the at least two first users and the at least two second users; and
identify at least one additional user from the plurality of users within an aggregate of the areas of interests of the at least two first users and the areas of interest of the at least two second users in the merged proximity group as a neighbor each of the at least two first users and the at least two second users in the merged proximity group.
21. A system comprising:
a communication interface for communicating with a plurality of user devices via a network, the plurality of user devices associated with a plurality of users; and
a control system associated with the communication interface and adapted to:
identify a first proximity group comprising at least two first users of the plurality of users, each user of the at least two first users being within a proximate area of at least one other user of the at least two first users and having an area of interest;
identify at least one additional user from the plurality of users within an aggregate of the areas of interests of the at least two first users in the first proximity group as a neighbor of each of the at least two first users in the first proximity group;
identify one of the at least two first users that is no longer within the proximate area of any other user of the at least two first users; and
remove the one of the at least two first users as a member of the first proximity group;
wherein the at least two first users comprise a plurality of first users and removing the user as a member of the first proximity group severs a chain of proximity between at least two subsets of the plurality of first users, and the control system is further adapted to:
split the first proximity group into at least two separate proximity groups each comprising one of the at least two subsets of the plurality of first users; and
for each subset of the plurality of first users from the at least two subsets, identify at least one additional user from the plurality of users within an aggregate of the areas of interest of the subset of the plurality of first users as a neighbor of each of the subset of the plurality of first users.
Patent Citations (118)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5493692(A) | 1996-02-01 | Theimer et al. | Applicant |
| US5754939(A) | 1998-05-01 | Herz et al. | Applicant |
| US5796727(A) | 1998-08-01 | Harrison et al. | Applicant |
| US5903901(A) | 1999-05-01 | Kawakura et al. | Applicant |
| US5949776(A) | 1999-09-01 | Mahany et al. | Applicant |
| US6014090(A) | 2000-01-01 | Rosen et al. | Applicant |
| US6049711(A) | 2000-04-01 | Ben-Yehezkel et al. | Applicant |
| US6240069(B1) | 2001-05-01 | Alperovich et al. | Applicant |
| US6349203(B1) | 2002-02-01 | Asaoka et al. | Applicant |
| US6456234(B1) | 2002-09-01 | Johnson | Applicant |
| US6529136(B2) | 2003-03-01 | Cao et al. | Examiner |
| US6539232(B2) | 2003-03-01 | Hendrey et al. | Applicant |
| US6542750(B2) | 2003-04-01 | Hendrey et al. | Applicant |
| US6618593(B1) | 2003-09-01 | Drutman et al. | Applicant |
| US6675015(B1) | 2004-01-01 | Martini et al. | Applicant |
| US6675268(B1) | 2004-01-01 | DeKoning et al. | Applicant |
| US6853841(B1) | 2005-02-01 | St. Pierre | Applicant |
| US6876642(B1) | 2005-04-01 | Adams et al. | Applicant |
| US6937860(B2) | 2005-08-01 | Jahn | Applicant |
| US6947571(B1) | 2005-09-01 | Rhoads et al. | Applicant |
| US6954443(B2) | 2005-10-01 | Forstadius et al. | Applicant |
| US6970703(B2) | 2005-11-01 | Fuchs et al. | Applicant |
| US6975266(B2) | 2005-12-01 | Abraham et al. | Applicant |
| US6990497(B2) | 2006-01-01 | O'Rourke et al. | Applicant |
| US7020710(B2) | 2006-03-01 | Weber et al. | Applicant |
| US7035618(B2) | 2006-04-01 | Schnurr | Applicant |
| US7035912(B2) | 2006-04-01 | Arteaga | Applicant |
| US7047315(B1) | 2006-05-01 | Srivastava | Applicant |
| US7085571(B2) | 2006-08-01 | Kalhan et al. | Applicant |
| US7134040(B2) | 2006-11-01 | Ayres | Applicant |
| US7171018(B2) | 2007-01-01 | Rhoads et al. | Applicant |
| US7200638(B2) | 2007-04-01 | Lake | Applicant |
| US7203753(B2) | 2007-04-01 | Yeager et al. | Applicant |
| US7206568(B2) | 2007-04-01 | Sudit | Applicant |
| US7218611(B2) | 2007-05-01 | Mimura et al. | Applicant |
| US7240106(B2) | 2007-07-01 | Cochran et al. | Applicant |
| US7249367(B2) | 2007-07-01 | Bove, Jr. et al. | Applicant |
| US7260638(B2) | 2007-08-01 | Crosbie | Applicant |
| US7269854(B2) | 2007-09-01 | Simmons et al. | Applicant |
| US7272357(B2) | 2007-09-01 | Nishiga et al. | Applicant |
| US7319379(B1) | 2008-01-01 | Melvin | Applicant |
| US7340768(B2) | 2008-03-01 | Rosenberger | Applicant |
| US7343160(B2) | 2008-03-01 | Morton | Applicant |
| US7359894(B1) | 2008-04-01 | Liebman et al. | Applicant |
| US7373109(B2) | 2008-05-01 | Pohja et al. | Applicant |
| US7509131(B2) | 2009-03-01 | Krumm et al. | Examiner |
| US7512702(B1) | 2009-03-01 | Srivastava et al. | Applicant |
| US7516212(B2) | 2009-04-01 | Nguyen et al. | Applicant |
| US7620404(B2) | 2009-11-01 | Chesnais et al. | Examiner |
| US7668832(B2) | 2010-02-01 | Yeh et al. | Applicant |
| US7684815(B2) | 2010-03-01 | Counts et al. | Applicant |
| US2001/0039659(A1) | 2001-11-01 | Simmons et al. | Applicant |
| US2001/0048449(A1) | 2001-12-01 | Baker | Applicant |
| US2002/0019829(A1) | 2002-02-01 | Shapiro | Applicant |
| US2002/0086659(A1) | 2002-07-01 | Lauper | Applicant |
| US2002/0086676(A1) | 2002-07-01 | Hendrey et al. | Applicant |
| US2003/0022675(A1) | 2003-01-01 | Mergler | Applicant |
| US2003/0050062(A1) | 2003-03-01 | Chen et al. | Applicant |
| US2003/0065721(A1) | 2003-04-01 | Roskind | Applicant |
| US2003/0229549(A1) | 2003-12-01 | Wolinsky et al. | Applicant |
| US2004/0107219(A1) | 2004-06-01 | Rosenberger | Applicant |
| US2004/0148393(A1) | 2004-07-01 | Breiter et al. | Applicant |
| US2004/0160307(A1) | 2004-08-01 | Saikkonen et al. | Applicant |
| US2004/0225519(A1) | 2004-11-01 | Martin | Applicant |
| US2005/0015800(A1) | 2005-01-01 | Holcomb | Applicant |
| US2005/0021369(A1) | 2005-01-01 | Cohen et al. | Applicant |
| US2005/0033780(A1) | 2005-02-01 | Simelius et al. | Applicant |
| US2005/0038876(A1) | 2005-02-01 | Chaudhuri | Examiner |
| US2005/0050027(A1) | 2005-03-01 | Yeh et al. | Applicant |
| US2005/0059379(A1) | 2005-03-01 | Sovio et al. | Applicant |
| US2005/0060350(A1) | 2005-03-01 | Baum et al. | Applicant |
| US2005/0071221(A1) | 2005-03-01 | Selby | Applicant |
| US2005/0160270(A1) | 2005-07-01 | Goldberg et al. | Applicant |
| US2005/0174975(A1) | 2005-08-01 | Mgrdechian et al. | Applicant |
| US2005/0197846(A1) | 2005-09-01 | Pezaris et al. | Applicant |
| US2005/0245233(A1) | 2005-11-01 | Anderson | Applicant |
| US2005/0251453(A1) | 2005-11-01 | Lu | Applicant |
| US2005/0251565(A1) | 2005-11-01 | Weel | Applicant |
| US2005/0251566(A1) | 2005-11-01 | Weel | Applicant |
| US2005/0251576(A1) | 2005-11-01 | Weel | Applicant |
| US2005/0251807(A1) | 2005-11-01 | Weel | Applicant |
| US2005/0272413(A1) | 2005-12-01 | Bourne | Applicant |
| US2006/0085419(A1) | 2006-04-01 | Rosen | Applicant |
| US2006/0085821(A9) | 2006-04-01 | Simmons et al. | Applicant |
| US2006/0123080(A1) | 2006-06-01 | Baudino et al. | Applicant |
| US2006/0149628(A1) | 2006-07-01 | Chefalas et al. | Applicant |
| US2006/0149631(A1) | 2006-07-01 | Brazell et al. | Applicant |
| US2006/0168264(A1) | 2006-07-01 | Baba et al. | Applicant |
| US2006/0218225(A1) | 2006-09-01 | Hee Voon et al. | Applicant |
| US2006/0223518(A1) | 2006-10-01 | Haney | Applicant |
| US2006/0229939(A1) | 2006-10-01 | Bhakta et al. | Applicant |
| US2006/0240856(A1) | 2006-10-01 | Counts et al. | Applicant |
| US2006/0287915(A1) | 2006-12-01 | Boulet et al. | Applicant |
| US2007/0121843(A1) | 2007-05-01 | Atazky et al. | Applicant |
| US2007/0136132(A1) | 2007-06-01 | Weiser et al. | Applicant |
| US2007/0168254(A1) | 2007-07-01 | Steelberg et al. | Applicant |
| US2007/0174243(A1) | 2007-07-01 | Fritz | Examiner |
| US2007/0205276(A1) | 2007-09-01 | Sodan et al. | Applicant |
| US2007/0218867(A1) | 2007-09-01 | Mononen et al. | Applicant |
| US2007/0249327(A1) | 2007-10-01 | Nurmi | Applicant |
| US2007/0260508(A1) | 2007-11-01 | Barry et al. | Applicant |
| US2007/0271136(A1) | 2007-11-01 | Strauss et al. | Applicant |
| US2008/0016205(A1) | 2008-01-01 | Svendsen | Applicant |
| US2008/0033809(A1) | 2008-02-01 | Black et al. | Applicant |
| US2008/0097999(A1) | 2008-04-01 | Horan | Examiner |
| US2008/0182591(A1) | 2008-07-01 | Krikorian | Examiner |
| US2008/0288375(A1) | 2008-11-01 | Uhrig et al. | Applicant |
| US2009/0030999(A1) | 2009-01-01 | Gatzke et al. | Examiner |
| US2009/0055229(A1) | 2009-02-01 | Lidgren et al. | Applicant |
| US2009/0085724(A1) | 2009-04-01 | Naressi et al. | Applicant |
| US2009/0315670(A1) | 2009-12-01 | Naressi et al. | Applicant |
| GB2399928(A) | 2004-09-01 | Applicant | |
| WO99/05877(A1) | 1999-02-01 | Applicant | |
| WO/04730(A1) | 2000-01-01 | Applicant | |
| WO1/24551(A1) | 2001-04-01 | Applicant | |
| WO2/29506(A2) | 2002-04-01 | Applicant | |
| WO2/062092(A1) | 2002-08-01 | Applicant | |
| WO2006/082566(A1) | 2006-08-01 | Applicant |
Non-Patent Literature (27)
- “Internet Relay Chat—Wikipedia, the free encyclopedia,” http://en.wikipedia.org/wiki/IRC, printed Nov. 16, 2007, 11 pages.Applicant
- “Instant Messenger—Aim—Instant Message Your Online Buddies for Free—AIM,” http://dashboard.aim.com/aim, copyright 2007 AOL LLC, printed Nov. 8, 2007, 6 pages.Applicant
- “Windows Live Messenger—Overview,” http://get.live.com/messenger/overview, copyright 2007 Microsoft Corp., printed Nov. 28, 2007, 1 page.Applicant
- “Bluetooth.com—Learn,”http://www.bluetooth.com/Bluetooth/Learn/, copyright 2007 Bluetooth SIG, Inc., printed Oct. 26, 2007, 1 page.Applicant
- “dodgeball.com :: mobile social software,” http://www.dodgeball.com/, copyright 2008 Google Inc., printed Jan. 16, 2008, 1 page.Applicant
- “eHarmony,” http://eharmony.com/, copyright 2000-2008 eHarmony.com, printed Jan. 16, 2008, 1 page.Applicant
- “flickr,” http://www.flickr.com/, copyright 2008 Yahoo! Inc., printed Jan. 16, 2008, 1 page.Applicant
- “Friendster—Home,” http://www.friendster.com/, copyright 2002-2007 Friendster, Inc., printed Jan. 16, 2008, 1 page.Applicant
- “Google Talk,” http://www.google.com/talk/, copyright 2008 Google, printed Jan. 16, 2008, 1 page.Applicant
- “iChat. Not being there is half the fun,” http://www.apple.com/macosx/features/ichat.html, printed Jan. 16, 2008, 1 page.Applicant
- “icq, ” http://www.icq.com/, copyright 1998-2008 ICQ Inc., printed Jan. 16, 2008, 2 pages.Applicant
- “IEEE 802.11,” http://en.wikipedia.org/wiki/IEEE—802.11, printed Oct. 26, 2007, 5 pages.Applicant
- “Anthem—Overview,” http://www.intercastingcorp.com/platform/anthem, copyright 2004-2007 Intercasting Corp., printed Jan. 16, 2008, 2 pages.Applicant
- “Apple—iPod classic,” http://www.apple.com/ipodclassic/, printed Oct. 26, 2007, 1 page.Applicant
- “Jabber SoftwareFoundation,” http://www.jabber.org/, copyright 1999-2005 the Jabber Software Foundation, printed Jan. 16, 2008, 3 pages.Applicant
- “lavalife Where singles click,” http://lavalife.com/, copyright 2006 Lavalife Corp., printed Jan. 16, 2008, 1 page.Applicant
- “Dating Service—Singles, Personals and Love, Match.com,” http://www.match.com/, copyright 2008 Match.com, printed Jan. 16, 2008, 2 pages.Applicant
- “MySpace,” http://www.myspace.com/, copyright 2003-2008 MySpace.com, printed Jan. 16, 2008, 2 pages.Applicant
- “mobile community, free sms, mobile dating, text flirting and friends networking—playtxt . . . ,” http://web.archive.org/ web120070225125113m—1/www.playtxt.net/playtxt.do, printed Jan. 16, 2008, 1 page.Applicant
- “Rabble—Social networking for your phone,” http://www.rabble.com/, copyright 2005-2008 Intercasting Corp, printed Jan. 16, 2008, 1 page.Applicant
- “SmallPlanet: Home,” http://web.archive.org/web/20061105030323/http://www.smallplanet.net/, copyright 2005 SmallPlanet.net, printed Jan. 16, 2008, 1 page.Applicant
- “Yahoo! Messenger,” http://messenger.yahoo.com/webmessengerpromo.php, copyright 2007 Yahoo! Inc., printed Oct. 26, 2007, 1 page.Applicant
- “Yahoo! Personals,” http://personals.yahoo.com/us/homepage/splash, copyright 2008 Yahoo! Inc., printed Jan. 16, 2008, 2 pages.Applicant
- “Zune,” http://www.zune.net/en-US/, copyright 2008 Microsoft Corporation, printed Jan. 16, 2008, 1 page.Applicant
- “Google AdWords: Regional and Local Targeting,” https://adwords.google.com/select/targeting.html, copyright 2008 Google, printed Jul. 17, 2008, 1 page.Applicant
- “Technology—Geo Targeting,” http://www.invidi.com/pages/itc—technology—05.html, copyright 2007, printed Nov. 18, 2008, 1 page.Applicant
- “IP Multimedia Subsystem,” http://en.wikipedia.org/wiki/IP—Multimedia—Subsystem, printed Jul. 8, 2009, 11 pages.Applicant