US20150078198A1 - Simple mesh network for wireless transceivers - Google Patents
Simple mesh network for wireless transceivers Download PDFInfo
- Publication number
- US20150078198A1 US20150078198A1 US14/031,918 US201314031918A US2015078198A1 US 20150078198 A1 US20150078198 A1 US 20150078198A1 US 201314031918 A US201314031918 A US 201314031918A US 2015078198 A1 US2015078198 A1 US 2015078198A1
- Authority
- US
- United States
- Prior art keywords
- data frame
- determining
- mesh network
- address
- wireless node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
-
- 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
- H04W84/12—WLAN [Wireless Local Area 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
Definitions
- the present embodiments relate to wireless mesh communication systems and, more particularly, to a communication protocol that is backwards compatible with existing IEEE 802.11 standards.
- a wireless mesh network is a type of wireless communication where at least one wireless transceiver must not only receive and process its own data, but it must also serve as a relay for other wireless transceivers in the network. This may be accomplished by a wireless routing protocol where a data frame is propagated within the network by hopping from transceiver to transceiver to transmit the data frame from a source node to a destination node.
- a wireless node may be a wireless access point such as a wireless router, a mobile phone, or a computer capable of accessing the wireless local area network (WLAN). In other applications, the wireless node may be an external security monitor, a room monitor, a fire or smoke detector, a weather station, or any number of other WLAN applications for home or business environments.
- a practical mesh network must maintain continuous network paths for all wireless nodes. This requires reliable network formation, reconfiguration around broken or interrupted network paths, and prioritized routing to ensure that data frames travel from source to destination along short yet reliable network paths.
- FIG. 1 shows an exemplary medium access control (MAC) header of the prior art that may be appended to IEEE 802.11 data frames for wireless network communication.
- the first three fields (Frame Control, Duration/ID, and Address 1 ) and the last field (FCS) are present in all frames. The remaining fields are present only in certain frame types and subtypes of frames.
- the four address fields are used to indicate a basic service set identifier (BSSID), source address (SA), destination address (DA), transmitting station (STA) address (TA), and receiving STA address (RA).
- BSSID basic service set identifier
- SA source address
- DA destination address
- STA transmitting station address
- RA receiving STA address
- FIG. 2 is a diagram showing a problem of limited range within an exemplary wireless mesh network.
- Access point (AP) 200 is directly connected to the internet and serves network nodes within area 202 . These network nodes include non-legacy leaf node (NLN) 206 , legacy leaf node (LLN) 208 , and relay node (RN) 210 .
- RN 210 has a range 204 that is smaller than area 202 . However, area 204 extends beyond the coverage of area 202 of AP 200 . Thus, RN 210 may relay data packets between LLN 212 and AP 200 .
- Present proposals for IEEE 802.11-2012 provide for such a RN. Implementation, however, is difficult and is not compatible with legacy network nodes.
- a method of operating a mesh network in a wireless communication system includes receiving a data frame having a header with plural addresses and determining that the data frame source is not an access point or a leaf node of the mesh network. A next address of the plural addresses is removed when a next recipient of the data frame is a final destination. The next address of the next recipient is set when the next recipient of the data frame is a final destination. The data frame is then transmitted to the next recipient.
- FIG. 1 is a diagram of an IEEE 802.11 medium access control (MAC) header of the prior art
- FIG. 2 is a diagram showing a problem of limited range within an exemplary wireless mesh network
- FIG. 3 is a diagram of a simple mesh wireless network of the present invention.
- FIG. 4 is a flow diagram showing formation of the simple mesh network of FIG. 3 ;
- FIG. 5 is a flow diagram showing mesh discovery when a new wireless node enters the wireless network of FIG. 3 ;
- FIG. 6 is a flow diagram showing data frame distribution through a relay node (RN) within the wireless network of FIG. 3 ;
- FIG. 7 is a flow diagram showing circular routing detection within a wireless mesh network.
- the mesh network includes access point (AP) 300 which may be a wireless router having access to the internet by digital subscriber line (DSL), satellite, or other data source.
- AP 300 communicates directly with legacy leaf node (LLN) 302 .
- LN legacy leaf node
- arrows are used to indicate wireless connection.
- AP 300 also communicates directly with non-legacy leaf node (NLN) 304 .
- RN relay nodes
- Relay nodes such as 308 , 312 , 318 , and 320 may be mobile devices such as cell phones, tablets, laptop or desktop computers, other wireless routers, or other suitable wireless devices according to the present invention.
- Leaf nodes 306 , 310 , 314 , and 322 either do not have sufficient signal strength to communicate directly with AP 300 or receive a substantially better signal from a corresponding RN as indicated by a received signal strength indicator (RSSI).
- RSSI received signal strength indicator
- LLN 306 and NLN 310 communicate directly with RN 308 .
- RN 308 relays data frames between AP 300 and leaf nodes 306 and 310 Likewise, LLN 314 communicates directly 322 with RN 312 , and RN 312 relays data frames between AP 300 and LLN 314 .
- RN 318 communicates directly with AP 300 . However, RN 318 does not communicate directly with NLN 322 . Rather, RN 318 directly communicates 316 with RN 320 . RN 320 directly communicates with NLN 322 . Thus, RN 318 relays data frames between RN 320 and AP 300 whether the data frames originate with RN 320 or NLN 322 .
- RN 320 relays data frames between RN 318 and NLN 322 .
- the mesh network further includes redundant data paths such as data path 330 between RN 312 and RN 320 . Therefore, if RN 318 drops out of the mesh network or signal quality is sufficiently degraded, data frames are relayed between RN 320 and AP 300 by RN 312 .
- the simple mesh network is preferably formed from the AP down to each leaf node (LN).
- the process begins when a wireless node wishing to join the mesh initiates a station scan 400 .
- the wireless node receives a basic service set (BSS) list 402 indicating all wireless nodes that are currently in the mesh network. If an AP is detected 404 , the wireless node connects to the AP 406 and the process ends 410 . This is the case when leaf nodes such as LLN 302 and NLN 304 join the mesh.
- BSS basic service set
- AP 300 is also detected at decision block 404 .
- AP 300 has an implied hop number (HN) of 0.
- HN hop number
- the HN therefore, indicates a logical distance from the AP.
- RN 308 is the first RN to join the mesh and adopts a sibling number (SN) of 1.
- SN sibling number
- RN 312 is the second RN to join the mesh and adopts a SN of 2.
- RN 318 is the third RN to join the mesh and adopts a SN of 3.
- RSSI received signal strength indicator
- each RN of the mesh may adopt several subordinate wireless nodes having a lower HN.
- Legacy leaf nodes such as LLN 314 and 306 may simply connect to their respective RNs 312 and 308 as though they were directly connected to the AP. In this case, the respective RN simply relays upstream and downstream data frames between the LLN and the AP as will be explained in detail. In effect, the LLN thinks it is directly connected to the AP.
- Non-legacy leaf nodes (NLN) such as 310 and 322 connect to respective RNs 308 and 320 in a similar manner.
- FIG. 5 there is a flow diagram showing mesh discovery when a new wireless node enters the wireless network of FIG. 3 .
- a wireless node wishing to enter an existing mesh will initiate a station scan 500 .
- the wireless node if an AP is detected 404 the wireless node will simply connect to the AP 406 and the process ends 410 .
- the wireless node sends an AP probe request 502 .
- Each RN in the mesh that receives the probe request will measure the RSSI of the probe.
- the random delay assures that the subsequent RN probe response 508 will not collide with a delayed AP response. If the wireless node is a NLN, it may select the RN with the lowest HN. Alternatively, if the wireless node is a LLN, it sends back an information element. The best RN then registers the NLN or LLN and announces the registration throughout the mesh to avoid multiple registration.
- FIG. 6 there is a flow diagram showing data frame distribution through a relay node (RN) within the wireless network of FIG. 3 .
- RN relay node
- data frame distribution proceeds according to IEEE 802.11.
- An RN first determines from the MAC header ( FIG. 1 ) whether the data frame is directly from the AP or a LN 602 . If decision block 602 is true, the RN then determines if this relay will be the final hop 604 . For example, if RN 308 receives a data frame from AP 300 the relay to NLN 310 will be the final hop.
- RN 308 receives a data frame from NLN 310 the relay to AP 300 will also be the final hop. If the relay transmission is the final hop, RN 308 transmits the data frame to the destination address (DA) with no change to the MAC header. If decision block 604 determines that the relay transmission is not the final hop, the RN sets next address 4 of the MAC header to point to the next RN 608 . For example, if RN 318 receives a data frame from AP 300 the relay to RN 320 will not be the final hop. RN 318 , therefore, sets address 4 of the MAC header to point to RN 320 and transmits the data frame 614 .
- RN 320 receives a data frame from NLN 322 the relay to RN 318 will not be the final hop. Thus, RN 320 sets address 4 of the MAC header to point to RN 318 and transmits the data frame 614 . In either case, only the RN specified by address 4 of the MAC header will service the received data frame.
- decision block 602 determines that a received data frame is not from an AP or LN, then it must be from another RN.
- Decision block 606 determines if the relay transmission will be the final hop. For example, if RN 318 receives a data frame from RN 320 , the relay transmission from RN 318 to AP 300 will be the final hop. In this case, address 4 of the MAC header is removed 610 and the data frame is relayed to AP 300 in a standard three address format according to IEEE 802.11 Likewise, if RN 320 receives a data frame from RN 318 , the relay transmission from RN 320 to NLN 322 will be the final hop. In this case, address 4 of the MAC header is also removed 610 and the data frame is relayed to NLN 322 in the standard three address format according to IEEE 802.11.
- decision block 606 determines that the relay transmission is not the final hop it means there is at least another RN in the mesh between the current RN and the destination wireless node at address DA of the MAC header.
- the RN sets next address 4 of the MAC header to point to the next RN 612 and transmits the data frame 614 . This process is repeated as necessary until a final hop to address DA is detected. After the final transmission to address DA of the MAC header, the process ends 616 .
- the simple mesh data frame distribution method of the present invention offers several advantages over methods of the prior art.
- a RN of the present invention will appear as a LN to the AP and will appear as an AP to each LLN or NLN it serves.
- the RN may be any IEEE 802.11 wireless device capable of adding a next address to address field 4 of the MAC header for transmission to a next RN and removing the next address from address field 4 of the MAC header for a final hop transmission to an AP or LN.
- each RN comprehends redundant data paths which may be used when a wireless node drops out of the data path, thereby making the mesh network less likely to drop data frames.
- the mesh network of the present invention requires no additional components and adds no additional cost to the mesh network.
- the mesh network of the present invention extends the coverage area of a single AP over complex structures such as office buildings, apartment complexes, hotels and motels, and other multi-story structures without the need for additional APs.
- FIG. 7 there a flow diagram showing circular routing detection within a wireless mesh network.
- Formation of a simple mesh network of the present invention preferably precludes circular data frame transmission. This is because RNs in the data path from the AP to any LN preferably have increasing HNs. Thus, downstream transmissions proceed from lower to higher HNs, and upstream transmissions proceed from higher to lower HNs.
- redundant data paths such as 330 ( FIG. 3 ), the condition that each RN may serve multiple RNs and LNs, and the dynamic nature of the mesh network may produce a circular routing path. If undetected, a circular routing path may result in repeated data frame transmission between two or more RNs so that the data frame never reaches the intended destination.
- FIG. 3 The method of FIG.
- a data frame first received 700 , and the receiving RN determines if address 4 of the MAC header is present 702 . If address 4 is not present, the source is either the AP or one of the LNs. At decision block 704 the receiving RN determines whether the source address (SA) LN is served by this RN. If not, the process ends 740 , and the RN effectively decides the data frame is intended for another RN. If the data frame is from an LN served by the receiving RN, data frame transmission continues 706 as previously described with regard to FIG. 6 .
- SA source address
- decision block 708 determines if the source of the data frame is upstream. If the source is downstream, decision block 710 determines whether the HN of the transmitting RN is greater than the HN of the receiving RN. If so, the process ends 740 . If not, a circular routing path is detected since a downstream RN should have a greater HN than an upstream RN. The receiving RN then gets the next downstream HN 714 , which is preferably one greater than its own HN and updates the transmitting RN's HN field 718 . Data frame transmission then continues 706 as previously described with regard to FIG. 6 .
- decision block 712 determines whether the HN of the transmitting RN is less than the HN of the receiving RN. If so, the process ends 740 . If not, a circular routing path is detected since an upstream RN should have a smaller HN than a downstream RN. The receiving RN then gets the next upstream HN 716 , which is preferably one less than its own HN and updates the transmitting RN's HN field 718 . Data frame transmission then continues 706 as previously described with regard to FIG. 6 .
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
- The present embodiments relate to wireless mesh communication systems and, more particularly, to a communication protocol that is backwards compatible with existing IEEE 802.11 standards.
- A wireless mesh network is a type of wireless communication where at least one wireless transceiver must not only receive and process its own data, but it must also serve as a relay for other wireless transceivers in the network. This may be accomplished by a wireless routing protocol where a data frame is propagated within the network by hopping from transceiver to transceiver to transmit the data frame from a source node to a destination node. A wireless node may be a wireless access point such as a wireless router, a mobile phone, or a computer capable of accessing the wireless local area network (WLAN). In other applications, the wireless node may be an external security monitor, a room monitor, a fire or smoke detector, a weather station, or any number of other WLAN applications for home or business environments.
- A practical mesh network must maintain continuous network paths for all wireless nodes. This requires reliable network formation, reconfiguration around broken or interrupted network paths, and prioritized routing to ensure that data frames travel from source to destination along short yet reliable network paths.
-
FIG. 1 shows an exemplary medium access control (MAC) header of the prior art that may be appended to IEEE 802.11 data frames for wireless network communication. The first three fields (Frame Control, Duration/ID, and Address 1) and the last field (FCS) are present in all frames. The remaining fields are present only in certain frame types and subtypes of frames. The four address fields are used to indicate a basic service set identifier (BSSID), source address (SA), destination address (DA), transmitting station (STA) address (TA), and receiving STA address (RA). -
FIG. 2 is a diagram showing a problem of limited range within an exemplary wireless mesh network. Access point (AP) 200 is directly connected to the internet and serves network nodes withinarea 202. These network nodes include non-legacy leaf node (NLN) 206, legacy leaf node (LLN) 208, and relay node (RN) 210. RN 210 has arange 204 that is smaller thanarea 202. However,area 204 extends beyond the coverage ofarea 202 of AP 200. Thus, RN 210 may relay data packets between LLN 212 and AP 200. Present proposals for IEEE 802.11-2012 provide for such a RN. Implementation, however, is difficult and is not compatible with legacy network nodes. - Although network proposals of the prior art provide steady improvements in wireless network communications, the present inventors recognize that still further improvements in mesh network protocol are possible. Accordingly, preferred embodiments described below are directed toward this and other improvements over the prior art.
- In a preferred embodiment of the present invention, there is disclosed a method of operating a mesh network in a wireless communication system. The method includes receiving a data frame having a header with plural addresses and determining that the data frame source is not an access point or a leaf node of the mesh network. A next address of the plural addresses is removed when a next recipient of the data frame is a final destination. The next address of the next recipient is set when the next recipient of the data frame is a final destination. The data frame is then transmitted to the next recipient.
-
FIG. 1 is a diagram of an IEEE 802.11 medium access control (MAC) header of the prior art; -
FIG. 2 is a diagram showing a problem of limited range within an exemplary wireless mesh network; -
FIG. 3 is a diagram of a simple mesh wireless network of the present invention; -
FIG. 4 is a flow diagram showing formation of the simple mesh network ofFIG. 3 ; -
FIG. 5 is a flow diagram showing mesh discovery when a new wireless node enters the wireless network ofFIG. 3 ; -
FIG. 6 is a flow diagram showing data frame distribution through a relay node (RN) within the wireless network ofFIG. 3 ; and -
FIG. 7 is a flow diagram showing circular routing detection within a wireless mesh network. - Referring now to
FIG. 3 , there is a diagram of a simple mesh wireless network of the present invention. The mesh network includes access point (AP) 300 which may be a wireless router having access to the internet by digital subscriber line (DSL), satellite, or other data source. AP 300 communicates directly with legacy leaf node (LLN) 302. Here, arrows are used to indicate wireless connection. AP 300 also communicates directly with non-legacy leaf node (NLN) 304. Finally, AP 300 directly communicates with relay nodes (RN) 308, 312, and 318. Relay nodes such as 308, 312, 318, and 320 may be mobile devices such as cell phones, tablets, laptop or desktop computers, other wireless routers, or other suitable wireless devices according to the present invention.Leaf nodes AP 300 or receive a substantially better signal from a corresponding RN as indicated by a received signal strength indicator (RSSI). For example, LLN 306 and NLN 310 communicate directly withRN 308.RN 308 relays data frames betweenAP 300 andleaf nodes RN 312, andRN 312 relays data frames between AP 300 and LLN 314. As previously mentioned,RN 318 communicates directly with AP 300. However,RN 318 does not communicate directly with NLN 322. Rather,RN 318 directly communicates 316 withRN 320.RN 320 directly communicates with NLN 322. Thus,RN 318 relays data frames betweenRN 320 and AP 300 whether the data frames originate withRN 320 or NLN 322. Correspondingly,RN 320 relays data frames betweenRN 318 and NLN 322. The mesh network further includes redundant data paths such asdata path 330 betweenRN 312 andRN 320. Therefore, ifRN 318 drops out of the mesh network or signal quality is sufficiently degraded, data frames are relayed betweenRN 320 and AP 300 byRN 312. - Turning now to
FIG. 4 , there is a flow diagram showing formation of the simple mesh network ofFIG. 3 . The simple mesh network is preferably formed from the AP down to each leaf node (LN). The process begins when a wireless node wishing to join the mesh initiates astation scan 400. The wireless node then receives a basic service set (BSS)list 402 indicating all wireless nodes that are currently in the mesh network. If an AP is detected 404, the wireless node connects to theAP 406 and the process ends 410. This is the case when leaf nodes such as LLN 302 and NLN 304 join the mesh. - The process is slightly different when relay nodes such as
RN decision block 404. AP 300 has an implied hop number (HN) of 0. Each RN that directly connects to AP 300 adopts a HN of 1. The HN, therefore, indicates a logical distance from the AP. Moreover,RN 308 is the first RN to join the mesh and adopts a sibling number (SN) of 1.RN 312 is the second RN to join the mesh and adopts a SN of 2.RN 318 is the third RN to join the mesh and adopts a SN of 3. - At
decision block 408, a wireless node wishing to join the mesh network determines if a RN is detected when no AP is detected. If no RN is detected, the wireless node is unable to join the mesh network and the process ends 410. Alternatively, if one or more RNs is detected, the wireless node sorts the RN list by HN and received signal strength indicator (RSSI) 412. For example,RN 320 detectsRN 312 andRN 318. BothRN 312 andRN 318 have HN=1, butRN 318 has a greater RSSI.RN 320, therefore, selects 414 aprimary connection 316 toRN 318 and a secondary orredundant connection 330 toRN 312. Moreover, according to the present invention each RN of the mesh may adopt several subordinate wireless nodes having a lower HN.RN 320 also sets 416 a HN=2, indicating it is one step further removed fromAP 300 than eitherRN 312 orRN 318. - Legacy leaf nodes such as
LLN respective RNs respective RNs NLN 310 also adopts HN=2 and SN=2 and may serve as a RN if another downstream LN should join the mesh Likewise,NLN 322 adopts HN=3 and SN=1 and may serve as a RN if another downstream LN should join the mesh. - Referring next to
FIG. 5 , there is a flow diagram showing mesh discovery when a new wireless node enters the wireless network ofFIG. 3 . A wireless node wishing to enter an existing mesh will initiate astation scan 500. As previously discussed with regard toFIG. 4 , if an AP is detected 404 the wireless node will simply connect to theAP 406 and the process ends 410. Alternatively, the wireless node sends anAP probe request 502. Each RN in the mesh that receives the probe request will measure the RSSI of the probe. An RN that measures an RSSI above an acceptable threshold and has a HN=1 will wait a respectiverandom delay period 506 and send aprobe response 508 that is identical to an AP probe response. The random delay assures that the subsequentRN probe response 508 will not collide with a delayed AP response. If the wireless node is a NLN, it may select the RN with the lowest HN. Alternatively, if the wireless node is a LLN, it sends back an information element. The best RN then registers the NLN or LLN and announces the registration throughout the mesh to avoid multiple registration. - Referring now to
FIG. 6 , there is a flow diagram showing data frame distribution through a relay node (RN) within the wireless network ofFIG. 3 . For the simple case where aLLN 302 orNLN 304 is directly connected toAP 300, data frame distribution proceeds according to IEEE 802.11. An RN, however, first determines from the MAC header (FIG. 1 ) whether the data frame is directly from the AP or aLN 602. Ifdecision block 602 is true, the RN then determines if this relay will be thefinal hop 604. For example, ifRN 308 receives a data frame fromAP 300 the relay toNLN 310 will be the final hop. Correspondingly, ifRN 308 receives a data frame fromNLN 310 the relay toAP 300 will also be the final hop. If the relay transmission is the final hop,RN 308 transmits the data frame to the destination address (DA) with no change to the MAC header. Ifdecision block 604 determines that the relay transmission is not the final hop, the RN setsnext address 4 of the MAC header to point to thenext RN 608. For example, ifRN 318 receives a data frame fromAP 300 the relay toRN 320 will not be the final hop.RN 318, therefore, setsaddress 4 of the MAC header to point toRN 320 and transmits thedata frame 614. Correspondingly, ifRN 320 receives a data frame fromNLN 322 the relay toRN 318 will not be the final hop. Thus,RN 320 setsaddress 4 of the MAC header to point toRN 318 and transmits thedata frame 614. In either case, only the RN specified byaddress 4 of the MAC header will service the received data frame. - If
decision block 602 determines that a received data frame is not from an AP or LN, then it must be from another RN.Decision block 606 then determines if the relay transmission will be the final hop. For example, ifRN 318 receives a data frame fromRN 320, the relay transmission fromRN 318 toAP 300 will be the final hop. In this case,address 4 of the MAC header is removed 610 and the data frame is relayed toAP 300 in a standard three address format according to IEEE 802.11 Likewise, ifRN 320 receives a data frame fromRN 318, the relay transmission fromRN 320 toNLN 322 will be the final hop. In this case,address 4 of the MAC header is also removed 610 and the data frame is relayed toNLN 322 in the standard three address format according to IEEE 802.11. - However, when
decision block 606 determines that the relay transmission is not the final hop it means there is at least another RN in the mesh between the current RN and the destination wireless node at address DA of the MAC header. In this case, the RN setsnext address 4 of the MAC header to point to thenext RN 612 and transmits thedata frame 614. This process is repeated as necessary until a final hop to address DA is detected. After the final transmission to address DA of the MAC header, the process ends 616. - The simple mesh data frame distribution method of the present invention offers several advantages over methods of the prior art. First, it is compatible with existing IEEE 802.11 networks. A RN of the present invention will appear as a LN to the AP and will appear as an AP to each LLN or NLN it serves. Second, the RN may be any IEEE 802.11 wireless device capable of adding a next address to address
field 4 of the MAC header for transmission to a next RN and removing the next address fromaddress field 4 of the MAC header for a final hop transmission to an AP or LN. Third, each RN comprehends redundant data paths which may be used when a wireless node drops out of the data path, thereby making the mesh network less likely to drop data frames. Fourth, the mesh network of the present invention requires no additional components and adds no additional cost to the mesh network. Finally, the mesh network of the present invention extends the coverage area of a single AP over complex structures such as office buildings, apartment complexes, hotels and motels, and other multi-story structures without the need for additional APs. - Turning now to
FIG. 7 , there a flow diagram showing circular routing detection within a wireless mesh network. Formation of a simple mesh network of the present invention preferably precludes circular data frame transmission. This is because RNs in the data path from the AP to any LN preferably have increasing HNs. Thus, downstream transmissions proceed from lower to higher HNs, and upstream transmissions proceed from higher to lower HNs. However, redundant data paths such as 330 (FIG. 3 ), the condition that each RN may serve multiple RNs and LNs, and the dynamic nature of the mesh network may produce a circular routing path. If undetected, a circular routing path may result in repeated data frame transmission between two or more RNs so that the data frame never reaches the intended destination. The method ofFIG. 7 detects and corrects undesirable circular routing paths. A data frame first received 700, and the receiving RN determines ifaddress 4 of the MAC header is present 702. Ifaddress 4 is not present, the source is either the AP or one of the LNs. Atdecision block 704 the receiving RN determines whether the source address (SA) LN is served by this RN. If not, the process ends 740, and the RN effectively decides the data frame is intended for another RN. If the data frame is from an LN served by the receiving RN, data frame transmission continues 706 as previously described with regard toFIG. 6 . - If
decision block 702 determines thataddress 4 of the MAC header is present,decision block 708 then determines if the source of the data frame is upstream. If the source is downstream,decision block 710 determines whether the HN of the transmitting RN is greater than the HN of the receiving RN. If so, the process ends 740. If not, a circular routing path is detected since a downstream RN should have a greater HN than an upstream RN. The receiving RN then gets the nextdownstream HN 714, which is preferably one greater than its own HN and updates the transmitting RN'sHN field 718. Data frame transmission then continues 706 as previously described with regard toFIG. 6 . - If
decision block 708 determines the source is upstream,decision block 712 determines whether the HN of the transmitting RN is less than the HN of the receiving RN. If so, the process ends 740. If not, a circular routing path is detected since an upstream RN should have a smaller HN than a downstream RN. The receiving RN then gets the nextupstream HN 716, which is preferably one less than its own HN and updates the transmitting RN'sHN field 718. Data frame transmission then continues 706 as previously described with regard toFIG. 6 . - Still further, while numerous examples have thus been provided, one skilled in the art should recognize that various modifications, substitutions, or alterations may be made to the described embodiments while still falling with the inventive scope as defined by the following claims. Other combinations will be readily apparent to one of ordinary skill in the art having access to the instant specification.
Claims (17)
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/031,918 US11218942B2 (en) | 2013-09-19 | 2013-09-19 | Simple mesh network for wireless transceivers |
US17/568,430 US20220132389A1 (en) | 2013-09-19 | 2022-01-04 | Simple mesh network for wireless transceivers |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/031,918 US11218942B2 (en) | 2013-09-19 | 2013-09-19 | Simple mesh network for wireless transceivers |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/568,430 Continuation US20220132389A1 (en) | 2013-09-19 | 2022-01-04 | Simple mesh network for wireless transceivers |
Publications (2)
Publication Number | Publication Date |
---|---|
US20150078198A1 true US20150078198A1 (en) | 2015-03-19 |
US11218942B2 US11218942B2 (en) | 2022-01-04 |
Family
ID=52667907
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/031,918 Active 2035-09-05 US11218942B2 (en) | 2013-09-19 | 2013-09-19 | Simple mesh network for wireless transceivers |
US17/568,430 Pending US20220132389A1 (en) | 2013-09-19 | 2022-01-04 | Simple mesh network for wireless transceivers |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/568,430 Pending US20220132389A1 (en) | 2013-09-19 | 2022-01-04 | Simple mesh network for wireless transceivers |
Country Status (1)
Country | Link |
---|---|
US (2) | US11218942B2 (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9713180B1 (en) | 2016-03-15 | 2017-07-18 | Qualcomm Incorporated | Relay centric mobility management in a mesh network |
US9717110B1 (en) | 2016-03-15 | 2017-07-25 | Qualcomm Incorporated | User equipment centric mobility management in a mesh network |
US9730091B2 (en) * | 2015-10-29 | 2017-08-08 | Honeywell International Inc. | Method and system improving the reliability of wireless fire detection systems |
US10123347B2 (en) | 2015-12-04 | 2018-11-06 | Qualcomm Incorporated | Method and apparatus for decoupling uplink latency using common uplink burst in TDD subframe structure |
Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030031127A1 (en) * | 1999-01-15 | 2003-02-13 | Cisco Technology, Inc. | Best effort technique for virtual path restoration |
US20080192713A1 (en) * | 2005-02-01 | 2008-08-14 | Farhad Mighani | Hierarchical Mesh Network for Wireless Access |
US20080310342A1 (en) * | 2007-06-12 | 2008-12-18 | Cisco Technology, Inc. | Addressing Messages in a Two-Tier Network |
US20110158127A1 (en) * | 2009-12-31 | 2011-06-30 | Zhuangzhi Duo | Wireless extender secure discovery and provisioning |
US20110164527A1 (en) * | 2008-04-04 | 2011-07-07 | Mishra Rajesh K | Enhanced wireless ad hoc communication techniques |
US20110255449A1 (en) * | 2003-08-22 | 2011-10-20 | Rappaport Theodore S | Broadband Repeater with Security for Ultrawideband Technologies |
US20120100870A1 (en) * | 2009-04-30 | 2012-04-26 | Pole Star Sa | Method for positioning by wi-fi signals |
US20130163412A1 (en) * | 2011-12-21 | 2013-06-27 | Sterling Hughes | System and method for setting a path to an access point across a wireless mesh network |
US20130250823A1 (en) * | 2012-03-22 | 2013-09-26 | Nigel Gaylard | System And Method For Stabilizing A Wireless Monitoring Network |
US20140071883A1 (en) * | 2012-09-07 | 2014-03-13 | Qualcomm Incorporated | Systems, Apparatus and Methods for Association in Multi-Hop Networks |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8675529B2 (en) | 2010-09-02 | 2014-03-18 | Texas Instruments Incorporated | Power efficient tunneled direct link setup apparatus, systems and methods |
US20120106528A1 (en) | 2010-10-28 | 2012-05-03 | Texas Instruments Incorporated | Unified protocol stack for colocated wireless transceivers |
-
2013
- 2013-09-19 US US14/031,918 patent/US11218942B2/en active Active
-
2022
- 2022-01-04 US US17/568,430 patent/US20220132389A1/en active Pending
Patent Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030031127A1 (en) * | 1999-01-15 | 2003-02-13 | Cisco Technology, Inc. | Best effort technique for virtual path restoration |
US20110255449A1 (en) * | 2003-08-22 | 2011-10-20 | Rappaport Theodore S | Broadband Repeater with Security for Ultrawideband Technologies |
US20080192713A1 (en) * | 2005-02-01 | 2008-08-14 | Farhad Mighani | Hierarchical Mesh Network for Wireless Access |
US20080310342A1 (en) * | 2007-06-12 | 2008-12-18 | Cisco Technology, Inc. | Addressing Messages in a Two-Tier Network |
US20110164527A1 (en) * | 2008-04-04 | 2011-07-07 | Mishra Rajesh K | Enhanced wireless ad hoc communication techniques |
US20120100870A1 (en) * | 2009-04-30 | 2012-04-26 | Pole Star Sa | Method for positioning by wi-fi signals |
US20110158127A1 (en) * | 2009-12-31 | 2011-06-30 | Zhuangzhi Duo | Wireless extender secure discovery and provisioning |
US20130163412A1 (en) * | 2011-12-21 | 2013-06-27 | Sterling Hughes | System and method for setting a path to an access point across a wireless mesh network |
US20130250823A1 (en) * | 2012-03-22 | 2013-09-26 | Nigel Gaylard | System And Method For Stabilizing A Wireless Monitoring Network |
US20140071883A1 (en) * | 2012-09-07 | 2014-03-13 | Qualcomm Incorporated | Systems, Apparatus and Methods for Association in Multi-Hop Networks |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9730091B2 (en) * | 2015-10-29 | 2017-08-08 | Honeywell International Inc. | Method and system improving the reliability of wireless fire detection systems |
US10123347B2 (en) | 2015-12-04 | 2018-11-06 | Qualcomm Incorporated | Method and apparatus for decoupling uplink latency using common uplink burst in TDD subframe structure |
US10687347B2 (en) | 2015-12-04 | 2020-06-16 | Qualcomm Incorporated | Method and apparatus for decoupling uplink latency using common uplink burst in TDD subframe structure |
US11483849B2 (en) | 2015-12-04 | 2022-10-25 | Qualcomm Incorporated | Method and apparatus for decoupling uplink latency using common uplink burst in TDD subframe structure |
US9713180B1 (en) | 2016-03-15 | 2017-07-18 | Qualcomm Incorporated | Relay centric mobility management in a mesh network |
US9717110B1 (en) | 2016-03-15 | 2017-07-25 | Qualcomm Incorporated | User equipment centric mobility management in a mesh network |
Also Published As
Publication number | Publication date |
---|---|
US11218942B2 (en) | 2022-01-04 |
US20220132389A1 (en) | 2022-04-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20220132389A1 (en) | Simple mesh network for wireless transceivers | |
EP2243313B1 (en) | Coordinated channel change in mesh networks | |
US8121077B2 (en) | Relay device and relay method | |
KR101739436B1 (en) | Combining bandwidth aware routing with channel selection and channel switching in a multi-hop wireless home network | |
US7505751B1 (en) | Wireless mesh architecture | |
US8737370B2 (en) | Methods and apparatuses for direct link setup | |
US20160150459A1 (en) | Techniques to support heterogeneous network data path discovery | |
WO2018049961A1 (en) | Data transmission method and relay node | |
US20170207851A1 (en) | Data transmission method and apparatus | |
US20060285510A1 (en) | Method and apparatus for transferring frames in extended wireless LAN | |
US9014051B2 (en) | Updating multicast group information of a client device of a wireless mesh network | |
WO2015025029A1 (en) | Hybrid mesh network | |
KR20080019605A (en) | Resource allocation in multi-access point wireless networks | |
KR20110053257A (en) | Proxy mechanism for mesh-type networks | |
US20050186908A1 (en) | Group network system using bluetooth and generating method thereof | |
US8493923B2 (en) | Path switching using co-located radios in a multi-hop wireless network | |
US11595805B2 (en) | Method for discovering device in mesh network | |
KR101802967B1 (en) | Method and apparatus for configuring multi-hop network | |
EP3259938B1 (en) | Simple mesh network for wireless transceivers | |
Khan et al. | A reliable multicast MAC protocol for Wi-Fi Direct 802.11 networks | |
US20220408308A1 (en) | Methods and apparatuses for end-to-end flow control | |
CN107959985B (en) | Hybrid mesh network construction method, data transmission method and device | |
TWI804198B (en) | Wireless network system and method with roaming and zero-collision packet and time-sharing control multiple access | |
US11457506B2 (en) | Adaptive multipath routing failure recovery in a wireless network | |
US20240015804A1 (en) | Bluetooth network establishing system and method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STPP | Information on status: patent application and granting procedure in general |
Free format text: FINAL REJECTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: AMENDMENT AFTER NOTICE OF APPEAL |
|
STCV | Information on status: appeal procedure |
Free format text: NOTICE OF APPEAL FILED |
|
STCV | Information on status: appeal procedure |
Free format text: APPEAL BRIEF (OR SUPPLEMENTAL BRIEF) ENTERED AND FORWARDED TO EXAMINER |
|
STCV | Information on status: appeal procedure |
Free format text: EXAMINER'S ANSWER TO APPEAL BRIEF MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: TC RETURN OF APPEAL |
|
STCV | Information on status: appeal procedure |
Free format text: EXAMINER'S ANSWER TO APPEAL BRIEF MAILED |
|
STCV | Information on status: appeal procedure |
Free format text: ON APPEAL -- AWAITING DECISION BY THE BOARD OF APPEALS |
|
STCV | Information on status: appeal procedure |
Free format text: BOARD OF APPEALS DECISION RENDERED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT RECEIVED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
AS | Assignment |
Owner name: TEXAS INSTRUMENTS INCORPORATED, TEXAS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ESTEVEZ, LEONARDO;BAUM, AVRAHAM;SIGNING DATES FROM 20130902 TO 20130915;REEL/FRAME:062732/0728 |
|
AS | Assignment |
Owner name: TEXAS INSTRUMENTS INCORPORATED, TEXAS Free format text: ASSIGNMENT OF INVENTION;ASSIGNOR:GABAY, BEN ZION;REEL/FRAME:062967/0871 Effective date: 20081114 |