WO2006029126A2 - Systeme et procede pour associer differents types de noeuds a des noeuds de point d'acces dans un reseau sans fil afin de transmettre des donnees dans ce reseau sans fil - Google Patents

Systeme et procede pour associer differents types de noeuds a des noeuds de point d'acces dans un reseau sans fil afin de transmettre des donnees dans ce reseau sans fil Download PDF

Info

Publication number
WO2006029126A2
WO2006029126A2 PCT/US2005/031643 US2005031643W WO2006029126A2 WO 2006029126 A2 WO2006029126 A2 WO 2006029126A2 US 2005031643 W US2005031643 W US 2005031643W WO 2006029126 A2 WO2006029126 A2 WO 2006029126A2
Authority
WO
WIPO (PCT)
Prior art keywords
meshed
node
meshed node
access point
nodes
Prior art date
Application number
PCT/US2005/031643
Other languages
English (en)
Other versions
WO2006029126A3 (fr
Inventor
Avinash Joshi
Charles R. Barker, Jr.
Keith J. Goldberg
William Vann Hasty, Jr.
Robin U. Roberts
Surong Zeng
Original Assignee
Meshnetworks, Inc.
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Meshnetworks, Inc. filed Critical Meshnetworks, Inc.
Priority to DE112005002142.4T priority Critical patent/DE112005002142B8/de
Publication of WO2006029126A2 publication Critical patent/WO2006029126A2/fr
Publication of WO2006029126A3 publication Critical patent/WO2006029126A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/34—Modification of an existing route
    • H04W40/36—Modification of an existing route due to handover
    • 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
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • 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
    • 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/28—Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10—Small scale networks; Flat hierarchical networks
    • 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
    • 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
    • H04W84/22—Self-organising networks, e.g. ad-hoc networks or sensor networks with access to wired networks
    • 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/08—Access point devices
    • 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
    • H04W88/182—Network node acting on behalf of an other network entity, e.g. proxy

Definitions

  • the present invention relates generally to a system and method for associating different types of nodes in a communication network with proxy nodes that can route packets between the different type of nodes and other nodes in the network.
  • each mobile node is capable of operating as a base station or router for the other mobile nodes, thus eliminating the need for a fixed infrastructure of base stations.
  • network nodes transmit and receive data packet communications in a multiplexed format, such as time-division multiple access (TDMA) format, code-division multiple access (CDMA) format, or frequency- division multiple access (FDMA) format.
  • TDMA time-division multiple access
  • CDMA code-division multiple access
  • FDMA frequency- division multiple access
  • More sophisticated ad-hoc networks are also being developed which, in addition to enabling mobile nodes to communicate with each other as in a conventional ad-hoc network, further enable the mobile nodes to access a fixed network and thus communicate with other mobile nodes, such as those on the public switched telephone network (PSTN), and on other networks such as the Internet. Details of these advanced types of ad-hoc networks are described in U.S. Patent Application Serial No. 09/897,790 entitled "Ad Hoc Peer-to-Peer Mobile Radio Access System Interfaced to the PSTN and Cellular Networks," filed on June 29, 2001, in U.S. Patent Application Serial No.
  • Access Point or Master Node
  • stations or slave nodes
  • the stations are typically described as being “associated with” the Access Point.
  • Access Points or Master Nodes are connected to other Access Points or Master Nodes and rest of the Internet.
  • FIG. 1 is a block diagram of an example ad-hoc wireless communications network including a plurality of nodes employing a system and method in accordance with an embodiment of the present invention
  • FIG. 2 is a block diagram illustrating an example of a mobile node employed in the network shown in Fig. 1 ;
  • FIG. 3 is an example of the connectivity of typical network operating in accordance with the International Electrical and Electronic Engineers (IEEE) 802.11
  • FIG. 4 is a block diagram of wireless network as shown in FIG. 1 configured in accordance with an embodiment of the present invention
  • FIGs. 5 through 7 are flowcharts illustrating examples of operations for updating the binding and association tables of nodes in the wireless network shown in
  • FIG. 4 in accordance with an embodiment of the present invention.
  • FIG. 8 is a flowchart illustrating an example of operations performed for sending a packet between nodes in the network show in FIG. 4 according to an embodiment of the present invention.
  • embodiments of the invention described herein may be comprised of one or more conventional processors and unique stored program instructions that control the one or more processors to implement, in conjunction with certain non-processor circuits, some, most, or all of the functions of a system and method for routing data in a wireless network described herein.
  • the non-processor circuits may include, but are not limited to, a radio receiver, a radio transmitter, signal drivers, clock circuits, power source circuits, and user input devices. As such, these functions may be interpreted as steps of a method to perform data routing in a wireless network.
  • the present invention provides a system and method that enables all nodes in a wireless network, in particular, an ad-hoc multi-hopping wireless network, to find routes to each other even if those nodes do not participate in routing packets.
  • FIG. 1 is a block diagram illustrating an example of an ad-hoc packet- switched wireless communications network 100 employing an embodiment of the present invention.
  • the network 100 includes a plurality of mobile wireless user terminals 102-1 through 102-n (referred to generally as nodes 102 or mobile nodes 102), and can, but is not required to, include a fixed network 104 having a plurality of intelligent access points (IAPs) 106-1, 106-2, ...106-n (referred to generally as nodes 106, intelligent access points 106, or IAPs 106), for providing nodes 102 with access to the fixed network 104.
  • IAPs intelligent access points
  • the fixed network 104 can include, for example, a core local access network (LAN), and a plurality of servers and gateway routers to provide network nodes with access to other networks, such as other ad-hoc networks, the public switched telephone network (PSTN) and the Internet.
  • the network 100 further can include a plurality of fixed routers 107-1 through 107-n (referred to generally as nodes 107 or fixed routers 107) for routing data packets between other nodes 102, 106 or 107. It is noted that for purposes of this discussion, the nodes discussed above can be collectively referred to as “nodes 102, 106 and 107,” or simply "nodes.”
  • the nodes 102, 106 and 107 are capable of communicating with each other directly, or via one or more other nodes 102, 106 or 107 operating as a router or routers for packets being sent between nodes, as described in U.S. Patent No. 5,943,322 to Mayor, and in U.S. Patent Application Serial No. 09/897,790, and U.S. Patent Nos. 6,807,165 and 6,873,839, referenced above. As shown in FIG.
  • each node 102, 106 and 107 includes a transceiver, or modem 108, which is coupled to an antenna 110 and is capable of receiving and transmitting signals, such as packetized signals, to and from the node 102, 106 or 107, under the control of a controller 112.
  • the packetized data signals can include, for example, voice, data or multimedia information, and packetized control signals, including node update information.
  • Each node 102, 106 and 107 further includes a memory 114, such as a random access memory (RAM) that is capable of storing, among other things, routing information pertaining to itself and other nodes in the network 100.
  • a memory 114 such as a random access memory (RAM) that is capable of storing, among other things, routing information pertaining to itself and other nodes in the network 100.
  • certain nodes, especially mobile nodes 102 can include a host 116 which may consist of any number of devices, such as a notebook computer terminal, mobile telephone unit, mobile data unit, or any other suitable device.
  • Each node 102, 106 and 107 also includes the appropriate hardware and software to perform Internet Protocol (IP) and Address Resolution Protocol (ARP), the purposes of which can be readily appreciated by one skilled in the art.
  • IP Internet Protocol
  • ARP Address Resolution Protocol
  • TCP transmission control protocol
  • UDP user datagram protocol
  • FIG. 3 illustrates a typical network 300 operating in accordance with the International Electrical and Electronic Engineers (IEEE) 802.11 Standard, such as version IEEE Std. 802.11-1997, which can be referred to as "an 802.11 network".
  • the network includes a first and second access points 302 AP 1 and AP 2, respectively.
  • AP 1 and AP 2 are connected to one another via wired Ethernet 304.
  • Wireless stations 306 (STA 1, STA 2, and STA 3) are associated with AP 1, while wireless stations 306 identified as STA 4, STA 5, and STA 6 are associated with AP 2.
  • stations 306 STA 1 through STA 6 access the Internet 308 through their associated APs.
  • these APs connect to the Internet through a backhaul infrastructure, such as a wired Ethernet.
  • An embodiment of the invention avoids the need for the backhaul infrastructure through the use of intelligent access points (IAPs 106 as shown in FIG. 1) that are connected to the wired portion (e.g., fixed network 104) of the network 100.
  • IAPs 106 is responsible for providing Internet connectivity to those devices that are associated with that IAP 106.
  • Devices are associated with the IAP 106 using a binding protocol as described below.
  • Meshed Device - A device operating according to an embodiment of the invention, which may follow a standard wireless protocol such as IEEE 802.11 or IEEE 802.15. These devices are responsible for forwarding packets to/from the proxy devices which are associated with them.
  • Non-Meshed Device A device following a standard wireless protocol such as IEEE 802.11 or IEEE 802.15 but not participating in any kind of routing. These devices are "proxied” by meshed devices, which establish routes for them.
  • FIG. 4 illustrates the use of the network 100 as shown in FIG. 1 according to an embodiment of the invention, wherein like components are given the same identification number.
  • the network 100 as shown in this example includes at least one intelligent access point 106 identified as IAP 1, which is communicatively linked to the Internet 402 via wired connection (such as fixed network 104).
  • the network 400 further includes access points 402, identified as AP 1, AP 2, AP 3, AP 4, and AP 5.
  • the network 400 also includes at least one node 404 (identified as Node 1) which is a meshed device but does not proxy any other device. All of the nodes 404 in the network 400 are associated with IAP 1.
  • the network 400 further includes wireless stations 406 STA 1 - STA 18, which are each associated with the nearest access point 402 (e.g., AP 1 through AP 5). For example, STA 13, STA 14, and STA 15 are each associated with access point AP 5. Some of the stations 406 are mobile nodes 102 (or routers 107) as discussed above with regard to FIG. 1 In this example, wireless stations 406 identified as STA 13, STA 14, and STA 15 are non-meshed devices, and do not participate directly in routing.
  • the network 400 also includes a device 408 identified as Device 1, which is associated with the access point AP 5 and is connected to AP 5 via Ethernet 410. [0026] In accordance with the embodiment shown in FIG.
  • the APs 1 though 5 and IAP 1 operate in compliance with the IEEE 802.11 standard for access points, but also have added functionality as described herein for the invention.
  • the stations 406 STA 1 - STA 18 operate in compliance with the IEEE 802.11 standard.
  • the APs use a wireless link to communicate with other APs.
  • the APs can use the same wireless link that they use to communicate to the STAs or can use an alternate link for communicating with other APs.
  • the network shown in FIG. 4 also may be used in conjunction with the Wireless Distribution System described in the IEEE 802.11-1997 Standard.
  • each AP maintains an "association table” or "proxy table” that contains an entry for each device that is associated with the AP (i.e. each device that is being proxied by the AP).
  • An AP can also have nodes or devices (associated with it through a wired Ethernet port (for example AP 5 has Device 1 associated with it) or through some other wired/wireless protocol like IEEE 802.15, Token Ring, or the like as can be appreciated by one skilled in the art.
  • An association table of an AP may also contain entries for non-meshed devices that are associated with other APs but use that AP as an intermediate node to communicate with other devices in the network 400. Each entry in the association table may include one or more of the following pieces of information:
  • Associated AP address (the address can be MAC address, IP address or other device ID depending on which addressing scheme is used ⁇ this entry is used if node is maintaining association information for non-meshed nodes associated with other AP. This is useful in case a four (4) addressing scheme is used in the network) • Expiration time of the entry
  • Each IAP 106 also maintains a "binding table.”
  • the binding table contains an entry for each AP that is associated with (also referred to herein as “bound to") the IAP (i.e., each meshed device that is bound to the IAP 106).
  • Each entry in the binding table may include one or more of the following pieces of information:
  • MAC Address of meshed device e.g. an AP, if MAC addressing scheme is used
  • IP address of meshed device e.g. an AP, if IP addressing scheme is used
  • a non-meshed device e.g., STA 13
  • a meshed device e.g. AP 5
  • the meshed device adds an entry into its association table or proxy table for this non-meshed device in step 1010.
  • the meshed device AP 5 sends a Binding Request (BREQ) to its bound IAP 106 (IAP 1) to report the new updates in step 1020.
  • BREQ Binding Request
  • IAP 1 adds an entry into its binding table for this new associated non-meshed device in step 1030.
  • the BREQ includes, but not limit to, the following information:
  • Bound IAP' s address (if the address can be MAC address, IP address or other device ID depending on which addressing scheme is used)
  • Originator's MAC address (the meshed device, e.g. AP, the address can be MAC address, IP address or other device ID depending on which addressing scheme is used)
  • the BANN includes, but not limit to, the following information:
  • IAP' s address (the new IAP that the meshed device is bound to; the address can be MAC address, LP address or other device ID depending on which addressing scheme is used)
  • Originator's address (it should be the meshed device's address; the address can be MAC address, IP address or other device ID depending on which addressing scheme is used)
  • Old IAP' s address (the old IAP that the meshed device is bound to; the address can be MAC address, IP address or other device ID depending on which addressing scheme is used)
  • the old IAP removes the Originator node (the meshed device which just handed off, in this example AP 5) and all its proxies from IAP l's binding table in step 1130.
  • IAP 1 also sends a Bind Removed (BRED) message to the originator node (AP 5) to acknowledge the action in stepll40.
  • BRED Bind Removed
  • the new IAP will also send one L2 update packet for each device that was bound recently on the WAN to update the entries in bridge/switch.
  • STA 13 moves from one AP (e.g. AP 5) and gets associated with another AP (e.g. AP 1) in step 1200, the association triggers the AP 1 to send a new BREQ message in step 1210 to the IAP indicating the new non- meshed node (STA 13) which got associated to it.
  • IAP 1 receives a BREQ, IAP 1 first checks its binding table in step 1220 to see if it had an entry for STA 13. If no entry is found, IAP will assume that the device is new and will create a new entry for it and generate an L2 update packet on the WAN in step 1230 otherwise it will update the existing entry to reflect the new association but will not send any L2 update packet.
  • the PREM includes, but not limit to, the following information:
  • IAP' s address (the address can be MAC address, IP address or other device ID depending on which addressing scheme is used)
  • the meshed device Upon receiving the PREM message, the meshed device (AP 5) removes the entries from its proxy/association table according to the list of proxy devices in the PREM message in step 1250.
  • routing protocols can generally be classified as either (a) table-driven (or proactive) routing protocols; or (b) on-demand (or reactive) routing protocols.
  • each node e.g., APs, IAP, STAs
  • each node maintains one or more tables containing routing information to every other node in the network 400. All nodes update these tables so as to maintain a consistent and up-to-date view of the network.
  • the nodes propagate update messages throughout the network in order to maintain consistent and up-to-date routing information about the whole network.
  • These routing protocols vary in the method by which the topology change information is distributed across the network and the number of necessary routing-related tables.
  • distance vector routing (or any variant of it for mobile ad-hoc networks (MANETs) such as destination sequenced distance vector (DSDV) routing).
  • MANETs mobile ad-hoc networks
  • DSDV destination sequenced distance vector
  • distance vector routing is modified as follows. Instead of advertising routes to other APs, APs also include the information about the devices which are associated with respective APs.
  • link state routing (or any variant of it like optimized state link routing (OLSR)).
  • link state routing is modified as follows. Instead of sending link updates about neighboring APs, all APs also include information about the devices associated with neighboring APs. Thus after routing convergence, all APs know about routes to all other APs and also know about the devices associated with those APs.
  • On demand routing protocols create routes only when desired by the source node. When a node requires a route to a destination, that node initiates a route discovery process within the network 400. This process is completed once a route is found or all possible route permutations have been examined. Once a route has been established, it is maintained by some form of route maintenance procedure until either the destination becomes inaccessible along every path from the source or until the route is no longer desired.
  • Ad-hoc On-demand Distance Vector (AODV) and dynamic source routing (DSR) are on-demand routing protocols that provide quick convergence and lower overhead, and allow the intermediate nodes to reply for a destination if they have a valid route.
  • AODV On-demand Distance Vector
  • DSR dynamic source routing
  • the real source and destination can be a non-meshed device which does not maintain any sequence number as required by AODV.
  • STA 15 tried to communicate with Device 1.
  • the non maintenance of Sequence Number can lead to inefficient routing using the standard implementation of DSR, and especially for AODV since, if the destination node is not a meshed device, then only the device with which the destination node is associated can reply.
  • standard on-demand routing protocols such as AODV and DSR are modified so that all meshed devices send the list of devices that are associated with them to the IAP.
  • This list can be sent periodically or in response to an event.
  • each AP can be configured such that it sends the list whenever a new node becomes associated with it.
  • the IAP stores this information in its binding table.
  • Each meshed device also informs the IAP when it adds or removes a device from its association table.
  • the sending station 406 (e.g. STA 13), which can also be referred to as the "source node” in this example, first sends the packet addressed to the destination node (e.g., STA 16 in this example) to STA 13's associated AP (AP 5) in accordance with the IEEE 802.11 standard in step 1300.
  • the packet at this point includes the source and the destination address.
  • the AP 5 uses one of the methods described below and as described in U.S. Application No.
  • the AP 5 first references its routing table to determine whether it has a valid route to the destination in step 1310. If the AP 5 has a valid route in its routing table, the AP 5 forwards the packet to the next hop towards the destination in step 1320. If the AP 5 determines that there is no valid route to the destination in its routing table, the AP 5 forwards the packet to the IAP 1 with which it is bound in step 1330, and sends a special message, called a Status Request, to the IAP 1 in step 1340.
  • the contents of the Status Request message may include, but are not limited to:
  • the AP 5 determines the route to the IAP 1 in step 1350.
  • the AP 5 can accomplish this task in a variety of ways, some of which are described in U.S. Patent Application Number 10/755,346, filed January 13, 2004, which is incorporated herein by reference in its entirety.
  • the IAP 1 Upon receiving this Status Request, the IAP 1 consults its binding table to see if the destination node (e.g., STA 16 in this example) is present in the table and is unexpired in step 1360. It should be noted that all of the information contained in the binding table can be combined with that in the routing table. The combined data structure can be used both as a routing table and as a binding table. After checking the binding table, the IAP 1 sends a message called a Status Reply back to the AP 5.
  • the contents of the Status Reply message may include, but are not limited to:
  • the IAP 1 finds a valid entry in its binding table in step 1360, it sends the Status Reply message back to the AP with the success bit set in step 1370. If the IAP 1 does not find a valid entry in its binding table, it sends the Status Reply message back to the AP 5 with the success bit unset in step 1380.
  • the Status Reply message also includes the type of the destination device, that is, either meshed or non-meshed. If the destination device is non-meshed, the IAP 1 also includes the address of the meshed device that is proxying the destination device.
  • the AP 5 Upon receiving the Status Reply with success bit set, the AP 5 initiates an expanding ring search, in accordance with, for example, AODV, in step 1390. In initiating this search, the AP 5 transmits a Route Request (RREQ) packet in step 1400.
  • the maximum time-to-live (TTL) can be equal to the number of hops to the IAP 1. In this example, the maximum TTL can also be a function of the number of hops to the IAP 1 , or can be a function of something other factor as can be understood by one skilled in the art.
  • the "Destination Address" field of the RREQ packet contains the address of the destination itself, if the Type field indicates that the destination is a meshed device.
  • the "Destination Address” field contains the address of the meshed device proxying the destination device as reported by the IAP 1.
  • the RREQ packet contains the address of a meshed device in the "Destination Address” field, any node having a valid route to the "Destination Address” can reply.
  • the RREQ packet does not need to reach all the way to the end (the destination).
  • the route is made available when some meshed device receives the RREQ packet, finds the appropriate route in its routing table, and unicasts a Route Reply (RREP) back to the origination of the RREQ (back to the AP 5) in step 1410.
  • RREP Route Reply
  • Two variations can be used for setting up and/or updating the route entries on the route between the source meshed device and the destination meshed device.
  • One variation is that the intermediate meshed device only maintains the routes to the destination meshed device and the source meshed device.
  • each following data packet should carry six addresses: initiator address, terminator address, source meshed device address, destination meshed device address, current hop device address, next hop device address. If the real source and the real destination are not meshed devices, then the initiator address and the terminator address will be the real source non-meshed device and the real destination non-meshed device, respectively, the source meshed device is the one proxying for the source non-meshed device, and the destination meshed device is the one proxying for the destination non-meshed device, respectively.
  • the initiator address is same as the source meshed device address
  • the terminator address is same as the destination meshed device address.
  • the intermediate meshed device maintains the routes to the source meshed device and the destination meshed device, as well as the proxy/association information for non-meshed devices which proxied by the source and destination meshed devices.
  • the RREP is sent back from the destination meshed device to the source meshed device, besides creating/updating the route entry for the destination meshed device, each intermediate meshed device also updates its proxy/association table if the real source and/or real destination are not meshed devices.
  • the intermediate node creates an entry for the non-meshed device, and records which meshed device the non-meshed device is associated with according to the address information in the RREP.
  • addresses are the initiator address, terminator address, current hop device address, and next hop device address.
  • the intermediate node forwards the data packet originating from a non-meshed source device and terminating at a non-meshed destination device, the intermediate node first consults its proxy/association table for the non-meshed destination device to get the destination meshed device which is proxying for the non-meshed destination device. Next, the intermediate node checks the route table for the route entry for the destination meshed device to get the next hop device address.
  • the AP 5 Upon receiving the RREP in step 1410, the AP 5 updates its routing table and starts using the newly found route in step 1420.
  • the flood of RREQ packets is stopped at the level where the intermediate node has a valid route to the destination or to the meshed device proxying the destination, since the RREQ packets do not need to travel all the way to the destination.
  • This also eliminates the possibility of an AP doing a network-wide Route Discovery, which can consume considerable overhead, especially when the AP is searching for a destination node that does not even exist in the network.
  • the AP 5 continues to send packets to the IAP 1 while the AP 5 is waiting for the Status Reply or Status Error message. Thus, no packets need to be buffered at the AP 5. If the Status Reply comes with success bit unset as in step 1380, the AP continues to send packets to the IAP 1 unless the IAP 1 receives a special message called Status Error.
  • Status Error An example of a sequence of events that can lead to the generation of a Status Error message is described below.
  • the IAP 1 upon receiving the Status Request message probes the binding table in step 1360 as discussed above to find if it has any entry for the destination mentioned in the Status Request. If the probe is unsuccessful, the IAP 1 tries to locate the IAP with which the destination is bound in step 1430. This can be a route look up in the routing table of the IAP host or an ARP cache look up, or employ some other suitable method. If the IAP 1 determines in step 1440 that it cannot find the IAP with which the destination is bound and hence cannot forward the packet, it generates the Status Error message to the source node (e.g., STA 13) in step 1450. [0057] The possible contents of the Status Error message can include, but are not limited to, the following.
  • the same information can also be conveyed through any other messages which are flowing between the devices.
  • the IAP with which the destination is bound can be determined in step 1440, the no further action is taken on the part of this IAP as in step 1460.
  • meshed device 404 could also perform all of the steps that the AP 5 performed in the above example, with the exception that Node 1 does not "proxy” any other device.
  • the true "source node” was a device associated with the AP 5 (e.g., STA 13), although as far as the rest of the network 400 was concerned, the source node was the AP 5 itself. If Node 1 wishes to communicate with a station 406 in the network 400, Node 1 would be the true "source node” as well as the source node recognized by the network.
  • the source node may be one of the APs or a meshed device that does not serve as an AP for any other node (e.g. Node 7).
  • the source node e.g, AP 5
  • the source node can also buffer the packets while waiting for the Status Reply or Status Error. This is advantageous when there is one direct optimal route between the source node and the destination, in which case sending packets via the IAP 1 would be inefficient. However, this buffering may delay the sending of packets, and can require additional buffer space.
  • the source node can first do a local Route Discovery for the destination before sending the packets to the IAP 1, or before sending any Status Request message.
  • the source node can do an expanding ring search with the maximum TTL equal to the number of hops to the IAP 1.
  • the maximum TTL can also be a function of the number of hops to the IAP 1 or a function of something else.
  • the source node doesn't know the type of the destination (meshed or non- meshed).
  • the source node just puts the real destination address in "Destination Address" field of the RREQ message. The overhead involved in this process is dependent on the type of the destination device.
  • any node having a valid route to it can reply. If the destination node is a non-meshed device, then it is the responsibility of the meshed device that is proxying the destination (e.g. the associated AP) to reply to the RREQ packet. Thus, when a RREQ message is received, each node should check its association table and reply if the destination is one of the nodes associated with it. The RREP packet also needs to be modified in this case, as it may potentially need to carry two addresses in the reply. If the real destination is a non-meshed device, then the RREP message should contain the address of the device proxying the destination and the address of the destination itself.
  • the source node If the source node receives a RREP message, the source node will then start sending the packets to the destination. If no reply is received after one or more attempts, the source node can safely determine that the destination node is not in its vicinity, determined by the maximum TTL it has used. At this point the source node typically has to use the IAP 1 to send the packets to the destination. This may be achieved through one of the following two techniques.
  • the source node can start sending packets to the IAP 1 once the source node determines that the local Route Discovery has failed. The source node will stop if a Status Error message is received from the IAP 1 indicating that the destination node does not exist in the network currently.
  • the source node can send a special message to the IAP 1, or the Status Request message with the find bit set to determine if the destination node exists in the network. The IAP 1, upon receiving the message, queries its host routing table or ARP cache, or employs some other suitable method, to find the IAP 1 to which the destination node is bound.
  • the IAP 1 If the IAP 1 is successful in finding the IAP 1 to which the destination node is bound, and hence the destination node itself, the IAP 1 indicates this by sending a Status Reply message with the found bit set to the source node. Otherwise the IAP 1 sends a Status Error message to the source node. [0064] If a Status Reply message is received by the source node with the found bit set, then the source node starts sending the packets to the IAP 1 for the IAP 1 to forward to the appropriate IAP 1 to which the destination node is bound. If the Status Error message is received, then the source node can declare the destination to be unreachable for the time being and try again later.
  • the nodes can use other messages to convey the same information.
  • the source node generally needs to send DNS and/or ARP queries to the IAP 1 to which it is bound to determine the IP address, MAC address, and so forth.
  • the IAP 1 upon receiving such messages, can send a special kind of message to indicate if the destination node is bound with that IAP 1 or not, or whether the destination node even exists in the network.
  • the ARP on DNS replies can also be modified to include this information. Even the data packet itself can replace the status request.
  • the first data packet to a particular destination received at the IAP 1 can be treated like a Status Request message.
  • special Status messages will not be needed.
  • the IAP 1 can be leveraged for the purpose of providing replies for server centric services like ARP, DNS DHCP and so on.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention concerne un procédé et un système pour transmettre des données dans un réseau sans fil (400), permettant à tous les noeuds (106, 402, 404, 406, 408) de trouver des trajets les uns vers les autres même si les noeuds (106, 402, 404, 406, 408) ne sont pas entremêlés et ne peuvent pas fonctionner comme un routeur pour transmettre des paquets reçus d'autres noeuds (106, 402, 404, 406, 408), et pour associer et ré-associer les noeuds non entremêlés et entremêlés à d'autres noeuds entremêlés (106, 402, 404, 406, 408). Les noeuds non entremêlés (STA13-STA15) demande une association à un des noeuds entremêlés (AP5) qui peuvent effectuer un routage de paquet, afin de demander que le noeud entremêlé (AP5) auquel le noeud non entremêlé (STA13) est associé fonctionne comme un noeud mandataire pour transmettre des paquets entre le noeud non entremêlé associé (STA13) et d'autres noeuds entremêlés ou non entremêlés (106, 402, 404, 406, 408). Certains des noeuds entremêlés (106) fonctionnent aussi comme points d'accès intelligents (106) pour offrir aux noeuds non entremêlés (STA13-STA15) et à d'autres noeuds entremêlés (402) un accès à d'autres réseaux, tel qu'Internet (402), et pour effectuer une association et une ré-association des noeuds non entremêlés et entremêlés (106, 402, 404, 406, 408).
PCT/US2005/031643 2004-09-07 2005-09-07 Systeme et procede pour associer differents types de noeuds a des noeuds de point d'acces dans un reseau sans fil afin de transmettre des donnees dans ce reseau sans fil WO2006029126A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
DE112005002142.4T DE112005002142B8 (de) 2004-09-07 2005-09-07 System und Verfahren zum Assoziieren verschiedener Arten von Knoten mit Zugangspunktknoten in einem drahtlosen Netzwerk zum Routen von Daten in dem drahtlosen Netzwerk

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US60772904P 2004-09-07 2004-09-07
US60/607,729 2004-09-07
US61184504P 2004-09-22 2004-09-22
US60/611,845 2004-09-22

Publications (2)

Publication Number Publication Date
WO2006029126A2 true WO2006029126A2 (fr) 2006-03-16
WO2006029126A3 WO2006029126A3 (fr) 2006-08-03

Family

ID=36036942

Family Applications (2)

Application Number Title Priority Date Filing Date
PCT/US2005/031643 WO2006029126A2 (fr) 2004-09-07 2005-09-07 Systeme et procede pour associer differents types de noeuds a des noeuds de point d'acces dans un reseau sans fil afin de transmettre des donnees dans ce reseau sans fil
PCT/US2005/031651 WO2006029131A2 (fr) 2004-09-07 2005-09-07 Systeme et procede pour l'acheminement de donnees entre differents types de noeuds dans un reseau sans fil

Family Applications After (1)

Application Number Title Priority Date Filing Date
PCT/US2005/031651 WO2006029131A2 (fr) 2004-09-07 2005-09-07 Systeme et procede pour l'acheminement de donnees entre differents types de noeuds dans un reseau sans fil

Country Status (6)

Country Link
US (2) US7251238B2 (fr)
EP (1) EP1790184B1 (fr)
JP (1) JP4532554B2 (fr)
KR (2) KR100898680B1 (fr)
DE (1) DE112005002142B8 (fr)
WO (2) WO2006029126A2 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008064419A1 (fr) * 2006-11-28 2008-06-05 National Ict Australia Limited Découverte de liaisons internodales multiples dans des réseaux radio à plusieurs bonds
EP2022280A2 (fr) * 2006-05-12 2009-02-11 Motorola, Inc. Système et procédé pour distribuer des informations d'erreur de mandat dans des réseaux sans fil
GB2459450A (en) * 2008-04-21 2009-10-28 Bubblenets Ltd Automatic interconnection of Intelligent Wireless Nodes to provide connection to external networks
CN113347651A (zh) * 2017-01-20 2021-09-03 无线通信与技术公司 利用通用网关节点设置网状网络的系统和方法

Families Citing this family (61)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100513863B1 (ko) * 2003-04-29 2005-09-09 삼성전자주식회사 호스트의 이동성을 지원할 수 있는 무선 근거리 네트워크시스템 및 그의 동작방법
DE112005002142B8 (de) * 2004-09-07 2018-03-01 ARRIS Enterprises LLC (n. d. Ges. d. Staates Delaware) System und Verfahren zum Assoziieren verschiedener Arten von Knoten mit Zugangspunktknoten in einem drahtlosen Netzwerk zum Routen von Daten in dem drahtlosen Netzwerk
US7639681B2 (en) * 2004-11-23 2009-12-29 Microsoft Corporation System and method for a distributed server for peer-to-peer networks
US7643483B2 (en) 2004-11-24 2010-01-05 Microsoft Corporation System and method for using a hop limited cast for internet egress point selection
US7715395B2 (en) * 2004-11-24 2010-05-11 Microsoft Corporation System and method for expanding the range of a mesh network
US7649899B2 (en) * 2004-11-29 2010-01-19 Microsoft Corporation System and method for dynamic egress routing through a single default gateway in a mesh network
DE602005019107D1 (de) * 2005-03-10 2010-03-11 Thomson Licensing Sa Hybrides leitweglenkprotokoll für ein netzwerk mit maschentopologie
US8117340B2 (en) * 2005-04-25 2012-02-14 Microsoft Corporation Trans-network roaming and resolution with web services for devices
KR100703780B1 (ko) * 2005-05-11 2007-04-06 삼성전자주식회사 무선 네트워크에서 라우팅 테이블의 정보를 일치시키는방법 및 장치
US8064416B2 (en) * 2005-11-09 2011-11-22 Thomson Licensing Route selection in wireless networks
US7782835B2 (en) * 2006-01-17 2010-08-24 Motorola, Inc. System and method for multihop packet forwarding
US8340106B2 (en) * 2006-03-13 2012-12-25 Microsoft Corporation Connecting multi-hop mesh networks using MAC bridge
PL2041922T3 (pl) * 2006-07-14 2013-08-30 Siemens Ag Sposób generowania komunikatu żądania rozszerzonej trasy oraz komunikatu odpowiedzi rozszerzonej trasy dla procedur wykrywania tras
EP1901486A1 (fr) * 2006-09-15 2008-03-19 Koninklijke Philips Electronics N.V. Réseau sans fil
JP2008141508A (ja) * 2006-12-01 2008-06-19 Koyo Electronics Ind Co Ltd Ｐｌｃシステムおよび該システムに用いるｐｌｃ
US8213409B2 (en) * 2007-02-20 2012-07-03 Harris Corporation System and method for communicating over mesh networks using waveform-enhanced, link-state routing
US7870305B2 (en) * 2007-03-09 2011-01-11 Microsoft Corporation Proxy association for devices
US8948046B2 (en) 2007-04-27 2015-02-03 Aerohive Networks, Inc. Routing method and system for a wireless network
US20080316997A1 (en) * 2007-06-20 2008-12-25 Motorola, Inc. Multi-radio node with a single routing module which manages routing for multiple different radio modules
US20080316951A1 (en) * 2007-06-20 2008-12-25 Motorola, Inc. Method for discovering a route to an intelligent access point (iap)
US20080317047A1 (en) * 2007-06-20 2008-12-25 Motorola, Inc. Method for discovering a route to a peer node in a multi-hop wireless mesh network
US20090031398A1 (en) * 2007-07-23 2009-01-29 Motorola, Inc. Role determination for meshed node authentication
US7894378B2 (en) * 2007-08-16 2011-02-22 Motorola Solutions, Inc. Method for updating a multicast state of a multicast group
US8270429B2 (en) * 2007-08-24 2012-09-18 Motorola Solutions, Inc. Method of communicating within a mesh network
CN101904190A (zh) * 2007-10-19 2010-12-01 以色列奥维通有限公司 无线通信网络基站扩展
US7839771B2 (en) * 2008-02-21 2010-11-23 Aerohive Networks, Inc. Backhaul failover method and system for a wireless network
US7792110B2 (en) * 2008-03-31 2010-09-07 Motorola, Inc. Method and system for updating a virtual local area network (VLAN) status of a node in a mesh network
US20090285138A1 (en) * 2008-05-13 2009-11-19 Tzero Technologies, Inc. Maintaining wireless communication between Consumer Electronic Control devices
US8218502B1 (en) 2008-05-14 2012-07-10 Aerohive Networks Predictive and nomadic roaming of wireless clients across different network subnets
US8179845B2 (en) 2008-08-21 2012-05-15 Motorola Solutions, Inc. Antenna-aware method for transmitting packets in a wireless communication network
US9674892B1 (en) 2008-11-04 2017-06-06 Aerohive Networks, Inc. Exclusive preshared key authentication
US20100157888A1 (en) * 2008-12-18 2010-06-24 Motorola, Inc. System and method for improving efficiency and reliability of broadcast communications in a multi-hop wireless mesh network
US20100157889A1 (en) * 2008-12-18 2010-06-24 Motorola, Inc. System and method for improving efficiency of broadcast communications in a multi-hop wireless mesh network
US8483194B1 (en) 2009-01-21 2013-07-09 Aerohive Networks, Inc. Airtime-based scheduling
US8798034B2 (en) * 2009-03-31 2014-08-05 Motorola Solutions, Inc. System and method for selecting a route based on link metrics incorporating channel bandwidth, spatial streams and/or guard interval in a multiple-input multiple-output (MIMO) network
US9900251B1 (en) 2009-07-10 2018-02-20 Aerohive Networks, Inc. Bandwidth sentinel
US11115857B2 (en) 2009-07-10 2021-09-07 Extreme Networks, Inc. Bandwidth sentinel
WO2011006841A1 (fr) 2009-07-13 2011-01-20 Siemens Aktiengesellschaft Message de mise à jour d’affectations et procédé de mise à jour d’affectations dans un réseau maillé
CN101639539B (zh) * 2009-09-09 2011-07-20 中国科学院地质与地球物理研究所 存储式地震信号连续采集系统
US9455897B2 (en) * 2010-04-06 2016-09-27 Qualcomm Incorporated Cooperative bandwidth aggregation using multipath transport
US8671187B1 (en) 2010-07-27 2014-03-11 Aerohive Networks, Inc. Client-independent network supervision application
US9002277B2 (en) 2010-09-07 2015-04-07 Aerohive Networks, Inc. Distributed channel selection for wireless networks
US9451415B2 (en) * 2011-06-17 2016-09-20 Qualcomm Incorporated Cooperative data transport
US9264353B2 (en) * 2011-09-22 2016-02-16 Qualcomm Incorporated Dynamic subflow control for a multipath transport connection in a wireless communication network
US10091065B1 (en) 2011-10-31 2018-10-02 Aerohive Networks, Inc. Zero configuration networking on a subnetted network
US9107193B2 (en) 2012-01-13 2015-08-11 Siemens Aktiengesellschaft Association update message and method for updating associations in a mesh network
US8787375B2 (en) 2012-06-14 2014-07-22 Aerohive Networks, Inc. Multicast to unicast conversion technique
US9992021B1 (en) 2013-03-14 2018-06-05 GoTenna, Inc. System and method for private and point-to-point communication between computing devices
US9413772B2 (en) 2013-03-15 2016-08-09 Aerohive Networks, Inc. Managing rogue devices through a network backhaul
US9690676B2 (en) 2013-03-15 2017-06-27 Aerohive Networks, Inc. Assigning network device subnets to perform network activities using network device information
US10389650B2 (en) 2013-03-15 2019-08-20 Aerohive Networks, Inc. Building and maintaining a network
US9948626B2 (en) 2013-03-15 2018-04-17 Aerohive Networks, Inc. Split authentication network systems and methods
US9832728B2 (en) 2013-05-10 2017-11-28 Elwha Llc Dynamic point to point mobile network including origination user interface aspects system and method
US9763166B2 (en) 2013-05-10 2017-09-12 Elwha Llc Dynamic point to point mobile network including communication path monitoring and analysis aspects system and method
US20140337840A1 (en) * 2013-05-10 2014-11-13 Elwha Llc Dynamic Point to Point Mobile Network Including Intermediate User Interface Aspects System and Method
US9152782B2 (en) 2013-12-13 2015-10-06 Aerohive Networks, Inc. Systems and methods for user-based network onboarding
US9756549B2 (en) 2014-03-14 2017-09-05 goTenna Inc. System and method for digital communication between computing devices
US10944669B1 (en) 2018-02-09 2021-03-09 GoTenna, Inc. System and method for efficient network-wide broadcast in a multi-hop wireless network using packet echos
EP3831021A1 (fr) 2018-07-27 2021-06-09 Gotenna Inc. ROUTAGE DE PAQUETS À COMMANDE NULLE VINEtm À L'AIDE D'UNE INSPECTION DE PAQUETS DE DONNÉES POUR DES RÉSEAUX MAILLÉS SANS FIL
US11082344B2 (en) 2019-03-08 2021-08-03 GoTenna, Inc. Method for utilization-based traffic throttling in a wireless mesh network
CN116419368A (zh) * 2021-12-30 2023-07-11 中兴通讯股份有限公司 WiFi mesh中路由设备上网方法、路由设备、管理系统和介质

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020013856A1 (en) * 1998-12-23 2002-01-31 Garcia-Luna-Aceves J. Joaquin Unified routing scheme for ad-hoc Internetworking
WO2003003633A1 (fr) * 2001-06-27 2003-01-09 Ricochet Networks, Inc. Procede et appareil de gestion de l'encombrement dans un reseau radio a commutation par paquets
US20030012168A1 (en) * 2001-07-03 2003-01-16 Jeremy Elson Low-latency multi-hop ad hoc wireless network
US20030076837A1 (en) * 2001-10-23 2003-04-24 Whitehill Eric A. System and method for providing a congestion optimized address resolution protocol for wireless Ad-Hoc Networks
EP1307058A1 (fr) * 2001-10-24 2003-05-02 Telefonaktiebolaget L M Ericsson (Publ) Système et méthodes pour télécommunications
US20030091011A1 (en) * 2001-08-15 2003-05-15 Roberts Robin U. System and method for performing soft handoff in a wireless data network
US20030091012A1 (en) * 2001-08-15 2003-05-15 Barker Charles R. System and method for providing an addressing and proxy scheme for facilitating mobility of wireless nodes between wired access points on a core network of a communications network
US6631128B1 (en) * 1999-05-27 2003-10-07 Telefonaktiebolaget L M Ericcson (Publ) Core network optimization of topology and technology for traffic handling
US20040141502A1 (en) * 2002-05-06 2004-07-22 M. Scott Corson Methods and apparatus for downlink macro-diversity in cellular networks
US20040160943A1 (en) * 2003-02-19 2004-08-19 Harris Corporation, Corporation Of The State Of Delaware Mobile ad-hoc network (MANET) including forward error correction (FEC), interleaving, and multi-route communication features and related methods

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5485455A (en) * 1994-01-28 1996-01-16 Cabletron Systems, Inc. Network having secure fast packet switching and guaranteed quality of service
US5943322A (en) * 1996-04-24 1999-08-24 Itt Defense, Inc. Communications method for a code division multiple access system without a base station
US6807165B2 (en) 2000-11-08 2004-10-19 Meshnetworks, Inc. Time division protocol for an ad-hoc, peer-to-peer radio network having coordinating channel access to shared parallel data channels with separate reservation channel
US7072650B2 (en) * 2000-11-13 2006-07-04 Meshnetworks, Inc. Ad hoc peer-to-peer mobile radio access system interfaced to the PSTN and cellular networks
US6873839B2 (en) * 2000-11-13 2005-03-29 Meshnetworks, Inc. Prioritized-routing for an ad-hoc, peer-to-peer, mobile radio access system
US20040018839A1 (en) 2002-06-06 2004-01-29 Oleg Andric Protocol and structure for mobile nodes in a self-organizing communication network
JP2004104322A (ja) * 2002-09-06 2004-04-02 Nippon Telegr & Teleph Corp <Ntt> アドホックネットワークの接続方法及び接続装置、接続プログラム並びにそのプログラムを記録した記録媒体
US7420952B2 (en) * 2002-10-28 2008-09-02 Mesh Dynamics, Inc. High performance wireless networks using distributed control
KR20030022123A (ko) * 2002-11-14 2003-03-15 테르싱크 유한회사 데이터 및 음성 서비스가 통합된 무선 단말 통신 세션을제공하는 방법 및 시스템
US7634230B2 (en) * 2002-11-25 2009-12-15 Fujitsu Limited Methods and apparatus for secure, portable, wireless and multi-hop data networking
ATE515856T1 (de) * 2003-01-13 2011-07-15 Meshnetworks Inc System und verfahren zur erzielung kontinuierlicherkonnektivität mit einem zugangspunkt oder gateway in einem drahtlosennetzwerk
US8248968B2 (en) * 2003-10-03 2012-08-21 Apple Inc. Method and apparatus for providing mobile inter-mesh communication points in a multi-level wireless mesh network
JP4505454B2 (ja) 2003-06-06 2010-07-21 メッシュネットワークス インコーポレイテッド 無線通信ネットワークの性能全体を改良するためのシステム及び方法
DE112005002142B8 (de) * 2004-09-07 2018-03-01 ARRIS Enterprises LLC (n. d. Ges. d. Staates Delaware) System und Verfahren zum Assoziieren verschiedener Arten von Knoten mit Zugangspunktknoten in einem drahtlosen Netzwerk zum Routen von Daten in dem drahtlosen Netzwerk

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020013856A1 (en) * 1998-12-23 2002-01-31 Garcia-Luna-Aceves J. Joaquin Unified routing scheme for ad-hoc Internetworking
US6631128B1 (en) * 1999-05-27 2003-10-07 Telefonaktiebolaget L M Ericcson (Publ) Core network optimization of topology and technology for traffic handling
WO2003003633A1 (fr) * 2001-06-27 2003-01-09 Ricochet Networks, Inc. Procede et appareil de gestion de l'encombrement dans un reseau radio a commutation par paquets
US20030012168A1 (en) * 2001-07-03 2003-01-16 Jeremy Elson Low-latency multi-hop ad hoc wireless network
US20030091011A1 (en) * 2001-08-15 2003-05-15 Roberts Robin U. System and method for performing soft handoff in a wireless data network
US20030091012A1 (en) * 2001-08-15 2003-05-15 Barker Charles R. System and method for providing an addressing and proxy scheme for facilitating mobility of wireless nodes between wired access points on a core network of a communications network
US20030076837A1 (en) * 2001-10-23 2003-04-24 Whitehill Eric A. System and method for providing a congestion optimized address resolution protocol for wireless Ad-Hoc Networks
EP1307058A1 (fr) * 2001-10-24 2003-05-02 Telefonaktiebolaget L M Ericsson (Publ) Système et méthodes pour télécommunications
US20040141502A1 (en) * 2002-05-06 2004-07-22 M. Scott Corson Methods and apparatus for downlink macro-diversity in cellular networks
US20040160943A1 (en) * 2003-02-19 2004-08-19 Harris Corporation, Corporation Of The State Of Delaware Mobile ad-hoc network (MANET) including forward error correction (FEC), interleaving, and multi-route communication features and related methods

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2022280A2 (fr) * 2006-05-12 2009-02-11 Motorola, Inc. Système et procédé pour distribuer des informations d'erreur de mandat dans des réseaux sans fil
EP2022280A4 (fr) * 2006-05-12 2012-01-18 Motorola Solutions Inc Système et procédé pour distribuer des informations d'erreur de mandat dans des réseaux sans fil
WO2008064419A1 (fr) * 2006-11-28 2008-06-05 National Ict Australia Limited Découverte de liaisons internodales multiples dans des réseaux radio à plusieurs bonds
US8315231B2 (en) 2006-11-28 2012-11-20 National Ict Australia Limited Discovery of multiple inter-node links in wireless multi-hop networks
GB2459450A (en) * 2008-04-21 2009-10-28 Bubblenets Ltd Automatic interconnection of Intelligent Wireless Nodes to provide connection to external networks
CN113347651A (zh) * 2017-01-20 2021-09-03 无线通信与技术公司 利用通用网关节点设置网状网络的系统和方法

Also Published As

Publication number Publication date
DE112005002142T5 (de) 2007-08-16
US7251238B2 (en) 2007-07-31
US20060098612A1 (en) 2006-05-11
US20060098611A1 (en) 2006-05-11
WO2006029126A3 (fr) 2006-08-03
KR20070088616A (ko) 2007-08-29
US7382759B2 (en) 2008-06-03
EP1790184B1 (fr) 2014-11-19
DE112005002142B4 (de) 2017-12-14
EP1790184A2 (fr) 2007-05-30
WO2006029131A3 (fr) 2007-02-22
EP1790184A4 (fr) 2012-01-18
JP4532554B2 (ja) 2010-08-25
KR100898680B1 (ko) 2009-05-22
JP2008512901A (ja) 2008-04-24
WO2006029131A2 (fr) 2006-03-16
KR100898681B1 (ko) 2009-05-22
KR20070088617A (ko) 2007-08-29
DE112005002142B8 (de) 2018-03-01

Similar Documents

Publication Publication Date Title
US7382759B2 (en) System and method for associating different types of nodes with access point nodes in a wireless network to route data in the wireless network
EP1982201B1 (fr) Système et procédé d&#39;acheminement de paquets à plusieurs bonds
EP1632044B1 (fr) Procede permettant d&#39;ameliorer la performance globale d&#39;un reseau de communication sans fil
US7894408B2 (en) System and method for distributing proxying error information in wireless networks
EP1751934B1 (fr) Routage adaptatif
KR100789773B1 (ko) 다중 홉 무선 근거리통신망에서 메쉬 네트워킹 자동 설정방법과, 가상 링크 설정 방법과, 패킷 전송 방법 및 이를위한 무선 단말기
Yuan et al. An optimized ad-hoc on-demand multipath distance vector (AOMDV) routing protocol
US7801143B2 (en) System and method for groupcast packet forwarding in a wireless network
WO2008157662A1 (fr) Procédé permettant de trouver un chemin vers un noeud homologue dans un réseau maillé sans fil à sauts multiples
US20070076673A1 (en) System and method to discover and maintain multiple routes in a wireless communication network
Yi et al. Smart route request for on-demand route discovery in constrained environments
KR101029497B1 (ko) 리엑티브 방식의 라우팅 프로토콜을 사용하는 이동 애드혹 네트워크 상에서 경로탐색 과정을 통한 에이알피 프로토콜 대체 방법

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 KM KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NG NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SM 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 IS IT LT LU LV 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: 1120050021424

Country of ref document: DE

WWE Wipo information: entry into national phase

Ref document number: 1020077008092

Country of ref document: KR

RET De translation (de og part 6b)

Ref document number: 112005002142

Country of ref document: DE

Date of ref document: 20070816

Kind code of ref document: P

122 Ep: pct application non-entry in european phase