Method and apparatus for accessing network node without route discovery

By using single-hop and multi-hop communication protocols in large wireless lighting networks, the source routing is recursively constructed, the problem of high routing discovery is solved, efficient node access and status information collection is achieved, and signaling workload and network are reduced. Delay.

CN119096597APending Publication Date: 2024-12-06SIGNIFY HOLDING BV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202380033697.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2022-04-11
Filing Date
2023-04-05
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

In large wireless lighting networks, the routing discovery process is expensive, especially when the number of network nodes increases, resulting in large signaling workloads and affecting efficiency.

Method used

By using a single hop communication protocol (such as BLE) between the user equipment and the proxy device and using a multi-hop communication protocol (such as Zigbee) within the wireless communication network, recursively constructing the source route until Find all network nodes to reduce the need for the routing discovery process.

Benefits of technology

It realizes connecting to network nodes without routing discovery, reducing signaling workload, improving the efficiency of node access and status information collection, and reducing network delay.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119096597A_ABST
    Figure CN119096597A_ABST
Patent Text Reader

Abstract

The present invention provides network access to a network node (e.g., a Zigbee node) without routing discovery through combined reading of a neighbor table and source routing. The electrified nodes can be found by repeatedly reading the neighbor tables of all the nodes in the network. A neighbor table of neighbors listed in a neighbor table of a first node is read by providing a source route that can be obtained by tracking from which node the neighbor table is read. Route selection may be controlled based on route quality (e.g., path cost). The result of the process is a source route list to all nodes. Source routing may then be used to communicate with all nodes in the network (e.g., to read the optical state).
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of wireless communication networks, such as but not limited to radio frequency (RF) wireless mesh networks, where many-to-one route requests are used to establish routes. Background Art

[0002] There is an ongoing trend towards more and more connected lighting systems, which enable a wide variety of new features such as (remote) scheduling, energy monitoring, sensor-based lighting control and asset management. In many cases, these systems are installed in existing buildings, in which case a wireless network is preferred to avoid having to deploy new cables (for lighting control) through the ceiling. Examples of such wireless network protocols widely used in current practice are open standard protocols such as Zigbee, Thread, Bluetooth Low Energy (BLE), BLE Mesh, Wi-Fi, Wi-Fi Direct, as well as various proprietary network implementations built on top of the IEEE 802.15.4, IEEE 802.15.1 or IEEE 802.11 standards.

[0003] Lighting networks, such as Zigbee networks, are becoming larger and larger, so that up to 100 nodes can be installed. In order to reach the network nodes, Ad Hoc On-Demand Distance Vector (AODV) route discovery based on a broadcast mechanism can be used. In AODV, nodes discover routes in a request-response cycle. The node requests a route to the destination by broadcasting a route request (RREQ) message to all its neighbors. When a node receives a RREQ message but does not have a route to the requested destination, it in turn broadcasts a RREQ message. In addition, it also remembers the reverse route to the requesting node, which can be used to forward subsequent responses to the RREQ. The process is repeated until the RREQ reaches a node with a valid route to the destination. The node (which can be the destination itself) responds with a route reply (RREP) message. The RREP message is unicast along the reverse route of the intermediate nodes until it reaches the original requesting node. Therefore, at the end of this request-response cycle, a bidirectional route is established between the requesting node and the destination.

[0004] Therefore, the larger the network, the more expensive route discovery becomes. Consider a Zigbee network with 20 nodes. A bridge or gateway can see 15 neighbors and requires 5 route discoveries, for which approximately 200 messages need to be sent. In a Zigbee network with 100 nodes, the bridge / gateway can see 26 neighbors, as this is the common maximum number of neighbors that still fits into a single link state message. While it would be possible to register more neighbors and send multiple link state messages, this is rarely used. Therefore, for a network of 100 nodes, if the application wants to communicate with all nodes in the network, 74 routes need to be discovered. Since a single route discovery can easily require 200 messages in a network of 100 nodes, 74 discoveries will require approximately 15,000 messages.

[0005] Canadian patent application CA 2922449 A1 discloses a method for optimizing routing in a local dense network. A packet is received at a first network device in the network. An optimal route for the packet to a neighboring network device in the network is determined using a source routing table (SRT), wherein the SRT includes an optimized routing table and a standard routing table, and wherein the optimized routing table includes a list of neighboring network devices to which the first network device can be directly routed, and wherein the standard routing table includes a Zigbee source routing table. Preferably, the packet is routed using the best route. Summary of the invention

[0006] An object of the present invention is to provide a node access solution for user equipment joining a mesh network to reduce signaling workload.

[0007] This object is achieved by a user device as claimed in claim 1 , a system as claimed in claim 12 , a method as claimed in claim 14 and a computer program product as claimed in claim 16 .

[0008] According to a first aspect, there is provided a user equipment for accessing a wireless communication network, comprising means for controlling the user equipment to provide access to a network node of the wireless communication network via a proxy device, wherein communication between the user equipment and the proxy device uses a single-hop communication protocol, and communication within the wireless communication network uses a multi-hop communication protocol, and wherein the means is configured to:

[0009] retrieving, from the proxy device, neighbor information about at least one neighbor node of the proxy device; and

[0010] constructing source routes to network nodes by connecting to retrieved neighbor nodes using source routing, and

[0011] Neighbor tables of network nodes discovered in the wireless communication network are recursively retrieved while tracing source routes until all desired network nodes of the wireless communication network, including the network node, are found and source routes to those network nodes in the wireless communication network are obtained.

[0012] According to a second aspect, there is provided a method for controlling a user equipment to provide access to a network node of a wireless communication network via a proxy device, wherein communication between the user equipment and the proxy device uses a single-hop communication protocol and communication within the wireless communication network uses a multi-hop communication protocol,

[0013] The method includes:

[0014] retrieving, from the proxy device, information about at least one neighbor node of the proxy device; and

[0015] constructing source routes to network nodes by connecting to retrieved neighbor nodes using source routing, and

