EP1980061B1 - Improved route determining methods for a network - Google Patents
Improved route determining methods for a network Download PDFInfo
- Publication number
- EP1980061B1 EP1980061B1 EP07700553.6A EP07700553A EP1980061B1 EP 1980061 B1 EP1980061 B1 EP 1980061B1 EP 07700553 A EP07700553 A EP 07700553A EP 1980061 B1 EP1980061 B1 EP 1980061B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- message
- node
- concentrator
- network
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims description 36
- 230000008901 benefit Effects 0.000 description 4
- 230000008859 change Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000001105 regulatory effect Effects 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000004931 aggregating effect Effects 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 239000000725 suspension Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/34—Source routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/18—End to end
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/30—Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
Definitions
- the present invention relates to determining routing information in a network, in particular to methods and systems for determining such information in a multi-hop wireless network.
- the topology of a multi-hop wireless network can vary in that the presence of particular nodes may be sporadic (for example due to mobility, or not presently communicating in order to conserve battery power, etc.). It is therefore problematic to establish and maintain data routes between nodes of such a network.
- a known technique to mitigate this is to establish a route from a source node to a destination node for subsequent messages.
- the source node issues an invitation message to other nodes in the network.
- each node receiving the message stores the identity of the node which supplied the message and then forwards the message to its neighboring nodes.
- a destination node responding to the invitation message sends a trace route message to the source node via the intermediate nodes traversed by the invitation message, the trace route message acquiring the identity of each such intermediate node as it travels to the source node.
- the source node obtains an explicit "source route" to the destination node from the received trace route message.
- a message sent by the source node to the destination node also contains route information which is used by intermediate nodes to route the message to the destination node.
- the source node requires storage to store source route information for the destination nodes with which the source node needs to subsequently communicate.
- a technique similar to that outlined above is proposed for ZigBee networks incorporating concentrators.
- Concentrators are data aggregators which for example service and manage a population of ZigBee nodes.
- a key issue in ZigBee systems is low cost - each node in the network should be low cost, including concentrators.
- ZigBee networks are multi-hop wireless networks and therefore could inherently benefit from the technique described above.
- the technique either requires use of a costly concentrator having large storage capacity to store source routes for many nodes or an inefficient network bandwidth utilization due to the need to re-establish route information from the concentrator to a destination node.
- a network comprising several concentrators having different characteristics makes it difficult to achieve an optimal solution.
- a route in the network is discovered by a source broadcasting a first message (route request) which identifies the destination node (target). The first message propagates (via multiple hops) to the target. When the target is reached a second message (route reply) is returned to the source, which determines and stores the route for sending third messages (data).
- WO00/41365 describes data flow control between a sender and a receiver. Credit lists are communicated from the receiver to the sender. A credit indicates a receive buffer size available at the receiver. The sender uses the credits to match the available buffer size to the amount of data packets transmitted. When the sender has used all the credits, it should refrain from sending further packets. Hence the data flow between the sender and receiver is regulated to avoid overflow errors.
- a node of the network having received the first message comprising said characteristic is then aware of characteristic(s) of the concentrator and can take this into account in deciding whether to send a further second message to trace the route back to the concentrator.
- a node able to send messages to more than one concentrator can adapt the sending of further second messages according to the particular concentrator with which it intends communicating.
- An inherent capability of the invention is the ability to operate effectively in a network comprising concentrators of differing-characteristics.
- the concentrator can optionally inform a particular node of its characteristic(s) by including such in a third message intended for the node. In one example, advising the node that the concentrator is running low on memory and therefore the node should send second messages on subsequent occasions since the concentrator can no longer guarantee to cache (store) the source route data for that node. In another example, irrespective of the general characteristics advised to nodes by a concentrator using the first message, the concentrator advises a specific node not to send further second messages since the data traffic level between that node and the concentrator is high, thereby conserving network bandwidth. In this case, the concentrator would ensure caching (storing) the source route data for that node.
- the first node having received the third message comprising said characteristic is then also made aware of characteristic(s) of the concentrator and can
- a characteristic of the concentrator sent to nodes is an indicator denoting the amount of storage capacity available for storing identifiers of nodes which constitute source routes to one or more nodes. Further or alternative characteristics of a concentrator can be identified which may be of use to a node. Furthermore, as inferred above, such characteristics of concentrators can be communicated to an individual node or plurality of nodes in a dynamic fashion to thereby adjust the actions of nodes (e.g. sending of further second messages) according to the instantaneous real time requirements of applications and/or traffic loading in the network.
- the methods described are suitable for any multi-hop wired or wireless network, for example paths between routers in wide area networks including the Internet, or paths within wireless IrDA, Wi-Fi or Bluetooth networks, etc.
- the methods can scale to any number of nodes and concentrators while maintaining the advantages stated.
- the first message is a modified ZigBee route request frame and the second message is a ZigBee route record command frame or a modified ZigBee network layer data frame.
- the third message is a modified ZigBee network layer data frame.
- the invention provides a useful solution for a multi-hop wired or wireless network that is scalable to larger networks whilst ensuring efficient usage of network data bandwidth and cost effective use of a mix of concentrators likely to exist in practical implemented systems. It has the further ability to dynamically adapt to changing circumstances, for example those relating to real-time network traffic.
- the term 'concentrator' means a data aggregator which for example services and manages a population of network (e.g. ZigBee) nodes.
- FIG. 1 shows a schematic describing a prior art method for determining routing information for a network of nodes. Message transfer is according to the bold arrows, and time increases from top to bottom of the Figure as denoted by the arrow 100.
- a network entity denoted a concentrator 102 performs the function of aggregating data of a number of nodes in the network.
- the concentrator 102 sends at 110 a first message 112 to node_x 104.
- an example of a first message is a suitably modified ZigBee route request frame.
- the node On arrival at node_x 104 the node records (not shown in the Figure for clarity) an identifier of the concentrator 102.
- Node_x 104 also forwards the first message to its neighboring nodes as denoted generally by arrow 114 and to specific neighboring node_y 106 as denoted by first message 116.
- node_y 106 On arrival at node_y 106 node_y records (again not shown in the Figure for clarity) an identifier of node_x.
- Node_y 106 further forwards the first message to its neighboring nodes as denoted generally by arrow 118 and in particular to node_z as denoted by arrow 120.
- node_z On arrival of the first message 120 at node_z 108 node_z records 124 an identifier 126 of node_y and forwards the first message to its neighboring nodes, as denoted generally by arrow 122.
- node_z sends a second message 132 to node_y as directed by the stored identifier of node_y.
- a second message is a ZigBee route record command frame or a suitably modified ZigBee network layer data frame.
- the second message 132 contains an identifier of node_z, (z), as indicated in the Figure.
- node_y having received the second message 132 appends its identifier, y, and forwards the second message 134 to node_x.
- the forwarded second message 134 contains the identifiers (y, z) of the nodes that the message has already passed.
- node_x On arrival at node_x of the second message 134, node_x appends its identifier, x, to the second message and forwards this message 136 to the concentrator 102.
- the forwarded second message 136 contains the identifiers (x, y, z).
- the concentrator on receiving the forwarded second message 136 stores 138 the node identifiers (x, y, z) as source routing data 140 for node_z 108.
- a third message 144 is a suitably modified ZigBee network layer data frame.
- the third message 144 is sent from concentrator 102 to node_x 104, node_x being indicated by node identifier, x, of the source routing data within the message.
- the third message is examined by node_x to identify node_y as the next hop in transferring the third message towards node_z.
- the third message 146 is transferred from node_x 104 to node_y 106.
- the third message 146 On arrival at node_y 106 the third message 146 is examined and node_z is identified as the next hop for the message from the source route data contained in message 146. The third message 148 is then transferred from node_y 106 to node_z 108. According to some predetermined policy, further second messages are, or are not, sent from node_z to the concentrator 102 as indicated by the chain linked arrows in the Figure. If such messages are to be sent, the process is the same as described earlier for the initial second message and comprises generating the message at 152 and sending the second message via node_y and node_x, as represented by items 154, 156, 158 in the Figure, the process storing 160 source route data at the concentrator 102.
- Figure 2a represents a schematic of a method for determining routing information for a network of nodes.
- One or more relevant characteristics 200 of the concentrator 102 are included in the sent 110 first message.
- a typical example of a characteristic is an indication of whether the concentrator can store source route data : if so this informs a network node that repeated sending of second messages is unnecessary.
- Another example of a characteristic is the duration the concentrator can store source route data - this can inform a network node that further sending of second messages is unnecessary before the duration period expires.
- concentrator characteristics can change dynamically over time, for example a concentrator's capacity to store source route data can become temporarily, or even permanently, constrained due to demands of an application, or the network activity of other nodes, affecting the concentrator.
- a concentrator can inform nodes of positive effects, for example that it is no longer constrained, perhaps due to lower network activity or even a hardware upgrade.
- the concentrator can inform the network nodes of characteristics independently of involvement of a user or network administrator (if any).
- the first message 112 is transferred across node_x and node_y, as already described in relation to Figure 1 previously.
- node_z 108 On arrival at node_z of first message 120, node_z 108 in addition stores 202 one or more concentrator characteristics 204. The method then proceeds at 130 to send a second message, as already described in relation to Figure 1 previously. Similarly a third message is generated at 142 and forwarded from the concentrator 102 to node_z 108, as also described in relation to Figure 1 previously.
- node_z 108 checks 206 the stored characteristics to determine whether or not the concentrator is constrained; that is whether or not it has limited capacity to store source route data for nodes. If it is constrained, then further sending of second messages is enabled 208. Consequently, a further second message is sent 152 from node_z 108 to concentrator 102, as already described in relation to Figure 1 previously.
- checks according to the types of concentrator characteristics are possible as recognized by the skilled person, for instance based on the example characteristics discussed briefly above.
- the third message 148 received by node_z 108 can optionally update 210 the concentrator characteristics held by a particular node, such as node_z 108 as shown in the Figure. This is useful to enable exceptions for a selected node or nodes (to have a different basis of communication with the concentrator with respect to other nodes).
- node_z generally sends many messages regularly to the concentrator
- characteristics can be sent by a third message to permit suspension in sending second messages, even though the concentrator has previously advised nodes that it is ostensibly constrained (not normally able to store source route data). For this node therefore the concentrator would in fact cache (store) the source route data.
- Figure 2b represents a schematic of an alternative method for determining routing information for a network of nodes.
- FIG. 2a illustrates a schematic of an alternative method for determining routing information for a network of nodes.
- FIG. 2b represents a schematic of an alternative method for determining routing information for a network of nodes.
- FIG. 2a represents a schematic of an alternative method for determining routing information for a network of nodes.
- FIG. 2b represents a schematic of an alternative method for determining routing information for a network of nodes.
- FIG. 2b represents a schematic of an alternative method for determining routing information for a network of nodes.
- FIG. 2b represents a schematic of an alternative method for determining routing information for a network of nodes.
- FIG. 2b represents a schematic of an alternative method for determining routing information for a network of nodes.
- FIG. 2b represents a schematic of an alternative method for determining routing information for a network of nodes.
- FIG. 2b represents a schematic of an alternative
- node_z 108 In deciding whether further second messages are required to be sent from node_z 108 to the concentrator 102, node_z 108 checks 206 the stored characteristics to determine whether or not the concentrator is constrained. In the case where it is constrained, then further sending of second messages is enabled 208.
- the method illustrated in Figure 2b provides an alternative mechanism to regulate network bandwidth usage whilst avoiding use of first messages to send concentrator characteristic(s).
- FIG. 3 shows generally at 300 a network comprising two concentrators and a variety of nodes.
- Concentrator 302 communicates with node_u 304 and node_t 306 using wireless links 308 and 310 respectively.
- Concentrator 302 also communicates wirelessly 314 with node x 312.
- node_x 312 communicates with node_v 318 via wireless link 316 and with node_y 322 via wireless link 320.
- node_y 322 communicates with node_w 326 via wireless link 324 and with node_z 330 via wireless link 328.
- Node_z 330 also communicates with concentrator 340 using wireless link 342.
- node_z maintains (not shown in the Figure) stored characteristics for each concentrator 302, 340 with which it communicates and adjusts the sending of further second messages to each concentrator in dependence on the characteristic(s) it currently holds for that concentrator.
- nodes operating in a network comprising more than one concentrator will need also to store an associated concentrator identifier with the node identifier recorded when the first message (e.g.
- the method is applicable to a range of wired and wireless networks, including wide area networks such as the Internet, and wireless IrDA, Wi-Fi or Bluetooth networks, etc. It is particularly suited to situations where cost is important, such as ZigBee network concentrators and nodes.
- Figure 4 shows an example first message structure comprising header 402, payload 404 and a field for concentrator characteristics 406.
- any suitable packet construction can be adopted to implement the present invention, as is readily identifiable to the skilled person.
- a ZigBee route request frame is suitably modified to incorporate a field for concentrator characteristics.
- a modified ZigBee network layer data frame is suitably modified to incorporate a field for concentrator characteristics when signaling such characteristics to a particular node.
- the syntax of the concentrator characteristics field can be determined according to the requirements of the application or protocol and the range of identified concentrator characteristics, and is readily identifiable by the skilled person.
- an invitation message 112, 116, 120 is sent from a concentrator 102 to nodes in a network.
- Each node records 124 an identifier 126 of the node or concentrator from which it received the message and forwards 122 the message to its neighbors.
- a node 108 then sends a trace message 132, 134, 136 to the concentrator 102 via intermediate nodes 106, 104 traversed by the invitation message in reaching the node and appends thereto the identifiers of the intermediate nodes.
- the concentrator uses source routing to send a subsequent message 144, 146, 148 to the node 108 using the identifiers included in the trace message.
- the invitation message and/or the subsequent message includes characteristic(s) 200 of the concentrator one or more of which are then stored by nodes, including node 108.
- the characteristic(s) are used in deciding 206, 208 to send further trace messages, thereby regulating use of network bandwidth.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Description
- The present invention relates to determining routing information in a network, in particular to methods and systems for determining such information in a multi-hop wireless network.
- The topology of a multi-hop wireless network can vary in that the presence of particular nodes may be sporadic (for example due to mobility, or not presently communicating in order to conserve battery power, etc.). It is therefore problematic to establish and maintain data routes between nodes of such a network.
- A known technique to mitigate this is to establish a route from a source node to a destination node for subsequent messages. The source node issues an invitation message to other nodes in the network. As the invitation message traverses the network, each node receiving the message stores the identity of the node which supplied the message and then forwards the message to its neighboring nodes. Subsequently, a destination node responding to the invitation message sends a trace route message to the source node via the intermediate nodes traversed by the invitation message, the trace route message acquiring the identity of each such intermediate node as it travels to the source node. By this means the source node obtains an explicit "source route" to the destination node from the received trace route message. Subsequently, a message sent by the source node to the destination node also contains route information which is used by intermediate nodes to route the message to the destination node. Clearly, the source node requires storage to store source route information for the destination nodes with which the source node needs to subsequently communicate.
- A technique similar to that outlined above is proposed for ZigBee networks incorporating concentrators. Concentrators are data aggregators which for example service and manage a population of ZigBee nodes. A key issue in ZigBee systems is low cost - each node in the network should be low cost, including concentrators. ZigBee networks are multi-hop wireless networks and therefore could inherently benefit from the technique described above. However, for large networks the technique either requires use of a costly concentrator having large storage capacity to store source routes for many nodes or an inefficient network bandwidth utilization due to the need to re-establish route information from the concentrator to a destination node. Furthermore, a network comprising several concentrators having different characteristics makes it difficult to achieve an optimal solution.
- The document "D. Johnson et al.: "Dynamic Source Routing in Ad-hoc Wireless Networks" [online] 1996, XP002432152" describes dynamic source routing in ad-hoc wireless networks. A route in the network is discovered by a source broadcasting a first message (route request) which identifies the destination node (target). The first message propagates (via multiple hops) to the target. When the target is reached a second message (route reply) is returned to the source, which determines and stores the route for sending third messages (data).
-
WO00/41365 - It is an object to improve on the known art.
- According to a first aspect of the present invention there is provided a method as defined in claim 1.
- Advantageously a node of the network having received the first message comprising said characteristic is then aware of characteristic(s) of the concentrator and can take this into account in deciding whether to send a further second message to trace the route back to the concentrator. Clearly, a node able to send messages to more than one concentrator can adapt the sending of further second messages according to the particular concentrator with which it intends communicating. An inherent capability of the invention is the ability to operate effectively in a network comprising concentrators of differing-characteristics.
- A further advantage is that the concentrator can optionally inform a particular node of its characteristic(s) by including such in a third message intended for the node. In one example, advising the node that the concentrator is running low on memory and therefore the node should send second messages on subsequent occasions since the concentrator can no longer guarantee to cache (store) the source route data for that node. In another example, irrespective of the general characteristics advised to nodes by a concentrator using the first message, the concentrator advises a specific node not to send further second messages since the data traffic level between that node and the concentrator is high, thereby conserving network bandwidth. In this case, the concentrator would ensure caching (storing) the source route data for that node.
- Advantageously, the first node having received the third message comprising said characteristic is then also made aware of characteristic(s) of the concentrator and can
- In a preferred embodiment, a characteristic of the concentrator sent to nodes is an indicator denoting the amount of storage capacity available for storing identifiers of nodes which constitute source routes to one or more nodes. Further or alternative characteristics of a concentrator can be identified which may be of use to a node. Furthermore, as inferred above, such characteristics of concentrators can be communicated to an individual node or plurality of nodes in a dynamic fashion to thereby adjust the actions of nodes (e.g. sending of further second messages) according to the instantaneous real time requirements of applications and/or traffic loading in the network.
- The methods described are suitable for any multi-hop wired or wireless network, for example paths between routers in wide area networks including the Internet, or paths within wireless IrDA, Wi-Fi or Bluetooth networks, etc. The methods can scale to any number of nodes and concentrators while maintaining the advantages stated. In a preferred embodiment, the first message is a modified ZigBee route request frame and the second message is a ZigBee route record command frame or a modified ZigBee network layer data frame. Optionally, the third message is a modified ZigBee network layer data frame.
- According to further aspects of the present invention there are provided systems for determining routing information for a network of nodes according to the methods described above, as specified in the appended claims to which the reader is referred. In summary the invention provides a useful solution for a multi-hop wired or wireless network that is scalable to larger networks whilst ensuring efficient usage of network data bandwidth and cost effective use of a mix of concentrators likely to exist in practical implemented systems. It has the further ability to dynamically adapt to changing circumstances, for example those relating to real-time network traffic.
- Embodiments of the invention will now be described, by way of example, with reference to the accompanying drawings, in which:
-
Figure 1 shows a schematic describing a prior art method for determining routing information for a network of nodes; -
Figures 2a and2b represent schematics of the methods for determining routing information for a network of nodes; -
Figure 3 shows a network comprising two concentrators and a variety of nodes; and -
Figure 4 shows an example first message structure comprising header, payload and concentrator characteristics. - In the present description, the following term is defined. The term 'concentrator' means a data aggregator which for example services and manages a population of network (e.g. ZigBee) nodes.
-
Figure 1 shows a schematic describing a prior art method for determining routing information for a network of nodes. Message transfer is according to the bold arrows, and time increases from top to bottom of the Figure as denoted by thearrow 100. A network entity denoted aconcentrator 102 performs the function of aggregating data of a number of nodes in the network. Theconcentrator 102 sends at 110 afirst message 112 tonode_x 104. In a ZigBee network, an example of a first message is a suitably modified ZigBee route request frame. On arrival atnode_x 104 the node records (not shown in the Figure for clarity) an identifier of theconcentrator 102. Node_x 104 also forwards the first message to its neighboring nodes as denoted generally byarrow 114 and to specific neighboringnode_y 106 as denoted byfirst message 116. On arrival atnode_y 106 node_y records (again not shown in the Figure for clarity) an identifier of node_x. Node_y 106 further forwards the first message to its neighboring nodes as denoted generally byarrow 118 and in particular to node_z as denoted byarrow 120. On arrival of thefirst message 120 atnode_z 108node_z records 124 anidentifier 126 of node_y and forwards the first message to its neighboring nodes, as denoted generally byarrow 122. At 130 node_z sends asecond message 132 to node_y as directed by the stored identifier of node_y. In a ZigBee network, an example of a second message is a ZigBee route record command frame or a suitably modified ZigBee network layer data frame. Thesecond message 132 contains an identifier of node_z, (z), as indicated in the Figure. In turn, node_y having received thesecond message 132 appends its identifier, y, and forwards thesecond message 134 to node_x. The forwardedsecond message 134 contains the identifiers (y, z) of the nodes that the message has already passed. On arrival at node_x of thesecond message 134, node_x appends its identifier, x, to the second message and forwards thismessage 136 to theconcentrator 102. The forwardedsecond message 136 contains the identifiers (x, y, z). The concentrator on receiving the forwardedsecond message 136stores 138 the node identifiers (x, y, z) assource routing data 140 fornode_z 108. - Having acquired the source routing data for node_z the
concentrator 102 is able to send at 142 athird message 144 to node_z 108 which comprises the relevantsource routing data 140. In a ZigBee network, an example of a third message is a suitably modified ZigBee network layer data frame. Thethird message 144 is sent fromconcentrator 102 tonode_x 104, node_x being indicated by node identifier, x, of the source routing data within the message. On arrival atnode_x 104 the third message is examined by node_x to identify node_y as the next hop in transferring the third message towards node_z. Thethird message 146 is transferred fromnode_x 104 tonode_y 106. On arrival atnode_y 106 thethird message 146 is examined and node_z is identified as the next hop for the message from the source route data contained inmessage 146. Thethird message 148 is then transferred fromnode_y 106 tonode_z 108. According to some predetermined policy, further second messages are, or are not, sent from node_z to theconcentrator 102 as indicated by the chain linked arrows in the Figure. If such messages are to be sent, the process is the same as described earlier for the initial second message and comprises generating the message at 152 and sending the second message via node_y and node_x, as represented byitems concentrator 102. -
Figure 2a represents a schematic of a method for determining routing information for a network of nodes. Features common to those ofFigure 1 are denoted using the same reference numerals. One or morerelevant characteristics 200 of theconcentrator 102 are included in the sent 110 first message. A typical example of a characteristic is an indication of whether the concentrator can store source route data : if so this informs a network node that repeated sending of second messages is unnecessary. Another example of a characteristic is the duration the concentrator can store source route data - this can inform a network node that further sending of second messages is unnecessary before the duration period expires. Other examples may be related to application requirements, for example in the case where the node is mobile relative to the concentrator such that its path (via intermediate nodes) to the concentrator may change over time. It should be noted that concentrator characteristics can change dynamically over time, for example a concentrator's capacity to store source route data can become temporarily, or even permanently, constrained due to demands of an application, or the network activity of other nodes, affecting the concentrator. Similarly, a concentrator can inform nodes of positive effects, for example that it is no longer constrained, perhaps due to lower network activity or even a hardware upgrade. Advantageously, the concentrator can inform the network nodes of characteristics independently of involvement of a user or network administrator (if any). - Referring back to
Figure 2a , thefirst message 112 is transferred across node_x and node_y, as already described in relation toFigure 1 previously. On arrival at node_z offirst message 120,node_z 108 inaddition stores 202 one ormore concentrator characteristics 204. The method then proceeds at 130 to send a second message, as already described in relation toFigure 1 previously. Similarly a third message is generated at 142 and forwarded from theconcentrator 102 tonode_z 108, as also described in relation toFigure 1 previously. - In deciding whether further second messages are required to be sent from
node_z 108 to theconcentrator 102, in the example illustrated inFigure 2a node_z 108checks 206 the stored characteristics to determine whether or not the concentrator is constrained; that is whether or not it has limited capacity to store source route data for nodes. If it is constrained, then further sending of second messages is enabled 208. Consequently, a further second message is sent 152 fromnode_z 108 toconcentrator 102, as already described in relation toFigure 1 previously. Alternative, or further, checks according to the types of concentrator characteristics are possible as recognized by the skilled person, for instance based on the example characteristics discussed briefly above. - As an option, and as shown by dashed lines, the
third message 148 received bynode_z 108 can optionally update 210 the concentrator characteristics held by a particular node, such asnode_z 108 as shown in the Figure. This is useful to enable exceptions for a selected node or nodes (to have a different basis of communication with the concentrator with respect to other nodes)..For example where node_z generally sends many messages regularly to the concentrator, characteristics can be sent by a third message to permit suspension in sending second messages, even though the concentrator has previously advised nodes that it is ostensibly constrained (not normally able to store source route data). For this node therefore the concentrator would in fact cache (store) the source route data. In such a way, network bandwidth is conserved for nodes which communicate frequently with a constrained concentrator. Other examples of exceptions can be identified. As an example, in order to ensure robust communication with a particular node, that node might be advised to send further second messages even though the concentrator has the capacity to store source route data. -
Figure 2b represents a schematic of an alternative method for determining routing information for a network of nodes. Features common to those ofFigures 1 and2a are denoted using the same reference numerals. Unlike the method depicted inFigure 2a , in the method ofFigure 2b one or morerelevant characteristics 200 of theconcentrator 102 are included in the sent 142 third message, none having initially been sent 110 in thefirst message 112. Thethird message 144 is transferred across node_x and node_y, as already described in relation toFigures 1 and2a previously. On arrival at node_z ofthird message 148,node z 108 inaddition stores 202 one ormore concentrator characteristics 204, replacing one or more default characteristics (not shown inFigure 2b ) already stored forconcentrator 102. - In deciding whether further second messages are required to be sent from
node_z 108 to theconcentrator 102,node_z 108checks 206 the stored characteristics to determine whether or not the concentrator is constrained. In the case where it is constrained, then further sending of second messages is enabled 208. Compared to the method ofFigure 2a , the method illustrated inFigure 2b provides an alternative mechanism to regulate network bandwidth usage whilst avoiding use of first messages to send concentrator characteristic(s). - Clearly, a combination of methods illustrated by
Figures 2a and2b is also possible, for example where a subset of concentrator characteristics is sent using the first message, which subset is subsequently augmented or updated using the third message. -
Figure 3 shows generally at 300 a network comprising two concentrators and a variety of nodes.Concentrator 302 communicates withnode_u 304 and node_t 306 usingwireless links Concentrator 302 also communicates wirelessly 314 with node x 312. In turn,node_x 312 communicates withnode_v 318 viawireless link 316 and withnode_y 322 viawireless link 320. In turn,node_y 322 communicates withnode_w 326 viawireless link 324 and withnode_z 330 viawireless link 328.Node_z 330 also communicates withconcentrator 340 usingwireless link 342. The highlighted network entities ofconcentrator 302,node_x 312,node_y 322 andnode_z 330 represent the concentrator and nodes as discussed in relation toFigures 1 ,2a and2b above. Of particular note is that node_z maintains (not shown in the Figure) stored characteristics for each concentrator 302, 340 with which it communicates and adjusts the sending of further second messages to each concentrator in dependence on the characteristic(s) it currently holds for that concentrator. The skilled person will recognize that, in general, nodes operating in a network comprising more than one concentrator will need also to store an associated concentrator identifier with the node identifier recorded when the first message (e.g. message Figures 1 ,2a and2b ) traverses the network. The method is applicable to a range of wired and wireless networks, including wide area networks such as the Internet, and wireless IrDA, Wi-Fi or Bluetooth networks, etc. It is particularly suited to situations where cost is important, such as ZigBee network concentrators and nodes. -
Figure 4 shows an example first messagestructure comprising header 402,payload 404 and a field forconcentrator characteristics 406. Clearly any suitable packet construction can be adopted to implement the present invention, as is readily identifiable to the skilled person. In a preferred example a ZigBee route request frame is suitably modified to incorporate a field for concentrator characteristics. As an option a modified ZigBee network layer data frame is suitably modified to incorporate a field for concentrator characteristics when signaling such characteristics to a particular node. The syntax of the concentrator characteristics field can be determined according to the requirements of the application or protocol and the range of identified concentrator characteristics, and is readily identifiable by the skilled person. - The foregoing method and implementations are presented by way of examples only and represent a selection of a range of methods and implementations that can readily be identified by a person skilled in the art to exploit the advantages of the present invention.
- In the description above and with reference to the Figures there are provided methods and systems in which an
invitation message concentrator 102 to nodes in a network. Eachnode records 124 anidentifier 126 of the node or concentrator from which it received the message and forwards 122 the message to its neighbors. Anode 108 then sends atrace message concentrator 102 viaintermediate nodes subsequent message node 108 using the identifiers included in the trace message. The invitation message and/or the subsequent message includes characteristic(s) 200 of the concentrator one or more of which are then stored by nodes, includingnode 108. The characteristic(s) are used in deciding 206, 208 to send further trace messages, thereby regulating use of network bandwidth.
Claims (16)
- A method for determining routing information for a multi-hop network, which network comprises nodes and at least one concentrator, the method comprising:- sending (110) a first message from the concentrator to said nodes in the network, wherein each node records an identifier of the node or concentrator from which it receives the first message and then forwards the first message to its neighboring nodes;- sending (130) a second message from a first node identifying said first node to the concentrator, which second message traverses any intermediate nodes traversed by the first message to reach the first node and has appended thereto the identifier of each such intermediate node; and- determining a route for a third message from the concentrator to the first node according to the identifiers included in the second message, said third message including the source route data to the first node;characterized in that, the first message further comprises at least one characteristic of the concentrator, said at least one characteristic of the concentrator comprising an indication relative to the concentrator ability to store source route data, the method further comprising:- recording (202) the at least one characteristic at the first node; and,- sending (152) a further second message at least partially in dependence on the at least one characteristic.
- A method as claimed in claim 1, wherein a characteristic of the concentrator is an indicator denoting the amount of storage capacity available for storing identifiers.
- A method as claimed in any of claims 1 to 2, wherein the first message is a modified ZigBee route request frame.
- A method as claimed in any of claims 1 to 3, wherein the second message is a ZigBee route record command frame.
- A method as claimed in any of claims 1 to 3, wherein the second message is a modified ZigBee network layer data frame.
- A method as claimed in any of claims 1 to 5, wherein the third message is a modified ZigBee network layer data frame.
- A system for determining routing information for a multi-hop network, which network comprises nodes and at least one concentrator, the system comprising:- the concentrator (302, 340) operable to send a first message to said nodes in the network;- a first node (330) operable to:- record an identifier of the node or concentrator from which it receives the first message;- forward the first message to its neighboring nodes;- send a second message from the first node identifying the first node to the concentrator, which second message traverses any intermediate nodes traversed by the first message to reach the first node and has appended thereto the identifier of each such intermediate node; and- the concentrator (302, 340) then being operable to:characterized in that,- receive the second message; and- determine a route for a third message from the concentrator to the first node according to the identifiers included in the second message, said third message including the source route data to the first node;- the concentrator (302, 340) is further operable to include at least one characteristic of the concentrator in the first message, said at least one characteristic of the concentrator comprising an indication relative to the concentrator ability to store source route data, and- the first node (330) is further operable to:- record the at least one characteristic at the first node; and,- send a further second message at least partially in dependence on the at least one characteristic.
- A system as claimed in claim 7, wherein a characteristic of the concentrator is an indicator denoting the amount of storage capacity available for storing identifiers.
- A system as claimed in any of claims 7 to 8, wherein the first message is a modified ZigBee route request frame.
- A system as claimed in any of claims 7 to 9, wherein the second message is a ZigBee route record command frame.
- A system as claimed in any of claims 7 to 9, wherein the second message is a modified ZigBee network layer data frame.
- A system as claimed in any of claims 7 to 11, wherein the third message is a modified ZigBee network layer data frame.
- A concentrator for use in the system as claimed in any of claims 7 to 12.
- A node for use in the system as claimed in any of claims 7 to 12.
- Software instructions for causing a processor to perform the method of any one of claims 1 to 6.
- A machine-readable data carrier storing the instructions of claim 15.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP07700553.6A EP1980061B1 (en) | 2006-01-18 | 2007-01-09 | Improved route determining methods for a network |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP06100531 | 2006-01-18 | ||
EP07700553.6A EP1980061B1 (en) | 2006-01-18 | 2007-01-09 | Improved route determining methods for a network |
PCT/IB2007/050059 WO2007083249A1 (en) | 2006-01-18 | 2007-01-09 | Improved route determining methods for a network |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1980061A1 EP1980061A1 (en) | 2008-10-15 |
EP1980061B1 true EP1980061B1 (en) | 2016-04-13 |
Family
ID=37964650
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP07700553.6A Active EP1980061B1 (en) | 2006-01-18 | 2007-01-09 | Improved route determining methods for a network |
Country Status (7)
Country | Link |
---|---|
US (1) | US8385323B2 (en) |
EP (1) | EP1980061B1 (en) |
JP (1) | JP5068769B2 (en) |
CN (1) | CN101371531B (en) |
ES (1) | ES2576452T3 (en) |
TW (1) | TW200746717A (en) |
WO (1) | WO2007083249A1 (en) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102007038592B3 (en) | 2007-08-16 | 2008-10-23 | Raumcomputer Entwicklungs- Und Vertriebs Gmbh | Building services integrating system, has switches connected with controller, where data packets are marked with identification of switch and are passed along their path via network of each switch that adds identification to list in packets |
CN102124764B (en) * | 2009-05-22 | 2014-01-08 | 华为技术有限公司 | Method, device and system for information pushing and method and device for obtaining information |
US9689955B2 (en) * | 2011-02-24 | 2017-06-27 | Corvus Technologies Corp | Ranging system using active radio frequency (RF) nodes |
KR101909129B1 (en) * | 2012-01-18 | 2018-10-17 | 삼성전자주식회사 | Method and apparatus for controlling zigbee device |
US10136341B2 (en) * | 2017-01-03 | 2018-11-20 | Simmonds Precision Products, Inc. | Wireless data concentrator systems and methods |
FR3105677A1 (en) * | 2019-12-20 | 2021-06-25 | Orange | Message routing method, associated network equipment |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6594701B1 (en) * | 1998-08-04 | 2003-07-15 | Microsoft Corporation | Credit-based methods and systems for controlling data flow between a sender and a receiver with reduced copying of data |
JP4454794B2 (en) * | 2000-05-30 | 2010-04-21 | キヤノン株式会社 | Communication method for mobile communication system |
US7764617B2 (en) * | 2002-04-29 | 2010-07-27 | Harris Corporation | Mobile ad-hoc network and methods for performing functions therein based upon weighted quality of service metrics |
US7680073B2 (en) * | 2002-05-31 | 2010-03-16 | Koninklijke Philips Electronics N.V. | Message routing in a radio network |
GB0313473D0 (en) | 2003-06-11 | 2003-07-16 | Koninkl Philips Electronics Nv | Configuring a radio network for selective broadcast |
JP2005159670A (en) * | 2003-11-25 | 2005-06-16 | Oki Electric Ind Co Ltd | Path control system and method |
JP2007529135A (en) * | 2003-12-23 | 2007-10-18 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | Predictive ad hoc |
KR100667318B1 (en) * | 2004-02-12 | 2007-01-12 | 삼성전자주식회사 | Method of multicast in ZigBee network |
-
2007
- 2007-01-09 JP JP2008550882A patent/JP5068769B2/en active Active
- 2007-01-09 WO PCT/IB2007/050059 patent/WO2007083249A1/en active Application Filing
- 2007-01-09 ES ES07700553.6T patent/ES2576452T3/en active Active
- 2007-01-09 EP EP07700553.6A patent/EP1980061B1/en active Active
- 2007-01-09 CN CN200780002653.1A patent/CN101371531B/en active Active
- 2007-01-09 US US12/160,904 patent/US8385323B2/en active Active
- 2007-01-15 TW TW096101483A patent/TW200746717A/en unknown
Also Published As
Publication number | Publication date |
---|---|
EP1980061A1 (en) | 2008-10-15 |
JP2009524325A (en) | 2009-06-25 |
CN101371531A (en) | 2009-02-18 |
ES2576452T3 (en) | 2016-07-07 |
US8385323B2 (en) | 2013-02-26 |
TW200746717A (en) | 2007-12-16 |
JP5068769B2 (en) | 2012-11-07 |
US20100177679A1 (en) | 2010-07-15 |
WO2007083249A1 (en) | 2007-07-26 |
CN101371531B (en) | 2013-08-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP2899930B1 (en) | Gateways and routing in software-defined manets | |
EP2899931B1 (en) | Service-oriented routing in software-defined manets | |
Cao et al. | A reliable and efficient encounter-based routing framework for delay/disruption tolerant networks | |
EP2361485B1 (en) | Selective a priori reactive routing | |
US20060293061A1 (en) | Radio communication device and route search method | |
Pham et al. | Increasing the network performance using multi-path routing mechanism with load balance | |
EP1980061B1 (en) | Improved route determining methods for a network | |
JP2006311495A (en) | Radio communication device, communication route control device, communication route control method, and communication system | |
Cao et al. | A geographic multicopy routing scheme for DTNs with heterogeneous mobility | |
Ramkumar et al. | Improved Wolf prey inspired protocol for routing in cognitive radio Ad Hoc networks | |
Kush et al. | Energy efficient Routing for MANET | |
Devi et al. | Content based routing using information centric network for IoT | |
Martirosyan et al. | Energy-aware and quality of service-based routing in wireless sensor networks and vehicular ad hoc networks | |
Shi | Semi-Probabilistic Routing in Intermittently Connected Mobile Ad Hoc Networks. | |
Yang et al. | A swarm-intelligence-based protocol for data acquisition in networks with mobile sinks | |
Kaur et al. | Analysis of traffic impact on proposed congestion control scheme in AODV | |
Sara et al. | Evaluation and comparison of emerging energy efficient routing protocols in MANET | |
Koutsogiannis et al. | Storage-enabled access points for improved mobile performance: an evaluation study | |
KR20100068153A (en) | Path setting apparatus and method based on attributes of an ad-hoc network | |
Venugopal et al. | LRTHR: Link-Reliability Based Two-Hop Routing for WSNs | |
Munjal et al. | Sustainable Crowdsensing Data Dissemination Using Public Vehicles | |
Cao et al. | Multiple-metric hybrid routing protocol for heterogeneous wireless access networks | |
Laloo et al. | Trade-off between Accuracy and Longevity in Wireless Sensor Networks | |
Reddy et al. | CL-mWSNs: Cross Layer Model-Based QoS Centric Routing Protocol for Mission-Critical Cooperative Communication in Mobile WSNs | |
Boyana et al. | Design And Analysis Of Qos Based Routing Protocols For Dynamic Data Transmission In Wireless Adhoc Networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20080818 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR |
|
17Q | First examination report despatched |
Effective date: 20120113 |
|
DAX | Request for extension of the european patent (deleted) | ||
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: KONINKLIJKE PHILIPS N.V. |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R079 Ref document number: 602007045762 Country of ref document: DE Free format text: PREVIOUS MAIN CLASS: H04L0012560000 Ipc: H04L0012701000 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04L 12/721 20130101ALI20151001BHEP Ipc: H04L 12/701 20130101AFI20151001BHEP |
|
INTG | Intention to grant announced |
Effective date: 20151020 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: REF Ref document number: 791146 Country of ref document: AT Kind code of ref document: T Effective date: 20160415 Ref country code: CH Ref legal event code: EP |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602007045762 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: ES Ref legal event code: FG2A Ref document number: 2576452 Country of ref document: ES Kind code of ref document: T3 Effective date: 20160707 |
|
REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG4D |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 791146 Country of ref document: AT Kind code of ref document: T Effective date: 20160413 |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20160413 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160714 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160816 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602007045762 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 11 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed |
Effective date: 20170116 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20170131 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20170131 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: MM4A |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20170109 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: TQ Owner name: PHILIPS LIGHTING HOLDING B.V., NL Effective date: 20171120 Ref country code: FR Ref legal event code: TQ Owner name: KONINKLIJKE PHILIPS N.V., NL Effective date: 20171120 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 12 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R081 Ref document number: 602007045762 Country of ref document: DE Owner name: SIGNIFY HOLDING B.V., NL Free format text: FORMER OWNER: KONINKLIJKE PHILIPS N.V., EINDHOVEN, NL Ref country code: DE Ref legal event code: R082 Ref document number: 602007045762 Country of ref document: DE Representative=s name: MEISSNER BOLTE PATENTANWAELTE RECHTSANWAELTE P, DE Ref country code: DE Ref legal event code: R081 Ref document number: 602007045762 Country of ref document: DE Owner name: PHILIPS LIGHTING HOLDING B.V., NL Free format text: FORMER OWNER: KONINKLIJKE PHILIPS N.V., EINDHOVEN, NL Ref country code: DE Ref legal event code: R081 Ref document number: 602007045762 Country of ref document: DE Owner name: KONINKLIJKE PHILIPS N.V., NL Free format text: FORMER OWNER: KONINKLIJKE PHILIPS N.V., EINDHOVEN, NL |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20170109 |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: 732E Free format text: REGISTERED BETWEEN 20190307 AND 20190313 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: HU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO Effective date: 20070109 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160413 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CY Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20160413 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160813 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R082 Ref document number: 602007045762 Country of ref document: DE Representative=s name: MEISSNER BOLTE PATENTANWAELTE RECHTSANWAELTE P, DE Ref country code: DE Ref legal event code: R081 Ref document number: 602007045762 Country of ref document: DE Owner name: KONINKLIJKE PHILIPS N.V., NL Free format text: FORMER OWNERS: KONINKLIJKE PHILIPS N.V., EINDHOVEN, NL; PHILIPS LIGHTING HOLDING B.V., EINDHOVEN, NL Ref country code: DE Ref legal event code: R081 Ref document number: 602007045762 Country of ref document: DE Owner name: SIGNIFY HOLDING B.V., NL Free format text: FORMER OWNERS: KONINKLIJKE PHILIPS N.V., EINDHOVEN, NL; PHILIPS LIGHTING HOLDING B.V., EINDHOVEN, NL |
|
REG | Reference to a national code |
Ref country code: ES Ref legal event code: PC2A Owner name: SIGNIFY HOLDING B.V. Effective date: 20210329 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R079 Ref document number: 602007045762 Country of ref document: DE Free format text: PREVIOUS MAIN CLASS: H04L0012701000 Ipc: H04L0045000000 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 17 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20230124 Year of fee payment: 17 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: TR Payment date: 20230102 Year of fee payment: 17 Ref country code: IT Payment date: 20230120 Year of fee payment: 17 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: ES Payment date: 20240209 Year of fee payment: 18 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20240129 Year of fee payment: 18 Ref country code: GB Payment date: 20240123 Year of fee payment: 18 |