WO2004107679A2 - System and method for wireless mesh networking - Google Patents
System and method for wireless mesh networking Download PDFInfo
- Publication number
- WO2004107679A2 WO2004107679A2 PCT/GB2004/002321 GB2004002321W WO2004107679A2 WO 2004107679 A2 WO2004107679 A2 WO 2004107679A2 GB 2004002321 W GB2004002321 W GB 2004002321W WO 2004107679 A2 WO2004107679 A2 WO 2004107679A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- node
- network
- nodes
- tree
- powered
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/26—Network addressing or numbering for mobility support
-
- 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/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2101/00—Indexing scheme associated with group H04L61/00
- H04L2101/60—Types of network addresses
- H04L2101/604—Address structures or formats
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/30—Connectivity information management, e.g. connectivity discovery or connectivity update for proactive routing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Definitions
- TECHNICAL FIELD This invention relates to wireless mesh networks, and in particular to such networks that may be used to form a building lighting control system; and to wirelessly enabled handheld equipment, and management interface software, for managing the building control system; and to wireless mesh networks and management systems for a variety of other applications.
- each node communicates directly only with neighbouring nodes, which in turn relay transmissions to more distant nodes.
- Such networks find application in a variety of different fields, differing based on the type of digital devices found at each node.
- such networks may be used for controlling lights in an office building, with each light device being connected to a node of the network and communicating wirelessly with neighbouring nodes; or for communicating between a network of water sensor devices at a water purification plant; or for communicating between members of a wireless network of computer systems.
- the low power requirements of wireless communications to a neighbouring node mean that mesh networks can be made using relatively inexpensive transceivers.
- each node maintains a routing table that specifies an optimal path toward each network destination.
- An originating node sends a message by broadcast to all neighbouring nodes, but only the specified recipient node along the optimal path relays the message, as determined by each node consulting its routing table; until the message reaches its destination.
- the Source Path Routing system the originating node sends a message containing the entire route of the message; each node then passes the message along the specified route until the destination node is reached.
- Both of these types of wireless mesh network require that each node keep a record of its neighbouring nodes, and broadcasts changes in its list of neighbouring nodes.
- the use of these messages consumes bandwidth and power, and risks breakdown due to errors in transmitting the updated neighbour lists.
- each member node of the mesh network maintains a cost table that indicates the costs of transmission to other nodes in the network.
- These cost tables are dynamically generated, based on the number of "hops" required to transmit messages from an originating node to a destination node. New nodes may therefore be added to the network quite flexibly, simply by having the node transmit a message; and node locations may be changed by simply changing the nodes' locations, and beginning to transmit messages. There is no requirement for each node to maintain a routing list of network neighbours, or to transmit updates to the list of neighbouring nodes.
- a method of operating a wireless mesh network comprising: seeding the network from a first node; allocating a network address to each member node of the network to form a tree-like structure of nodes, such that the network address is reversibly derived from the network address of the member node from which it is derived in the tree-like structure; and mapping out cross- branch network connections between nodes that are determined not to be immediate neighbour nodes according to the addresses of the tree-like structure.
- each node of the network may respond to the same predetermined maximum number of requests to join the network from other potential member nodes.
- Each network address for each new node of the network may be derived from a network address of a member node that responds to the new node's request to join the network.
- Cross- branch network connections may be formed by: (i) each node of the network periodically transmitting a discovery message; and (ii) when a second member node receives the discovery message, forming a cross-branch network connection between the second member node and a node that sent the discovery message.
- the method may further comprise re-allocating the network addresses of the nodes of the network such that no node of the network has a network connection with another node of the network that is in a generation of the tree-like structure that differs by more than one generation.
- the method may also further comprise determining a minimum number of nodes through which a message must be passed to be transferred from a source node to a destination node; and transferring the message from the source node to a neighbour node that has the smallest such minimum number of nodes.
- the network may comprise both battery-powered and mains-powered nodes
- the method may further comprise: operating at least one battery- powered node in a dormant state for at least a portion of time; and using a mains-powered node, associated with the at least one battery-powered node, to hold incoming information directed to the associated battery-powered node, until the battery-powered device becomes active again. Messages may be preferentially routed via the mains-powered nodes.
- a single synchronization node of the network periodically transmits time synchronization messages throughout the network.
- each node of the network may maintain a record of a time offset between its own time standard and that of each of its neighbouring nodes.
- the method further comprises connecting at least one member node of the network to a computer device using a management interface.
- the computer device may gather information about the status of the network, or issue instructions to at least one node of the network, using the management interface. Instructions may be issued, using the management interface, to group at least two nodes of the network such that the grouped nodes store network addresses of fellow grouped nodes, and transmit a message to the fellow grouped nodes upon receipt of an external stimulus. At least one node of the grouped nodes maybe capable of re-transmitting a message to all other member nodes of the grouped nodes.
- At least one node of the network communicates with a device that is capable of converting messages from the network into a form suitable for transmission via an alternative protocol, which may be at least one of: Ethernet, the 802.11 Standard, HyperLAN, TCP/IP, GSM, GPRS, EDGE, or UMTS.
- Each node of the network may comprise a wireless transceiver, a microprocessor, and an external device.
- the external device may comprise a sensor, an actuator, or a general computing device; or a building lighting device.
- Each node may comprise components selected from at least one of: (i) a generic ISM band transceiver and a low power microprocessor; (ii) a device conforming to the Bluetooth standard 802.15.1; (iii) a device conforming to the ZigBee standard 802.15.4; and (iv) a device conforming to the WiFi standard 802.11.
- a wireless network comprising: a plurality of member nodes arranged in a tree-like structure seeded from a first node, wherein each member node is allocated a network address that is reversibly derived from the network address of the member node from which it is derived in the tree-like structure; and at least one cross-branch connection between nodes of the network that are not immediate neighbour nodes according to the network addresses of the tree-like structure.
- Fig. 1 shows the components of an individual node of a wireless mesh network, in accordance with an embodiment of the invention
- Fig. 2 shows a tree structure of nodes, determined in accordance with an embodiment of the invention
- Fig. 3 shows a tree structure of nodes with cross-branches determined by a node discovery process, in accordance with an embodiment of the invention
- Fig. 4 shows an algorithm for determining the shortest distance between two nodes, in accordance with an embodiment of the invention
- Fig. 5 A shows an algorithm for determining the distance between two nodes based on the generation of each node in a tree structure, in accordance with an embodiment of the invention
- Fig. 5B shows a distance calculation in accordance with the embodiment of Fig. 5A
- Fig. 6 shows the allocation of an address to a new node, in accordance with an embodiment of the invention.
- a wireless mesh network in which a low-cost path for a message between two nodes of the network can be determined based on organizing the network into a tree structure, and discovering cross-branches between the nodes.
- the network is formed by an initialization process that starts from a central node, and continues by dynamically allocating network addresses to devices joining the network in a deterministic manner.
- Such a network may be used for a wide variety of purposes, including for implementing a building lighting control system.
- Fig. 1 shows the components of an individual node 101 of a wireless mesh network, in accordance with an embodiment of the invention.
- a radio frequency transceiver 102 transmits and receives messages to and from neighbouring nodes of the network; and communicates with a CPU/Memory module 103, which implements the processing logic required by each node of the network to implement the algorithms described herein.
- the CPU/Memory module 103 communicates with the external equipment 105 located at the node, via an interface module 104.
- the external equipment 105 may be any suitable device, such as a sensor, actuator, or general computing device; or a building lighting device; in accordance with embodiments of the invention.
- Fig. 2 shows a tree structure of nodes 201, determined in accordance with an embodiment of the invention.
- the network 201 is formed by allocating addresses to new nodes, which sign on at random with nodes that already have network addresses. The process is "seeded" by starting at node 0, shown at 202. Addresses are allocated to new nodes using the algorithm of Fig. 6, described further below.
- the tree structure is organized into generations, such as generations 0 through 3, shown at 203. To route a message from node 8, shown at 204, to node 20, shown at 205, in the tree structure would take five hops, via nodes 2, 0, 1, and 5 (shown at 206, 202, 207, and 208, respectively), using the shortest distance algorithm of Fig.4, described further below.
- a message will be routed via one of the neighbour nodes by preference, using the shortest distance algorithm of Fig. 4 (for example, for node 1, the message will be routed via node 5, shown at 205).
- a node discovery process in accordance with an embodiment of the invention, as shown in Fig. 3.
- the cross-branches 301-304 are formed via the discovery process, to allow nodes to communicate directly with nodes that are not directly related to them via the tree structure.
- the cross branches give the network its mesh structure.
- cross-branch 303 it only takes two hops to transmit a message from node 8 to node 20, via node 5 (shown at 305, 306, and 307 respectively), by applying the shortest distance algorithm of Fig. 4 at node 8.
- This algorithm will determine that node 5 is only one hop away from the destination node, whereas nodes 2 and 3 are each four hops away.
- Applying the shortest distance algorithm of Fig. 4 at node 5 indicates that node 20 is zero hops from the destination (i.e. it is the destination), whereas nodes 1 and 4 are one and two hops away, respectively.
- Fig. 4 shows an algorithm for determining the shortest distance between two nodes, in accordance with an embodiment of the invention.
- a node receives an incoming message 401, it first determines 402 whether the message is intended for itself; if so, it processes the message 403 and exits 404. If the message is not intended for this node, it is next determined whether the message has expired 405; if so, the message is discarded 406. If not, a loop is initiated by setting two variables 407 to zero, i.e. a neighbour index n is set to zero, and a shortest distance neighbour index x is set to 0. The loop proceeds by determining 408 the distance between each neighbour node and the destination node, using the algorithm of Fig. 5A, described below.
- the shortest distance neighbour index x is re-set 410 to equal that neighbour's node number.
- the loop is then repeated 411 for each of the neighbour nodes, by incrementing 412 the neighbour index n. Once all neighbours have been considered, the message is forwarded 413 to the neighbour having the shortest distance neighbour index x.
- Fig. 5A shows an algorithm for determining the distance between two nodes based on the generation of each node in a tree structure, in accordance with an embodiment of the invention.
- This algorithm is used to determine the distance from each neighbour node to the destination node, at step 409 of the loop of Fig. 4, and is discussed with reference to Fig. 5B.
- the tree generation of node A which is indicated as the length "s" in Fig. 5B, is first determined 502.
- the tree generation of node B which is indicated as the length "t” in Fig. 5B, is determined 503.
- the generation of the older node out of nodes A and B is determined 504, indicated as the value "u” in Fig. 5B; the "older" node is that node which is of a lower generation number.
- the generation of the closest common ancestor, v is next determined 505. For example, in Fig. 2, the closest common ancestor between node 4 and node 20 is node 1; and the closest common ancestor between node 3 and node 1 is node 0.
- the distance between nodes A and B is determined 506, using the formula that the distance equals the absolute value of the difference between s and t, plus twice (u minus v), i.e. I s-t I + 2(u-v). In the example of Fig. 5B, the distance from A to B is three hops, as calculated using the fact that the difference between s and t is 1, and twice (u minus v) is 2, so that the total is the three hops distance.
- Fig. 6 shows the allocation of an address to a new node, in accordance with an embodiment of the invention.
- This algorithm may be used to add a new node to the tree structure of Fig. 2, for example.
- Next, a comparison 603 is made. If the existing number of node children plus the value of x is greater than or equal to the maximum number of node children, the algorithm exits 604. Otherwise, the new address is set equal to the node's own address times the maximum allowed number of children plus the existing number of children plus x, at 605.
- each node stores information about each other node with which it has direct radio contact. It stores the number of nodes that it has so far "adopted" into the network, as well as the total number of neighbour nodes with which it has direct communication. For each neighbour node, this information includes:
- the end-points with which a node is required to communicate may be, for example, a sensor from which the node should expect to receive data, and respond as a result of receiving such data.
- the information stored at a node is:
- the wireless mesh network can be used to implement a building management system, such as a building lighting control system.
- the member nodes of the network can be reconfigured or maintained using a wirelessly enabled PDA or handheld device.
- a member node of the network can act as a gateway to any or all of: a PC or processor; a local area network, such as an Ethernet, 802.11, or HyperLAN network; or a wide area network, such as a TCP/IP, GSM/GPRS, or UMTS network; or to existing telecommunications infrastructure inside the building.
- management interface software according to the invention can allow active management of the building management system, for example via the PDA/handheld, or via the gateway member node.
- the management interface software can also allow remote access to control the building management system, for example through the gateway node.
- Each node may comprise components selected from at least one of: (i) a generic ISM band transceiver and a low power microprocessor; (ii) a device conforming to the Bluetooth standard 802.15.1; (iii) a device conforming to the ZigBee standard 802.15.4; and (iv) a device conforming to the WiFi standard 802.11.
- each member node of the wireless mesh network can be assigned a set of other members of the same network with which it will communicate via the optimum route.
- Each member of the network is able to communicate via the most direct route with any other member that it has been assigned to communicate with.
- member nodes can be grouped to operate en masse to an instruction from another member node. This allows whole floors or buildings to be illuminated with a single switch. Member nodes can also be members of multiple groups, allowing a plurality of behaviors, such as: in a multistory office, a single light fixture node may be a member of the stairwell group and a floor group, such that when the lights on the floor are turned on, the stairwell is lit also. In this way, groups can be "stacked," such that if the light in a single office cubicle is on, the light corridor to the exit is also lit, as is the stairwell to the ground floor.
- a system has a number of advantages.
- First, the function of each member node of the wireless mesh network is reconfigurable.
- the nodes can be instructed via the management interface software, mentioned above, to communicate with additional nodes, or a completely new set of member nodes.
- planned maintenance can be performed, by which messages can be re-routed based upon traffic density such that batteries, which can provide power for the external device of all or some of the nodes, run out at around the same time.
- the member nodes of the network can be instructed to work in collaboration to reduce energy costs. For example, a member node that is an occupancy sensor can inform another member node, which is a light fitting, to switch the light off if the room is empty.
- the network can also be controlled from the central management interface to switch off all unnecessary power use during the night, for example.
- the network is initialized in three stages: tree formation, cross-branch discovery, and tree re-mapping.
- nodes In the tree formation stage, when individual nodes are first activated, they have no knowledge of any other surrounding nodes. In this instance, they transmit requests to any other node that may hear them to join the network. However, unless a node is already a member of an established network, it is not authorized to respond to any such requests.
- the network is initialized from a designated node, which is authorized by a human controller to respond to any such requests that it may receive. In this way, the network is initialized from a central point, and the establishment of the network ripples out from that single member node. When a new node is welcomed to the network (i.e.
- any node can calculate how closely related it is to any other node in the network by comparing the two network addresses. Specifically, the number of generations by which the two nodes differ can be calculated by determining the number of times that the node address can be divided by the maximum allowed number of children before that number becomes less than one.
- node address in binary format, it is the number of times that the node address can be right shifted by the square-root of the maximum allowed number of children before it becomes zero (assuming that the maximum allowed number of children is a square number. For example, take the node with address '5.' This node is the second child of node '1', which is the first child of node '0'. Therefore node '5' is a second generation node (being two generations from node '0'). To calculate this in reverse based on its network address, one would calculate:
- this device belongs to generation two in the tree structure.
- the nodes continue to transmit discovery messages to locate any other nodes that are also already members of the network.
- Each node then populates a routing table with those other member nodes that it discovers and are most distantly related to itself; that is, those nodes whose network addresses are most different from its own.
- the tree is first built with a connectivity in which the member of the n-th generation has m daughter members in the (n+l)-th generation. Consequently, a tree-like structure is generated in which an optimal routing can be deterministically traced, as described further below. Addition of cross-branches results in direct links between the n-th and (n ⁇ j)-th generation, where j > 1, which results in a more degenerate routing topology that may consist of multiple routes that have different route properties, such as number of hops, power consumption, traffic density, time delay, and other properties.
- the tree re-mapping stage consists of a number of network rules designed to result in a network performance that is optimized to a particular set of constraints, such as power consumption, shortest hops, and so on.
- the structure of the network after re-mapping results in a network address for each node that more closely reflects the topology of the entire network.
- the cross- branches connect between the n-th generation and the (n+l)-th and (n-l)-th and n-th generations.
- every member node of a network has a network address that is derived from the member node through which it joined the network (for example using the algorithm of Fig.
- a node can calculate which of its immediate neighbours is most closely related to any other member of the network. On this basis, if a node receives an instruction to initiate or forward a message to any unknown member of the network, it can make an optimum routing decision based upon which of its neighbours is most closely related to the destination node.
- a member node may resort to initiating a broadcast route discovery request, in accordance with an embodiment of the invention.
- it will send a routing request to each of its neighbours enquiring whether they know of a route towards the final destination. This message is retransmitted by all who receive it, unless any node that receives it has access to a route to the specified destination.
- it will reply to the node from which the broadcast originated, giving the distance (in 'hops') from it to the specified destination node.
- the originating node is able to compare all of the responses that it receives, and determine the optimal route to reach the specified destination.
- mains-powered members of the network that are near to a battery-powered member are assigned to 'buddy' with the battery- powered node.
- the mains-powered member keeps track of the cycle of sleep for the battery- powered member with which it is paired, and buffers the flow of communications between the battery-powered node and the rest of the network.
- the mains-powered member can also make urgent decisions for the buddy node if the decision cannot wait until the battery-powered node is next awake. In this way, the mains-powered nodes do the majority of the work in network maintenance and message routing, leaving the battery-powered members to conserve their batteries.
- the time perception of individual nodes of the network is kept synchronized, for example by using a central node as the time standard for the entire network, or by having each node maintain a record of the time offset between all of its nearest neighbor nodes.
- the latter method avoids the need for a central beacon signal, thereby removing the network's dependence on a single network node for time synchronization.
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/559,076 US7653010B2 (en) | 2003-06-03 | 2004-06-02 | System and method for wireless mesh networking |
JP2006508382A JP2006526920A (en) | 2003-06-03 | 2004-06-02 | System and method for a wireless mesh network |
EP04735761A EP1629657A2 (en) | 2003-06-03 | 2004-06-02 | System and method for wireless mesh networking |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB0312674A GB0312674D0 (en) | 2003-06-03 | 2003-06-03 | Intelligent wireless mesh network |
GB0312674.5 | 2003-06-03 | ||
GB0402917.9 | 2004-02-10 | ||
GB0402917A GB0402917D0 (en) | 2004-02-10 | 2004-02-10 | System and method for wireless mesh networking |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2004107679A2 true WO2004107679A2 (en) | 2004-12-09 |
WO2004107679A3 WO2004107679A3 (en) | 2005-03-31 |
Family
ID=33492260
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/GB2004/002321 WO2004107679A2 (en) | 2003-06-03 | 2004-06-02 | System and method for wireless mesh networking |
Country Status (5)
Country | Link |
---|---|
US (1) | US7653010B2 (en) |
EP (1) | EP1629657A2 (en) |
JP (1) | JP2006526920A (en) |
TW (1) | TW200507524A (en) |
WO (1) | WO2004107679A2 (en) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1677473A1 (en) * | 2004-12-23 | 2006-07-05 | Carmel-Haifa University Economic Corp. Ltd. | Ad hoc communication system and method for routing speech packets therein |
WO2007065987A1 (en) * | 2005-12-05 | 2007-06-14 | France Telecom | Method for rebuilding an ad hoc network and the nodes thereof |
EP1875673A1 (en) * | 2005-05-10 | 2008-01-09 | Samsung Electronics Co., Ltd. | Routing method in wireless network and communication apparatus of using the same |
EP1944926A2 (en) | 2007-01-08 | 2008-07-16 | Industrial Technology Research Institute | Method and system for network data trasmitting |
WO2008157814A1 (en) * | 2007-06-21 | 2008-12-24 | Microsoft Corporation | Hybrid tree/mesh overlay for data delivery |
EP2052497A2 (en) * | 2006-08-15 | 2009-04-29 | CiscoTechnology Inc. | Route tree building in a wireless mesh network |
JP2010503307A (en) * | 2006-09-06 | 2010-01-28 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Technology for finding reference nodes for positioning |
US9660447B2 (en) | 2012-03-02 | 2017-05-23 | Ideal Industries, Inc. | Connector having wireless control capabilities |
Families Citing this family (48)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100645440B1 (en) * | 2004-06-14 | 2006-11-14 | 삼성전자주식회사 | ZigBee network device for determining network parameter separately and assigning address, and address assigning method thereof |
US8040893B2 (en) * | 2004-08-11 | 2011-10-18 | Alcatel Lucent | Method for fast source routed connection setup |
US7656804B2 (en) * | 2004-08-16 | 2010-02-02 | Motorola, Inc. | Method and apparatus for operating an AD-HOC communication system |
US7996558B2 (en) * | 2005-03-01 | 2011-08-09 | Industrial Technology Research Institute | Methods and systems for a routing protocol |
WO2007003038A1 (en) | 2005-06-30 | 2007-01-11 | Streetlight Intelligence, Inc. | Adaptive energy performance monitoring and control system |
ATE556568T1 (en) * | 2005-06-30 | 2012-05-15 | Led Roadway Lighting Ltd | METHOD AND SYSTEM FOR LUMINANCE CHARACTERIZATION |
KR100913894B1 (en) * | 2005-09-30 | 2009-08-26 | 삼성전자주식회사 | Method for efficient routing in wireless mesh network |
US20070298821A1 (en) * | 2006-06-21 | 2007-12-27 | Lockheed Martin Corporation | System for boolean network configuration of a wireless network |
KR100825735B1 (en) * | 2006-09-29 | 2008-04-29 | 한국전자통신연구원 | Method for Address Space Management about nodes incapable of communication over ZigBee Network |
US20080175210A1 (en) * | 2007-01-24 | 2008-07-24 | Johnson Controls Technology Company | Distributed spectrum analyzer |
US20090065596A1 (en) * | 2007-05-09 | 2009-03-12 | Johnson Controls Technology Company | Systems and methods for increasing building space comfort using wireless devices |
US8274928B2 (en) * | 2007-06-18 | 2012-09-25 | Light Corporation | Wireless mesh network |
US20100187832A1 (en) * | 2007-07-31 | 2010-07-29 | Johnson Controls Technology Company | Devices for receiving and using energy from a building environment |
US20090045939A1 (en) | 2007-07-31 | 2009-02-19 | Johnson Controls Technology Company | Locating devices using wireless communications |
US8290710B2 (en) | 2007-09-07 | 2012-10-16 | Led Roadway Lighting Ltd. | Streetlight monitoring and control |
US8570190B2 (en) * | 2007-09-07 | 2013-10-29 | Led Roadway Lighting Ltd. | Centralized route calculation for a multi-hop streetlight network |
KR100926727B1 (en) | 2008-02-01 | 2009-11-16 | (주)아이필넷 | Ubiquitous sensor network system, domain group ID allocation method and data transmission method |
US8364325B2 (en) * | 2008-06-02 | 2013-01-29 | Adura Technologies, Inc. | Intelligence in distributed lighting control devices |
US8532003B2 (en) * | 2008-10-03 | 2013-09-10 | Synapsense Corporation | Apparatus and method for managing packet routing through internally-powered network devices in wireless sensor networks |
US8600560B2 (en) | 2008-12-30 | 2013-12-03 | Synapsense Corporation | Apparatus and method for controlling computer room air conditioning units (CRACs) in data centers |
US8538584B2 (en) | 2008-12-30 | 2013-09-17 | Synapsense Corporation | Apparatus and method for controlling environmental conditions in a data center using wireless mesh networks |
CN101771941B (en) * | 2008-12-31 | 2013-09-25 | 财团法人工业技术研究院 | Multicast communication method, relay node and wireless network system using same |
US8761084B2 (en) * | 2009-01-14 | 2014-06-24 | Synapsense Corporation | Apparatus and method for establishing data communication in a time-synchronized mesh wireless network during time synchronization failures |
US20110299425A1 (en) * | 2009-02-12 | 2011-12-08 | Praveen Kumar | Addressing and Routing Scheme for Distributed Systems |
US8199010B2 (en) | 2009-02-13 | 2012-06-12 | Lutron Electronics Co., Inc. | Method and apparatus for configuring a wireless sensor |
CN102106124B (en) * | 2009-04-16 | 2013-08-28 | 华为技术有限公司 | Route method, equipment and system |
US20100302947A1 (en) * | 2009-05-29 | 2010-12-02 | Nokia Corporation | Method and apparatus for providing awareness information over an ad-hoc mesh network |
US8194541B2 (en) * | 2009-05-29 | 2012-06-05 | Nokia Corporation | Method and apparatus for providing a collaborative reply over an ad-hoc mesh network |
US8255469B2 (en) | 2009-05-29 | 2012-08-28 | Nokia Corporation | Method and apparatus for locating communities over an ad-hoc mesh network |
KR101269550B1 (en) * | 2009-09-02 | 2013-07-04 | 고려대학교 산학협력단 | Communication method and system for sensor network |
AU2011217741B2 (en) * | 2010-02-18 | 2016-10-20 | Isee Vc Pty Ltd | A system, method and software application for the dissemination of data across a plurality of computing systems |
US8811377B1 (en) | 2010-08-30 | 2014-08-19 | Synapsense Corporation | Apparatus and method for instrumenting devices to measure power usage using a multi-tier wireless network |
CN102761463A (en) * | 2011-04-29 | 2012-10-31 | 鸿富锦精密工业(深圳)有限公司 | Network equipment and method for implementation of energy conservation and electricity saving of network equipment in local area network |
US9192019B2 (en) | 2011-12-07 | 2015-11-17 | Abl Ip Holding Llc | System for and method of commissioning lighting devices |
WO2013191413A1 (en) * | 2012-06-18 | 2013-12-27 | 엘지전자 주식회사 | Method and device for transmitting and receiving flooding signal in wireless communication system |
CN103581239B (en) * | 2012-07-27 | 2019-01-22 | 中兴通讯股份有限公司 | A kind of discovery method, apparatus of equipment and service |
US9992038B2 (en) | 2013-06-14 | 2018-06-05 | Arizona Board Of Regents On Behalf Of Arizona State University | Underwater multi-hop communications network |
EP3132647B1 (en) * | 2014-04-16 | 2018-06-13 | Philips Lighting Holding B.V. | Method and apparatus for reducing the length of a packet storm in a wireless mesh network |
US10684030B2 (en) | 2015-03-05 | 2020-06-16 | Honeywell International Inc. | Wireless actuator service |
US9736019B2 (en) * | 2015-05-14 | 2017-08-15 | Eero Inc. | Methods for dynamic router configuration in a mesh network |
US10574788B2 (en) * | 2016-08-23 | 2020-02-25 | Ebay Inc. | System for data transfer based on associated transfer paths |
US9953474B2 (en) | 2016-09-02 | 2018-04-24 | Honeywell International Inc. | Multi-level security mechanism for accessing a panel |
US11057937B2 (en) * | 2017-10-19 | 2021-07-06 | Qualcomm Incorporated | Relay node connection techniques in wireless backhaul systems |
US10892858B2 (en) | 2018-09-28 | 2021-01-12 | At&T Intellectual Property I, L.P. | Chain broadcasting in vehicle-to-everything (V2X) communications |
CN109634188A (en) * | 2019-01-04 | 2019-04-16 | 安徽科技学院 | A kind of a kind of control method of farmland disinfestation lamp based on Lora and ZigBee technology |
US10789800B1 (en) | 2019-05-24 | 2020-09-29 | Ademco Inc. | Systems and methods for authorizing transmission of commands and signals to an access control device or a control panel device |
US10832509B1 (en) | 2019-05-24 | 2020-11-10 | Ademco Inc. | Systems and methods of a doorbell device initiating a state change of an access control device and/or a control panel responsive to two-factor authentication |
US10972958B1 (en) | 2020-03-05 | 2021-04-06 | At&T Intellectual Property I, L.P. | Location-based route management for vehicle-to-everything relay communications |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6028857A (en) | 1997-07-25 | 2000-02-22 | Massachusetts Institute Of Technology | Self-organizing network |
WO2002076028A1 (en) | 2001-03-09 | 2002-09-26 | Motorola, Inc. | A protocol for a self-organizing network using a logical spanning tree backbone |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5216423A (en) * | 1991-04-09 | 1993-06-01 | University Of Central Florida | Method and apparatus for multiple bit encoding and decoding of data through use of tree-based codes |
US5875301A (en) * | 1994-12-19 | 1999-02-23 | Apple Computer, Inc. | Method and apparatus for the addition and removal of nodes from a common interconnect |
US6216168B1 (en) * | 1997-03-17 | 2001-04-10 | Cabletron Systems, Inc. | Perspective-based shared scope address resolution method and apparatus |
DE19810843B4 (en) * | 1998-03-12 | 2004-11-25 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and access device for determining the storage address of a data value in a storage device |
WO1999049618A1 (en) * | 1998-03-23 | 1999-09-30 | Hitachi, Ltd. | Network repeater and network next transfer destination searching method |
US6614789B1 (en) * | 1999-12-29 | 2003-09-02 | Nasser Yazdani | Method of and apparatus for matching strings of different lengths |
JP2002026973A (en) * | 2000-07-12 | 2002-01-25 | Nec Corp | Path retrieval system and its method, and router used for it |
ES2298367T3 (en) * | 2002-04-30 | 2008-05-16 | Nokia Corporation | METHOD AND DEVICE FOR THE MANAGEMENT OF DATA EXCHANGE IN TREE. |
-
2004
- 2004-06-02 EP EP04735761A patent/EP1629657A2/en not_active Withdrawn
- 2004-06-02 JP JP2006508382A patent/JP2006526920A/en active Pending
- 2004-06-02 US US10/559,076 patent/US7653010B2/en active Active
- 2004-06-02 WO PCT/GB2004/002321 patent/WO2004107679A2/en active Search and Examination
- 2004-06-03 TW TW093115932A patent/TW200507524A/en unknown
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6028857A (en) | 1997-07-25 | 2000-02-22 | Massachusetts Institute Of Technology | Self-organizing network |
WO2002076028A1 (en) | 2001-03-09 | 2002-09-26 | Motorola, Inc. | A protocol for a self-organizing network using a logical spanning tree backbone |
Cited By (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1677473A1 (en) * | 2004-12-23 | 2006-07-05 | Carmel-Haifa University Economic Corp. Ltd. | Ad hoc communication system and method for routing speech packets therein |
US7738402B2 (en) | 2004-12-23 | 2010-06-15 | Carmel-Haifa University Economic Corp. Ltd. | Ad hoc communication system and method for routing speech packets therein |
EP1875673A4 (en) * | 2005-05-10 | 2008-05-07 | Samsung Electronics Co Ltd | Routing method in wireless network and communication apparatus of using the same |
EP1875673A1 (en) * | 2005-05-10 | 2008-01-09 | Samsung Electronics Co., Ltd. | Routing method in wireless network and communication apparatus of using the same |
WO2007065987A1 (en) * | 2005-12-05 | 2007-06-14 | France Telecom | Method for rebuilding an ad hoc network and the nodes thereof |
EP2052497A2 (en) * | 2006-08-15 | 2009-04-29 | CiscoTechnology Inc. | Route tree building in a wireless mesh network |
EP2052497A4 (en) * | 2006-08-15 | 2012-05-30 | Cisco Tech Inc | Route tree building in a wireless mesh network |
JP2010503307A (en) * | 2006-09-06 | 2010-01-28 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Technology for finding reference nodes for positioning |
EP1944926A2 (en) | 2007-01-08 | 2008-07-16 | Industrial Technology Research Institute | Method and system for network data trasmitting |
EP1944926A3 (en) * | 2007-01-08 | 2011-12-07 | Industrial Technology Research Institute | Method and system for network data trasmitting |
WO2008157814A1 (en) * | 2007-06-21 | 2008-12-24 | Microsoft Corporation | Hybrid tree/mesh overlay for data delivery |
US7657648B2 (en) | 2007-06-21 | 2010-02-02 | Microsoft Corporation | Hybrid tree/mesh overlay for data delivery |
US8504734B2 (en) | 2007-06-21 | 2013-08-06 | Microsoft Corporation | Hybrid tree/mesh overlay for data delivery |
US9660447B2 (en) | 2012-03-02 | 2017-05-23 | Ideal Industries, Inc. | Connector having wireless control capabilities |
Also Published As
Publication number | Publication date |
---|---|
US20060245360A1 (en) | 2006-11-02 |
JP2006526920A (en) | 2006-11-24 |
US7653010B2 (en) | 2010-01-26 |
EP1629657A2 (en) | 2006-03-01 |
WO2004107679A3 (en) | 2005-03-31 |
TW200507524A (en) | 2005-02-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7653010B2 (en) | System and method for wireless mesh networking | |
Todtenberg et al. | A survey on Bluetooth multi-hop networks | |
Yahya et al. | Towards a classification of energy aware MAC protocols for wireless sensor networks | |
JP5122489B2 (en) | Wireless mesh network | |
Shah et al. | Energy aware routing for low energy ad hoc sensor networks | |
EP2171929B1 (en) | Path selection and power management in mesh networks | |
US7522563B2 (en) | Network protocol | |
CN101395968B (en) | Lighting system with lighting units using optical communication | |
CN100591029C (en) | Multi-jump wireless self-organizing network construction method based on partition tree | |
US20040018839A1 (en) | Protocol and structure for mobile nodes in a self-organizing communication network | |
EP2109961A1 (en) | Method for allocating an address of device in wireless personal area network (wpan) and wpan device | |
EP3262893B1 (en) | Energy efficient ble mesh initialisation and operation | |
KR20080025095A (en) | Communicating over a wireless network | |
KR20080075806A (en) | Method for allocating a beacon slot using a beacon table in wireless personal area network(wpan) and wpan device | |
Faheem et al. | Dynamic sink location update scope control mechanism for mobile sink wireless sensor networks | |
WO2009148752A2 (en) | Node scheduling and address assignment within an ad-hoc communication system | |
EP2683200A1 (en) | Method for constructing a cluster tree topology in a personal area network | |
US9295105B2 (en) | Methods and devices for configuring simplified, static, multi-hop wireless networks | |
KR20120113064A (en) | Low power sensor network system using cluster network and method for establishing cluster network in sensor network | |
Patil et al. | Intelligent Energy Efficient Routing Protocol based on Biological Agents for MANETS | |
KR101241989B1 (en) | Method for topology setting of remote meter reading system | |
Leão et al. | An opportunistic approach to deal with real-time mesh communication in wireless sensor networks | |
WO2018079558A1 (en) | Wireless device | |
Huu et al. | An efficient method for gathering data considering energy and delay time on WSNs | |
TWM583656U (en) | Wireless network networking architecture |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A2 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A2 Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2004735761 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2006508382 Country of ref document: JP |
|
WWP | Wipo information: published in national office |
Ref document number: 2004735761 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2006245360 Country of ref document: US Ref document number: 10559076 Country of ref document: US |
|
DPEN | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed from 20040101) | ||
WWP | Wipo information: published in national office |
Ref document number: 10559076 Country of ref document: US |