[0016] Neighbor tables of network nodes discovered in the wireless communication network are recursively retrieved while tracing source routes until all desired network nodes of the wireless communication network, including the network node, are found and source routes to those network nodes in the wireless communication network are obtained.

[0017] According to a third aspect, a system is provided, comprising at least one user device of the first aspect and at least one proxy device for providing access to a network node of a wireless communication network, wherein the proxy device is a combined node configured to communicate with the user device by using a single-hop communication protocol (particularly a BLE protocol) and to communicate with the network node of the wireless network by using a multi-hop communication protocol (particularly a Zigbee protocol).

[0018] According to a fourth aspect, there is provided a computer program product comprising code means for producing the steps of the method of the above second aspect when run on a controller device.

[0019] Thus, an external node (i.e., a user device) can connect to a (mesh) network without requiring a route discovery process. Instead, upon connecting to the network, the external node recursively continues to read the neighbor table of available nodes in the mesh network while tracking the source route. To prevent the node from needing to discover the route to the external node, the external node can initiate a many-to-one route request before reading the neighbor table.

[0020] Although it may be possible to establish source routes to all desired nodes according to the above aspects, the process may be configured to stop when source routes to all desired nodes have been found. It is not given that when a user device is connected to a mesh network, it needs to read information from all nodes in the network to control the network nodes in the room.

[0021] However, optionally, the device in the user equipment can be configured to recursively read the neighbor table of the network node in the wireless network, while tracking the source route, until no new network node is found and a list of source routes to all available network nodes in the wireless network is obtained. Therefore, an efficient node discovery and access solution can be provided based on the available source routing and neighbor table provision mechanism.

[0022] Therefore, retrieving the state of a node and / or controlling a node can be achieved by combining the reading of a neighbor table with source routing. More specifically, the method is to read the neighbor table of a first node to obtain a list of neighbors. Next, the neighbor tables of these neighbors are read. When the process is repeated until no new nodes are found, the process terminates. As a result, a list of all powered-on nodes in the network is obtained. By combining the reading of a neighbor table with source routing, a list of routes to all nodes in the network is obtained. Source routing can be achieved by tracking the sequence of steps required to reach a neighbor's neighbor. The use of source routing provides fine-grained control of the discovery process for external nodes and reduces the overhead of device discovery because it no longer requires flooding and / or broadcasting. Therefore, all powered-on nodes and routes can be found. No additional time is required for powered-off nodes. Attempting AODV route discovery for powered-off nodes will eventually result in a timeout (e.g., approximately 1.6 seconds in a Zigbee network). AODV route discovery is based on broadcasting. In a Zigbee network, a broadcast transaction table is provided to keep track of ongoing broadcasts and thereby limit the number of broadcasts to approximately 3 per second.

[0023] Consider a lighting network that should be accessed via BLE using Zigbee Direct (proxy) nodes. A user device (e.g., a mobile phone) is connected to a BLE / Zigbee proxy node and wants to read the status of all lights. When the user starts the app, the number of routes is unknown. The proxy node may have a list of available routes based on previous use, but if the proxy node is restarted, there may not be any available routes. Consider a network of 30 nodes. If the proxy node sees 15 neighbor nodes and there are no other routes, 15 route discoveries are required, which requires approximately 900 messages. Combining the reading of the neighbor table with source routing, it will be necessary to read the neighbor table of 30 nodes. Because the neighbor table entries are very large (e.g., 22 bytes), 10 to 12 read operations and responses may be required to obtain the neighbor table. Therefore, reading the neighbor table of all nodes will require approximately 2*12*30=720 messages. In order to improve the efficiency of reading the neighbor table, new vendor-specific attributes or Zigbee Cluster Library (ZCL) commands can be used. Such attributes or commands will only provide neighbor table data relevant to the algorithm. For example, not reporting the extended panId and extended address reduces the 22-byte payload by 16 bytes. It is sufficient to provide a 16-bit network address, a representation of the link cost, and some flags, which allows up to 25 neighbors to be provided in a single read. This is especially important for obtaining optimized access times in isolated networks. Subsequently, regular OADV route discovery can be applied at slower intervals (e.g., 1 route every 3 seconds) to replace source routing.

[0024] According to the first option of any one of the first to fourth aspects, the apparatus may include a Zigbee VirtualDirect (ZVD) device function for connecting to a Zigbee Direct device (ZDD) included in a proxy device. Thus, a tunneling protocol may be used for direct access between a user device and a proxy device without the need for additional gateway hardware.

[0025] In one example, the neighbor table may be read by using the Zigbee Mgmt_Lqi_req command or a vendor specific command or attribute.

[0026] According to the second option of any one of the first to fourth aspects which can be combined with the first option, a directed source-routed state information request can be issued to collect state information from discovered network nodes of the wireless network. Thus, the state of the retrieved neighbor nodes can be obtained with little signaling workload, so that the signaling load on the wireless network can be minimized.

[0027] According to the third option of any one of the first to fourth aspects which can be combined with the first or second option, once a controllable node is discovered while topology detection is still in progress, node discovery and state information collection can be balanced by utilizing the parallelism between neighbor detection and state information collection. Thus, the time delay involved in the process of constructing a source route to access a specific target node can be reduced.

[0028] According to the fourth option of any one of the first to fourth aspects that can be combined with any one of the first to third options, node discovery and status information collection can be controlled by prioritizing at least one of obtaining status information of discovered controllable devices, obtaining status information of controllable devices in a target room, obtaining status information of controllable devices displayed on a user interface of a user device, and obtaining status information of controllable devices in a current room. Therefore, by concentrating the node discovery and status information collection process on network nodes of a predetermined area and / or type, the time delay involved in the process of constructing a source route to access a specific target node can be reduced.

[0029] According to a fifth option of any one of the first to fourth aspects which can be combined with any one of the first to fourth options, a many-to-one routing request can be initiated before obtaining neighbor information. This measure provides the following advantage: the network node is informed about available routes back to the user equipment or proxy device to minimize the signaling load required to forward a response to the user equipment.

