Peer-to-peer networking interference remediation

Abstract

Presented herein is a method for managing radio resources in a venue implementing a high-density wireless infrastructure. The method includes: using a wireless access point to detect neighbor awareness networking (NAN) communications broadcast by a mobile device; determining a wireless channel on which the mobile device sends the NAN communications; predicting a destination of the mobile device based on a path taken by the mobile device through a predetermined venue, the path being detected using the wireless access point; and implementing a radio resource management remediation technique based on the wireless channel and the destination to reduce radio interference expected to be caused by the NAN communications broadcast by the mobile device at the destination.

Description

Technical Field

[0001] The present disclosure is directed to monitoring moving peer-to-peer networking packets and implementing remediation techniques to mitigate potential interference caused by such packets. Background Art

[0002] Wi-Fi Aware (also known as Neighbor Awareness Networking, NAN) allows mobile stations (STAs) (e.g., mobile phones in close proximity to each other) to form peer-to-peer groups and exchange information directly without having to rely on access points (APs) as intermediary nodes. The goal of NAN is to organize peer-to-peer (P2P) groups where individual devices may want to exchange information on topics of common interest.

[0003] In operation, a single NAN device sends a discovery message on a known channel. Until a group is formed, these messages are not synchronized between devices, resulting in potentially high channel noise. Once NAN devices hear each other, they meet at a certain interval (time rendezvous point) determined by the elected group leader. At this point, the devices are synchronized in time. At the time rendezvous point, the discovery window allows NAN group participants to exchange information about services they may want to share. If they don't need to share, then there is no reason for them to stay in the same group. Therefore, if it is discovered that they are not interested in each other, then the NAN device can leave the group and try to discover and synchronize other groups. Devices with "things to share" will likely remain in the group. "Things to share" can be any type of data, from "I am a Minecraft player and will share my scores" to "Jerome family, group to exchange photos." In this case, interested members of the group will subscribe to the service (whatever is being shared), and the offering STA will give another time rendezvous point (usually on the same channel) where the service will be offered. BRIEF DESCRIPTION OF THE DRAWINGS

[0004] Figure 1 Components of a network according to an example embodiment are depicted, including access points, mobile stations, and NAN packet detection and channel interference remediation logic.

[0005] Figure 2 Tracking of a given STA in a playing field is depicted according to an example embodiment.

[0006] Figure 3A NAN packet is shown overlaid on a particular channel on a portion of a stadium map that includes an access point on the particular channel according to an example embodiment.

[0007] Figure 4 Discussion of how NAN packet detection and channel interference remediation logic may become aware of neighboring or nearby access points coupled with interference caused by NAN packets according to example embodiments is shown.

[0008] Figure 5 is a flow diagram depicting a series of operations performed by NAN packet detection and channel interference remediation logic according to an example embodiment.

[0009] Figure 6 A device (eg, a server) that may host and execute NAN packet detection and channel interference remediation logic according to example embodiments is depicted. Specific embodiments

[0010] Overview

[0011] Presented herein is a method for managing radio resources in a venue implementing a high-density wireless infrastructure. The method includes: using a wireless access point to detect neighbor awareness networking (NAN) communications broadcast by a mobile device; determining a wireless channel on which the mobile device sends the NAN communications; predicting a destination of the mobile device based on a path taken by the mobile device through a predetermined venue, the path being detected using the wireless access point; and implementing a radio resource management remediation technique based on the wireless channel and the destination to reduce radio interference expected to be caused by the NAN communications broadcast by the mobile device at the destination.

[0012] A device or apparatus is also described. The device may include: an interface unit configured to enable network communications; a memory; and one or more processors coupled to the interface unit and the memory and configured to: detect Neighbor Aware Networking (NAN) communications broadcast by a mobile device using a wireless access point; determine a wireless channel on which the mobile device sends the NAN communications; predict a destination of the mobile device based on a path taken by the mobile device through a predetermined venue, the path being detected using the wireless access point; and implement a radio resource management remediation technique based on the wireless channel and the destination to reduce radio interference expected to be caused by the NAN communications broadcast by the mobile device at the destination.

[0013] Example Embodiments

[0014] Wi-Fi Aware (also known as Neighbor Awareness Networking, NAN) allows mobile stations (STAs), such as mobile phones that are in close proximity to each other, to form peer-to-peer groups and exchange information directly without having to rely on access points (APs) as intermediary nodes. The NAN communication mode is expected to be widely adopted. However, NAN presents considerable challenges in managed high-density networks, such as stadium environments. Specifically, given that NAN groups are formed and disbanded and STAs are mobile, peer-to-peer (P2P) channels may become congested, so not only may collisions between P2P groups themselves increase, but collisions between P2P groups and wireless infrastructure cells may also potentially increase.

[0015] P2P channels can be avoided entirely through managed infrastructure APs, however, this approach is impractical for several reasons.

[0016] For example, in the 2.4 GHz band, there are only three non-overlapping channels, and even losing one entire channel is a huge challenge because it is very difficult to ensure wide coverage with only two channels without major overlapping base station subsystem (OBSS) collisions.

[0017] Additionally, NAN determines the primary advertising channel (eg, ch 6 in 2.4 GHz; ch 149 or 40 in 5 GHz), but data exchanges may be configured to use other channels, making NAN activity detection and avoidance difficult.

[0018] To optimize radio resource management (RRM), it is beneficial to predict the location of NAN activity and react in a manner that reduces the likelihood that the activity of NAN packets will cause interference. Embodiments described herein provide methods for such predictions and also provide preventive management techniques that strive to minimize the interference caused by established NAN packets in the wireless infrastructure.

[0019] NAN works mainly in three stages, as follows:

[0020] 1. Rendezvous: In this phase (Phase 1), the STA starts and broadcasts the rendezvous point information (specific channel and specific time).

[0021] 2. Service exchange: In this phase (Phase 2), two or more NAN devices meet on a specific channel at a specific point in time and exchange information about available services (eg, "Rob's family picture sharing").

