EP2567250B1 - Signal phase-based location of network nodes - Google Patents
Signal phase-based location of network nodes Download PDFInfo
- Publication number
- EP2567250B1 EP2567250B1 EP11721171.4A EP11721171A EP2567250B1 EP 2567250 B1 EP2567250 B1 EP 2567250B1 EP 11721171 A EP11721171 A EP 11721171A EP 2567250 B1 EP2567250 B1 EP 2567250B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- node
- signal
- reference node
- receiving
- 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
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
- G01S5/0284—Relative positioning
- G01S5/0289—Relative positioning of multiple transceivers, e.g. in ad hoc networks
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
- G01S5/0205—Details
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
- G01S5/04—Position of source determined by a plurality of spaced direction-finders
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
- G01S5/06—Position of source determined by co-ordinating a plurality of position lines defined by path-difference measurements
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
- G01S5/10—Position of receiver fixed by co-ordinating a plurality of position lines defined by path-difference measurements, e.g. omega or decca systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Definitions
- the invention relates generally to wireless networks, and more specifically in one embodiment to locating mobile wireless mesh network nodes.
- Bluetooth technology that enables a cell phone user to associate and use an earpiece in what is sometimes referred to a personal area network or PAN.
- PAN personal area network
- Another example is a mesh network, in which a number of devices work together to form a mesh, such that data can be sent from a source device to a destination device via other devices in the mesh network.
- Mesh networks often include multiple links from a network node to other network nodes nearby, and can thereby provide routing around broken links or paths by discovering other routes through the mesh to a destination node.
- New nodes to a mesh network are typically able to automatically discover the mesh network when they are activated in the vicinity of a compatible mesh network, and can easily join the network.
- Mesh networks are often made up of network nodes that are not mobile, and so link quality and reliability is relatively slow to change. Most applications of mesh networks rely on radio frequency communications to transfer data between network nodes, as running cables between nodes defeats somewhat the intended ease of installation and use of mesh network devices.
- Mesh network device installations often have multiple networks deployed in remote locations, and are managed from a central location or server.
- the central location computer might have knowledge of what devices are within each of the mesh networks under management, but typically does not have direct access to the network nodes or knowledge of the location of each node in the network.
- a mesh network controller might monitor an array of network nodes attached to various tools or production equipment in a facility and know the location of some fixed nodes in the facility, but will not know the location of other, mobile nodes in the network.
- the present teaching provides a method for determining the physical position of a movable node in a network as detailed in claim 1. Also provided is a wireless network as detailed in claim 6. Advantageous features are provided in the dependent claims.
- One example embodiment of the invention comprises determining the physical position of a movable node in a wireless network by sending a first signal from a first reference node to at least a second reference node and the unknown node.
- the unknown node receives the first signal and sends a second signal to at least the second reference node in phase with the first signal.
- the first signal and the second signal are received in the second reference node and the phase of the received signals is compared to determine the position of the unknown node based on the phase difference between the received first and second signals.
- mesh networks are often used to route data between various elements or nodes in a network made up of a number of loosely assembled nodes.
- Mesh networks are designed such that a compatible node can easily join the network and receive and send data, including passing received data along a route to an intended destination node.
- Mesh networks are therefore considered self-arranging and self-healing, in that if a node becomes inoperable or loses a connection to another node, data can be easily routed around the broken network link.
- mesh network technologies use wireless communication, further enhancing the ease of use of mesh networking for certain applications. Because deployed mesh network nodes are typically stationary for some period of time, wireless connections between various nodes can be formed and characterized by searching a known frequency or radio band for other mesh network nodes as new wireless nodes are added to the mesh network. Recent reductions in cost and advancement in wireless networking technology has made use of mesh networking for a variety of applications a desirable alternative to using a more structured network such as a TCP/IP network or other type of network.
- ZigBee mesh network One example of a mesh network standard using wireless radio communication is the ZigBee mesh network, which was developed by an industry alliance and is related to IEEE standards including 802.15.4.
- the retail price of ZigBee-compliant transceivers is nearly a dollar, and a transceiver, memory, and processor can be bought for a few dollars in quantity, making integration of mesh network technology into inexpensive electronic devices a practical option.
- the standard is intended to support low power consumption at reasonably low data rates, and provides a self-organizing network technology that works well for applications such as control, monitoring, sensing, and home automation.
- one node operates as a coordinator, forming the root of the mesh network and performing other functions such as bridging to other networks and handling encryption keys.
- Most nodes are router nodes, which can receive and send data, including passing data along to other nodes.
- end device nodes contain just enough functionality to receive and send data, but cannot route or pass data from a sending node to a different receiving node. While this preserves battery life and reduces the cost of the node, end device nodes are unable to contribute to the routing functions of the mesh network, and so will typically not make up a large percentage of a mesh network's nodes.
- Each node in a ZigBee network sends a regular link status message, enabling its neighbor nodes to record the neighboring node as a neighbor, along with other information such as the link quality or signal strength.
- the paths within the network are managed within the individual router nodes that make up the bulk of the network, which maintain routing information regarding their links directly to other nodes but do not contain full routing capability. For example, a ZigBee node may know that to forward a message to node it should send the message to its neighboring node, but it does not know the route the message takes from the neighbouring node to the node.
- ZigBee primarily uses technology known as Ad-hoc On-demand Distance Vector (AODV) to automatically construct an ad-hoc network by use of a route discovery process.
- An originating node broadcasts a route request command, which keeps track of its source, and other characteristics such as the number of nodes traversed and link quality between nodes as it progresses through the network.
- the destination node receives one or more copies of the broadcast request, and sends back a reply indicating which of the one or more routes discovered to use based on factors such as the number of hops and link quality between nodes.
- Each of the intermediate nodes maintains a list of immediate neighbor nodes to use for various destination nodes, but does not maintain a complete route.
- ZigBee also includes many-to-one routing and source routing in some embodiments (e.g. ZigBee PRO) in which aggregator nodes are used to collect regular messages from multiple other nodes, such as where an aggregator is a gateway node in a sensor network.
- Source routing allows the aggregator to store complete routes to several other nodes in the network, where the route is determined by an aggregator node broadcast message and reply process. Sending a message to an aggregator using such a stored broadcast message path rather than route discovery is often known as "many-to-one" routing.
- ZigBee nodes are not given traditional network addresses such as in a TCP/IP network, and routing within the ZigBee network is different than in an IP network, it is difficult for an outside network such as a TCP/IP, SMS, or other network to directly communicate with a specific node in a mesh network.
- an outside network such as a TCP/IP, SMS, or other network
- Some solutions to network node position determination include using GPS (Global Positioning System) receivers in the nodes, such that the GPS receiver can provide the node with its location. This significantly raises the cost and complexity of the node, as a GPS receiver must then be added to each such node, and the node must be able to receive strong enough GPS signals to make a position determination.
- GPS Global Positioning System
- Other systems use a common timebase and methods of triangulation or trilateration, but require a significant number of messages be passed from the mobile node to determine time of flight to at least three other nodes with known positions.
- One example embodiment of the invention therefore provides a system and method for using a single broadcast timing signal from a first reference node, and a second fixed node that receives the timing signal from the first node and from a node of unknown position.
- the unknown node repeats the timing signal from the first node in phase with and at the same frequency as the first node, enabling the second node to determine the unknown node's position to one of two points on a plane, such as a factory floor.
- a third fixed node enables location of the unknown node to one of two points in another plane, enabling three dimensional determination of the unknown node's position.
- Figure 1 illustrates a first node 101 and a second node 102 having known positions.
- a third node 103 is within radio range of both nodes 101 and 102, but its position is not known.
- node 3 is shown as being along an arc that runs between nodes 101 and 102, the node may be beyond one of the nodes in a further embodiment such that one of the nodes with known position is further away from the unknown node than from the other node with a known position.
- the distance d3 is similarly unknown, and these distances d1, d2, and d3 are determined to find the location of unknown node N3 as shown at 103.
- At least one of the nodes having a known location, 101 and 102 broadcasts a signal such as a burst location signal.
- the burst location signal is a burst signal that includes signals at three different frequencies relatively near one another, and for a long enough period that nodes N2 at 102 and N3 at 103 can receive the signals and track the phase and frequency such as by using the received signals to drive a phase locked loop or by another suitable method at three distinct frequencies.
- the received signals in a further example are frequency filtered so that the phase of three distinct signals at three different frequencies can be tracked independently.
- the broadcast signal is here first received by the nearer node 103, which synchronizes in phase and frequency with the signal received and broadcasts its own signal in phase with the received signal.
- the broadcast signals from the fixed node N1 at 101 and the unknown N3 node at 103 are received in the fixed node N2, which is operable to compare the phase of the two burst signals received and determine the position of the unknown node N3.
- the phase difference is used to determine the difference in d1+d2 and d1+d3, the phase can be used to determine the position of the unknown node to one of two positions on a plane having the known difference between d2 and d3, as shown at 103 and 104 in Figure 1 .
- the plane cannot be determined using the method described above alone.
- the position of the unknown node 103 can be found to be in one of two positions 103 and 104 on the plane if the plane is already known, such as knowing that all three nodes are on the ground or on the floor of a single-story factory.
- the unknown node may be anywhere along a circle having its center at the point where d1 and d2 meet in Figure 1 , such as on different locations of different floors in a multi-story building.
- Figure 2 shows a group of equations that can be used to determine the position of an unknown node such as N3 of Figure 1 , consistent with an example embodiment of the invention.
- a variety of measurements are taken, denoted A, B, and D, and are used to solve the given equations for the distances d1, d2, and d3 as reflected in Figure 1 .
- the N1 node makes a transmission to N3, which synchronizes with the phase of N1's transmission as previously described and sends a signal in phase with the received signal to N2.
- N2 is also able to either directly receive the same signal sent to N3, or receive a separate signal from N1 in phase with the signal N1 sent to N2, and to compare the phases of the signals from N1 and N2.
- This enables the node N2 to calculate a difference in path lengths between the distance from N1 to N2 (or d1+d2) and N1 to N3 to N2 (or d1+d3), plus some integer multiple of the signal's wavelength. This is reflected by the equation for A at 201, which reduces to the difference between distances d2 and d3.
- N1 sending a signal to N2, which relays an in-phase signal to N3.
- a transmission from N1 to N3 enables N3 to compare phases of the received signals just as N2 did to derive the previous equation, resulting in the equation for B at 202.
- the difference between the N1 to N2 to N3 path and the N1 to N3 path reduces to d2+d3, as also reflected at 202.
- the distance D is known because the locations of nodes N1 and N2 are known, and can be used to solve for either d1 or d2 if the other distance is known, as shown at 203.
- Combination of the reduced equations for A at 201 and B at 202 is shown at 204, which reflects that two times d2 is equal to A plus B. Because A and B are known, the value of d2 can be calculated as shown at 205, and substituted back into equations 201-203 to find d1 and d3 as well.
- the end result of these calculations is derivation of the distances d1, d2, and d3, which indicate the position of the node N3 relative to nodes N1 and N2 having known positions. If the three nodes are in the same plane, such as all located within the same floor of a factory building or hospital, the location of N3 can be determined to be one of two positions, as reflected in Figure 1 . If the plane defined by nodes N1, N2, and N3 is not known, the location of N3 is determined to be at any point having distance d1 from N1 and d2 from n2, which forms a circle having the line linking N1 and N2 at its center.
- Figure 3 is a flowchart, illustrating a method (301, 302, 303, 304) of finding the location of an unknown node in three dimensions, consistent with an example embodiment of the invention.
- some event triggers a node location process to determine the physical location of a node N3 in a network such as a wireless mesh network.
- the trigger event is in some embodiments a user-initiated query, such as a query regarding the location of a particular piece of equipment physically associated with the node N3, and in other examples is initiated by a node controller system periodically or when a node in the network appears to have an unknown location or to have moved.
- the process is repeated using another pair of nodes having known locations to derive another circle of possible locations for the unknown node at 203.
- two additional nodes N4 and N5 are used to determine another circle of possible node locations.
- the unknown node location solutions found at 202 and 203 form two circles that will desirably intersect at only one point, resulting in a single well-defined node location as shown at 204.
- the nodes N4 and N5 may be chosen not to be particularly near N1 and N2, and chosen so that the line connecting nodes N1 and N2 is not parallel to or is largely orthogonal to the line connecting nodes N4 and N5. This results in the two solution circles centered about the lines connecting the nodes N1-N2 and N4-N5 being in planes that are orthogonal rather than parallel to one another, to reduce the possibility of appearance of multiple intersections between the solution circles.
- the solution circles will intersect at two points, leaving some potential ambiguity as to the unknown node's physical location.
- the wavelength of the received signal is short enough that the phase of the signal received at receiving nodes repeats several times within the possible realm of locations of the unknown node.
- Each location process such as described in conjunction with Figure 2 therefore provides a series of possible solutions, such that additional information is needed to determine the unknown node's position.
- the process is repeated multiple times (such as three times) at frequencies relatively near one another, such that the solution series from the three repetitions of the location process overlap at only one solution point within a reasonable solution space.
- the examples presented here illustrate how passing signals from node to node in phase with an originating node can be used to determine the position of an unknown node.
- the approach described herein has a variety of advantages over systems currently in use, such as not needing complicated and expensive Global Positioning System hardware or carefully synchronized clocks distributed between nodes.
- Other mesh networks such as DigiMesh and non-mesh networks such as Wi-Fi and wireless cellular networks can also use the methods described herein to determine the position of a mobile node in the network using two or more other nodes having known locations.
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Mobile Radio Communication Systems (AREA)
Description
- This application claims the benefit of priority of
U.S. Patent Application No. 121774,862 , entitled "SIGNAL PHASE-BASED LOCATION OF NETWORK NODES," which was filed on May 6, 2010. - The invention relates generally to wireless networks, and more specifically in one embodiment to locating mobile wireless mesh network nodes.
- Although computer networks have become relatively common both in office and in home networking environments, such networks are typically fairly sophisticated and require significant processing power, electrical power, and infrastructure to work well. Some networking applications do not require so robust a network environment, but can benefit from the ability to provide electronic communications between devices.
- One such example is the Bluetooth technology that enables a cell phone user to associate and use an earpiece in what is sometimes referred to a personal area network or PAN. Another example is a mesh network, in which a number of devices work together to form a mesh, such that data can be sent from a source device to a destination device via other devices in the mesh network.
- Mesh networks often include multiple links from a network node to other network nodes nearby, and can thereby provide routing around broken links or paths by discovering other routes through the mesh to a destination node. New nodes to a mesh network are typically able to automatically discover the mesh network when they are activated in the vicinity of a compatible mesh network, and can easily join the network.
- Mesh networks are often made up of network nodes that are not mobile, and so link quality and reliability is relatively slow to change. Most applications of mesh networks rely on radio frequency communications to transfer data between network nodes, as running cables between nodes defeats somewhat the intended ease of installation and use of mesh network devices.
- Mesh network device installations often have multiple networks deployed in remote locations, and are managed from a central location or server. The central location computer might have knowledge of what devices are within each of the mesh networks under management, but typically does not have direct access to the network nodes or knowledge of the location of each node in the network. For example, a mesh network controller might monitor an array of network nodes attached to various tools or production equipment in a facility and know the location of some fixed nodes in the facility, but will not know the location of other, mobile nodes in the network.
- An example of prior art is
US3714650 (A ). - There exists a need to provide network technology that addresses factors such as management of wireless network nodes.
- The present teaching provides a method for determining the physical position of a movable node in a network as detailed in claim 1. Also provided is a wireless network as detailed in claim 6. Advantageous features are provided in the dependent claims.
- One example embodiment of the invention comprises determining the physical position of a movable node in a wireless network by sending a first signal from a first reference node to at least a second reference node and the unknown node. The unknown node receives the first signal and sends a second signal to at least the second reference node in phase with the first signal. The first signal and the second signal are received in the second reference node and the phase of the received signals is compared to determine the position of the unknown node based on the phase difference between the received first and second signals.
-
-
Figure 1 shows an example radio frequency mesh network comprising two reference nodes and a node having an unknown location, consistent with an example embodiment of the invention. -
Figure 2 illustrates equations used to determine the position of a movable node in a wireless network environment, consistent with an example embodiment of the invention. -
Figure 3 is a flowchart illustrating a method of finding the location of an unknown node in three dimensions by repeating a process in multiple planes, consistent with an example embodiment of the invention. - In the following detailed description of example embodiments of the invention, reference is made to specific examples by way of drawings and illustrations. These examples are described in sufficient detail to enable those skilled in the art to practice the invention, and serve to illustrate how the invention may be applied to various purposes or embodiments. Other embodiments of the invention exist and are within the scope of the invention, and logical, mechanical, electrical, and other changes may be made without departing from the subject or scope of the present invention. Features or limitations of various embodiments of the invention described herein, however essential to the example embodiments in which they are incorporated, do not limit the invention as a whole, and any reference to the invention, its elements, operation, and application do not limit the invention as a whole but serve only to define these example embodiments. The following detailed description does not, therefore, limit the scope of the invention, which is defined only by the appended claims.
- Many wireless networks such as mesh networks are often used to route data between various elements or nodes in a network made up of a number of loosely assembled nodes. Mesh networks are designed such that a compatible node can easily join the network and receive and send data, including passing received data along a route to an intended destination node. Mesh networks are therefore considered self-arranging and self-healing, in that if a node becomes inoperable or loses a connection to another node, data can be easily routed around the broken network link.
- Many mesh network technologies use wireless communication, further enhancing the ease of use of mesh networking for certain applications. Because deployed mesh network nodes are typically stationary for some period of time, wireless connections between various nodes can be formed and characterized by searching a known frequency or radio band for other mesh network nodes as new wireless nodes are added to the mesh network. Recent reductions in cost and advancement in wireless networking technology has made use of mesh networking for a variety of applications a desirable alternative to using a more structured network such as a TCP/IP network or other type of network.
- One example of a mesh network standard using wireless radio communication is the ZigBee mesh network, which was developed by an industry alliance and is related to IEEE standards including 802.15.4. The retail price of ZigBee-compliant transceivers is nearly a dollar, and a transceiver, memory, and processor can be bought for a few dollars in quantity, making integration of mesh network technology into inexpensive electronic devices a practical option. The standard is intended to support low power consumption at reasonably low data rates, and provides a self-organizing network technology that works well for applications such as control, monitoring, sensing, and home automation.
- In this example of wireless mesh technology, one node operates as a coordinator, forming the root of the mesh network and performing other functions such as bridging to other networks and handling encryption keys. Most nodes are router nodes, which can receive and send data, including passing data along to other nodes. In some embodiments, end device nodes contain just enough functionality to receive and send data, but cannot route or pass data from a sending node to a different receiving node. While this preserves battery life and reduces the cost of the node, end device nodes are unable to contribute to the routing functions of the mesh network, and so will typically not make up a large percentage of a mesh network's nodes.
- Although various nodes in the mesh network can communicate with other nodes using the node ID of the destination node, they do so in a different way than TCP/IP or many other network types. Each node in a ZigBee network sends a regular link status message, enabling its neighbor nodes to record the neighboring node as a neighbor, along with other information such as the link quality or signal strength. The paths within the network are managed within the individual router nodes that make up the bulk of the network, which maintain routing information regarding their links directly to other nodes but do not contain full routing capability. For example, a ZigBee node may know that to forward a message to node it should send the message to its neighboring node, but it does not know the route the message takes from the neighbouring node to the node.
- ZigBee primarily uses technology known as Ad-hoc On-demand Distance Vector (AODV) to automatically construct an ad-hoc network by use of a route discovery process. An originating node broadcasts a route request command, which keeps track of its source, and other characteristics such as the number of nodes traversed and link quality between nodes as it progresses through the network. The destination node receives one or more copies of the broadcast request, and sends back a reply indicating which of the one or more routes discovered to use based on factors such as the number of hops and link quality between nodes. Each of the intermediate nodes maintains a list of immediate neighbor nodes to use for various destination nodes, but does not maintain a complete route.
- ZigBee also includes many-to-one routing and source routing in some embodiments (e.g. ZigBee PRO) in which aggregator nodes are used to collect regular messages from multiple other nodes, such as where an aggregator is a gateway node in a sensor network. Source routing allows the aggregator to store complete routes to several other nodes in the network, where the route is determined by an aggregator node broadcast message and reply process. Sending a message to an aggregator using such a stored broadcast message path rather than route discovery is often known as "many-to-one" routing.
- Because ZigBee nodes are not given traditional network addresses such as in a TCP/IP network, and routing within the ZigBee network is different than in an IP network, it is difficult for an outside network such as a TCP/IP, SMS, or other network to directly communicate with a specific node in a mesh network. Although adding a new node to such a network and routing to the new node is relatively straightforward, as explained above, identification of the node's position relative to other fixed nodes is somewhat more difficult.
- Only the new node knows who all of its neighbors are and their relative signal strengths, enabling a crude approximation of position. But, signals can be attenuated or amplified by presence of metal objects in the area, such as in a warehouse environment, making such position determination using signal strength suspect. Because mesh networks are often used in monitoring or tracking applications where the physical location of a node is important, it is often desirable to be able to determine the physical position of a new or mobile node in such a wireless network environment.
- Some solutions to network node position determination include using GPS (Global Positioning System) receivers in the nodes, such that the GPS receiver can provide the node with its location. This significantly raises the cost and complexity of the node, as a GPS receiver must then be added to each such node, and the node must be able to receive strong enough GPS signals to make a position determination. Other systems use a common timebase and methods of triangulation or trilateration, but require a significant number of messages be passed from the mobile node to determine time of flight to at least three other nodes with known positions.
- One example embodiment of the invention therefore provides a system and method for using a single broadcast timing signal from a first reference node, and a second fixed node that receives the timing signal from the first node and from a node of unknown position. The unknown node repeats the timing signal from the first node in phase with and at the same frequency as the first node, enabling the second node to determine the unknown node's position to one of two points on a plane, such as a factory floor. Repeating the process with a third fixed node enables location of the unknown node to one of two points in another plane, enabling three dimensional determination of the unknown node's position.
- A more detailed example is presented in
Figure 1 , which illustrates afirst node 101 and asecond node 102 having known positions. Athird node 103 is within radio range of both 101 and 102, but its position is not known. Although node 3 is shown as being along an arc that runs betweennodes 101 and 102, the node may be beyond one of the nodes in a further embodiment such that one of the nodes with known position is further away from the unknown node than from the other node with a known position.nodes - In this example, the distances d1 and d2 are unknown, but the distance between
101 and 102 is known to be D. We therefore know that D=d1+d2. The distance d3 is similarly unknown, and these distances d1, d2, and d3 are determined to find the location of unknown node N3 as shown at 103.nodes - At least one of the nodes having a known location, 101 and 102, broadcasts a signal such as a burst location signal. In a more detailed embodiment, the burst location signal is a burst signal that includes signals at three different frequencies relatively near one another, and for a long enough period that nodes N2 at 102 and N3 at 103 can receive the signals and track the phase and frequency such as by using the received signals to drive a phase locked loop or by another suitable method at three distinct frequencies. The received signals in a further example are frequency filtered so that the phase of three distinct signals at three different frequencies can be tracked independently.
- The broadcast signal is here first received by the
nearer node 103, which synchronizes in phase and frequency with the signal received and broadcasts its own signal in phase with the received signal. The broadcast signals from the fixed node N1 at 101 and the unknown N3 node at 103 are received in the fixed node N2, which is operable to compare the phase of the two burst signals received and determine the position of the unknown node N3. - Because the phase difference is used to determine the difference in d1+d2 and d1+d3, the phase can be used to determine the position of the unknown node to one of two positions on a plane having the known difference between d2 and d3, as shown at 103 and 104 in
Figure 1 . Although the three 101, 102, and 103 form a plane, the plane cannot be determined using the method described above alone. The position of thenodes unknown node 103 can be found to be in one of two 103 and 104 on the plane if the plane is already known, such as knowing that all three nodes are on the ground or on the floor of a single-story factory. In another example where the plane is not known, the unknown node may be anywhere along a circle having its center at the point where d1 and d2 meet inpositions Figure 1 , such as on different locations of different floors in a multi-story building. -
Figure 2 shows a group of equations that can be used to determine the position of an unknown node such as N3 ofFigure 1 , consistent with an example embodiment of the invention. Here, a variety of measurements are taken, denoted A, B, and D, and are used to solve the given equations for the distances d1, d2, and d3 as reflected inFigure 1 . - In this example, the N1 node makes a transmission to N3, which synchronizes with the phase of N1's transmission as previously described and sends a signal in phase with the received signal to N2. N2 is also able to either directly receive the same signal sent to N3, or receive a separate signal from N1 in phase with the signal N1 sent to N2, and to compare the phases of the signals from N1 and N2. This enables the node N2 to calculate a difference in path lengths between the distance from N1 to N2 (or d1+d2) and N1 to N3 to N2 (or d1+d3), plus some integer multiple of the signal's wavelength. This is reflected by the equation for A at 201, which reduces to the difference between distances d2 and d3.
- A similar series of transmissions starts with N1 sending a signal to N2, which relays an in-phase signal to N3. A transmission from N1 to N3 enables N3 to compare phases of the received signals just as N2 did to derive the previous equation, resulting in the equation for B at 202. Here, the difference between the N1 to N2 to N3 path and the N1 to N3 path reduces to d2+d3, as also reflected at 202.
- The distance D is known because the locations of nodes N1 and N2 are known, and can be used to solve for either d1 or d2 if the other distance is known, as shown at 203. Combination of the reduced equations for A at 201 and B at 202 is shown at 204, which reflects that two times d2 is equal to A plus B. Because A and B are known, the value of d2 can be calculated as shown at 205, and substituted back into equations 201-203 to find d1 and d3 as well.
- The end result of these calculations is derivation of the distances d1, d2, and d3, which indicate the position of the node N3 relative to nodes N1 and N2 having known positions. If the three nodes are in the same plane, such as all located within the same floor of a factory building or hospital, the location of N3 can be determined to be one of two positions, as reflected in
Figure 1 . If the plane defined by nodes N1, N2, and N3 is not known, the location of N3 is determined to be at any point having distance d1 from N1 and d2 from n2, which forms a circle having the line linking N1 and N2 at its center. - Repetition of the above process using the same unknown node and another pair of known nodes will result in another set of possible solutions, such that the intersection of the two solutions will indicate the actual location of the unknown node, making position location in two or three dimensions possible using methods such as that described above.
-
Figure 3 is a flowchart, illustrating a method (301, 302, 303, 304) of finding the location of an unknown node in three dimensions, consistent with an example embodiment of the invention. At 301, some event triggers a node location process to determine the physical location of a node N3 in a network such as a wireless mesh network. The trigger event is in some embodiments a user-initiated query, such as a query regarding the location of a particular piece of equipment physically associated with the node N3, and in other examples is initiated by a node controller system periodically or when a node in the network appears to have an unknown location or to have moved. - The process described above with respect to
Figure 2 is then performed at 202, using nodes N1 and N2 having known locations to determine the location of node N3 as being some point on a circle centered about the axis linking N1 and N2 with its radius and position defined by the determined distances d1 and d3. - Because the exact physical location of the node can't be determined using this pair of nodes without further information regarding the unknown node's position, the process is repeated using another pair of nodes having known locations to derive another circle of possible locations for the unknown node at 203. In the example at 203, two additional nodes N4 and N5 are used to determine another circle of possible node locations.
- The unknown node location solutions found at 202 and 203 form two circles that will desirably intersect at only one point, resulting in a single well-defined node location as shown at 204. To increase the likelihood of the solution circles having a single, clearly defined point of intersection, the nodes N4 and N5 may be chosen not to be particularly near N1 and N2, and chosen so that the line connecting nodes N1 and N2 is not parallel to or is largely orthogonal to the line connecting nodes N4 and N5. This results in the two solution circles centered about the lines connecting the nodes N1-N2 and N4-N5 being in planes that are orthogonal rather than parallel to one another, to reduce the possibility of appearance of multiple intersections between the solution circles. In an extreme example, if the nodes N1-N2 and N1-N4 are used to find two solution circles, the solution circles will intersect at two points, leaving some potential ambiguity as to the unknown node's physical location.
- In some further embodiments, the wavelength of the received signal is short enough that the phase of the signal received at receiving nodes repeats several times within the possible realm of locations of the unknown node. Each location process such as described in conjunction with
Figure 2 therefore provides a series of possible solutions, such that additional information is needed to determine the unknown node's position. To solve this, the process is repeated multiple times (such as three times) at frequencies relatively near one another, such that the solution series from the three repetitions of the location process overlap at only one solution point within a reasonable solution space. - The examples presented here illustrate how passing signals from node to node in phase with an originating node can be used to determine the position of an unknown node. The approach described herein has a variety of advantages over systems currently in use, such as not needing complicated and expensive Global Positioning System hardware or carefully synchronized clocks distributed between nodes. Although the example above is presented in the context of a ZigBee mesh network, other mesh networks such as DigiMesh and non-mesh networks such as Wi-Fi and wireless cellular networks can also use the methods described herein to determine the position of a mobile node in the network using two or more other nodes having known locations.
- Although specific embodiments have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that any arrangement which is calculated to achieve the same purpose may be substituted for the specific embodiments shown. This application is intended to cover any adaptations or variations of the example embodiments of the invention described herein. It is intended that this invention be limited only by the claims, and the full scope of equivalents thereof.
Claims (10)
- A method of determining the physical position of a movable node in a network, comprising:sending a first signal from a first transmitting reference node (101) to a first receiving reference node (102) and the movable node (103), the first transmitting reference node and the first receiving reference node forming a first pair of reference nodes;receiving the first signal in the movable node and sending a second signal from the movable node to the first receiving reference node in phase with the first signal;receiving the first signal and the second signal in the first receiving reference node and comparing the phase of the received first and second signals; characterized bysending a third signal from a second transmitting reference node, different from the first transmitting reference node, to a second receiving reference node, different from the first receiving node, and the movable node, the second transmitting reference node and the second receiving reference node forming a second pair of reference nodes;receiving the third signal in the movable node and sending a fourth signal from the movable node to the second receiving reference node in phase with the third signal;receiving the third signal and the fourth signal in the second receiving reference node and comparing the phase of the received third signal and the received fourth signal; anddetermining the position of the movable node based on the phase difference between the received first and second signals and on the phase difference between the received third and fourth signals;wherein the first transmitting reference node, the first receiving reference node, the second transmitting reference node, and the second receiving reference node are positioned such that a line between the first transmitting reference node and the first receiving reference node is orthogonal to a line between the second transmitting reference node and the second receiving reference node.
- The method of determining the physical position of a movable node in a network of claim 1, wherein determining the position of the movable node comprises determining the position as one of two points on a plane defined by the first transmitting reference node, the first receiving reference node and the movable node.
- The method of determining the physical position of a movable node in a network of claim 1, further comprising repeating the method using two or more signal frequencies to resolve position ambiguity where signal wavelength is small relative to distances between nodes.
- The method of determining the physical position of a movable node in a network of claim 1, wherein the network nodes comprise at least one of a Zigbee, a DigiMesh, a Wi-Fi, and a cellular telephone network.
- The method of determining the physical position of a movable node in a network of claim 1, wherein one or more of the first transmitting reference node and the first receiving reference node comprise a mobile or movable node whose location has already been determined.
- A wireless network, comprising:a first transmitting reference node and a first receiving reference node having known positions and forming a first pair of reference nodes;a second transmitting reference node and a second receiving reference node, having known positions and forming a second pair of reference nodes, wherein the first transmitting reference node (101) is operable to send a first signal; anda movable node (103) operable to receive the first signal from the first transmitting reference node and send a second signal to the first receiving reference node (102) in phase with the first signal; characterized in thatwherein the second transmitting reference node is operable to send a third signal;
wherein the movable node is operable to receive the third signal from the second transmitting reference node and send a fourth signal to the second receiving reference node in phase with the third signal;
wherein the first receiving reference node is operable to receive and compare the phase of the first signal and second signal;
wherein the second receiving reference node is operable to receive and compare the phase of the third signal and the fourth signal;
wherein the position of the movable node is determined based on the phase difference between the received first and second signals and on the phase difference between the received third and fourth signals;
wherein the first transmitting reference node, the first receiving reference node, the second transmitting reference node, and the second receiving reference node are positioned such that a line between the first transmitting reference node and the first receiving reference node is orthogonal to a line between the second transmitting reference node and the second receiving reference node. - The wireless network of claim 6, wherein determining the position of the movable node comprises determining the position as one of two points on a plane defined by the first transmitting reference node, first receiving reference node and the movable node.
- The wireless network of claim 6, the first receiving reference node further operable to receive and compare signal phases using two or more signal frequencies to resolve position ambiguity where signal wavelength is small relative to distances between nodes.
- The wireless network of claim 6, wherein the network nodes comprise at least one of a Zigbee, a DigiMesh, a Wi-Fi, and a cellular telephone network.
- The wireless network of claim 6, wherein one or more of the first transmitting reference node and second reference nodes comprise a mobile or movable node whose location has already been determined.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US12/774,862 US8712444B2 (en) | 2010-05-06 | 2010-05-06 | Signal phase-based location of network nodes |
| PCT/US2011/035307 WO2011140308A1 (en) | 2010-05-06 | 2011-05-05 | Signal phase-based location of network nodes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| EP2567250A1 EP2567250A1 (en) | 2013-03-13 |
| EP2567250B1 true EP2567250B1 (en) | 2016-11-16 |
Family
ID=44351566
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| EP11721171.4A Active EP2567250B1 (en) | 2010-05-06 | 2011-05-05 | Signal phase-based location of network nodes |
Country Status (3)
| Country | Link |
|---|---|
| US (1) | US8712444B2 (en) |
| EP (1) | EP2567250B1 (en) |
| WO (1) | WO2011140308A1 (en) |
Families Citing this family (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2283474B1 (en) | 2008-04-14 | 2016-12-14 | Mojix, Inc. | Radio frequency identification tag location estimation and tracking system and method |
| EP2559014A4 (en) | 2010-04-14 | 2016-11-02 | Mojix Inc | Systems and methods for detecting patterns in spatio-temporal data collected using an rfid system |
| US8755331B2 (en) * | 2011-12-13 | 2014-06-17 | International Business Machines Corporation | Determining a physical location of a wireless mobile device |
| GB201202167D0 (en) * | 2012-02-08 | 2012-03-21 | Pratt Ian | A navigation device employing meshed networking technologies with associated camera device |
| US9119040B2 (en) | 2012-07-09 | 2015-08-25 | Intel Corporation | Trilateration processing |
| US9111156B2 (en) | 2013-03-15 | 2015-08-18 | Mojix, Inc. | Systems and methods for compressive sensing ranging evaluation |
| US9848428B2 (en) * | 2013-08-27 | 2017-12-19 | Telefonaktiebolaget Lm Ericsson (Publ) | Positioning of wireless devices |
| WO2015139026A2 (en) | 2014-03-14 | 2015-09-17 | Go Tenna Inc. | System and method for digital communication between computing devices |
| CN105683774B (en) * | 2014-07-22 | 2018-08-14 | 华为技术有限公司 | Access point, terminal and Wireless Fidelity WiFi indoor orientation methods |
| CN104459612A (en) * | 2014-11-26 | 2015-03-25 | 四川长虹电器股份有限公司 | Mobile terminal with function of measuring distance and direction of wifi equipment |
| CN107251600B (en) * | 2015-02-24 | 2018-10-23 | 三菱电机株式会社 | Radio characteristics display device, radio characteristics display methods and storage device |
| US9883337B2 (en) | 2015-04-24 | 2018-01-30 | Mijix, Inc. | Location based services for RFID and sensor networks |
| US9906431B2 (en) * | 2015-06-11 | 2018-02-27 | Virginia Commonwealth University | Rapid localization platform for location based applications in self-organized networking systems |
| CN109640245A (en) * | 2018-10-22 | 2019-04-16 | 北京无线体育俱乐部有限公司 | Object monitor method, equipment, system and storage medium |
| CN109655787A (en) * | 2019-01-02 | 2019-04-19 | 京东方科技集团股份有限公司 | Positioning device and method, electronics work board, shopping cart |
| US12273963B2 (en) * | 2021-07-29 | 2025-04-08 | Qualcomm Incorporated | Reporting techniques for movable relay nodes |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US3714650A (en) | 1970-07-30 | 1973-01-30 | Raytheon Co | Vehicle command and control system |
| US3860921A (en) * | 1973-11-15 | 1975-01-14 | Nasa | Simultaneous acquisition of tracking data from two stations |
| JPS62251683A (en) | 1986-04-21 | 1987-11-02 | スペリ− コ−ポレイシヨン | Positioning device by transponder |
| US6574478B1 (en) * | 2000-08-11 | 2003-06-03 | Alcatel Usa Sourcing, L.P. | System and method for locating mobile devices |
| US7123925B2 (en) * | 2002-06-18 | 2006-10-17 | British Telecommunications Public Limited Company | Method and apparatus for locating devices |
| FR2910131B1 (en) * | 2006-12-15 | 2009-01-30 | Thales Sa | PASSIVE LOCALIZATION ENSEMBLISTE IN TOA / TDOA MODES |
| JP2008236516A (en) | 2007-03-22 | 2008-10-02 | Hitachi Ltd | Node position measuring method, node position measuring system and server |
| US8102784B1 (en) * | 2009-02-18 | 2012-01-24 | Dust Networks, Inc. | Localization in a network |
| US8054762B2 (en) * | 2009-03-31 | 2011-11-08 | Technology Currents Llc | Network node location discovery |
-
2010
- 2010-05-06 US US12/774,862 patent/US8712444B2/en active Active
-
2011
- 2011-05-05 EP EP11721171.4A patent/EP2567250B1/en active Active
- 2011-05-05 WO PCT/US2011/035307 patent/WO2011140308A1/en not_active Ceased
Non-Patent Citations (1)
| Title |
|---|
| DOHERTY L ET AL: "Convex position estimation in wireless sensor networks", PROCEEDINGS IEEE INFOCOM 2001. CONFERENCE ON COMPUTER COMMUNICATIONS. TWENTIETH ANNUAL JOINT CONFERENCE OF THE IEEE COMPUTER AND COMMUNICATIONS SOCIETY (CAT. NO.01CH37213); [PROCEEDINGS IEEE INFOCOM. THE CONFERENCE ON COMPUTER COMMUNICATIONS], PISCAT, vol. 3, 22 April 2001 (2001-04-22), pages 1655 - 1663, XP010538858, ISBN: 978-0-7803-7016-6, DOI: 10.1109/INFCOM.2001.916662 * |
Also Published As
| Publication number | Publication date |
|---|---|
| US20110273991A1 (en) | 2011-11-10 |
| WO2011140308A1 (en) | 2011-11-10 |
| EP2567250A1 (en) | 2013-03-13 |
| US8712444B2 (en) | 2014-04-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8712444B2 (en) | Signal phase-based location of network nodes | |
| EP2603809B1 (en) | Location of mobile network nodes | |
| EP2507646B1 (en) | Message-based location of mobile network nodes | |
| US11350381B2 (en) | Mesh ranging and network message and slot structure for ad-hoc networks and method therefor | |
| CN103444246B (en) | Method and radio device for co-positioned | |
| US10192416B2 (en) | Indoor positioning and tracking using a multi-band wireless networking system | |
| EP2035853B1 (en) | Device positioning with delegated location determination | |
| CN104204846B (en) | For the method and apparatus of wireless short-range connection setup | |
| US9479894B2 (en) | Locating and tracking system | |
| KR20070112159A (en) | Method and apparatus for transmitting location data in a communication system | |
| WO2023108231A1 (en) | Computer network for location and data transfer | |
| JP2006166314A (en) | Radio station position estimating apparatus and method | |
| JP7538357B2 (en) | Positioning method and positioning device | |
| Conceicao et al. | Onto scalable wireless ad hoc networks: Adaptive and location-aware clustering | |
| KR101488922B1 (en) | Managing systen for meter-reading in heterogeneous network and method thereof | |
| Zhu et al. | A location-determination application in wirelesshart | |
| Kirci et al. | Wireless sensor networks and efficient localisation | |
| Kong et al. | Localization and dynamic link detection for geographic routing in non-line-of-sight (NLOS) environments | |
| Sánchez et al. | Building your own infrastructure based 802.11 fingerprinting service | |
| EP4690735A1 (en) | A single cluster formation technique for ultra-wideband (uwb) time difference of arrival (tdoa) | |
| US20200187020A1 (en) | In-facility transmission system, in-facility transmission method, and base station | |
| CN120858293A (en) | Positioning of passive backscatterers for positioning | |
| Hautamäki | INDOOR POSITIONING AND ZIGBEE | |
| Al-Odhari et al. | Implementation of the CCA-MAP localization algorithm on a wireless sensor network testbed | |
| HK1192095A (en) | Cooperative localisation of radio apparatuses |
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: 20121122 |
|
| AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
| DAX | Request for extension of the european patent (deleted) | ||
| 17Q | First examination report despatched |
Effective date: 20150901 |
|
| 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: G01S 5/06 20060101ALN20160523BHEP Ipc: G01S 5/02 20060101AFI20160523BHEP Ipc: G01S 5/10 20060101ALN20160523BHEP |
|
| INTG | Intention to grant announced |
Effective date: 20160610 |
|
| 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): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM 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: 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: AT Ref legal event code: REF Ref document number: 846424 Country of ref document: AT Kind code of ref document: T Effective date: 20161215 |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602011032447 Country of ref document: DE |
|
| 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: 20161116 |
|
| REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20161116 |
|
| 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: 846424 Country of ref document: AT Kind code of ref document: T Effective date: 20161116 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20170217 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: 20161116 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: 20161116 Ref country code: NO 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: 20170216 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: 20161116 |
|
| REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 7 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20170316 Ref country code: HR 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: 20161116 Ref country code: RS 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: 20161116 Ref country code: ES 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: 20161116 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: 20161116 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: 20161116 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: 20161116 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20161116 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: 20161116 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: 20161116 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: 20161116 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: 20161116 |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602011032447 Country of ref document: DE |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SM 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: 20161116 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: 20161116 Ref country code: IT 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: 20161116 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: 20170216 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20170531 |
|
| 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: 20170817 |
|
| 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: 20161116 |
|
| 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: 20161116 |
|
| 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: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20170531 Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20170531 |
|
| 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: 20170505 |
|
| 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: 20170505 |
|
| REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 8 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20170505 |
|
| 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: 20110505 |
|
| 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: 20161116 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MK 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: 20161116 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: TR 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: 20161116 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AL 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: 20161116 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: 20170316 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20250529 Year of fee payment: 15 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20250523 Year of fee payment: 15 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20250526 Year of fee payment: 15 |