[0030] According to the sixth option of any one of the first to fourth aspects that can be combined with any one of the first to fifth options, a source route can be constructed by tracking the sequence of steps required to reach a neighbor node of a neighbor node. Therefore, effective source routing can be achieved by tracking the process of neighbor node discovery.

[0031] According to the seventh option of any one of the first to fourth aspects which can be combined with any one of the first to sixth options, the calculation cost of the registered source route of the retrieved neighbor node can be compared with the calculation cost of the obtained new source route of the retrieved neighbor node to decide whether to replace the registered source route with the new source route. Thus, the cheapest source route is registered for the retrieved neighbor node to optimize the source routing process.

[0032] According to an eighth option of any one of the first to fourth aspects that can be combined with any one of the first to seventh options, link quality information can be obtained from neighbor information and used for cost calculation of source routing. Therefore, the cost calculation of source routing can be optimized by considering the quality of available links on the source routing.

[0033] According to a ninth option of any one of the first to fourth aspects that can be combined with any one of the first to eighth options, the retrieved neighbor node can be configured to reverse the source route and use the reversed source route as routing information to route the response to the user device. Therefore, the retrieved neighbor node can derive an available route back to the user device or the proxy device to minimize the signaling load required to forward the response to the user device.

[0034] Note that the above-mentioned apparatus may be implemented based on an arrangement of discrete hardware circuits, integrated chips, or chip modules having discrete hardware components, or based on a signal processing device or chip controlled by a software routine or program stored in a memory, written on a computer-readable medium, or downloaded from a network (such as the Internet).

[0035] It shall be understood that the user equipment of claim 1, the system of claim 12, the method of claim 14 and the computer program product of claim 16 may have similar and / or identical preferred embodiments, in particular as defined in the dependent claims.

[0036] It shall be understood that a preferred embodiment of the invention can also be any combination of the dependent claims or the above-described embodiments with the respective independent claim.

[0037] These and other aspects of the invention will be apparent from and elucidated with reference to the embodiments described hereinafter. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] In the following drawings:

[0039] Figure 1 schematically illustrates a block diagram of a network architecture in which various embodiments may be implemented;

[0040] Figure 2 A block diagram of a user equipment with a node access function according to various embodiments is schematically shown;

[0041] Figure 3 shows a flow chart of a node determination and routing selection process according to various embodiments;

[0042] Figure 4 schematically illustrates an exemplary network structure having five network nodes; and

[0043] Figure 5 The following is used to explain the Figure 4 An exemplary table of node determination and route selection processes for an exemplary network structure. DETAILED DESCRIPTION

[0044] Various embodiments of the present invention are now described based on a wireless communication system (such as but not limited to a Zigbee lighting network). In a Zigbee network, a many-to-one route request (MTORR) can be used in combination with source routing. MTORR will enable nodes in the network to establish a path to the node initiator with limited overhead. This may be useful in wireless sensor networks, where a gateway / bridge sends an MTORR, which enables the sensor to then reach the gateway / bridge. When a sensor has data that it wants to send to the gateway / bridge, it also sends a route record that contains the route to the sensor. The gateway / bridge can store the received route records and build a source routing table. When the gateway / bridge wants to read additional data from the sensor, it can include the source route in the message. The source route is essentially a jump list attached to the message.

[0045] However, in a lighting network that includes lighting nodes but no gateway or bridge, and in the case where a mobile device is connected to the network with the help of a nearby lighting node and wants to retrieve the status of a light in the lighting network, this solution is not easily applicable. In such a scenario, the light will need to initiate communication to retrieve the status of the light nodes in the network. In one example, it may be possible to broadcast a read status message to all lighting nodes, get responses from all lighting nodes, and collect source routes. However, since all lighting nodes respond at the same time, this may result in a broadcast storm, and / or an inability to receive the status of all responding lighting nodes.

[0046] In a system with gateways or bridges, routes can be collected over long periods of time. However, there are several situations where routes to many nodes are needed:

[0047] In a standalone setting (e.g., Zigbee Direct), a mobile phone can connect to a Zigbee network through a proxy node. The proxy node may not have many routes set up to other nodes in the network, and the mobile phone's running application ("app") can be configured to quickly display light status and allow the user to control any light. An additional advantage of the present invention is that the mobile phone - which is now a powerful computing platform with ample memory and processing power - can collect the information and perform all relevant processing, while the resource requirements on the network nodes (lights, switches) remain low.

[0048] In a standalone network (e.g., without a gateway), it may be desirable to access all nodes with a mobile device. For example, to deploy a new timer schedule or read energy statistics.

[0049] In systems with gateways, routing may need to be reestablished after a power failure. This means that in large networks it will take quite a while before the network is operational again after a restart.

[0050] According to various embodiments, a node access mechanism is provided that enables communication with all nodes in a network without the use of route discovery commands.

[0051] Figure 1 The architecture of a Zigbee mesh network 100 with Zigbee / BLE (Z / B) combination nodes 101 , 103 is shown in which various embodiments may be implemented.

[0052] Note that throughout this disclosure, the structure and / or function of a block having the same reference numeral as previously described will not be described again unless additional specific functions are involved. In addition, only those structural elements and functions that are helpful for understanding the embodiments are shown. For the sake of brevity, other structural elements and functions are omitted.

[0053] When considering wireless networks, "standalone connected" wireless networks have been proposed that can operate without a gateway. Using a BLE connection from a mobile device 104 to a Zigbee / BLE combination node 101 (e.g., a retrofit luminaire), such an independently connected wireless network can be set up and configured, for example as a Zigbee network and the devices therein, by an application on a mobile device (user device) 104 (such as a smartphone). The Zigbee / BLE combination node 101 to which the mobile device 104 is connected via BLE can be used as a proxy in the Zigbee network. By connecting to a single Zigbee / BLE combination node 101 via BLE, the mobile device 104 can connect to and control any of the other nodes 102, 103 in the Zigbee mesh network 100.