[0022] 3. Data Exchange: In this phase (Phase 3), NAN devices that share the same service of interest exchange data. This may occur on the rendezvous channel or on another channel determined during Phase 2.

[0023] According to an embodiment, when the STA enters a predetermined venue (eg, a stadium, a conference center, etc.) with a managed high-density network, a Phase 1 signal transmitted by a NAN-capable STA is detected.

[0024] More specifically, refer to Figure 1 , the figure depicts components of a network 100 , including an access point (AP) 125 , a mobile station (STA) 150 , and NAN packet detection and channel interference remediation logic 190 hosted on a server 180 .

[0025] As a NAN-capable STA 150 moves through a facility or a predetermined venue 105, a probability machine (which may be implemented as part of the NAN group detection and channel interference remediation logic 190) determines the likely trajectory of a user (i.e., a user of a given STA 150). Assume that a user enters the stadium and walks through a restricted entry point (entrance / door). As long as the STA 150 is awake, and assuming that at least one application that has enabled NAN is running on the STA 150, the STA 150 will send a NAN discovery message. Such NAN discovery messages are received by the wireless infrastructure. There will be many STAs 150 that walk through the entry point and send NAN discovery messages. By keeping track of the paths of individual STAs 150 (by using the corresponding APs 125 that are efficiently deployed along all possible paths to track each STA), machine learning techniques (again, implemented as part of the NAN group detection and channel interference remediation logic 190) can learn pathway patterns and can therefore be configured to predict the path that a given new STA 150 may take, and therefore, for example, the seating section that a given new STA 150 will eventually reach.

[0026] Figure 2 Depicted is tracking a given STA in a stadium field according to an example embodiment. As shown, there are many possible users and trajectories, and many users may follow trajectories along paths 210, 215, 220, but the following discussion focuses on a STA following path 230.

[0027] When Figure 2 When a STA is detected at point A in the image, it can be determined from the a priori machine learning training set that the STA is unlikely to go through a wall, for example (although the location is not precise or employee shortcuts can provide such visual overlap on the map), but is likely to go up to any area in the seating area 119, or left to an area in 101 or 201. This is known because it can be learned that users walking to, for example, area 117 tend to enter through the upper right entrance. In other words, the possible trajectories and their probabilities are known from the training set.

[0028] Of course, there is a lower probability that the user uses the lower right entrance to the court and walks directly to, for example, the seating area 117. Determining this type of probability can be done using, for example, stochastic forecasting techniques.

[0029] So, when the user enters the court through the lower right door, the model predicts that the user can only walk to A, and then possibly turn left or right. Depending on the size of the training set, the model can determine the probability of the user going up or down. The probability of going up should be about 0.5, and the probability of going down is about 0.5. Similarly, at point A, the probability distribution of the user's possible ending up in areas 120, 121, 122, and so on.

[0030] As the user continues along path 230 through points B and C, the probability that the user will end up in area 119 increases, while the probability that the user changes their mind and ends up in, for example, area 101 decreases. At point D, the probability that the user ends up in 119 or 120 is very high, while the probability that the user ends up elsewhere becomes low.

[0031] The above learning process is particularly helpful in the context of the instantaneous embodiment because not all APs 125 on the path are on the rendezvous channel (i.e., a subset of APs 125 detect the rendezvous message) and not all APs are on the communication channel for each group. However, by coordinating location, trajectory, and stage 1, 2, and 3 detections, the NAN group detection and channel interference remediation logic 190 can detect individual groups and their characteristics (member count, location, activity, and channel).

[0032] The results of the learning can be displayed as an overlay on a map (see e.g. Figure 3 ) to provide administrators with visibility into the locations and channels of P2P nodes and their expected effects on Wi-Fi infrastructure services.

[0033] It should be noted that the prediction component of the described embodiments is advantageous because:

[0034] - NAN discovery channels are fixed (one channel in 2.4 GHz, one channel in 5 GHz, the channel depends on the regulatory domain);

[0035] - NAN packets may subsequently be communicated on a channel different from the discovery channel; and

[0036] - The goal is to not only try to locate the device, but also determine whether a NAN grouping is formed and exists in a specific location.

[0037] NAN Grouping

[0038] There are two types of 1STAJST groups: permanent groups ("Rob's family") and temporary groups formed around a shared theme ("hot dog lover", "Minecraft player", etc.).

[0039] Consider the following group: friends, or a family going to watch a game. They may meet directly in the seating area (this probability exists), or they may meet at the stadium or even go together (both probabilities exist). The information is used to locate the group and its members on the track of their seats.

[0040] Assume that the NAN discovery channel is 44. As mentioned above, not all APs 125 on the path between the lower right entrance and the seating area 119 are on channel 44. In addition, NAN packets may be formed and exchange data on the discovery channel, or may be formed on the discovery channel and meet on another channel to exchange data.

[0041] Long-term grouping

[0042] Consider the following group: Rob and his two children meet at the entrance of the stadium. Each of them has a phone, and all three phones are likely to be members of Rob's NAN group. When the group is along Figure 2 As the packet proceeds along path 230 in FIG. 4 , it will pass through one or more APs 125 on channel 44, and quite a few other APs 125 on other channels. The packet is detected (e.g., by monitoring NAN discovery messages) when the STA passes through an AP 125 on channel 44. Because this is a permanent packet, the phone will stay in the NAN packet and exchange occasional synchronization data. This synchronization data exchange can occur on the NAN discovery channel (44) or another channel.

[0043] In simple terms, NAN packets are maintained by a rendezvous point at regular intervals to confirm service information (i.e., we are in the same household), and then a rendezvous point is set for data exchange where a short exchange burst will confirm what data is being shared (e.g., photos, phone hotspot service, etc.). This happens at regular intervals, even when no one is sharing photos with anyone else. In other words, from a NAN perspective, packets do not need to be kept alive to exchange data.

