WO2006074319A1 - Multichannel mesh router and methods for path selection in a multichannel mesh network - Google Patents
Multichannel mesh router and methods for path selection in a multichannel mesh network Download PDFInfo
- Publication number
- WO2006074319A1 WO2006074319A1 PCT/US2006/000377 US2006000377W WO2006074319A1 WO 2006074319 A1 WO2006074319 A1 WO 2006074319A1 US 2006000377 W US2006000377 W US 2006000377W WO 2006074319 A1 WO2006074319 A1 WO 2006074319A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- channel
- node
- metric
- packet
- matrix
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/66—Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
-
- 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/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- 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/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- 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/54—Organization of routing tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/122—Avoiding congestion; Recovering from congestion by diverting traffic away from congested entities
-
- 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/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/18—Service support devices; Network management devices
Definitions
- Some embodiments of the present invention pertain to wireless communications. Some embodiments pertain to packet forwarding in wireless mesh networks. Some embodiments pertain to multicarrier communications.
- Some conventional communication networks route packets among nodes of the network using forwarding tables that are stored in the nodes.
- the forwarding tables generally identify a next-hop node based on the packet's destination.
- the next-hop node is generally the same for all packets having the same destination regardless of the packet's originating node.
- the forwarding tables are conventionally generated by selecting paths through the network in a hop-by-hop fashion based on next-hops with the lowest cost.
- this conventional forwarding approach may not select the best path through the network because the frequencies and/or time slots used by the communication links along a given path may interfere with each other resulting in increased packet delays, increased packet retransmissions, and/or reduced channel bandwidth.
- FIG. 1 illustrates a multichannel wireless mesh network in accordance with some embodiments of the present invention
- FIG. 2 is a functional block diagram of a multichannel wireless communication node in accordance with some embodiments of the present invention
- FIG. 3 is a flow chart of a packet forwarding procedure in accordance with some embodiments of the present invention.
- FIG. 4 is an example of a multichannel mesh network
- FIG. 5 is an example of routing table for a multichannel mesh network
- FIG. 6 is an example of multichannel mesh network that uses four communication channels.
- FIG. 1 illustrates a multichannel wireless mesh network in accordance with some embodiments of the present invention.
- Multichannel wireless mesh network 100 may comprise a plurality of wireless communication nodes 102 that may communicate with each other over one or more wireless communication channels 104.
- at least some of wireless communication nodes 102 communicate with other nodes 102 using more than one wireless communication channel 104.
- some wireless communication nodes 102 communicate with other nodes 102 using only one communication channel, although the scope of the invention is not limited in this respect.
- node five may communicate with node four using a first communication channel (e.g., channel one), node five may communicate with node one using a second communication channel (e.g., channel two), and node five may communicate with node seven using a third communication channel (e.g., channel three).
- Node one for example, may communicate with nodes two, four and five using only the first channel (e.g., channel one).
- Node three for example, may communicate with node two using the first communication channel (e.g., channel one) and may communicate with node six using both the second and third communication channels (e.g., channels two and three).
- FIG. 1 illustrates a mesh network utilizing three communication channels, the scope of the invention is not limited in this respect.
- Some embodiments of the present invention are equally applicable to any mesh network utilizing one or more communication channels.
- the use of two or more orthogonal wireless communication channels in mesh network 100 may significantly increase the ability of nodes 102 to communicate and route packets therebetween.
- any one node's transmission on a particular communication channel may potentially interfere with other node's communicating on that channel depending on the distance between nodes in network 100. This may result in increased collisions, increased dropped packets, and increased packet retransmissions throughout the entire network.
- nodes 102 may communicate with each other using more than one communication channel.
- nodes 102 may generate channel-metric matrices for each possible destination in network 100.
- the channel-metric matrices identify next-hop nodes and a communication channel for each possible bottleneck channel.
- An intermediate node on a route may select a next-hop node and one of communication channels 104 for forwarding a received packet based on the bottleneck channel determined by the intermediate node for the packet's source-destination combination.
- the bottleneck channel may be viewed as the channel whose impact should be minimized to select an optimum route through the network.
- an intermediate node may route packets that have the same destination node differently when, for example, they have different source nodes.
- the next-hop node and channel may be selected to reduce contention in the network 100.
- the next-hop node and channel may be selected to increase channel diversity (i.e., use of different channels) along a path to the destination node, although the scope of the invention is not limited in this respect.
- a bottleneck channel may be determined for a particular route and may be associated with a source-destination pair. The bottleneck channel may be the channel that if it were to be used for forwarding packets between the source-destination pair, increased channel contention, reduced channel diversity and/or increased congestion may result. Accordingly, the impact of the bottleneck channel may be minimized in selecting a more optimum route. The determination of a bottleneck channel for a source-destination combination is discussed in more detail below.
- FIG. 2 is a functional block diagram of a multichannel wireless communication node in accordance with some embodiments of the present invention.
- Multichannel wireless communication node 200 may be suitable for use as any one or more of multichannel wireless communication nodes 102 (FIG. 1).
- multichannel wireless communication node 200 may be a multichannel wireless mesh network router, although the scope of the invention is not limited in this respect.
- multichannel wireless communication node 200 may include one or more transceivers 202. Each transceiver 202 may be associated with a particular wireless communication channel. Multichannel wireless communication node 200 may also include media access controllers 204 associated with transceivers 202. Multichannel wireless communication node 200 may also comprise multihop forwarding circuitry 206 for forwarding packets and path selection circuitry 208 to generate channel-metric matrices 210 and select next-hop nodes as described in more detail below.
- circuitry is used to describe several elements of communication node 200, this does not necessarily imply the use of circuit hardware. As used herein, “circuitry” may include hardware, firmware and software implementations including combinations thereof.
- Multichannel wireless communication node 200 may also be coupled with one or more antennas 212 for communicating over wireless communication channels 104 (FIG. 1). Although node 200 illustrates two separate transceivers 202 for communicating with two communication channels, in some embodiments a single transceiver may be used for communicating over two or more communication channels, although the scope of the invention is not limited in this respect.
- path selection circuitry 208 generates a channel-metric matrix for destination nodes of a mesh network.
- the matrix may include the cost to reach a given destination and may maintain sufficient information to identify routes in a multihop, multichannel mesh network, such as network 100 (FIG. 1).
- An example of a channel-metric matrix generated by a node 'M' for a source node 'S' and a destination 'D' in a multichannel mesh network is shown below:
- each transceiver 202 may use one of n channels, and n may range from one to four or more.
- the X,- values in each row of the matrix may represent the cost contributed by links on channel /, and Nexto may represent the next-hop node to destination node 'D'.
- Each row of the matrix may represent the cost to reach the destination through the specified next-hop node, given that a particular channel is a bottleneck channel in the end-to-end path.
- a bottleneck channel may be created by contention, for example, when multiple links along a path are competing for bandwidth in the same channel.
- a source node 'S' may determine the bottleneck channel for the end-to-end path from itself to a destination node 'D'. Furthermore, an intermediate node 'M' in the path from source node 'S' to destination node 'D' may also determine which channel is the bottleneck channel for the end-to-end path from source node 'S' to destination node 'D'. In the example matrix above, the bottleneck channel is listed for each row left of the matrix.
- a routing matrix used in multi-channel network 100 may include a matrix for each destination.
- a node identifies the matrix corresponding to the packet's destination and may select the row in which MAX (X,) is minimized (e.g., minimizing contention). In some alternate embodiments, another function of the values in that row may be minimized.
- the selected row may represent the bottleneck channel with the least impact on performance.
- the next- hop node identified in that row and the associated transmission channel may be used as the next-hop node and transmission channel to reach the destination node.
- an intermediate node may obtain the matrix for the destination of a packet from channel-metric matrices 210 (FIG. 2). To select the row of the matrix containing the correct next-hop, the intermediate node may first determine which channel is the bottleneck channel for the path from the source node to the destination node.
- the bottleneck channel may have already been determined by the source (or the destination) node, which may have generated the channel-metric matrix for the entire path; however an intermediate node may not have this information.
- the bottleneck channel may be determined by either the source or the destination node and may be communicated to the nodes along the path.
- a packet sent along the path may specify the bottleneck channel for a source-destination pair.
- this signaling may be part of a route reply packet.
- an explicit end-to-end message may be used.
- an intermediate node may determine the bottleneck channel using the channel-metric matrices associated with a packet's destination node and the packet's source node. In this way, the bottleneck channel can be efficiently determined without requiring explicit signaling.
- Some conventional routers may run a Dijkstra-type routing algorithm for all source- destination pairs, which is very computationally expensive.
- node 'A' may be the packet's source node and node 'C may be the packet's destination node.
- Node 'B' may be any intermediate node on a multihop route or path between node 'A' and node 'C.
- node 'B' may identify the bottleneck channel using locally available information.
- node 'B' may use the channel-metric matrix it may have previously generated for node A as a destination node, and may use the channel-metric matrix it may have previously generated for node 'C as a destination node.
- path selection circuitry 208 of node 'B' may compute a new matrix as illustrated below:
- Path selection circuitry 208 (FIG. 2) of node 'B' may use the new matrix to determine the bottleneck channel for the path from node 'A' to node 'C. This may be
- Path selection circuitry 208 (FIG. 2) of node 'B' may select the row of the new matrix for which MAX (X 1 ) is minimized, although the scope of the invention is not limited in this respect. Alternatively, another function of the Z,- values in each row may be minimized.
- the new matrix ⁇ c (as computed above) may not necessarily be the same
- a ⁇ C may also be any other
- Tn pfyi f* be the minimal row of A ⁇ c .
- node 'B' along a selected path from source node 'A' to destination node C may determine the bottleneck channel and select a next- hop for forwarding packets from source node 'A' to destination node 'C.
- Path selection circuitry 208 may perform these computations with minimal computational overhead. Furthermore, no signaling may necessarily be required to inform intermediate nodes along the path of the selected bottleneck channel. In addition, intermediate nodes need not maintain a mapping of source and destination pairs to bottleneck channel (or next-hop), which may require significant storage complexity. In some embodiments, a soft cache of these mappings may optionally be maintained for source-destination pairs to reduce the need to perform the bottleneck-channel computation for each packet.
- An intermediate node may route a packet by first determining the packet's destination node and then identifying the channel-metric matrix for the destination node from matrices stored in channel-metric matrices 210. The next-hop node may then identified by selecting the row corresponding to the bottleneck channel previously determined by combining the source and destination node channel-metric matrices.
- the packet may identify a source node and a destination node in a multichannel mesh network.
- Path selection circuitry 208 may combine a first channel-metric matrix associated with the packet's source node and a second channel- metric matrix associated with the packet's destination node and may select a next-hop node and an associated transmission channel based on metrics elements of the combined matrix for use in forwarding the packet to its destination node.
- path selection circuitry 208 may select the next-hop node and associated transmission channel to increase diversity among the wireless communication channels used on a route to the destination node.
- node 200 may comprise a storage element (e.g., element 210) to store a channel-metric matrix for each possible destination in the network as a destination node. At least some of the channel-metric matrices may identify more than one possible next-hop node and an associated one of the wireless communication channels (i.e., a transmission channel) for reaching (i.e., transmitting packets to) the matrix's associated destination node. For each channel that can be identified as a possible bottleneck channel, a matrix may identify a different next-hop node and associated transmission channel to use.
- the channel-metric matrices are generated and stored for each destination node and may comprise a channel metric vector (X 0 , X 1 ... X;) for next-hop nodes.
- the channel metric vectors may comprise a channel metric for each of the communication channels indicating a usage of the communication channel for a path through the network to the destination node associated with the channel-metric matrix.
- elements of the channel metric vectors are each associated with one of the communication channels and comprise a weighted combination of one or more of a hop count, link bandwidth, airtime estimate, and data rate for the associated channels, although the scope of the invention is not limited in this respect.
- elements of the channel metric vectors may be based on link speed, noise, signal-to-noise ratio, reliability, or other link factors.
- path selection circuitry 208 may combine a first channel- metric matrix associated with the packet's source node and a second channel-metric matrix associated with the packet's destination node to generate a new channel-metric matrix.
- Each channel metric vector (Xo, X 1 ... XO (e.g., row) of the new channel-metric matrix may have a maximum channel metric, and path selection circuitry 208 may select one of the channel metric vectors (e.g., a row) having a minimum value of the maximum channel metrics.
- the selected channel metric vector may be associated with a bottleneck channel for that source-destination pair, and the selected vector may also be associated with the next-hop node and a transmission channel for forwarding the received packet.
- path selection circuitry 208 may combine elements of the first channel-metric matrix associated with the packet's source node and elements of the second channel-metric matrix associated with the packet's destination node to generate the new channel-metric matrix by weighting the elements equally. In some alternate embodiments, path selection circuitry 208 may combine elements of the first channel- metric matrix associated with the packet's source node and elements of the second channel-metric matrix associated with the packet's destination node to generate the new channel-metric matrix by weighting the elements in accordance with a weighting algorithm.
- the weighting algorithm may weight elements based on latency (e.g., related to hop count) or throughput, although the scope of the invention is not limited in this respect.
- the path selection circuitry may generate the channel-metric matrix for destination nodes of the network by construction of paths through the network to destination nodes on a hop-by-hop basis by separately retaining cost contributions of each of the communication channels in the form of a channel metric vector for each candidate path.
- channels used for communication between nodes of a multicarrier mesh network may include packet switched channels, time-division multiplexed channels (e.g., use of time slots), frequency division multiplexed channels, code division multiplexed channels, or other channel allocation techniques.
- wireless communication node 200 may transmit and receive orthogonal frequency division multiplexed (OFDM) communication signals.
- transceivers 202 may transmit and receive on multicarrier communication channels.
- the multicarrier communication channel may be within a predetermined frequency spectrum and may comprise a plurality of orthogonal subcarriers.
- the orthogonal subcarriers may be closely spaced symbol-modulated subcarriers. To help achieve orthogonality between the closely spaced subcarriers of an OFDM signal, each subcarrier may have a null at substantially a center frequency of the other subcarriers.
- each subcarrier may have an integer number of cycles within a symbol period.
- the orthogonality between the different communication channels 104 may be achieved through a frequency- division multiplexing (FDM) technique, a time-division multiplexing (TDM) technique, a code-division multiplexing (CDM) technique, or combinations thereof.
- the frequency spectrums for the multicarrier communication channels may comprise either a 5 GHz frequency spectrum or a 2.4 GHz frequency spectrum.
- the 5 GHz frequency spectrum may include frequencies ranging from approximately 4.9 to 5.9 GHz
- the 2.4 GHz spectrum may include frequencies ranging from approximately 2.3 to 2.5 GHz, although the scope of the invention is not limited in this respect, as other frequency spectrums are also equally suitable.
- multichannel wireless communication node 200 may transmit and/or receive RF communications in accordance with specific communication standards, such as the Institute of Electrical and Electronics Engineers (IEEE) standards including IEEE 802.11 (a), 802.11 (b), 802.11 (g) and/or 802.11 (h) standards for wireless local area networks (WLANs) or the IEEE 802.1 l(s) standard for mesh networks, although multichannel wireless communication node 200 may also be suitable to transmit and/or receive communications in accordance with other techniques.
- Antennas 212 may comprise directional or omnidirectional antennas, including, for example, dipole antennas, monopole antennas, patch antennas, loop antennas, microstrip antennas or other types of antennas suitable for reception and/or transmission of RF signals.
- multichannel wireless communication node 200 may be almost any device that operates as a wireless router including a personal digital assistant (PDA), a laptop or portable computer with wireless communication capability, a web tablet, a wireless telephone, a wireless headset, a pager, an instant messaging device, a digital camera, an access point or other device that may receive and/or transmit information wirelessly.
- PDA personal digital assistant
- multichannel wireless communication node 200 is illustrated as a wireless communication device, multichannel wireless communication node 200 may be almost any wireless or wireline communication device, including a general purpose processing or computing system.
- multichannel wireless communication node 200 may be a battery-powered device.
- multichannel wireless communication node 200 is illustrated as having several separate functional elements, one or more of the functional elements may be combined and may be implemented by combinations of software-configured elements, such as processing elements including digital signal processors (DSPs), and/or other hardware elements.
- processing elements may comprise one or more microprocessors, DSPs, application specific integrated circuits (ASICs), and combinations of various hardware and logic circuitry for performing at least the functions described herein.
- the functional elements of multichannel wireless communication node 200 may refer to one or more processes operating on one or more processing elements.
- FIG. 3 is a flow chart of a packet forwarding procedure in accordance with some embodiments of the present invention.
- packet forwarding procedure 300 may be performed by an intermediate node of a multichannel mesh network for forwarding a current packet between a source and a destination node of the network.
- packet forwarding procedure 300 may be performed by a multichannel wireless mesh network router, such as node 200 (FIG. 2), although the scope of the invention is not limited in this respect.
- Single channel mesh routers may also be suitable for performing procedure 300.
- a packet is received and the packet's source node and the packet's destination node may be determined from information (e.g., a header) within the packet.
- Il Operation 302 also comprises identifying a channel-metric matrix for the packet's source node and a channel-metric matrix for the packet's destination node. Operation 302 may be performed by multihop forwarding circuitry 206 (FIG. 2) and path selection circuitry 208 (FIG. 2), although the scope of the invention is not limited in this respect. Operation 304 comprises combining the channel-metric matrix identified for the packet's source node with the channel-metric matrix identified for the packet's destination , node. The combining of these matrices may be performed in accordance with one or more linear combination techniques discussed above.
- Operation 306 comprises selecting a next-hop node and associated communication channel based on the elements of the combined channel-metric matrix generated in operation 304.
- a row having a lowest maximum metric may be selected, although the scope of the invention is not limited in this respect.
- the selected row may correspond to a bottleneck channel of the channel-metric matrix for the packet's destination node.
- Operation 308 comprises storing the next-hop node and bottleneck channel for the source-destination associated with the packet. In this way, the determination of the bottleneck channel may need to be done only once for a source-destination pair under current channel conditions.
- Operations 304 through 308 may be performed by path selection circuitry 208 (FIG. 2), although the scope of the invention is not limited in this respect.
- Operation 310 comprises transmitting (i.e., forwarding) the packet to the next-hop node based on the identified row using the associated transmission channel determined in operation 306. Operation 310 may be performed multihop forwarding circuitry 206 (FIG.
- procedure 300 Although the individual operations of procedure 300 are illustrated and described as separate operations, one or more of the individual operations may be performed concurrently, and nothing requires that the operations be performed in the order illustrated.
- the use of multiple transceivers by a mesh router may enable improved system performance.
- the use of multiple transceivers by a mesh router may enable full-duplex communication allowing a node to receive on one radio while simultaneously transmitting on a second radio.
- the use of multiple transceivers may also allow more than one link along a multi-hop path to be active at a time, even if all of the links in the path are within interference range of each other by allowing different links to use different non-interfering channels.
- FIG. 4 is an example of a multichannel mesh network.
- Multichannel mesh network 400 may be used to illustrate an example in which the use of a distance- vector does not result in an optimal path from source node one to destination node four.
- the optimal path for node four to node one is the path from node four to node three to node one (i.e., 4-3-1) (which minimizes the interference between the two hops from node four to node one), while the optimal path from node six to node one is the path from node six to node five to node four to node two to node one (i.e., 6-5-4-2-1).
- link-state routing may be used to find optimal paths in a multi-channel network.
- FIG. 5 is an example of routing table for a multichannel mesh network. Routing table 500 may illustrate entries for node four of network 400 (FIG. 4).
- FIG. 6 is an example of multichannel mesh network that uses four communication channels.
- mesh network 600 assume that the cost for the use of each link has a value of one and that a goal is to minimize interference between channels. Based on this goal, a path through network 600 that minimizes the maximum number of links that use the same channel is desirably determined. For example, for a packet to be routed from node one to node five, node one would look in its routing table and find the following matrix:
- Node one may then select channels one, two or four as the bottleneck channel, since none of these choices has any channel contention. If either channel one or channel two is selected, and the packet is forwarded to node three. Node three may use the following computation to determine the bottleneck channel:
- node three can make the same choice as node one and correctly forward the packet toward the destination.
- node one chose channel four as the bottleneck channel, it will forward to node four.
- Node four may use the following computation to determine the bottleneck channel:
- node four the same bottleneck channels are available, and node four chooses the same path as node one.
- terms such as processing, computing, calculating, determining, displaying, or the like may refer to an action and/or process of one or more processing or computing systems or similar devices that may manipulate and transform data represented as physical (e.g., electronic) quantities within a processing system's registers and memory into other data similarly represented as physical quantities within the processing system's registers or memories, or other such information storage, transmission or display devices.
- computing device includes one or more processing elements coupled with computer-readable memory that may be volatile or non- volatile memory or a combination thereof.
- Embodiments of the invention may be implemented in one or a combination of hardware, firmware and software. Embodiments of the invention may also be implemented as instructions stored on a machine-readable medium, which may be read and executed by at least one processor to perform the operations described herein.
- a machine-readable medium may include any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer).
- a machine-readable medium may include read-only memory (ROM), random-access memory (RAM), magnetic disk storage media, optical storage media, flash-memory devices, electrical, optical, acoustical or other form of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.), and others.
Abstract
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB0714640A GB2438984B (en) | 2005-01-04 | 2006-01-04 | Multichannel mesh router and methods for path selection in a multichannel mesh network |
DE112006000134T DE112006000134B4 (en) | 2005-01-04 | 2006-01-04 | Multi-channel mesh router and path selection method in a multi-channel mesh network |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/030,593 | 2005-01-04 | ||
US11/030,593 US7471633B2 (en) | 2005-01-04 | 2005-01-04 | Multichannel, mesh router and methods for path selection in a multichannel mesh network |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2006074319A1 true WO2006074319A1 (en) | 2006-07-13 |
Family
ID=36424543
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US2006/000377 WO2006074319A1 (en) | 2005-01-04 | 2006-01-04 | Multichannel mesh router and methods for path selection in a multichannel mesh network |
Country Status (5)
Country | Link |
---|---|
US (1) | US7471633B2 (en) |
DE (1) | DE112006000134B4 (en) |
GB (1) | GB2438984B (en) |
TW (1) | TWI309518B (en) |
WO (1) | WO2006074319A1 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1986375A1 (en) * | 2007-04-05 | 2008-10-29 | Alcatel Lucent | Method and node for routing data in a wireless meshed networks |
US7471633B2 (en) | 2005-01-04 | 2008-12-30 | Intel Corporation | Multichannel, mesh router and methods for path selection in a multichannel mesh network |
Families Citing this family (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7664037B2 (en) * | 2005-01-04 | 2010-02-16 | Intel Corporation | Multichannel mesh network, multichannel mesh router and methods for routing using bottleneck channel identifiers |
US7626967B2 (en) * | 2005-01-05 | 2009-12-01 | Intel Corporation | Methods and apparatus for providing a transparent bridge associated with a wireless mesh network |
US7957277B2 (en) * | 2005-02-25 | 2011-06-07 | Interdigital Technology Corporation | Wireless communication method and system for routing packets via intra-mesh and extra-mesh routes |
CN101138206B (en) * | 2005-03-08 | 2013-04-24 | 艾利森电话股份有限公司 | Method and arrangement for advanced routing metrics in multihop networks |
KR101235972B1 (en) * | 2005-05-31 | 2013-02-21 | 삼성전자주식회사 | Multi-channel mac method and apparatus for wlan devices with single radio interface |
US7688739B2 (en) * | 2005-08-02 | 2010-03-30 | Trilliant Networks, Inc. | Method and apparatus for maximizing data transmission capacity of a mesh network |
CN101009531B (en) * | 2006-01-25 | 2010-04-07 | 华为技术有限公司 | Error control method and mutual-help forwarding system |
US8761125B2 (en) * | 2006-05-01 | 2014-06-24 | The Hong Kong University Of Science And Technology | Scalable wireless mesh networks |
US7953055B2 (en) * | 2006-07-14 | 2011-05-31 | Samsung Electronics Co., Ltd. | Multi-channel MAC apparatus and method for WLAN devices with single radio interface |
US20080084856A1 (en) * | 2006-10-06 | 2008-04-10 | Motorola, Inc. | System and method to facilitate path selection in a multihop network |
US8660085B2 (en) * | 2006-12-04 | 2014-02-25 | Qualcomm Incorporated | Methods and apparatus for transferring a mobile device from a source eNB to a target eNB |
US9319299B2 (en) * | 2008-01-25 | 2016-04-19 | Alcatel Lucent | Method and apparatus for link aggregation using links having different link speeds |
JP5480281B2 (en) | 2008-10-09 | 2014-04-23 | コーニンクレッカ フィリップス エヌ ヴェ | Channel switching in mesh type networks |
US8429474B2 (en) * | 2009-03-30 | 2013-04-23 | Intel Corporation | Multiple protocol data transport |
US8625485B2 (en) * | 2009-04-30 | 2014-01-07 | Sung-Ju Lee | Data flow routing in a multi-hop wireless network |
KR101295875B1 (en) * | 2009-12-07 | 2013-08-12 | 한국전자통신연구원 | Operating method of sensor network and network node providing routing mechanism supporting real time transmission of prior information |
US9826039B2 (en) | 2014-02-04 | 2017-11-21 | Honeywell International Inc. | Configurable communication systems and methods for communication |
US9548918B2 (en) * | 2014-02-28 | 2017-01-17 | General Electric Company | Edge router systems and methods |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020061001A1 (en) * | 2000-08-25 | 2002-05-23 | The Regents Of The University Of California | Dynamic source tracing (DST) routing protocol for wireless networks |
US20030161268A1 (en) * | 2002-02-22 | 2003-08-28 | Telefonaktiebolaget Lm Ericsson | Cross-layer integrated collision free path routing |
US20030202476A1 (en) * | 2002-04-29 | 2003-10-30 | Harris Corporation | Determining quality of service (QoS) routing for mobile AD HOC networks |
WO2004014091A1 (en) * | 2002-08-05 | 2004-02-12 | Harris Corporation | Multi-channel mobile ad hoc network |
US20040229566A1 (en) * | 2003-05-13 | 2004-11-18 | Weilin Wang | Systems and methods for congestion control in a wireless mesh network |
WO2004114690A1 (en) * | 2003-06-05 | 2004-12-29 | Meshnetworks, Inc. | Optimal routing in ad hac wireless communication network |
Family Cites Families (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2856050B2 (en) * | 1993-11-30 | 1999-02-10 | 日本電気株式会社 | Routing control method |
SE9704784L (en) * | 1997-12-19 | 1999-06-20 | Ericsson Telefon Ab L M | Method and apparatus in a packet switching network |
US6535481B1 (en) * | 1999-08-20 | 2003-03-18 | Nortel Networks Limited | Network data routing protection cycles for automatic protection switching |
US6363319B1 (en) * | 1999-08-31 | 2002-03-26 | Nortel Networks Limited | Constraint-based route selection using biased cost |
US6621795B1 (en) | 1999-10-12 | 2003-09-16 | Verizon Corporate Services Group Inc. | Band manager for use in multiple-channel networks |
US6816460B1 (en) * | 2000-03-14 | 2004-11-09 | Lucent Technologies Inc. | Location based routing for mobile ad-hoc networks |
US6580979B2 (en) * | 2000-07-10 | 2003-06-17 | Hrl Laboratories, Llc | Method and apparatus for terrain reasoning with distributed embedded processing elements |
AU2001280351A1 (en) * | 2000-09-20 | 2002-04-02 | Telefonaktiebolaget Lm Ericsson (Publ) | Traffic dependent bluetooth scatternet optimization procedure |
JP4496673B2 (en) * | 2001-06-07 | 2010-07-07 | 株式会社デンソー | OFDM transceiver |
US20030181211A1 (en) | 2002-03-19 | 2003-09-25 | Javad Razavilar | Method and apparatus for dynamic channel selection in wireless modems |
US7616961B2 (en) * | 2002-04-29 | 2009-11-10 | Harris Corporation | Allocating channels in a mobile ad hoc network |
US20050180356A1 (en) | 2002-10-01 | 2005-08-18 | Graviton, Inc. | Multi-channel wireless broadcast protocol for a self-organizing network |
JP2004336209A (en) | 2003-05-01 | 2004-11-25 | Ntt Docomo Inc | Traffic distribution control apparatus, and traffic distribution control method |
US7246172B2 (en) * | 2003-06-06 | 2007-07-17 | Matsushita Electric Industrial Co., Ltd. | Static dense multicast path and bandwidth management |
US7471633B2 (en) | 2005-01-04 | 2008-12-30 | Intel Corporation | Multichannel, mesh router and methods for path selection in a multichannel mesh network |
US7664037B2 (en) | 2005-01-04 | 2010-02-16 | Intel Corporation | Multichannel mesh network, multichannel mesh router and methods for routing using bottleneck channel identifiers |
-
2005
- 2005-01-04 US US11/030,593 patent/US7471633B2/en not_active Expired - Fee Related
-
2006
- 2006-01-04 GB GB0714640A patent/GB2438984B/en not_active Expired - Fee Related
- 2006-01-04 WO PCT/US2006/000377 patent/WO2006074319A1/en active Application Filing
- 2006-01-04 DE DE112006000134T patent/DE112006000134B4/en not_active Expired - Fee Related
- 2006-01-04 TW TW095100323A patent/TWI309518B/en not_active IP Right Cessation
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020061001A1 (en) * | 2000-08-25 | 2002-05-23 | The Regents Of The University Of California | Dynamic source tracing (DST) routing protocol for wireless networks |
US20030161268A1 (en) * | 2002-02-22 | 2003-08-28 | Telefonaktiebolaget Lm Ericsson | Cross-layer integrated collision free path routing |
US20030202476A1 (en) * | 2002-04-29 | 2003-10-30 | Harris Corporation | Determining quality of service (QoS) routing for mobile AD HOC networks |
WO2004014091A1 (en) * | 2002-08-05 | 2004-02-12 | Harris Corporation | Multi-channel mobile ad hoc network |
US20040229566A1 (en) * | 2003-05-13 | 2004-11-18 | Weilin Wang | Systems and methods for congestion control in a wireless mesh network |
WO2004114690A1 (en) * | 2003-06-05 | 2004-12-29 | Meshnetworks, Inc. | Optimal routing in ad hac wireless communication network |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7471633B2 (en) | 2005-01-04 | 2008-12-30 | Intel Corporation | Multichannel, mesh router and methods for path selection in a multichannel mesh network |
EP1986375A1 (en) * | 2007-04-05 | 2008-10-29 | Alcatel Lucent | Method and node for routing data in a wireless meshed networks |
Also Published As
Publication number | Publication date |
---|---|
DE112006000134B4 (en) | 2012-11-22 |
DE112006000134T5 (en) | 2007-12-06 |
TWI309518B (en) | 2009-05-01 |
GB2438984B (en) | 2009-04-22 |
GB2438984A (en) | 2007-12-12 |
GB0714640D0 (en) | 2007-09-05 |
US7471633B2 (en) | 2008-12-30 |
TW200635286A (en) | 2006-10-01 |
US20060146718A1 (en) | 2006-07-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2006074319A1 (en) | Multichannel mesh router and methods for path selection in a multichannel mesh network | |
WO2006074385A1 (en) | Multichannel mesh network, multichannel mesh router and methods for routing using bottleneck channel identifiers | |
JP5037120B2 (en) | Optimal routing in ad hoc wireless communication networks | |
Kyasanur et al. | Routing and interface assignment in multi-channel multi-interface wireless networks | |
Wang et al. | Adaptive multipath source routing in ad hoc networks | |
JP4447601B2 (en) | Multi-user diversity forwarding | |
Hu et al. | On mitigating the broadcast storm problem with directional antennas | |
US8059544B2 (en) | Distance adaptive routing protocol | |
US20050286426A1 (en) | System and method for link quality routing using a weighted cumulative expected transmission time metric | |
EP1936889A1 (en) | Location aware packet routing in an ad-hoc network | |
WO2006096097A1 (en) | Method and arrangement for advanced routing metrics in multihop networks | |
Kyasanur et al. | Routing in multi-channel multi-interface ad hoc wireless networks | |
Roy et al. | Multipath routing in ad hoc wireless networks with omni directional and directional antenna: A comparative study | |
Sheikh et al. | A survey of cross‐layer protocols for IEEE 802.11 wireless multi‐hop mesh networks | |
Roy et al. | Capacity scaling with multiple radios and multiple channels in wireless mesh networks | |
Ajmal et al. | Coordinated opportunistic routing protocol for wireless mesh networks | |
Gong et al. | A combined proactive routing and multi-channel MAC protocol for wireless ad hoc networks | |
Luong et al. | Channel allocation for multiple channels multiple interfaces communication in wireless ad hoc networks | |
Guirguis et al. | Channel selection scheme for cooperative routing protocols in cognitive radio networks | |
Lee et al. | OLSR-MC: A proactive routing protocol for multi-channel wireless ad-hoc networks | |
Omer et al. | A dual channel routing protocol based on energy and link quality indicator in wireless body area networks | |
The Dung et al. | SCRRM: a stability‐aware cooperative routing scheme for reliable high‐speed data transmission in multi‐rate mobile ad hoc wireless networks | |
Krasnovsky et al. | A performance of wireless ad-hoc network routing protocol | |
Irfan Rafique et al. | Simple modifications in HWMP for wireless mesh networks with smart antennas | |
Jiang et al. | A new interference aware routing metric for multi-radio multi-channel wireless mesh networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
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: 1120060001345 Country of ref document: DE |
|
ENP | Entry into the national phase |
Ref document number: 0714640 Country of ref document: GB Kind code of ref document: A Free format text: PCT FILING DATE = 20060104 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 0714640.0 Country of ref document: GB |
|
RET | De translation (de og part 6b) |
Ref document number: 112006000134 Country of ref document: DE Date of ref document: 20071206 Kind code of ref document: P |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 06717558 Country of ref document: EP Kind code of ref document: A1 |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8607 |