[0054] In one example, the combined nodes 101 and 103 can be Zigbee Direct devices (ZDDs) configured to allow external devices (e.g., mobile devices 104) to connect to the Zigbee network 100. Zigbee Direct is a standard that creates a tunneling protocol between Zigbee and Bluetooth Low Energy (BLE) devices without the need for additional gateway hardware. It leverages the Generic Attribute Profile (GATT) of BLE. A Zigbee Virtual Device (ZVD) is provided on an external device (e.g., mobile device 104) (e.g., as an app) and acts as a central device, and the ZDD (e.g., combined nodes 101, 103) acts as a peripheral device. If the ZDD is ready to connect to one or more ZVDs, it sends a connectable advertisement. Upon connection (and authentication), the ZVD is added to the neighbor or child table of the ZDD and is treated by the local stack as another Zigbee device (e.g., with a different MAC identifier).

[0055] In an exemplary Zigbee Direct setup, a ZVD (e.g., a mobile phone) can scan for BLE devices. To identify whether a BLE device is a ZDD or any other type of device, the underlying Zigbee Direct specification can define what data should be provided in an advertisement (e.g., a beacon). To create a ZDD, the advertisement can include a 16-bit Zigbee Direct service identifier (e.g., "0xFFF7"). The service identifier can be standardized using the Bluetooth Special Interest Group (SIG) and can be registered for use by the Zigbee Connection Standards Alliance (CSA). In addition, a personal network area (PAN) identifier (panID) can be provided in a ZDD advertisement. Based on the panID, the ZVD can filter whether the BLE device belongs to the network it wants to connect to. For convenience, the advertising data can also contain the short address of the ZDD. When the ZVD has detected a ZDD, it can set up a connection to a ZDD. The selection can be based on other parameters such as, for example, the most recently used (one or more) or received signal quality (e.g., received signal strength indication (RSSI)).

[0056] In this way, the mobile device 104 can be used to directly communicate with one of the combination nodes 101, 103 that supports both Zigbee and BLE protocols. In an embodiment, the combination nodes 101, 103 can use a combination chip that is arranged to operate according to one of two different communication protocols (e.g., a single-hop communication protocol (such as BLE) and a multi-hop communication protocol (such as Zigbee)) at a time. Therefore, part of the processing resources can be reused to provide a more cost-effective solution. Alternatively, the combination chip can include one or more chips or transceivers that enable the device to operate in parallel in two networks. In one example, two independent chips can be placed back to back to bridge two different wireless networks.

[0057] In computer networking, source routing (sometimes also called "path addressing") allows the sender of a packet to partially or completely specify the route the packet takes through the network. In contrast, in traditional routing, routers in the network determine the path step by step based on the packet's destination. Source routing allows for easier troubleshooting, improves traceroutes, and enables nodes to discover all possible routes to a host.

[0058] Dynamic Source Routing (DSR) is a routing protocol for wireless mesh networks. It is similar to AODV in that it forms routes on demand when a transmitting node requests a route. However, it uses source routing instead of relying on routing tables at each intermediate device. More specifically, DSR is an on-demand protocol designed to limit the bandwidth consumed by control packets in self-organizing wireless networks by eliminating the periodic table update messages required in table-driven methods. The main difference between this on-demand routing protocol and other on-demand routing protocols is that it is beaconless and therefore does not require periodic hello packet (beacon) transmissions, which nodes use to inform their neighbors of its existence. The basic approach of this protocol (and all other on-demand routing protocols) during the route construction phase is to establish routes by flooding route request packets in the network. The destination node, upon receiving a route request packet, responds by sending a route reply packet back to the source, which carries the route traversed by the received route request packet.

[0059] In a conventional Zigbee network, each Zigbee router node may send a link status message approximately every 15 seconds. Using this link status message, neighboring nodes will be able to update their neighbor tables with the correct link costs (output link costs) of their neighbors as measured by these neighbors. The link status message may be a single-hop broadcast message.

[0060] Routing protocols use the "cost" of a link as a metric to attempt to describe the loss of using a particular link. The shortest path would then be the path with the least loss or least cost. In route resolution, costs may be assigned based on, for example, the number of hops, bandwidth, and / or latency of a link. Optionally, costs may be varied to achieve traffic engineering results (i.e., to direct traffic).

[0061] In a standalone Zigbee network without a fixed gateway, there is no fixed / single entry point into the Zigbee network from which the mobile device 104 can reach all other nodes. In contrast, a network with multiple combined nodes 101, 103 to which the mobile device 104 can randomly connect Figure 1 In an independent Zigbee network, the mobile device 104 can communicate with other nodes 102 of the Zigbee network 100 by using, for example, the BLE protocol, through one of the combined nodes 101, 103 as a proxy.

[0062] Communicating with multiple nodes on a Zigbee network through a selected proxy has multiple advantages. It allows the user to avoid tedious identification of individual nodes before establishing a 1:1 BLE connection, eliminates duplicate connection times (depending on the discovery and security methods used, the connection time for each connection to each node may be in the range of 1 to 2 seconds), and allows further time savings due to parallel operations on the network. Instead of reading node status one by one, the mobile node 104 can request status updates from all nodes via broadcast, or request status updates from multiple nodes via unicast, and collect responses when they are received. As a result, when sending messages to one or more other Zigbee nodes in the network via any proxy node, the overall network latency can be significantly reduced.

[0063] According to various embodiments, the mobile device 104 (e.g., ZVD) can be configured to connect to the Zigbee network 100 (e.g., home network) in an ad hoc manner via one of the combined nodes 101, 103 (e.g., ZDD) to enable quick access to controllable devices in a fast manner without adding a significant signaling load. To achieve this, the Zigbee network 100 can be configured to allow source routing, so that the mobile device 104 sending the packet can specify the route that the packet should take through the Zigbee network 100.

