Methods and devices using advertisement frames for nearby network communication
The 'Nearby Network' protocol addresses the limitations of existing P2P networks by eliminating hierarchy and optimizing energy use, enabling seamless and dynamic UE connections.
Patent Information
- Application Number
- PCT/CN2025/095447
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2025-05-16
- Publication Date
- 2026-11-19
AI Technical Summary
Existing peer-to-peer (P2P) communication protocols in wireless networks require a peer hierarchy, consume excessive energy, and lack dynamicity, hindering seamless connections and large-scale deployment.
A P2P communication protocol called 'Nearby Network' that operates without a hierarchy, using advertisement frames for node detection and connection establishment, allowing UEs to act as bridges and dynamically manage energy consumption.
Enables seamless integration and efficient energy use among UEs, facilitating dynamic connections without the need for a leader node, thus supporting large-scale deployment.
Smart Images

Figure CN2025095447_19112026_PF_FP_ABST
Abstract
Description
METHODS AND DEVICES USING ADVERTISEMENT FRAMES FOR NEARBY NETWORK COMMUNICATIONFIELD OF THE DISCLOSURE
[0001] This document generally describes methods and devices operating in a wireless communication environment, such as (but not limited to) the one described in Institute of Electrical and Electronics Engineers (IEEE) 802.15.4 standard, but also in other wireless-based environments, for example, the one described by the 5G standard documents, known as 3GPP communication systems, or by the Bluetooth standard documents, which are regulated and maintained by the Bluetooth Special Interest Group (Bluetooth SIG) . Other communication protocols may also be used for the methods and devices described in this document.BACKGROUND
[0002] With the explosion of user equipments (UEs) , for example, smartphones, tablets, smart watches, and the ubiquity of wireless connections (especially cellular connection, also called 5G in this document) between the UEs, there is a large amount of content (especially pictures) that is being exchanged between these UEs. However, the existing 5G providers experience network issues, which result in lost signals and / or lost connections between the UEs. This means that there are cases in which one UE cannot exchange content with another UE.
[0003] As a solution to this problem, peer-to-peer (P2P) networks were proposed for the UEs, even when the UEs are still connected to the 5G networks. The existing P2P communication protocols have their own drawbacks. For example, these protocols require a peer hierarchy (e.g., a leader node) for routing purposes, which might become resource and processor intensive, causing the individual UEs to spend a large amount of energy for little benefit for itself. Also, the existing P2P protocols might not be as dynamic as required for UEs that are moving around. Further, the existing P2P protocols require logging into the network and performing a certain authentication procedure, i.e., they are not offering a seamless connection between the various UEs. All these limitations of the existing systems and networks hinder their large scale deployment as a small percentage of the users have embraced them.SUMMARY
[0004] Various embodiments introduce a P2P communication protocol, called in this document a “Nearby Network. ” This protocol is configured to achieve a seamless integration among various UEs (also called “nodes” ) , even if some of the UEs have never communicated before with each other. The Nearby Network is also configured to treat all UEs at the same level, i.e., there is no hierarchy between the UEs, no leader, no router node, no border router node, etc. This feature simplifies the interaction between the nodes of the Nearby Network and the amount of memory and power used by each node for keeping track of various nodes. Each UE is configured to act as a bridge between different peer UEs, i.e., to route a message from one peer UE to another peer UE. However, the user of the UE has the choice of selecting or declining to act as a bridge.
[0005] The methods and devices discussed in this document address various aspects of node detection among peers in a wireless communication system, monitoring and establishing connections between the peers. The nodes of the Nearby Network use an advertisement frame for discovering (i.e., become aware of) peer nodes. The advertisement frame has a specific structure, that includes, at least a medium access control (MAC) address and a personal area network identifier (PAN ID) . The advertisement frame may also indicate a radio frequency (RF) channel for communication. The advertisement frame may further specify at least one of a coordinated sampled listening (CSL) period and phase, a group ID, an application ID, a user ID, a node matcher, a device name, and a service list.
[0006] The advertisement frame may be transmitted by a node during a given period and then the node scans (listens) for advertisement frames from peer nodes during a subsequent period, with this cycle being repeated in time. Alternatively, the node may transmit the advertisement frame interleaved with the scanning for peer nodes advertisement frames. The Nearby Network protocol defines various states of the nodes, e.g., known state, linked state, lost state, and secured state so that each peer node is “seen” in one of these states by the other nodes. The nodes move from one state to another depending on (1) their locations relative to the peers, (2) their availability, and (3) various technical features.BRIEF DESCRIPTION OF THE DRAWINGS
[0007] The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate one or more embodiments and, together with the description, explain these embodiments.
[0008] FIG. 1 schematically illustrates two UEs that communicate in a direct, wireless manner, with each other.
[0009] FIG. 2 schematically illustrates a structure of an advertisement frame used by the UEs to communicate in a P2P manner according to an embodiment.
[0010] FIGs. 3 and 4 schematically illustrate a first mode for the transmission and reception of the advertisement frames by the UEs according to an embodiment.
[0011] FIGs. 5 and 6 schematically illustrate a second mode for the transmission and reception of the advertisement frames by the UEs according to another embodiment.
[0012] FIG. 7 schematically illustrates how a UE interacts with peer UEs for receiving advertisement frames according to an embodiment.
[0013] FIG. 8. schematically illustrates a table configured to store information collected by the UE of FIG. 7 from the advertisement frames of the peer UEs according to an embodiment.
[0014] FIG. 9 illustrates a configuration of a contact header information element of the advertisement frame according to an embodiment.
[0015] FIG. 10 illustrates a configuration of a payload field of the advertisement frame according to an embodiment.
[0016] FIG. 11 illustrates a configuration of a content of the payload of the advertisement frame according to an embodiment.
[0017] FIG. 12 illustrates a configuration of an advertising element, which is part of the content of the payload of the advertisement frame, according to an embodiment.
[0018] FIG. 13 illustrates a configuration of advertising data associated with a node matcher according to an embodiment.
[0019] FIG. 14 is a flow chart of a UE method for establishing peer UEs based on the advertisement frame according to an embodiment.
[0020] FIG. 15 schematically illustrates the nearby network stack according to an embodiment.
[0021] FIG. 16 schematically illustrates the functionalities of the various layers used by the nearby network according to an embodiment.DETAILED DESCRIPTION
[0022] Methods and devices described in this section embody techniques related to P2P communication in a wireless environment in which there is no main link coordinator (e.g., no star topology) . The nodes in the P2P communication form the Nearby Network, which uses the mesh topology. Techniques and methods for how the nodes of the Nearby Network detect peer nodes in an efficient way and also monitor and establish connections with other nodes are discussed in this document.
[0023] The embodiment descriptions in this section refer to the accompanying drawings. The same reference numbers in different drawings identify the same or similar elements. The detailed descriptions do not preclude other embodiments within the scope of the appended claims. The embodiments are not limited to the described configurations but may be extended to other arrangements.
[0024] Prior to discussing the peer detection and monitoring for the Nearby Network, a possible configuration of the Nearby Network 100, which is illustrated in FIG. 1, is introduced. The Nearby Network 100, called in this document the “network, ” may include any number of nodes. A node may be a smartphone, a tablet, a smart watch, or any other device that has a wireless communication capability. In one embodiment, the wireless communication capability is defined by the IEEE 802.15.4 technical standard. This wireless communication standard defines the operation of low-rate wireless personal area networks (LR-WPANs) and focuses on low-power, low-data-rate communication over short distances (for example, up to 20 m) . The IEEE 802.15.4 protocol operates in the 2.4 GHz frequency band, 868 MHz in Europe, and 915 MHz in North America. While many embodiments below are discussed with the IEEE 802.15.4 protocol in mind, any other wireless communication standard may also be used, for example, Bluetooth, IEEE 802.11, for high-speed wireless local area networking (WLAN) , Z-wave, long range wide area network (LoRaWAN) , near field communication (NFC) , cellular standard (4G LTE, 5G) , ultra-wideband (UWB) , infrared communication, etc.
[0025] FIG. 1 shows, for simplicity, that the network 100 includes two nodes 110 and 120. However, as noted above, the network 100 may include any number of nodes. The nodes in this embodiment are two smartphones. The structure of the two nodes (e.g., smartphones) is shown in the figure as being different, suggesting that smartphones from different manufacturers or from different vintages may be part of the network.
[0026] Node 110 may be a smartphone that includes antennas connected to an RF front end 111, and a transceiver. The transceiver may be a long term evolution (LTE) transceiver 112, a 5G new radio (NR) transceiver 113, or an IEEE 802.15.4 transceiver 114. Although FIG. 1 shows three transceivers being present in the node 110, one skilled in the art would understand that, while at least one transceiver is present, more than one transceiver being present is optional. The antennas and RF front end 111 can be tuned to one or more frequency bands (e.g., subcarriers) , for example, as defined by 3GPP LTE, 5G NR, 6G, IEEE 802.15.4 communication standards and implemented by respective transceivers. Node 110 also includes one or more precoders 115 (which is optional, as indicated by the dash line) , one or more processor (s) 116, and computer-readable storage media (CRSM) 117. Processor (s) 116 may be single or multiple-core processors, and CRSM 117 includes any suitable memory / storage other than propagating signals. For example, memory / storage can include random-access memory (RAM) , static RAM (SRAM) , dynamic RAM (DRAM) , non-volatile RAM (NVRAM) , read-only memory (ROM) , and / or flash memory. CRSM 117 stores device data 118 necessary for node’s communications. The CRSM 117 may also include a nearby network configuration manager 119. The nearby network configuration manager 119 is configured to implement node detection and monitoring and to establish connections between the nodes, as discussed later.
[0027] Node 120 also includes one or more antennas, an RF front end 121, and a transceiver 122 for communicating with the node 110 and other nodes. Node 120’s antennas and RF front end 121 can be tuned to one or more frequency bands (e.g., subcarriers) , similar to node 110, and these frequency bands are implemented by transceiver 122. Node 120 further includes processor (s) 123 and CRSM 124. Processor (s) 123 can include single or multiple-core processors, and CRSM 124 includes any suitable memory / storage except propagating signals. For example, memory / storage can include RAM, SRAM, DRAM, NVRAM, ROM, and / or flash memory. CRSM 124 stores device data 125, which includes network and / or peer related information, and / or an operating system, which are executable by processor (s) 123 to enable wireless communication along signaling channel 101 with node 110 as well as with other nodes. CRSM 124 also stores a nearby network configuration manager 126, similar to 119.
[0028] The nodes 110 and 120 of the network 100 (which is a P2P network, different from the 4G or 5G networks, which are not P2P networks) need to be aware of the existence of each other, and to collect some data about each other so that a message from one node can be routed to another node through the network 100. Note that in one embodiment, information obtained by one node through the 4G or 5G network is not used in the nearby network 100. In other words, even if the node 110 may become aware of the node 120 due to some functions or properties of the 4G or 5G network, the node 100 acquires information about the neighboring nodes within the nearby network 100, independent of the 4G or 5G network. This characteristic is implemented so that when the 4G or 5G becomes unavailable, the nearby network 100 remains operational.
[0029] Note that the nearby network 100 uses a democratic peer system, i.e., each node in the network 100 is as important as any other node in the network. This means that in this embodiment, there is no need for leaders or special nodes in the network. Note that contrary to the “democratic” network 100, existing P2P networks (for example WiFi ad-hoc networks, such as WiFi aware (NaN) , WiFi P2P, etc. ) work in a star topology, where there is a main link coordinator that perform administrative duties for all other nodes. Further, network 100 needs to be dynamically set up using the least amount of energy. To respond to this need, the IEEE 802.15.4 or a low energy Bluetooth protocol may be used. Note that the WiFi networks (and other existing P2P networks, for example, Thread) use more energy as they maintain at selected nodes, routing tables between the various nodes.
[0030] Each node of the network 100 is configured to use a rendezvous advertisement frame 200 (called “advertisement frame” in this document) having a structure, for example, as illustrated in FIG. 2. Those skilled in the art would understand and the structure may include fewer or more fields. The advertisement frame 200 is broadcasted by each node for the neighboring nodes and each node also listens for the corresponding advertisement frames from the neighboring nodes. The advertisement frame 200 includes at least a first field 202 for a medium access control (MAC) address and a second field 204 for a personal area network (PAN) identifier (ID) . The PAN ID is a unique identifier used to distinguish different wireless networks operating in the same area. The PAN ID ensures that devices within a specific network can communicate with each other without interference from neighboring networks and associated devices. The PAN ID is also defined by the IEEE 802.15.4. However, different from the IEEE 802.15.4, there is no PAN coordinator for the network 100. Note that the PAN coordinator in the IEEE 802.15.4 has plural functions, for example, approves a new device joining the network, maintains a tree list of all the nodes, etc.
[0031] The advertisement frame 200 may also include a third field 206 indicating a channel indicator (e.g., RF channel indicator) , to be used by the broadcasting node and the receiver node to communicate with each other. Depending on the type of wavelengths used for communication, the channel indicator may be an optical channel indicator, if Bluetooth is used instead of IEEE 802.15.4.
[0032] The advertisement frame 200 may further include a fourth field 208 indicating the CSL mechanism. The CSL mechanism introduces specific periods (when the device is awake or sleeping) and phases to manage low-power communication efficiently. The CSL mechanism allows the various nodes to periodically “wake up” to check for incoming communication while conserving energy when idle. This field and the associated CSL mechanism support a sleepy-to-sleepy mode for the nodes, which is discussed later in more detail.
[0033] The advertisement frame 200 may further include a fifth field 210 indicating a group ID. The group ID is associated with an upper layer group ID, for example, an ID that is used in a group chat or a talk-to-push application. The advertisement frame 200 may further include a sixth field 212 indicating an application ID, which is associated with the application running the network 100 on the nodes 110 or 120. The advertisement frame 200 may further include a seventh field 214 indicating a user ID, which uniquely identifies the node. This ID had been previously been encrypted by the server in the cloud for all the node’s contacts (e.g., the contacts could be part of the user account or they could be part of an allowed list that has been previously (or dynamically) been built) . These IDs are periodically synced to the nodes whenever they have an internet connection. Examples of user IDs: “Carlos” is DDRTG#and "John” is RTGH@) . In one application, the user ID is an encrypted user ID and it is associated with a security of the corresponding node. In one embodiment, the user ID is associated with an authentication and management system, for example, Gaia. A Gaia ID is associated with a Google account, may be an email address, and this ID allows the users to access and manage their accounts across different services. The users of the nodes may, in one embodiment, previously connected to each other using this ID and thus, they are present in each other contacts. This information may be stored at the nodes, so that even when the service in the cloud becomes unavailable, i.e., there is 4G, or 5G, of WiFi connection to the internet, the nodes have access to their IDs and their contacts, which are associated with the Gaia account in this embodiment.
[0034] The advertisement frame 200 may also include an eighth field 216 including a node matcher. The node matcher may be used by the nodes to filter desired peers with which to interact. The node matcher is discussed later in more detail. The advertisement frame 200 may also include a ninth field 218 including a device name. The device name may include the name of the node, as it was selected by the user of the node. The advertisement frame 200 may also include a tenth field 220 that includes a service list. The service list may include one or more services that the broadcasting node supports, for example, technical capabilities of the broadcasting node, which is also discussed later.
[0035] As discussed above, the advertisement frame 200 may include only the first two fields 202 and 204. In one embodiment, the advertisement frame 200 includes only the first three fields 202, 204, and 206. In yet another embodiment, the advertisement frame 200 may also include one or more of the other fields 208 to 220. In one embodiment, the advertisement frame 200 includes all the fields illustrated in FIG. 2. In yet another embodiment, the advertisement frame 200 includes any combination of fields.
[0036] In one embodiment, the advertisement frame 200 is broadcasted 310 by each node 110 and 120 during a first time period and the same node then listens 320, during a second time period, different from the first time period, for incoming advertisement frames 200 from nodes of the network 100. In this regard, FIG. 3 illustrates the node 110 repeatedly broadcasting 310 advertisement frames 200 during a first period Ta, followed by a first idle period Tiddle1 in which the node is inactive, followed by a scanning (listening) period Tscan during which the node listens 320 for advertisement frames 200 from other nodes, followed by a second idle period Tiddle2, followed by a second period Ta, during which the node 110 again repeatedly broadcasted 310 the advertisement frames 200, and so on. The values of the various time periods Ta, Tiddle1, Tscan, and Tiddle2 may be selected to be consistent with the various standards used for the broadcasting, for example, the IEEE 802.15.4. In one embodiment, the time periods are in the range of hundreds to thousands of ms. However, those skilled in the art would understand that the values of the time periods may be selected based on other criteria.
[0037] FIG. 4 shows the broadcasting and listening times for another node 120 of the network 100, relative to the times of the node 110. It is noted that when the first node 110 broadcasts the advertisement frames 200, the second node 120 listens, and vice versa. However, there is no guarantee that the broadcasting and listening periods for all the nodes are coordinated so that when one node broadcasts, the other nodes listen. Also, because the range of transmission for the IEEE 802.15.4 protocol is relatively short, for example, less than 30 m, only a limited number of nodes are likely to be within a circle of radius 30 m around a broadcasting node, which increases the odds that one node broadcasts and the other nodes are listening. In addition, if the advertisement frame 200 includes the CSL field, the node 110 can determine the time periods when the node 120 is ON or OFF.
[0038] In one embodiment, a change in the location of the node 110 may determine the initiation of the broadcasting of the advertisement frames 200, i.e., the location change may supersede the repetition of the time intervals shown in FIG. 3.
[0039] FIGs. 5 and 6 illustrate another possibility for broadcasting 310 and listening 320 for the advertisement frames 200. According to this embodiment, each node broadcasts 310 a single advertisement frame 200 followed by listening 320 for a period of time, which is followed by another single broadcasting of a single advertisement frame 200, followed by another listening period. This pattern may be repeated by a desired number of times during the ON period Ton. This period is followed by an OFF period Toff, during which the node conserves energy (enters the sleep mode) and neither broadcasts nor listens for any advertisement frame 200. Then, a new ON period Ton is initiated, having the same structure as the previous ON period. The cycle of ON and OFF periods may be repeated with any desired frequency and for any desired amount of time. Note that for both embodiments (i.e., the embodiment illustrated in FIGs. 3 and 4 and the embodiment illustrated in FIGs. 5 and 6) , the node may start broadcasting 310 during an idle or OFF period if the node changes its position. Also note that FIGs. 5 and 6 show the ON and OFF periods of the nodes 110 and 120 not being coordinated, i.e., there is an amount of overlap between the ON and OFF periods of the two nodes. In one embodiment, the nodes are configured to select different ON and OFF length periods to prevent a perfect overlapping of the ON period of one node and the OFF period of a neighboring node. In one embodiment, the nodes are configured to randomly select the lengths of the ON and OFF periods, within an acceptable range, to inject a misalignment between the ON and OFF periods for the two nodes. In yet another embodiment, the nodes use the CSL mechanism to prevent the alignment of the ON periods of one node with the OFF periods of another node.
[0040] The broadcasting (or transmission) of the advertisement frame 200 by each node may take place on one or more channels of a given band. In one embodiment, the network 100 is configured to use a full band of frequencies for broadcasting. Thus, the nodes 110 and 120 of the network 100 are configured to use a subset of the full band or the entire band for broadcasting activities. For example, the full band may include N channels, where N may be 16 in the IEEE 802.15.4 standard. Other values for N may be used depending on the adopted communication standard. The nodes may be configured to use a subset of M a priori fixed channels, where M is smaller than N. In one embodiment, M may be 3 and N 16. This broadcasting mode is called in this document a “partial-channel” mode. The partial-channel mode may be used to speed up discovery of sleepy nodes, i.e., those nodes that duty cycle between ON and OFF periods. This mode consumes a smaller amount of energy than a full band mode. Because the sleepy nodes are not available during the OFF periods, they are considered as being “sleepy” during these periods. Note that other nodes may be ON all the time. The choice of being ON all the time or being sleepy may be a matter of node configuration, or node owner preference.
[0041] The nodes may be configured to transmit along all N channels of the full band. This mode is called “full-band” mode. A full-band advertisement interval should be multiple of the partial-channel advertising interval so that during the cycle of a full-band advertising, partial advertising can be skipped. The advertisement frame 200 may be transmitted with carrier sense multiple access with collision avoidance (CSMA / CA) enabled but with no retransmission. The CSMA / CA is a network communication protocol used in wireless and wired networks to manage access to a shared communication medium and reduce the likelihood of data collisions. This protocol is employed in standards like IEEE 802.11 (Wi-Fi) and IEEE 802.15.4.
[0042] In one embodiment, the non-sleepy nodes always perform full-band broadcasting of the advertisement frame 200. The sleepy nodes may perform both partial-channel or full-band broadcasting, depending on the context. The sleepy nodes are configured to dynamically change their partial-channel advertisement duty cycle (e.g., TON and TOFF) , depending on the node’s state and context. For example, when the screen of the node is ON, the sleepy node may use a faster duty cycle as the power impact of the transmission is smaller. Similar algorithms may be applied for the mobility state of the node, specific apps running on the node, etc. In one embodiment, the scanning for the signals is offloaded to the nearby network manager (chip) and the node requests a wake-up whenever the scanning find an appropriate connection request.
[0043] In one embodiment, the nodes may be configured with an “aggressive discovery” mode. The nodes with the aggressive discovery mode may “park” on one of the reserved partial-channels for a long period of time to scan and discover its neighbors as soon as possible. After some period of time, the node is configured to switch to another reserved partial-channel and repeat the discovery process. The discovery may continue until a neighbor is discovered, or until all the reserved partial-channels are used up. The reserved partial-channels may be any number P of channels from the full band, where P is smaller than N.
[0044] During the broadcasting and listening periods, a given node becomes aware of neighboring nodes (through the received advertisement frames 200) . These neighboring nodes may have various relationships with the given node and this is true for all the nodes of the network 100. Thus, a set of states has been introduced for the nearby network 100 for categorizing each neighboring node in relationship to the given node. Note that the network may have many nodes, and the given node and the neighboring nodes form just a subset of all the nodes, i.e., the neighboring nodes of the given node are typically less than the set of all the nodes. For example, in a network 100 of 20 nodes, it is possible that the given node has only one to three neighboring nodes. Other values are possible for the number of nodes or the neighboring nodes.
[0045] The number of neighboring nodes depends on the communication protocol. If the IEEE 802.15.4 protocol is used, because the range of the RF waves is about 10 to 30 m, it is unlikely that many neighboring nodes are present around the given node. This situation may change depending on the location of the given node. For example, if the given node is in a stadium or on a ski slope, then the density of nodes in the vicinity of the given node is likely high, and thus, the number of neighboring nodes is likely to be high. In fact, the network 100 is designed to take advantage of exactly these situations, when a large number of nodes are present in a limited geographical area. For these situations, the preferred 4G or 5G communication between the nodes and the telecommunication network provider is typically impaired by the bandwidth limitations of the network. Thus, an alternative for exchanging short messages and / or pictures or other files between nodes confined in the limited geographical area is the use of the nearby network 100, which is not affected by the limitations of the 4G or 5G telecommunication networks and is independent of the 4G or 5G networks.
[0046] Returning to the various states of the nodes of the network 100, there are four states defined in this embodiment, a known state, a linked state, a lost state, and a secured state. Once the given node detects an advertisement frame from a neighbor node, the given node stores (in a table that is discussed later) the neighboring advertisement information (extracted from the received advertisement frame 200) and registers the neighboring node as “known. ” Thus, all the neighboring nodes may be registered as known. Note that as the given node continuously or intermittently listens for advertisement frames 200, the number of known nodes may change, as the neighboring nodes move in and out of a reaching area of the given node.
[0047] The first time a given node unicasts a contact frame to a known node, the contact frame should include a contact information element (IE) for potential response traffic. The contact frame is used to establish a handshake between the nodes such that the nodes form a connection between themselves (this contact frame can also be used as a heartbeat to check if the destination node is still present) . The IE may include the values of the second field 204 (e.g., PAN ID) and of the third field 206 (e.g., RF channel) of the received advertisement frame 200 associated with the known node. The contact frame may contain additional fields that are necessary for the different applications and use cases for a successful operation. Once the contact frame is acknowledged by the neighboring node, the neighboring node status is changed from “known” to “linked. ” This means that the given node may now exchange information (e.g., pictures or text) with the linked node as the linked node accepted such exchange of information by acknowledging the frame from the given node. In other words, the neighboring node has the freedom to refuse communication, via the nearby network 100, with the given node 110, by refusing to acknowledge the contact frame sent by the given node 110. Note that in this embodiment, the contact frame sent by the given node is different from the advertisement frame 200.
[0048] As noted above, it is possible that a neighboring node is not acknowledging the contact frame broadcasted by the given node 110. After consecutive unicast contact frames failing during a given time period (i.e., kNeighborLostTimeout default to 10s) , the given node changes the state of the neighboring node to the “lost” state.
[0049] For the scenarios in which security / encryption is used between two neighboring nodes (link layer security only) , the neighboring node enters the secured state after the two neighboring nodes exchange credentials to secure the link between them. In this regard, note that the network 100 works differently from other communication standards in the sense that there is no association or pairing between the nodes. The given node is ready to communicate with its neighboring node (at MAC layer level) right after receiving the advertisement frame 200 because the given node knows the neighboring nodes’ MAC address, PAN ID, and RF channel (from the received advertisement frame 200) . If a security protocol is implemented, then there is an additional step, an association step, between the nodes for security purposes.
[0050] The network topology is discussed next. As the nearby network 100 supports bridging, the advertisement frame 200 is an efficient way for each node to be aware of peers and the link quality. FIG. 7 illustrates a configuration 700 in which the given node 110 is in proximity of three nodes 120A, 120B, and 120C. Thus, the three nodes 120A to 120C are the neighboring nodes. The term “neighboring” node is used in this embodiment to mean that a direct communication between the given node 110 and the node 120A (or 120B or 120C) is present. Note that node 120D is not in direct communication with the given node 110. Thus, node 120D is not a neighboring node for the given node 110 in this configuration. However, the node 120D is a neighboring node for node 120B and also for node 102C.
[0051] Each node periodically collects and updates information related to the neighboring nodes not only from the advertisement frames 200, but also from measured key performance indicators (KPIs) associated with the advertisement frames 200. One example of the KPI is the received signal strength indicator (RSSI) . FIG. 8 illustrates a table 800 maintained by each node of the network 100. Table 800 includes a column listing (only) the neighboring nodes (for the embodiment shown in FIG. 7, they are 120A to 120C) , a column listing the MAC addresses of the neighboring nodes (extracted from the corresponding advertisement frames 200) , a column listing the RF channels for each neighboring node (also extracted from the corresponding advertisement frames 200) , and a column listing the RSSI for each neighboring node (measured by the given node based on the received signal carrying the advertisement frame 200) . Other KPI may be used by the given node. The information in table 800 may be used by the routing algorithm to find the best path for a message delivery from the given node 110 to a non-neighboring node 120D.
[0052] In one embodiment, the advertisement frame 200 is an enhanced beacon with no security. A beacon refers to a signal used to transmit periodic messages to indicate the presence of an associated device or provide information. These messages are typically used for purposes such as navigation, synchronization, discovery, or data transmission. For example, a Wi-Fi access point broadcasts beacons at regular intervals to announce their presence, network name (SSID) , and other capabilities to nearby devices. In this embodiment, the advertisement frame 200 includes a contact header IE 900, which is a vendor specific command as illustrated in FIG. 9. The contact header IE 900 includes three octets, defined by the Organizationally Unique Identifier (OUI) , which is an identifier used to uniquely identify a vendor, manufacturer, or organization in networking and telecommunications. The contact IE 900 includes a first octet that indicates a subtype (which is part of the MAC address, field 202 in FIG. 2, and the subtype is associated with a particular device, model, or type of product, for example, the type of node) , a second octet that indicates the PAN ID (field 204 in FIG. 2) , and a third octet that indicates the communication channel (field 206 in FIG. 2) . In one embodiment, the contact IE 900 may be modified to further include a short address, so that in some cases the nodes do not have to use a 64-bit extended address for communication. In another embodiment, the contact IE 900 may include one or more reserved slots, that may be used with further functionalities of the network.
[0053] The source address mode preferably uses the extended address, and a destination address shall not be present. To keep the advertisement frame 200 most efficient, the Sequence Number may be suppressed, and neither the source PAN ID nor the destination PAN ID have to be present. This optimization is used to reduce as much as possible the air time of the advertisement frame for maximum spectral efficiency. For sleepy nodes, the advertisement frame may include the CSL header IE so that the other nodes know when the sleepy nodes are OFF and when they turn their Rx ON.
[0054] The payload field 1000 of the advertisement frame 200 shall be formatted as illustrated in FIG. 10, where the protocol ID indicates the protocol or standard that is used for transmitting the advertisement frame 200. In this embodiment, the protocol ID is fixed to 0x04 to allow coexistence with other protocols. Note that currently the OpenThread protocol specifies 0x03 for their defined format. The payload field 1000 is one octet, and in addition to the protocol ID also includes a content field called Content. The configuration of the Content is illustrated in FIG. 11 and should include zero or more advertising elements (AE) . Examples of AEs are illustrated in the table of FIG. 12. Note that the payload field 1000 together with the contact header IE 900 include all the information of the advertisement frame 200 shown in FIG. 2. In other words, FIG. 2 illustrates the content of the advertisement frame 200 while FIGs. 9 to 12 illustrate the structure / configuration of the advertisement frame 200.
[0055] The device name (field 218 in FIG. 2 and type 1 in FIG. 12) may contain a unicode transformation format –8bit (UTF-8) encoded string that is representative of the node’s name (e.g., “Alice’s Pixel” phone) . The UTF-8 is used as an encoding standard for representing text in digital communications. Other protocols may be used for encoding.
[0056] The node matcher (field 216 in FIG. 2 and type 2 in FIG. 12) is used by the receiving node (e.g., the given node 110 receiving data from a neighboring node 120A) for filtering the peer nodes that have a desired service and / or service data. For example, the given node 110 may desire to communicate only with Pixel nodes, or nodes that run the Google messaging system, or nodes that use the WhatsUp application. For example, a node that is a Pixel smartphone may filter out all nodes that are not Pixel smartphones as only the Pixel smartphones may provide a desired functionality. In one embodiment, the advertisement frame 200 may format the node matcher field to have the configuration shown in FIG. 13, so that service data of interest is broadcasted by the neighboring nodes and the given node can then select the desired node from the neighboring nodes. An advertisement frame may include multiple node matchers.
[0057] The service list (field 220 in FIG. 2 and type 3 in FIG. 12) includes a list of services that the advertising nodes support. For example, a Pixel phone supports Google messaging, but a phone with another operating system (Phone B) does not support such messaging system. In this example, Pixel and Phone B would not be able to establish a connection since they do not have a common service that both supports and can communicate. In one embodiment, the receiver node computes the peer’s supported services by combining this list of services with services included in the node matcher AEs. For example, all the nodes desired to be discovered should periodically advertise their rendezvous data, which includes the service ID. The application subscribes to those peer nodes for which there is an interest in the services associated with the service IDs. The nearby network manager (which is discussed in more details in sister application “Seamless connection, authentication, and encryption for nearby network devices, ” Serial No.zz / mmm, nnn, docket no. 0683-109, filed on the same day as the current application, and assigned to the same assignee, the entire content of which is incorporated herein by reference) is configured to notify the application when an interested peer is found or lost.
[0058] A P2P wireless communication method 1400 performed by a node (aUE 110 in this case) for establishing awareness of a first peer UE 120A is now discussed with regard to FIG. 14. The method includes receiving 1402, from the first peer UE 120A, a first advertisement frame 200 including a medium access control, MAC, address 202, and a personal area network identifier, PAN ID, 204, associated with the first peer UE, storing 1404, at the first UE 110, the MAC address 202 and the PAN ID 204 in a peers table 800, registering 1406 the first peer UE 120A with a connection state, and broadcasting 1408, to a second peer UE 120B, a second advertisement frame 200 including information related to the UE 110.
[0059] The UE stores the content of the first advertisement frame in the peers table only when the first advertisement frame is received directly from the first peer UE. The first advertisement frame further includes at least one of: a radio frequency, RF, channel, a coordinated sampled listening, CSL, period and phase, group ID, application ID, user ID, node matcher, device name, and service list. The broadcasting is performed during a first period of time, and the method further includes listening, during a second period of time, for advertisement frames from peer UEs.
[0060] The broadcasting occurs over a number N of fixed channels, where N is smaller than a number M of all available channels. The UE uses a single channel for listening and is configured to listen for the first advertisement frame on the single channel for a period longer than a sum of the first and second periods, to discover the first peer UE. The method further includes assigning a linked status to the connection state of the first peer UE when the UE unicasts, for a first time, a frame to the first peer UE, and the first peer UE acknowledges receiving the frame. The method assigns a lost status to the connection state of the first peer UE when the UE unicasts multiple times a frame to the first peer UE, and the first peer UE fails to acknowledge receiving the frame. The method assigns a secured status to the connection state of the first peer UE when security is enabled between the UE and the first peer UE. The security is enabled between the UE and the first peer UE at a link layer level.
[0061] The method may also include exchanging data between the UE and the first peer UE with no prior association or pairing mode. Any two UEs of the UE, the first peer UE, and the second peer UE have the same rank and use a same advertisement frame configuration. The method may also include measuring a parameter associated with a signal received from the first peer UE and adding a value of the measured parameter to the peer table for routing purposes. The first advertisement frame further includes: a node matcher field indicative of the first peer UE having a desired service and / or service data, and a service list field indicative of the first peer UE having a desired technical capability.
[0062] In another embodiment, a UE 110 is configured to establish a peer-to-peer wireless communication method with a first peer UE 120A. For this embodiment, the UE 110 includes a transceiver 114 configured to receive 1402, from the first peer UE 120A, a first advertisement frame 200 including a medium access control, MAC, address 202, and a personal area network identifier, PAN ID, 204 associated with the first peer UE 120. The UE also includes a storage media 117 configured to store 1404 the MAC address 202 and the PAN ID 204 in a peers table 800, and a processor 116 configured to register 1406 the first peer UE 120 with a connection state. The transceiver 114 is further configured to broadcast 1408 to a second peer UE 120B, a second advertisement frame 200 including information related to the UE 110.
[0063] The first advertisement frame further includes at least one of: a radio frequency, RF, channel, a coordinated sampled listening, CSL, period and phase, a group ID, an application ID, a user ID, a node matcher, a device name, and a service list. The transceiver broadcasts the second advertisement frame during a first period and the transceiver is configured to listen, during a second period of time, for advertisement frames from peer UEs. The transmitter is configured to transmit over a number N of fixed channels, where N is smaller than a number M of all available channels. In one embodiment, the UE uses a single channel for listening and is configured to listen for the first advertisement frame on the single channel for a period longer than a sum of the first and second periods, to discover the first peer UE.
[0064] The processor is further configured to: assign a linked status to the connection state of the first peer UE when the UE unicasts, for a first time, a frame to the first peer UE, and the first peer UE acknowledges receiving the frame, assign a lost status to the connection status of the first peer UE when the UE unicasts multiple times a frame to the first peer UE, and the first peer UE fails to acknowledge receiving the frame, and / or assign a secured status to the connection state of the first peer UE when security is enabled between the UE and the first peer UE. The security is enabled between the UE and the first peer UE at a link layer level. In one embodiment, data exchange is performed between the UE and the first peer UE with no prior association or pairing mode. This means that two UEs of the UE, the first peer UE, and the second peer UE have the same rank and use a same advertisement frame configuration.
[0065] In one embodiment, the processor is further configured to measure a parameter associated with a signal received from the first peer UE and add a value of the measured parameter to the peer table for routing purposes.
[0066] The first advertisement frame further includes a node matcher field indicative of the first peer UE having a desired service and / or service data, and a service list field indicative of the first peer UE having a desired technical capability.
[0067] The nearby network 100 discussed in the above embodiments may be implemented at one or more layers. For example, FIG. 15 shows a stack configuration 1500 having a physical layer (PHY) 1502, a MAC layer 1504, a network layer 1506, a transport layer 1508, and an application layer 1510. The nearby network 100 may be implemented, in this example, at the MAC layer 1504, the network layer 1506, and the transport layer 1508. The PHY layer 1502 may include a 802.15.4 PHY component, a bluetooth (BT) PHY component, and a 802.11 PHY component. The MAC layer 1504 may include a 802.15.4 MAC component, a BT MAC component, and a 802.11 MAC component.
[0068] FIG. 16 illustrates the functionalities of each layer for the nearby network 100. For example, the rendezvous advertisement 200 is hosted by the application layer 1510. The transport layer 1508 is configured to support user datagram protocol (UDP) and transmission control protocol (TCP) . The nearby network 100 is configured with a routing method (discussed in more details in sister application titled “Routing methods and apparatuses for nearby network communication, ” Serial No. xx / yyy, zzz, docket no. 0683-108, filed on the same day as the present application and assigned to the same assignee, the entire content of which is included herein by reference) that works in the network layer 1506. The routing method may be proactive and / or reactive. A 6LoWPAN protocol that allows IPv6 to be used over low-power wireless personal area networks (LPWAN) may be implemented in the network layer 1506 and used by the nearby network 100. The nearby network 100 is configured to use a unicast approach. The nearby network is configured to support a peer-to-peer topology in the link layer 1504, with no authorization required for communication. The encryption in this layer is optional, for example, may be deferred to the application layer. Multiple channels are allowed in the link layer 1504 and multiple PAN IDs may be used.
[0069] Reference throughout this section to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with an embodiment is included in at least one embodiment. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment” in various places throughout the specification are not necessarily all referring to the same embodiment. Further, the particular features, structures or characteristics may be combined in any suitable manner in one or more embodiments.
[0070] Numerical adjectives “first” , “second” , and “third” do not imply any order (are not ordinals) but are markers to distinguish separate instances of similar elements. References to the singular (e.g., “a” or “an” , “the” ) should include the plural unless clearly indicated otherwise.
[0071] As used herein, a phrase referring to “at least one of” or “one or more of” a list of items refers to any combination of those items, including single members. For example, “at least one of: a, b, or c” is intended to cover the possibilities of: a only, b only, c only, a combination of a and b, a combination of a and c, a combination of b and c, and a combination of a and b and c.
[0072] Although the features and elements of the present embodiments are described in the embodiments in particular combinations, each feature or element can be used alone without the other features and elements of the embodiments or in various combinations with or without other features and elements disclosed herein. The methods or flowcharts may be implemented in a computer program, software or firmware tangibly embodied in a computer-readable storage medium for execution by a specifically programmed computer or processor.
Claims
1.A peer-to-peer wireless communication method (1400) performed by a user equipment, UE, (110) for establishing awareness of a first peer UE (120A) , the method comprising:receiving (1402) , from the first peer UE (120A) , a first advertisement frame (200) including a medium access control, MAC, address (202) , and a personal area network identifier, PAN ID (204) associated with the first peer UE (120A) ;storing (1404) , at the UE (110) , the MAC address (202) and the PAN ID (204) in a peers table (800) ;registering (1406) the first peer UE (120A) with a connection state; andbroadcasting (1408) , to the first peer UE (120A) and a second peer UE (120B) , a second advertisement frame (200) including information related to the UE (110) .2.The method of Claim 1, wherein the UE stores a content of the first advertisement frame in the peers table only when the first advertisement frame is received directly from the first peer UE.3.The method of Claim 1 or 2, wherein the first advertisement frame further includes at least one of: a radio frequency, RF, channel, a coordinated sampled listening, CSL, period and phase, group ID, application ID, user ID, node matcher, device name, and service list.4.The method of any of Claims 1 to 3, wherein the broadcasting is performed during a first period of time, and the method further comprises:listening, during a second period of time, for advertisement frames from peer UEs.5.The method of Claim 4, wherein the broadcasting occurs over a number N of fixed channels, where N is smaller than a number M of all available channels.6.The method of Claim 4, wherein the UE uses a single channel for listening and is configured to listen for the first advertisement frame on the single channel for a period longer than a sum of the first and second periods, to discover the first peer UE.7.The method of any of Claims 1 to 6, further comprising:assigning a linked status to the connection state of the first peer UE when the UE unicasts, for a first time, a contact frame to the first peer UE, and the first peer UE acknowledges receiving the contact frame.8.The method of any of Claims 1 to 7, further comprising:assigning a lost status to the connection state of the first peer UE when the UE unicasts multiple times a contact frame to the first peer UE, and the first peer UE fails to acknowledge receiving the contact frame.9.The method of any of Claims 1 to 8, further comprising:assigning a secured status to the connection state of the first peer UE when security is enabled between the UE and the first peer UE.10.The method of Claim 9, wherein the security is enabled between the UE and the first peer UE at a link layer level.11.The method of any of Claims 1 to 10, further comprising:exchanging data between the UE and the first peer UE with no prior association or pairing mode.12.The method of any of Claims 1 to 11, wherein any two UEs of the UE, the first peer UE, and the second peer UE have a same rank and use a same advertisement frame configuration.13.The method of any of Claims 1 to 12, further comprising:measuring a parameter associated with the first advertisement received from the first peer UE; andadding a value of the measured parameter to the peer table for routing purposes.14.The method of any of Claims 1 to 13, wherein the first advertisement frame further includes:a node matcher field indicative of the first peer UE having a desired service and / or service data; anda service list field indicative of the first peer UE having a desired technical capability.15.A computer readable medium arranged to implement the method according to claim 1.16.A user equipment, UE, (110) configured to establish a peer-to-peer wireless communication method with a first peer UE (120A) , the UE (110) comprising:a transceiver (114) configured to receive (1402) , from the first peer UE (120A) , a first advertisement frame (200) including a medium access control, MAC, address (202) , and a personal area network identifier, PAN ID (204) associated with the first peer UE (120) ;a storage media (117) configured to store (1404) the MAC address (202) and the PAN ID (204) in a peers table (800) ;a processor (116) configured to register (1406) the first peer UE (120) with a connection state; andthe transceiver (114) being further configured to broadcast (1408) to the first peer UE (120A) and a second peer UE (120B) , a second advertisement frame (200) including information related to the UE (110) .17.The UE of Claim 16, wherein the first advertisement frame further includes at least one of: a radio frequency, RF, channel, a coordinated sampled listening, CSL, period and phase, a group ID, an application ID, a user ID, a node matcher, a device name, and a service list.18.The UE of Claim 16 or 17, wherein the transceiver broadcasts the second advertisement frame during a first period of time and the transceiver is configured to:listen, during a second period of time, for advertisement frames from peer UEs.19.The UE of Claim 18, wherein the transceiver transmits over a number N of fixed channels, where N is smaller than a number M of all available channels.20.The UE of Claim 18, wherein the UE uses a single channel for listening and is configured to listen for the first advertisement frame on the single channel for a period longer than a sum of the first and second periods, to discover the first peer UE.21.The UE of any of Claims 16 to 20, wherein the processor is further configured to:assign a linked status to the connection state of the first peer UE when the UE unicasts, for a first time, a contact frame to the first peer UE, and the first peer UE acknowledges receiving the contact frame.22.The UE of any of Claims 18 to 21, wherein the processor is further configured to:assign a lost status to the connection status of the first peer UE when the UE unicasts multiple times a contact frame to the first peer UE, and the first peer UE fails to acknowledge receiving the contact frame.23.The UE of any of Claims 18 to 22, wherein the processor is further configured to:assign a secured status to the connection state of the first peer UE when security is enabled between the UE and the first peer UE.24.The UE of Claim 23, wherein the security is enabled between the UE and the first peer UE at a link layer level.25.The UE of any of Claims 18 to 24, wherein data exchange is performed between the UE and the first peer UE with no prior association or pairing mode.26.The UE of any of Claims 18 to 25, wherein any two UEs of the UE, the first peer UE, and the second peer UE have a same rank and use a same advertisement frame configuration.27.The UE of any of Claims 18 to 26, wherein the processor is further configured to:measure a parameter associated with the first advertisement frame received from the first peer UE; andadd a value of the measured parameter to the peer table for routing purposes.28.The UE of any of Claims 18 to 27, wherein the first advertisement frame further includes:a node matcher field indicative of the first peer UE having a desired service and / or service data; anda service list field indicative of the first peer UE having a desired technical capability.