[0044] In this case (Rob's home), a packet is formed and remains formed. When the AP on channel 44 detects the packet, the transmission time across the AP cell is sufficient to discern that the packet is formed and remains (STAs meet at the rendezvous point, synchronize with the packet host, etc.). In other words, on channel 44, the AP detects the NAN discovery window, the STA offering the service, and one or more STAs subscribing to the offered service. This indicates that this packet will likely remain as a packet. When this detection is repeated for subsequent APs (possibly on channel 44) that detect the packet, the confidence in the stability of the packet increases.

[0045] This information allows the NAN packet detection and channel interference remediation logic 190 to infer the presence of one device from the presence of another device. If Rob's phone is detected along the path, for example, because Rob's MAC is probing on channel 161 where the AP operates, then there is a probability equivalent to the group stability confidence that the other 2 phones are also traveling along the same path, even though no probing of the other 2 phones was detected on the channel 161. In other words, when the group stability confidence is high, the NAN packet detection and channel interference remediation logic 190 can infer the presence of other members of the group by detecting members of the group.

[0046] Temporary Grouping

[0047] Consider the following scenario: two sports fans happen to appear at the entrance of the stadium at the same time, and both have a NAN-aware application running on their phones. The two phones will discover and meet on channel 44. A NAN group will then form and remain synchronized for the duration that the two phones are in range. This duration can be anywhere between a few seconds and, for example, an entire game time (if the two sports fans happen to end up sitting within range of each other). The probability here depends on the stadium environment and the type of grouping. The longer the users are detected along similar paths, the higher the probability that detecting the trajectory of one will allow predicting the trajectory of the other.

[0048] No NAN grouping

[0049] Consider the third and final situation where the phones scan, discover, and meet on channel 44, but do not find any compatible services to share. The behavior in this case is that each STA will leave the group (no synchronization) and will look for other groups. This behavior may also be detected when a large group of people enters the venue and passes within range of the AP on channel 44.

[0050] Because each of the three scenarios above is a probability, and because it is difficult to calculate real-time certainty for a packed stadium, probabilities are used to predict NAN group locations. Behavior depends on the stadium configuration, local customs, and other factors (e.g., in France, people never meet inside a stadium because it is considered impolite, so the training set will show that groups are formed outside the stadium in most cases and then walk into the stadium together).

[0051] Therefore, the behavior and the chance of seeing NAN groups in the seating area 119 ( Figure 2 ) is a combination of multiple factors. This is why the NAN packet detection and channel interference remediation logic 190 uses machine learning to construct the probability of each event occurring based on observations of a large sample of events.

[0052] In other words, the training set based NAN packet detection and channel interference remediation logic 190 can determine trajectory probabilities, infer the trajectory of one device based on the trajectory of another device and the detection stability of NAN packets associated with both devices, and finally, predict the possible destination of the NAN packets based on the learned pattern of the court and the devices detected during court events.

[0053] By using the aforementioned prediction techniques, it is possible to determine, for example, that region 119 ( Figure 2 ) even if no NAN packets are directly detected in area 119 (e.g., because there are no APs in area 119 on channel 44 or on the NAN data channel of the packet).

[0054] That is, it is possible to tell with a high level of confidence based on the described prediction techniques that a stable NAN packet detected along path 230 is actually in region 119 even though there is no AP 125 on the NAN channel for that region.

[0055] It is also possible to predict with a high level of confidence that a member of the group is present even if only a single member (or a subset of members) is detected.

[0056] Figure 3 A NAN packet is shown overlaid on a particular channel on a portion of a stadium map that includes an access point on the particular channel according to an example embodiment.

[0057] It should also be noted that the NAN discovery channel is not necessarily a NAN data communication channel. Thus, as the user follows a trajectory toward their seated area, the AP 125 on the associated channel detects the NAN communication, and other APs (e.g., Figure 3 Direct communication between phones is detected by APs on ch149, 11, 52, and 153. The counts of STAs and frames per packet can be used to determine the nodule density. Figure 3 A situation is depicted where APs near NAN packets do not share a channel. NAN packet detection and channel interference remediation logic 190 is configured to manage AP channel selection and / or perform other remediation techniques to reduce or avoid interference between NAN packets and nearside APs once a NAN packet is predicted to be at a particular destination.

[0058] Channel Interference Remediation

[0059] In high density network infrastructure venues such as stadiums, Wi-Fi access points 125 typically use highly directional antennas due to the high density of users and the associated need for controlled cell size and client count. The desired coverage typically results in a group of seats in a predetermined area, such as Figure 4 435(2).

[0060] In this environment, the activity of NAN grouping and its effect on the local cell is equivalent to the presence of overlapping cells in the following ways:

[0061] - When the NAN packet communication channel is directly equivalent to the channel of the AP covering the same area, and when all NAN members are within the AP cell area, then normal CSMA / CA rules apply and the result is normal spectrum sharing. In this case, no special actions may be expected.

[0062] - When NAN group members are in place, but only some of them are within the AP cell (e.g. Figure 4 ), then the standard hidden node problem arises.

[0063] exist Figure 4 In the example of FIG. 4 , some members of NAN group 450 are within area 435(2). Such members will communicate according to standard CSMA / CA techniques. On the other hand, some members are outside the coverage area 435(2) of AP 425(2). Such members do not detect AP 425(2) traffic, and do not detect traffic from many members of the AP cell in area 435(2). Therefore, traffic from members of NAN group 450 in area 435(2) may collide with traffic from users served by AP 425(2) in area 435(2).

[0064] It is worth noting that NAN does not describe any restrictions on NAN groups. In addition, NAN allows relaying and is not strict on group member counts. Therefore, in a dense stadium situation, it is very likely that large groups will eventually form (large groups in terms of distance between members and large groups in terms of member count). Therefore, the possibility of interference is greater than "just a pair of phones" because it depends on the specific implementation and group type.

[0065] Thus, as mentioned, the NAN packet detection and channel interference remediation logic 190, once the destination of a NAN packet has been predicted, is configured to undergo one or more channel interference remediation techniques to attempt to avoid interference between the NAN packet and nearby APs or APs having adjacent or overlapping coverage areas (where "nearby" means close enough to receive interfering transmissions from the NAN packet).

[0066] There are several common approaches to remedy channel interference.

[0067] Method (1): One way to avoid channel interference is to preemptively change the operating channel of an AP 125 that happens to be near the predicted destination of a NAN packet on the same channel. In such a situation, the NAN packet detection and channel interference remediation logic 190 predicts the destination of the NAN packet and then causes any nearby APs 125 to change their channels. Figure 3 The results of such a situation are depicted in , where no AP channel overlaps with nearby NAN group channels.

[0068] Method (2): In another method, a nearby AP can take ownership of individual NAN packets by becoming an anchor host (by setting a high host priority). In this mode, the AP can redirect the packet communication to another channel that is not used by the AP in the local area. That is, the NAN packet detection and channel interference remediation logic 190 causes the nearby AP to move the channel of the NAN packet instead of the channel of the mobile AP. Figure 3 It can also be a result of this approach.

[0069] Method (3): In yet another method, when multiple NAN groups are in the same area, they may use uncoordinated rendezvous points (because their hosts are not within range of each other). In this case, the NAN group detection and channel interference remediation logic 190 may cause the AP to use clock synchronization to override the host announcements and force the various groups to rendezvous at the same time, thus limiting the impact on wireless infrastructure traffic.

[0070] Method (4): In yet another method, NAN packet detection and channel interference remediation logic 190 can cause noisy large packet decomposition by increasing the number of hops announced to the host. When a single packet is decomposed (over a large area), the participating APs can coordinate to set each sub-packet to a channel that does not disrupt the wireless infrastructure and relay traffic between sub-packets.

[0071] Regarding method (2), the following elements can be considered.

[0072] The NAN group host selects the communication channel and notifies the group members. Thus, the perspective of the 'best channel' to use depends on the host's perspective, on the one hand, and on any adaptive mechanisms implemented, on the other hand. Thus, if the NAN group host is outside of the AP 425(2) service area 435(2), then the host may pick a channel that will overlap with the AP 425(2) channel (although a different channel may be picked).

[0073] Once a channel is chosen, NAN does not need to prepare for channel changes. In some implementations, a static initial channel is used (which completely ignores possible overlap with nearby AP channels until performance degrades to the point of being unusable from the host's perspective). Other implementations may use initial adaptation mechanisms, but these mechanisms may not take into account perspectives other than the host's perspective.

[0074] In the case of hidden nodes, i.e., a NAN group partially overlaps with an AP cell, collisions degrade the experience for both the NAN group members and the cell STAs (in the collision area). The host may not be aware of the problem (because it is not detecting the AP). In this case, changing the AP channel is a possible remedial technique. However, such changes may be different due to channel planning (i.e., such changes may adversely affect multiple users in multiple other cells). The dynamic channel assignment (DCA) of the RRM system can then calculate whether the results will be better if the overlapping NAN group is changed to another channel.

[0075] Generally speaking, NAN group members "care" about meeting and exchanging services (and then exchanging data if applicable). The success of these operations is part of the group's concern, while collisions with nearby systems are not. However, NAN does not have a mechanism to detect such collision problems (if the NAN host is not directly affected). Therefore, the techniques described herein allow for a higher exchange success rate.

[0076] With respect to remedy (3), the purpose of NAN is to provide a time rendezvous point, a time window during which members of a group can meet to exchange information about services (i.e., exchanges that can occur between members). At the time rendezvous point provided by the host, a window opens when participating STAs can describe the services they provide, hear other NAN broadcasts, and provide a time window through which further data exchanges can be provided.

[0077] The following hidden node problem between NAN packets can occur when two packets are in the same area, the STA hears both packets, but the hosts are not within range of each other (this is likely to happen in a stadium environment where people can establish absorption at ground level while the signal to and from the AP is still clear at ceiling level).

[0078] At time t0, group 1 starts the discovery window. At time t1, STA1 in group 1 gives a rendezvous point for service 1 data sharing.

[0079] At time t1, the STAs in group 1 tune to receive STA1 data, making the spectrum busy with STA1 data transmission. At the same time, the group 2 discovery window starts, but fails because the STA1 traffic continues to exceed the group 2 discovery window.

[0080] In a variation of the same problem, STA1 (in packet 1) and STA2 (in packet 2) are given overlapping data transmission windows because they are in different packets, are not synchronized, and do not consider the other's transmission windows. When the STAs in packet 2 tune into the window, they see STA 1 traffic and time out. Therefore, one of the packets fails to achieve its goal.

[0081] In a variation of the same problem, where the STAs are not using the same default data channel as the discovery channel, STA1 may be on the data channel while Packet 2 is in the discovery window. This prevents the NAN packet browser function from operating properly.

[0082] The aforementioned problem can also be solved by helping two groups in the same area gain awareness of each other. According to an embodiment, this is achieved by ensuring that the two groups can hear each other's service and data window information exchanges. The AP within the range of the two groups can help this awareness by taking the role of the host under the command of the NAN group detection and remediation logic 190 and setting the discovery windows of the two groups to be simultaneous.

[0083] When two groups share the same discovery window, they share the same time window to inform each other about their services. However, the trade-off chosen is 'shared time' or 'collisions because of cell overlap'. This solution does not address the problem of high density of STAs having to share time slices. The aforementioned methods limit collisions by ensuring mutual awareness.

[0084] It should also be noted that in the NAN process, the discovery window is used to offer services to STAs that advertise the same content, and then each STA that offers the service informs the other STAs of the time window (and channel) in which this data will be shared. By having two packets in the same discovery window, the STA in packet 2 will hear the STA in packet 1 offering the data window, and will (according to NAN) offer a different time window for its own data, thus limiting collisions.

[0085] Regarding method (4), it should be noted that this technique does not force the AP to operate on multiple channels. Instead, the goal is to break up the packet into multiple channels when the packet is large. The AP then acts as a repeater between nodes. If the packet is large, more than one AP may be involved, each on its own channel.

[0086] More specifically, according to the NAN protocol and as mentioned above, the discovery window is limited in duration and affects the cell. During the window, one or more STAs plan to advertise data exchange rendezvous points (time and channel). In most cases, the channel plan is the same as the advertising channel. In some cases, the STA can select and indicate another channel. In the case, according to NAN, other STAs that also advertise data exchange rendezvous points during the discovery window will announce the same channel and other times as the first announcement STA (otherwise, if they advertise different channels, then the participating STAs will need to jump between channels, which is impractical; if they advertise similar time rendezvous points, the transmissions will collide).

[0087] If the data channel is different from the local AP channel, then there is no impact on the infrastructure (and no action is required). If the data channel is the same as the local AP channel, then the NAN packet traffic will impact the local AP cell.

[0088] In large packets, the consumed air time may be greatly increased due to the NAN process: the advertising STA sends its window for data transmission, and other STAs can subscribe ("I'll be at the rendezvouspoint"). When these STAs are far away from each other, two events may occur. The STA that will transmit needs to account for the farthest user, and will therefore use more air time to transmit at a low data rate. And, when STAs detect that the signal from the offering STA is low, they can request a relay (other subscribing STAs are requested and accept the relay, which extends the packet size, and then the consumed air time becomes worse because the same frame is repeated).

[0089] In such a situation, the AP can break up the packets by advertising the relay function. In this mode, participating STAs far away from the transmitting STA will receive traffic through the AP, thus allowing the transmitting STA to send at a data rate compatible with its distance to the AP, rather than degrading to a low data rate.

[0090] Keep in mind that in a stadium environment, the STA-to-AP signal ("floor-to-ceiling") is likely to be better than the STA-to-STA signal when the STAs are not close to each other (because the signal needs to pass through multiple objects), so for comparable distances, the STA-to-STA data rate drops faster than the STA-to-AP data rate.

[0091] Through this relay mode, AP 125 speeds up data distribution to packets. This is only beneficial to the infrastructure if the transmission is also on the AP channel (otherwise, NAN transmission is slowed down, but does not affect cell users).

[0092] When users are far enough from each other that the packet spans two or more AP cells, it is possible that the neighboring APs are on different channels, so only one AP channel will be affected (if two APs are on the same channel and both are affected, then the APs can relay traffic to each other). When the affected AP relays traffic, it will relay to the NAN STA at the edge of the affected cell. This mode can be enabled when the air time consumed by STA-AP-EDGE STA is estimated to be less than the air time consumed by STA-EDGE STA (this determination does not matter because the AP initially detects the STA-EDGE STA frame and also knows the STA-AP and AP-EDGE STA data rates).

[0093] In summary, the NAN packet detection and channel interference remediation logic 190 can be configured to employ an iterative learning scheme to detect P2P packets formed as users move and connect to exchange to the NAN. This process enables the NAN packet detection and channel interference remediation logic 190 to learn, detect, and predict the location of P2P nodes, including when nearby APs are not on the P2P channel. The NAN packet detection and channel interference remediation logic 190 can also estimate the impact of the packet on the target channel. This information can be fed back to a mapping application for display to an administrator, but can also be used to improve radio resource management (RRM) channel planning by predicting NAN station locations relative to located RF neighbors.

[0094] Figure 5 is a flow chart depicting a series of operations performed by NAN packet detection and channel interference remediation logic 190n according to an example embodiment. At operation 510, the logic is configured to detect neighbor awareness networking (NAN) communications broadcast by a mobile device using a wireless access point. At operation 512, the logic is configured to determine a wireless channel on which the mobile device sends NAN communications. At operation 514, the logic is configured to predict a destination of the mobile device based on a path taken by the mobile device through a predetermined venue, the path being detected using the wireless access point. And, at operation 516, the logic is configured to implement radio resource management (RRM) remediation techniques based on the wireless channel and the destination to reduce radio interference caused by NAN communications broadcast by the mobile device expected at the destination.

[0095] Figure 6 A device 600 (e.g., a server executing NAN packet detection and channel interference remediation logic 190) is depicted according to an example embodiment. It should be understood that Figure 6 This merely provides an illustration of one embodiment and does not imply any limitation with respect to the environments in which different embodiments may be implemented.Many modifications to the depicted environments may be made.

[0096] As depicted, device 600 includes bus 612, which provides communication between computer processor 614, memory 616, persistent storage 618, communication unit 620, and input / output (I / O) interface 622. Bus 612 may be implemented with any architecture designed to pass data and / or control information between processors (such as microprocessors, communications and network processors, etc.), system memory, peripheral devices, and any other hardware components within the system. For example, bus 612 may be implemented with one or more buses.

[0097] Memory 616 and persistent storage 618 are computer-readable storage media. In the depicted embodiment, memory 616 includes random access memory (RAM) 624 and cache memory 626. In general, memory 616 may include any suitable volatile or non-volatile computer-readable storage media.

[0098] One or more programs (e.g., NAN packet detection and channel interference remediation logic 190) may be stored on persistent storage 618 for execution by one or more of the corresponding computer processors 614 via one or more memories in memory 616. Persistent storage 618 may be a magnetic hard drive, a solid-state hard drive, a semiconductor memory device, a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a flash memory, or any other computer-readable storage medium capable of storing program instructions or digital information. For example, one or more programs may include software instructions that, when executed by one or more processors 614, cause computing device 600 to perform, for example, Figure 5 operation.

[0099] The media used by persistent storage 618 may be removable. For example, a removable hard drive may be used for persistent storage 618. Other examples include optical and magnetic disks, thumb drives, and smart cards that are inserted into a drive for transfer to another computer-readable storage medium that is also part of persistent storage 618.

[0100] Communications unit 620, in these examples, provides communications with other data processing systems or devices. Communications unit 620, in these examples, includes one or more network interface cards. Communications unit 620 may provide communications using one or both of physical and wireless communication links.

[0101] I / O interface 622 allows input and output of data with other devices that may be connected to computer device 600. For example, I / O interface 622 may provide a connection to external devices 628 such as a keyboard, a keypad, a touch screen, and / or some other suitable input device. External devices 628 may also include portable computer-readable storage media such as database systems, thumb drives, portable optical or magnetic disks, and memory cards.

[0102] Software and data used to practice the embodiments may be stored on such portable computer-readable storage media and loaded onto persistent storage 618 via I / O interface 622. I / O interface 622 may also connect to display 630. Display 630 provides a mechanism to display data to a user and may be, for example, a computer monitor.

[0103] The programs described herein are identified based on the applications by which they are implemented in specific embodiments. However, it should be understood that any specific program naming herein is used only for convenience, and thus the embodiments should not be limited to any specific application identified and / or implied by such naming.

[0104] Data related to the operations described herein may be stored in any conventional or other data structure (e.g., files, arrays, lists, stacks, queues, records, etc.) and may be stored in any desired storage unit (e.g., databases, data or other repositories, queues, etc.). Data transmitted between entities may include any desired format and arrangement and may include any number of fields of any size of any type to store data. Definitions and data models for any data sets may indicate an overall structure in any desired format (e.g., computer-related language, graphical representation, lists, etc.).

[0105] The present embodiment may employ any number of any type of user interfaces (e.g., graphical user interfaces (GUIs), command lines, prompts, etc.) to obtain or provide information (e.g., data related to crawling a website), wherein the interface may include any information arranged in any format. The interface may include any number of any type of input or actuation structures (e.g., buttons, icons, fields, boxes, links, etc.) placed in any location to input / display information and initiate desired actions via any appropriate input device (e.g., mouse, keyboard, etc.). The interface screens may include any appropriate actuators (e.g., links, tabs, etc.) to navigate between screens in any format.

[0106] The environment of this embodiment may include any number of computers or other processing systems (e.g., client or end-user systems, server systems, etc.) and databases or other repositories arranged in any desired manner, wherein this embodiment may be applied to any desired type of computing environment (e.g., cloud computing, client-server, network computing, mainframes, stand-alone systems, etc.). The computer or other processing system employed by this embodiment may be implemented by any number of any personal or other type of computer or processing system (e.g., desktop computers, laptops, PDAs, mobile devices, etc.), and may include any combination of any commercially available operating system and commercially available and custom software (e.g., machine learning software, etc.). These systems may include any type of monitor and input device (e.g., keyboard, mouse, voice recognition, etc.) to input and / or view information.

[0107] It should be understood that the software of the present embodiment can be implemented in any desired computer language and can be developed by a person of ordinary skill in the computer field based on the functional descriptions contained in the flowcharts illustrated in the specification and drawings. In addition, any reference to software that performs various functions herein generally means a computer system or processor that performs the functions under the control of the software. The computer system of the present embodiment can alternatively be implemented by any type of hardware and / or other processing circuits.

[0108] The various functions of a computer or other processing system can be distributed in any manner between any number of software and / or hardware modules or units, processing or computer systems and / or circuits, wherein the computers or processing systems can be located locally or remotely from each other and communicate via any appropriate communication medium (e.g., LAN, WAN, intranet, Internet, hardwired, modem connection, wireless, etc.). For example, the functions of the present embodiment can be distributed in any manner among various end-user / client and server systems, and / or any other intermediary processing devices. The software and / or algorithms described above and illustrated in the flow charts can be modified in any manner to accomplish the functions described herein. In addition, the functions in the flow charts or descriptions can be performed in any order to accomplish the desired operations.

[0109] The software of this embodiment may be provided on a non-transitory computer-usable medium (e.g., magnetic or optical media, magneto-optical media, floppy disk, CD-ROM, DVD, memory device, etc.) on a fixed or portable program product apparatus or device for use with a stand-alone system or a system connected by a network or other communications medium.

[0110] The communication network can be implemented by any number of any type of communication networks (e.g., LAN, WAN, Internet, intranet, VPN, etc.). The computer or other processing system of the present embodiment may include any conventional or other communication device to communicate on the network via any conventional or other protocol. The computer or other processing system can access the network using any type of connection (e.g., wired, wireless, etc.). The local communication medium can be implemented by any appropriate communication medium (e.g., local area network (LAN), hard wiring, wireless link, intranet, etc.).

[0111] The system may employ any number of any conventional or other databases, data storage devices, or storage structures (e.g., files, databases, data structures, data or other repositories, etc.) to store information (e.g., data related to contact center interaction routing). The database system may be implemented by any number of any conventional or other databases, data storage devices, or storage structures (e.g., files, databases, data structures, data or other repositories, etc.) to store information (e.g., data related to contact center interaction routing). The database system may be included within or coupled to a server and / or client system. The database system and / or storage structure may be a remote or local database system and / or storage structure of a computer or other processing system and may store any desired data (e.g., data related to contact center interaction routing).

[0112] The presented embodiments may be in various forms, such as systems, methods and / or computer program products at any possible level of integrated technical detail. The computer program product may include a computer-readable storage medium (or multiple media) having computer-readable program instructions thereon for causing a processor to perform the aspects presented herein.

[0113] A computer-readable storage medium may be a tangible device that can hold and store instructions for use by an instruction execution device. A computer-readable storage medium may be, for example, but not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of computer-readable storage media includes the following: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM) a portable compact disc read-only memory (CD-ROM), a digital versatile disk (digital versatile disk, DVD), a memory stick, a floppy disk, a mechanical encoding device, such as a punch card or a raised structure in a groove on which instructions are recorded, and any suitable combination of the foregoing. As used herein, a computer-readable storage medium is not essentially understood as a temporary signal, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagated through a waveguide or other transmission medium (e.g., a light pulse passing through a fiber optic cable), or an electrical signal transmitted by a wire.

[0114] The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a corresponding computing / processing device, or downloaded to an external computer or external storage device via a network (e.g., the Internet, a local area network, a wide area network, and / or a wireless network). The network may include copper transmission cables, optical transmission fibers, wireless transmissions, routers, firewalls, switches, gateway computers, and / or edge servers. The network adapter card or network interface in each computing / processing device receives the computer-readable program instructions from the network, and forwards the computer-readable program instructions to be stored in a computer-readable storage medium in the corresponding computing / processing device.

[0115] The computer-readable program instructions for performing the operation of the present embodiment may be compiler instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, configuration data of an integrated circuit, or source code or object code written in any combination of one or more programming languages, including object-oriented programming languages, such as Smalltalk, C++, etc., and procedural programming languages, such as "C" programming language or similar programming languages. The computer-readable program instructions may be executed entirely on the user's computer, partially on the user's computer, as a stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the latter case, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider). In some embodiments, electronic circuits including, for example, programmable logic circuits, field-programmable gate arrays (FPGAs), or programmable logic arrays (PLAs) may execute computer-readable program instructions by personalizing the electronic circuits with state information of the computer-readable program instructions so as to perform the aspects presented herein.

[0116] Various aspects of the present disclosure are described herein with reference to flowchart illustrations and / or block diagrams of methods, devices (systems), and computer program products according to the present embodiments. It should be understood that each block of the flowchart illustration and / or block diagram, and the combination of blocks in the flowchart illustration and / or block diagram can be implemented by computer-readable program instructions.

[0117] The computer-readable program instructions may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device to produce a machine, such that the instructions executed via the processor of the computer or other programmable data processing device create a device for implementing the functions / behaviors specified in the flowchart and / or block diagram blocks. The computer program instructions that can direct a computer, other programmable data processing device, and / or other equipment to act in a specific manner may also be stored in a computer-readable storage medium, such that the computer-readable storage medium having the instructions stored therein includes an article of manufacture, the article of manufacture including instructions for implementing aspects of the functions / behaviors specified in the flowchart and / or block diagram blocks.

[0118] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device, so that a series of operable steps are performed on the computer, other programmable apparatus, or other device to produce a computer-implemented method, so that the instructions executed on the computer or other programmable device implement the functions / behaviors specified in the flowchart and / or block diagram.

[0119] The flowcharts and block diagrams in the accompanying drawings illustrate the possible specific implementation architecture, functions, and operations of the system, method, and computer program product according to various embodiments. In this regard, each box in the flowchart or block diagram can represent a module, segment, or code portion including one or more executable instructions for implementing a specified logical function. In some alternative implementations, the functions mentioned in the box can appear in an order other than the order mentioned in the accompanying drawings. For example, two boxes shown in succession can actually be executed roughly at the same time, or these boxes can sometimes be executed in reverse order, depending on the functionality involved. It should also be noted that each box illustrated in the block diagram and / or flowchart, as well as the combination of boxes in the block diagram and / or flowchart, can be implemented by a system based on special-purpose hardware, and the system performs a specified function or behavior or performs a combination of special-purpose hardware and computer instructions.

[0120] In summary, a method is provided in one form. The method includes: using a wireless access point to detect neighbor awareness networking (NAN) communications broadcast by a mobile device; determining a wireless channel on which the mobile device sends the NAN communications; predicting a destination of the mobile device based on a path taken by the mobile device through a predetermined venue, the path detected using the wireless access point; and implementing a radio resource management remediation technique based on the wireless channel and the destination to reduce radio interference expected to be caused by the NAN communications broadcast by the mobile device at the destination.

[0121] The venue may include a high-density wireless infrastructure such as might be found in a sports arena or convention center.

[0122] In an embodiment, predicting the destination of the mobile device may include using machine learning.

[0123] In one embodiment, implementing radio resource management remediation techniques to reduce radio interference expected to be caused by mobile devices at a destination may be based on the number of mobile device participants in the destination NAN group.

[0124] In another embodiment, the radio resource management remediation technique may include changing the channel of operation of the access point serving the destination.

[0125] In another embodiment, the radio resource management remediation technique may include changing the channel of operation of an access point serving an area adjacent to the destination.

[0126] The radio resource management remediation technique may also include causing the access point of the service destination to become a member of the NAN group that includes the mobile device, causing the access point of the service destination to become an anchor host of the NAN group, and causing the NAN group to switch to a channel different from the channel used by the access point of the service destination.

[0127] The radio resource management remediation technique may further include causing the access point serving the destination to become a member of a NAN group including the mobile device and further operate as a NAN relay node.

[0128] The method may additionally include displaying an indication of the NAN grouping including the mobile device on a map of the predetermined venue.

[0129] A device according to an embodiment may also be provided in another form. The device may include: an interface unit configured to enable network communication; a memory; and one or more processors coupled to the interface unit and the memory and configured to: use a wireless access point to detect neighbor awareness networking (NAN) communications broadcast by a mobile device; determine a wireless channel on which the mobile device sends NAN communications; predict a destination of the mobile device based on a path taken by the mobile device through a predetermined venue, the path being detected using the wireless access point; and implement a radio resource management remediation technique based on the wireless channel and the destination to reduce radio interference caused by NAN communications broadcast by the mobile device at the destination.

[0130] In an embodiment, one or more processors may be configured to implement radio resource management remediation techniques based on the number of mobile device participants in a destination NAN group to reduce radio interference expected to be caused by the mobile device at the destination.

[0131] Radio resource management remediation techniques may include changing the channel of operation of the access point serving the destination.

[0132] Radio resource management remediation techniques may include changing the channel of operation of access points serving areas adjacent to the destination.

[0133] Radio resource management remediation techniques may include causing the access point of the service destination to become a member of a NAN group that includes the mobile device, causing the access point of the service destination to become an anchor host for the NAN group, and causing the NAN group to switch to a channel different from the channel used by the access point of the service destination.

[0134] The radio resource management remediation technique may include causing the access point serving the destination to become a member of a NAN group including the mobile device and further operate as a NAN relay node.

[0135] In yet another form, a non-transitory computer-readable storage medium is provided that is encoded with instructions that, when executed by a processor, cause the processor to: detect Neighbor Awareness Networking (NAN) communications broadcast by a mobile device using a wireless access point; determine a wireless channel over which the mobile device sends the NAN communications; predict a destination of the mobile device based on a path taken by the mobile device through a predetermined venue, the path being detected using the wireless access point; and implement radio resource management remediation techniques based on the wireless channel and the destination to reduce radio interference caused by NAN communications expected to be broadcast by the mobile device at the destination.

[0136] The instructions may also include instructions that, when executed by the processor, cause the processor to implement a radio resource management remediation technique to reduce NANs expected to be broadcast by mobile devices at the destination based on the number of mobile device participants in the destination NAN group.

[0137] Radio resource management remediation techniques may include causing the access point of the service destination to become a member of a NAN group that includes the mobile device, causing the access point of the service destination to become an anchor host for the NAN group, and causing the NAN group to switch to a channel different from the channel used by the access point of the service destination.

[0138] The radio resource management remediation technique may include causing the access point serving the destination to become a member of a NAN group including the mobile device and further operate as a NAN relay node.

[0139] The foregoing description is intended by way of example only. Various modifications and structural changes may be made without departing from the scope of the concepts described herein and within the spirit and range of equivalents of the claims.

Claims

1. A method for peer-to-peer networking interference remediation, comprising: detecting, using a wireless access point, neighbor awareness networking (NAN) communications broadcast by a plurality of mobile devices participating in a NAN group; determining a wireless channel over which the NAN packet transmits the NAN communication; predicting a destination of the NAN packet based on a path taken by the NAN packet through a predetermined venue, the path detected using the wireless access point; as well as implementing a radio resource management remediation technique based on the wireless channel and the destination to reduce radio interference expected to be caused by the NAN communication broadcasted by the NAN packet at the destination, Wherein, the predetermined site includes a high-density wireless infrastructure, and wherein the wireless access point includes a plurality of wireless access points in the high-density wireless infrastructure.

2. The method according to claim 1, wherein: The predetermined venue is one of a stadium or a conference center.

3. A method according to any one of the preceding claims, wherein: Predicting the destination of the NAN packet includes using machine learning.

4. The method according to claim 1 or 2, further comprising: The radio resource management remediation technique is implemented based on the number of mobile device participants in the NAN packet at the destination to reduce radio interference expected to be caused by the NAN packet at the destination.

5. The method according to claim 1 or 2, wherein: The radio resource management remediation technique includes changing the channel of operation of the access point serving the destination.

6. The method according to claim 1 or 2, wherein: The radio resource management remediation technique includes changing the channel of operation of an access point serving an area adjacent to the destination.

7. The method according to claim 1 or 2, wherein: The radio resource management remediation technique includes causing the access point serving the destination to become a member of the NAN group, causing the access point serving the destination to become an anchor host of the NAN group, and causing the NAN group to switch to a channel different from the channel used by the access point serving the destination.

8. The method according to claim 1 or 2, wherein: The radio resource management remediation technique includes causing an access point serving the destination to become a member of the NAN group and further operate as a NAN relay node.

9. The method of claim 1 or 2, further comprising displaying an indication of the NAN grouping on a map of the predetermined venue.

10. An apparatus for remediation of peer-to-peer network interference, comprising: an interface unit configured to enable network communications; Memory; as well as One or more processors, coupled to the interface unit and the memory, and configured to: detecting, using a wireless access point, neighbor awareness networking (NAN) communications broadcast by a plurality of mobile devices participating in a NAN group; determining a wireless channel over which the NAN packet transmits the NAN communication; predicting a destination of the NAN packet based on a path taken by the NAN packet through a predetermined venue, the path detected using the wireless access point; as well as implementing a radio resource management remediation technique based on the wireless channel and the destination to reduce radio interference expected to be caused by the NAN communication broadcasted by the NAN packet at the destination, Wherein, the predetermined site includes a high-density wireless infrastructure, and wherein the wireless access point includes a plurality of wireless access points in the high-density wireless infrastructure.

11. The device according to claim 10, wherein: The one or more processors are configured to implement the radio resource management remediation technique based on a number of mobile device participants in the NAN packet at the destination to reduce radio interference expected to be caused by the NAN packet at the destination.

12. The device according to claim 10 or 11, wherein: The radio resource management remediation technique includes changing the channel of operation of the access point serving the destination.

13. The apparatus according to claim 10 or 11, wherein: The radio resource management remediation technique includes changing the channel of operation of an access point serving an area adjacent to the destination.

14. The apparatus according to claim 10 or 11, wherein: The radio resource management remediation technique includes causing the access point serving the destination to become a member of the NAN group, causing the access point serving the destination to become an anchor host of the NAN group, and causing the NAN group to switch to a channel different from the channel used by the access point serving the destination.

15. The apparatus according to claim 10 or 11, wherein: The radio resource management remediation technique includes causing an access point serving the destination to become a member of the NAN group and further operate as a NAN relay node.

16. A non-transitory computer-readable storage medium encoded with instructions that, when executed by a processor, cause the processor to: detecting, using a wireless access point, neighbor awareness networking (NAN) communications broadcast by a plurality of mobile devices participating in a NAN group; determining a wireless channel over which the NAN packet transmits the NAN communication; predicting a destination of the NAN packet based on a path taken by the NAN packet through a predetermined venue, the path detected using the wireless access point; as well as implementing a radio resource management remediation technique based on the wireless channel and the destination to reduce radio interference expected to be caused by the NAN communication broadcasted by the NAN packet at the destination, Wherein, the predetermined site includes a high-density wireless infrastructure, and wherein the wireless access point includes a plurality of wireless access points in the high-density wireless infrastructure.

17. The non-transitory computer-readable storage medium according to claim 16 further includes instructions which, when executed by the processor, cause the processor to: implement the radio resource management remediation technology based on the number of mobile device participants in the NAN packet at the destination to reduce radio interference expected to be caused by the NAN packet at the destination.

18. The non-transitory computer-readable storage medium according to claim 16 or 17, wherein: The radio resource management remediation technique includes causing the access point serving the destination to become a member of the NAN group, causing the access point serving the destination to become an anchor host of the NAN group, and causing the NAN group to switch to a channel different from the channel used by the access point serving the destination.

19. The non-transitory computer-readable storage medium according to claim 16 or 17, wherein: The radio resource management remediation technique includes causing an access point serving the destination to become a member of the NAN group and further operate as a NAN relay node.

Images