[0064] In addition, the mobile device 104 can be configured to obtain information about the Zigbee network 100 (e.g., information about the network nodes that it can control and / or their states (optionally, information about all network nodes and / or their states)). This can be achieved by configuring the mobile device 104 to collect neighbor tables of at least some of the network nodes 101, 102, 103 in the Zigbee network 100, and using the neighbor tables to discover at least some of the remaining network nodes. In parallel with this node discovery, the device can also use source routing to retrieve additional neighbor tables and state information from the discovered nodes.

[0065] In one example, the mobile device 104 can be configured to read the neighbor table in the Zigbee network 100 through the Mgmt_Lqi_req command of the Zigbee device profile. This request is sent to the device indicated by the short address, for example, via source routing, to request it to return its neighbor table. In Zigbee, being able to respond to this command is mandatory.

[0066] Optionally, the reading of neighbor information can be optimized, at the expense of not being able to use this optimization on devices outside the wireless network. In a wireless network with external devices (e.g., third-party luminaires), standard Mgmt_Lqi requests can be sent to network-related ("internal") luminaires. Since these internal luminaires and their capabilities are known in advance, optimized commands can be sent to each light. As an example, reading the light state of a luminaire in a Zigbee network may require up to three messages, depending on the capabilities and on / off state. For colored lights, it may be necessary to read the on / off cluster, the level control cluster, and the color cluster. Internal luminaires can be equipped with a vendor-specific advanced light control cluster that is configured to support reading the light state in a single read, thereby optimizing the reading process.

[0067] Thus, in an embodiment, mobile device 104 can perform neighbor table discovery focused on a controllable device, and can then issue a directed "source routed" state information request to begin collecting state information for the discovered nodes. In this way, the number of packets in the network (i.e., signaling load) can be kept small.

[0068] Although the mobile device 104 obtains information about the controllable devices, the controllable devices may need the status and / or routing information of the mobile device 104. Otherwise, they need to discover the routing path, which increases the signaling overhead.

[0069] Therefore, in an embodiment, it is proposed to configure the mobile device 104 to connect to the Zigbee network 100 and trigger MTORR, for example, at one of the combined nodes 101, 103. As a result, all nodes in the Zigbee network 100 are informed of the route to the mobile device 104. Alternatively, in response to a source-routed based state information request, each addressed node can be configured to "reverse" the source route and use this routing information to route the response towards the mobile device 104. Either solution allows the state information (state) to be sent directly to the mobile device 104.

[0070] Wireless communication networks such as those discussed herein are deployed in home, office, and / or other (building) automation systems. Many of the nodes in such systems are typically "application" nodes, such as for lighting applications, HVAC applications, security applications, and / or window treatment systems (e.g., blinds, shutters, skylights). In smaller consumer settings, these may also cover a wide variety of consumer electronic IoT devices. Such devices are typically part of a wireless communication network to facilitate control, which has become personal control with the proliferation of mobile phones and other portable electronic devices.

[0071] The control operation may involve turning a device on or off, or switching an operating mode, such as, for example, switching the color intensity of a light source in the case of a lighting application. To facilitate control, electronic control devices are often provided with a user-friendly user interface, which may also require that the current state of such controllable devices be reproduced on the user interface. To this end, the claimed invention may be used to build source routes to network nodes that a user wants to control, to allow the user device to collect the current state of the network nodes using unicast commands sent using source routing, and to enable the network nodes to relay such information to the user device for reproduction on the mobile device, and to allow the user to issue control commands to the network devices using unicast commands using the same source routing.

[0072] In an embodiment, once a controllable node is discovered while topology detection is still ongoing, node discovery and state collection can be balanced by exploiting the parallelism between neighbor detection and state collection. Initially, node discovery can be prioritized. Then, the discovery process can continue, but requests for state information can also be sent in parallel to the discovered nodes using source routing addressing. In one example, once the discovery process is moving along a different route, state collection can be started for previously discovered nodes at a limited cost. Thus, a compromise between overall topology discovery and reduced latency for state collection can be achieved.

[0073] In an embodiment, knowledge of the home network can be exploited by supporting node discovery and status collection in known areas (e.g., complete rooms or other target spaces). Since the mobile device 104 can have information about the home network (e.g., which specific luminaires are in a specific room or other target space), this information can be used to prioritize the discovery of controllable nodes in the room. As a result, the collection of status information for limited target spaces can be accelerated and easily presented on the user interface of the mobile device 104. In an example, the app on the mobile device 104 can be configured to use the room as a "unit" for displaying controllable devices. Therefore, taking into account the relevant information available on the mobile device 104 and what will be displayed on the user interface of the mobile device 104, status collection can be targeted to the room, and node discovery can be guided accordingly, allowing the status of the room to be displayed faster (shielding delays).

[0074] In one example, the mobile device 104 app has information about nodes in the network 100 and displays the nodes on a "room basis" on its user interface. Status collection can then focus on the displayed controllable nodes in the current room. Assuming that the user may want to control the controllable devices in the current room (which will then be displayed), status discovery of these controllable devices can be facilitated by directing discovery to nodes known to be in the same room.

[0075] As a further option, existing information about nodes in the room may be exploited, such as by prioritizing nodes that are known to be in the same room as the Zigbee device to which the mobile device 104 is connected. Thus, the search may be directed to neighboring nodes that are known to be in the same room (and / or later to neighboring nodes that are known to be in adjacent rooms or on the same floor).

[0076] In one embodiment, node discovery can be focused on controllable devices currently presented on the user interface of mobile device 104. Since an app on mobile device 104 can open a page showing certain controllable nodes (which may actually be located in another room), the focus of node discovery can be placed on these nodes, even though they are located in the other room. When information about neighboring rooms is available, such information can be used to guide node discovery.

[0077] Therefore, as described above, the underlying mechanisms of node discovery (neighbor table collection) and status collection (source routing) can be controlled, focusing on at least one of the following: obtaining the status of discovered controllable devices, obtaining the status of controllable devices in the target room, obtaining the status of controllable devices displayed on the user interface of the mobile device 104, and obtaining the status of controllable devices in the current room.

[0078] Figure 2 Schematically illustrates a user equipment with a node access function according to various embodiments (eg, Figure 1 Block diagram of a mobile device 104).

[0079] The user equipment may be a wireless network node including a transceiver (TRX) 22 configured to communicate using at least a first wireless communication protocol (eg, BLE) to communicate with a wireless device using the first communication protocol. Figure 1 communicates with one of the combined nodes 101, 103.

[0080] In addition, the user equipment may include a controller (CTRL) 24 and a memory (MEM) 26 for storing (one or more) routing tables, node information, etc. Those skilled in the art will appreciate that the memory 26 and the controller 24 may be separate physical entities within the user equipment, or may represent logical entities, for example, where the functionality is implemented in a single physical entity, such as an integrated circuit (e.g., an application specific integrated circuit (ASIC)).

[0081] In addition, the controller 24 of the user equipment may include a node check function (N-CH) 242 and a source route check function (SR-CH) 244, which are configured to provide the node discovery and state collection process of the proposed node access function according to the embodiments described herein (individually or interactively). The node check function and the source route check function 242, 244 can be implemented in software by a software routine configured to control the controller, or can be implemented in hardware by building individual blocks of a digital chip (e.g., an ASIC or a field programmable gate array (FPGA)) based on a hardware description language.

[0082] Figure 3 A flow chart of a node determination and routing selection process for the proposed node access scheme according to various embodiments is shown.

[0083] The process starts with a single node. For example, in the case of the upcoming Zigbee Direct standard, the ZDD can be used as a proxy (e.g. Figure 1 The combined node 101 or 103) can be used to connect a mobile phone (e.g., Figure 1 The mobile device 104 in the embodiment is connected to the Zigbee network (e.g., Figure 1 The address of the ZDD is used as a starting point (eg, stored or set at the mobile phone (eg, at the ZVD)), and the neighbor table of the ZDD is read via a corresponding command (eg, Mgmt_Lqi_req command).

[0084] Where a bridge or gateway is provided in the network, the process may start with the neighbor list of the bridge / gateway.

[0085] According to the proposed node access scheme, when reading the neighbor table (e.g., by Figure 2 Node check function 242) and register the found results (e.g., in Figure 2 26), while constructing the source route (e.g., by Figure 2 The neighbor table may also include a link quality indicator, which may be used for improved cost calculation by combining the link quality indicator in the source route.

[0086] In the Zigbee neighbor table, a neighbor may not be the closest node (e.g., with the strongest signal). Instead, the Zigbee stack can be configured to intentionally introduce distant nodes in the neighbor table to prevent unreachable parts of the network. Therefore, it may be advantageous to include a link quality indicator when calculating the cost used to select a source route.

[0087] In step S301, the mobile phone triggers an optional MTORR broadcast from a first node (eg, a proxy ZDD) to allow other network nodes to reply. Then, in step S302, the first node is marked as unchecked (UCH).

[0088] In step S303, the (controllable) node (N) having the best path (eg, the "cheapest" path with the lowest cost) is determined from all available unchecked nodes. BP ).

[0089] In step S304, the neighbor table of the determined node is requested (RQ NT) using the registered source routing of the best path.

[0090] In step S305, the requested neighbor table is received (RX NT) from the addressed node.

[0091] Then, in step S306, the nodes and their node addresses of the retrieved neighbor table are retrieved, and new source routes and their associated costs are calculated by adding the corresponding node addresses (NA) (and associated costs) to the registered source routes (SRs) of the determined node from which the neighbor table has been received.

[0092] In step S307, for each retrieved neighbor node in the received neighbor table, it is checked whether the neighbor node is a new node (NN) that has not been registered.

[0093] If the node being checked is not a new node (i.e., it has been registered before), the process branches to step S308, where the cost of the registered source route for the node is compared with the associated cost of the obtained new source route (CC). Then, in step S309, if the associated cost of the new source route is smaller, the source route is replaced (RSR) with the new source route. Otherwise, the "old" source route is maintained for the relevant node. In the subsequent step S310, the node is marked as checked (CH).

[0094] Otherwise, if the checked node is a new node, the process branches to step S311, where the new node is added / marked as an unchecked node (UCH) and a new source route (SR) is registered.

[0095] After all nodes of the neighbor table have been checked in steps S307 to S311, the process continues to step S312, where it is checked whether any remaining unchecked nodes are registered. If not, the process ends at step S313. Otherwise, the process jumps back to step S303, where the next node (N) with the best path (e.g., the cheapest path with the lowest cost) is determined from all available unchecked nodes. BP ).

[0096] Optionally, the process can be configured to stop if all desired nodes have been found. It may not be necessary to read information from "leaf" nodes (e.g., nodes at the ends of network branches). For example, if a network has five nodes that are all in the ZDD neighbor table, no further reading of the neighbor table is required.

[0097] Figure 4 An exemplary network structure with five network nodes is schematically shown.

[0098] An exemplary network structure may be a Zigbee network, and includes five nodes 1 to 5. Node 1 may be a combined node (e.g., ZDD) that acts as a proxy for external devices to link the Zigbee network with other nodes 2 to 5. Node 1 is connected to nodes 2 and 3, nodes 2 and 3 are connected to each other and to node 4, and node 4 is connected to node 5.

[0099] Figure 5 The following is used to explain the Figure 4 An exemplary table of node determination and route selection processes for an exemplary network structure.

[0100] Table row instructions are based on Figure 3 Flow diagram of the consecutive registration states(S) during the routing selection process.

[0101] In addition, the table columns include: the address of the registered node (ADD), which corresponds to the node numbers "1" to "5"; the source route (SR) to the registered node, which is indicated by the corresponding node number sequence; the check status (CH) of the registered node, which is indicated by yes ("Y") or no ("N"); and the neighbor nodes (NB) indicated by their node numbers.

[0102] Initially, in state 1, node 1 has been registered and marked as unchecked. Then, in state 2, the neighbor table of node 1 has been retrieved, and neighbor nodes 2 and 3 have been read and registered. Node 1 has been marked as checked. In addition, a new source route "1" and a new node 2 have been registered, and node 2 has been marked as unchecked. Additionally, a new source route "1" and a new node 3 have been registered, and node 3 has been marked as unchecked.

[0103] In the subsequent state 3, the neighbor nodes 1, 3 and 4 of node 2 have been retrieved, and node 2 has been marked as checked. In addition, the new node 4 has been added with the source route "1, 2" and is marked as unchecked.

[0104] In the following state 4, the neighbor nodes 1, 2 and 4 of node 3 have been retrieved, and node 3 has been marked as checked. In addition, a new (cheaper) source route "1, 3" has been registered for registering node 4.

[0105] In the subsequent state 5, the neighbor node 5 of node 4 has been retrieved, and node 4 has been marked as checked. In addition, the new node 5 has been added with the source route "1, 2, 4" and is marked as unchecked.

[0106] Finally, in state 6, node 5's neighbor node 4 has been retrieved, and node 5 has been marked as checked. In addition, the new node 5 has been added with the source route "1, 2, 4" and marked as checked.

[0107] Since there are no remaining unchecked nodes in state 6, the node determination and routing process ends here.

[0108] According to another embodiment, it can be determined in an initial step whether the Figure 3 The process or the conventional route discovery process (e.g., AODV) can be used. If the number of nodes in the network is small and the number of neighbors is large, conventional AODV routing may be favored. For example, in a 15-node network with 14 neighbors.

[0109] It may also be possible to search for a specific set of nodes and terminate the process once routes to these nodes have been found (with sufficiently low link costs), rather than finding all nodes. In this way, the process can terminate immediately when all nodes are neighbors.

[0110] Since the neighbor table entries are very large (e.g., 22 bytes per neighbor), a vendor-specific neighbor table read can be implemented. If the link cost and network address are returned for each neighbor, only 3 bytes are needed so that the entire neighbor table can fit into one message (e.g., 16*3=48 bytes, while the effective Zigbee payload is about 75 bytes).

[0111] After the source route is obtained, the light state or other state information can be read. Instead of waiting for the process to complete before reading the light state, the light state can be read during the process when a route with sufficient quality is found. This can be used to speed up the presentation of the light state of nearby lights in the user interface.

[0112] In summary, network access to a network node (e.g., a Zigbee node) without route discovery has been described by a combined read of a neighbor table and source routing. By repeatedly reading the neighbor tables of all nodes in the network, powered nodes can be found. The neighbor tables of the neighbors listed in the neighbor table of the first node are read by providing source routing, which can be obtained by tracking which node the neighbor table is read from. Route selection can be controlled based on route quality (e.g., path cost). The result of this process is a list of source routes to all nodes. It is then possible to communicate with all nodes in the network (e.g., to read light status) using source routing.

[0113] It will be understood that the controller referred to herein may actually be provided by one or more integrated circuits, an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a digital signal processor (DSP), or the like.

[0114] Although reference is made herein to the accompanying drawings (e.g. Figure 3 and Figure 5 ) At least some aspects of the embodiments described in the present invention include computer processes executed in a controller, but the invention also extends to computer programs, in particular computer programs on or in a carrier or app for a mobile device suitable for putting the invention into practice. The program may be in the form of a non-transitory source code, object code, a code intermediate between source code and object code, such as a partially compiled form, or any other non-transitory form suitable for implementing the process according to the invention. The carrier may be any entity or device capable of carrying the program. For example, the carrier may include a storage medium, such as a solid-state drive (SSD) or other semiconductor-based RAM; a ROM, such as a CD ROM or a semiconductor ROM; a magnetic recording medium, such as a floppy disk or a hard disk; a general optical storage device; and the like.

[0115] While the invention has been illustrated and described in detail in the drawings and foregoing description, such illustration and description are to be considered illustrative or exemplary and not restrictive.

[0116] The present invention can also be used in bridge-based systems. For example, in the case where the bridge is rebooted (hardware turned off and then back on) and has no more routes in its memory. In a bridge-based system, the bridge is part of the network and a BLE combo node may not be needed. Because the bridge is part of the Zigbee network, it has a neighbor table (which can be maintained by processing link status messages from neighboring nodes). As Figure 3In the first step of the above process, the bridge can read its own neighbor table. The process can even be the same if the bridge will be configured to literally send a first neighbor table read message to itself. However, in a practical implementation, the bridge can directly access its own memory storing the neighbor table. Otherwise, the process may remain the same except that BLE is not used.

[0117] In one example, a component in the bridge (e.g., software routing) can trigger sending neighbor table read requests, collecting received data, and building a source routing table. To achieve this, the bridge can actually use two controllers or processors (CPUs). One processor can be configured to implement Zigbee and be responsible for sending and receiving messages in the network. The other processor can be responsible for the main application (e.g., receiving http messages, polling light status, and instructing another (Zigbee) processor to send messages). The two processors can be connected using a serial link.

[0118] Although particularly advantageous in standalone Zigbee networks, the same principles can also be applied in other mesh networks with multiple concentrators. In networks with a large number of concentrator / proxy nodes, it is relevant to keep track of available routes in the network. When doing so, it will be possible for mobile devices to connect to the network self-organizingly and be able to communicate not only with the proxy, but also with other nodes in the mesh network without having to wait for route discovery to complete.

[0119] Furthermore, the proposed node access concept is not limited to Zigbee networks and can be used in conjunction with other networks such as Thread, BT Mesh, Wi-Fi Mesh, JupiterMesh, or other mesh topologies using multi-hop communication protocols.

[0120] The proposed method can also be used in wireless mesh networks, where, in addition to the above-mentioned Zigbee / BLE combination nodes, other nodes that only support a multi-hop communication protocol or another single-hop communication protocol (e.g., WiFi, near field communication (NFC), cellular communication, etc.) are provided. Such nodes can be "traditional" Zigbee-only nodes, or can be Zigbee / BLE-enabled nodes that have been configured (before installation, during network initialization, or during operation) to operate as Zigbee-only nodes. For example, in a network with many Zigbee / BLE nodes in close proximity, it is conceivable to configure some Zigbee / BLE router nodes as Zigbee End Devices (ZEDs) in order to simplify the network topology and reduce the need for route discovery.

[0121] By studying the drawings, the disclosure and the appended claims, those skilled in the art can understand and implement other variations of the disclosed embodiments when practicing the claimed invention. In the claims, the word "comprising" does not exclude other elements or steps, and the indefinite article "one" or "an" does not exclude multiple. A single processor or other unit can implement the functions of several items listed in the claims. The mere fact that certain measures are cited in mutually different dependent claims does not indicate that the combination of these measures cannot be used advantageously. The foregoing description describes certain embodiments of the present invention in detail. However, it will be appreciated that no matter how detailed the above appears in the text, the present invention can be practiced in a variety of ways and is therefore not limited to the disclosed embodiments. It should be noted that when describing certain features or aspects of the present invention, the use of specific terms should not be understood to imply that the term is redefined here to be limited to include any specific characteristics of the features or aspects of the present invention associated with the term.

[0122] A single unit or device may fulfill the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.

Claims

1. A user equipment (104) for accessing a wireless communication network (100), comprising means for controlling the user equipment (104) to provide access to a network node (102) of the wireless communication network (100) via a proxy device (101, 103), wherein communication between the user equipment (104) and the proxy device (101, 103) uses a single-hop communication protocol, and communication within the wireless communication network (100) uses a multi-hop communication protocol, and The device is configured to: retrieving neighbor information about at least one neighbor node of the proxy device (101, 103) from the proxy device (101, 103); and constructing a source route to the network node (102) by connecting to the retrieved neighbor nodes using source routing, and Neighbor tables of network nodes discovered in the wireless communication network (100) are recursively retrieved while tracing source routes until all desired network nodes of the wireless communication network, including the network node (102), are found and source routes to those network nodes in the wireless communication network (100) are obtained.

2. The user equipment (104) according to claim 1, wherein the wireless communication network is a Zigbee mesh network, and the apparatus comprises a Zigbee VirtualDirect device function for connecting to a Zigbee Direct device included in the proxy device (101, 103).

3. The user equipment (104) according to claim 1, wherein the desired network nodes are all available network nodes, and the device is configured to recursively read the neighbor table of the network nodes in the wireless network (100) while tracking the source route until no new network nodes are found and a source route list to all available network nodes in the wireless network (100) is obtained.

4. The user equipment (104) of claim 1, wherein the wireless communication network is a Zigbee mesh network, and the apparatus is configured to read the neighbor table by using a Zigbee Mgmt_Lqi_req command or a vendor specific command or attribute.

5. The user equipment (104) of claim 1, wherein the apparatus is configured to issue a directed source-routed state information request to collect state information from discovered network nodes of the wireless communication network (100).

6. The user equipment (104) according to claim 5, wherein the apparatus is configured to balance node discovery and state information collection by exploiting parallelism between neighbor detection and state information collection once a controllable node is discovered while topology detection is still in progress.

7. The user device (104) according to claim 5, wherein the device is configured to control node discovery and status information collection by prioritizing at least one of the following: obtaining status information of discovered controllable devices, obtaining status information of controllable devices in a target room, obtaining status information of controllable devices displayed on a user interface of the user device (104), and obtaining status information of controllable devices in a current room.

8. The user equipment (104) according to claim 1, wherein the device is configured to initiate a many-to-one routing request before obtaining neighbor information.

9. The user equipment (104) according to claim 1, wherein the apparatus is configured to construct a source route by tracing a sequence of steps required to reach a neighbor node of a neighbor node.

10. The user equipment (104) according to claim 1, wherein the device is configured to compare the computational cost of the registered source route of the retrieved neighbor node with the computational cost of the obtained new source route of the retrieved neighbor node to decide whether to replace the registered source route with the new source route.

11. The user equipment (104) according to claim 10, wherein the apparatus is configured to obtain link quality information from neighbor information, and use the link quality information to perform cost calculation for source routing.

12. A system comprising at least one user device (104) according to claim 1 and at least one proxy device (101, 103) for providing access to a network node (102) of a wireless communication network (100), wherein the proxy device (101, 103) is a combined node configured to communicate with the user device (104), and wherein the single-hop communication protocol is the Bluetooth Low Energy protocol and the Zigbee protocol is used to communicate with the network node (102) of the wireless communication network (100).

13. The system of claim 12, wherein the retrieved neighbor node is configured to reverse the source route and use the reversed source route as routing information to route the response to the user device (104).

14. A method of controlling a user device (104) to provide access to a network node (102) of a wireless communication network (100) via a proxy device (101, 103), wherein communication between the user device (104) and the proxy device (101, 103) uses a single-hop communication protocol and communication within the wireless communication network (100) uses a multi-hop communication protocol, The method comprises: Retrieving information about at least one neighbor node of the proxy device (101, 103) from the proxy device (101, 103); and constructing a source route to the network node (102) by connecting to the retrieved neighbor nodes using source routing, and Neighbor tables of network nodes discovered in the wireless communication network (100) are recursively retrieved while tracing source routes until all desired network nodes, including the network node (102), are found and source routes to those network nodes in the wireless communication network (100) are obtained.

15. The method of claim 14, wherein the desired network nodes are all available network nodes, and the device is configured to recursively read neighbor tables of network nodes in the wireless network (100) while tracking source routes until no new network nodes are found, and obtain a list of source routes to all available network nodes in the wireless network (100).

16. A computer program product comprising code means for generating the steps of claim 14 or 15 when run on a controller device (24).