WO2013100752A1 - A method for establishing an end-to-end route for traversing data - Google Patents
A method for establishing an end-to-end route for traversing data Download PDFInfo
- Publication number
- WO2013100752A1 WO2013100752A1 PCT/MY2012/000150 MY2012000150W WO2013100752A1 WO 2013100752 A1 WO2013100752 A1 WO 2013100752A1 MY 2012000150 W MY2012000150 W MY 2012000150W WO 2013100752 A1 WO2013100752 A1 WO 2013100752A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- route
- neighboring
- mesh nodes
- etx
- rtt
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/26—Route discovery packet
-
- 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
Definitions
- the present invention relates to method for establishing an end-to-end route for traversing data from source to destination through wireless mesh networks. More particularly, the method is a method of incorporating multiple performance metrics into a shortest routing protocol in wireless mesh networks.
- Wireless mesh networks are dynamically self organizing, self configuring and self healing with nodes in the networks automatically establishing an ad hoc network and preserving mesh connectivity.
- Wireless mesh is functionally similar to standard IEEE 802.11 infrastructure network with respect to Basic Service Set (BSS) and Extended Service Set (ESS).
- BSS Basic Service Set
- ESS Extended Service Set
- WDS use an extension of IEEE 802.11 MAC/PHY to provide a protocol for auto configuring paths between Mesh Points (MPs) in a multi-hop topology, supporting broadcast, multicast and unicast traffic.
- WMNs are emerging rapidly as the WMNs support several applications such as Broadband Home Networking, Community and Neighbourhood Networking, Enterprise Networking, Metropolitan area networks, Disaster Recovery and Security Surveillance. Intel, Microsoft and Motorola have realized the potential of this technology and offering wireless mesh networking products. A few test beds are already established in university research labs. Existing solutions in mobile ad hoc and sensor networks cannot be directly applied to WMNs due to the differences in traffic patterns, mobility scenarios, gateway functionalities and bandwidth requirements.
- WO 2008/097221 describes a method of calculating a link cost for each end to end route.
- this prior art describes a solution for multi channel, multi radio environments with single metric routes.
- US 2000116393 describes yet another solution for cost based route calculation.
- this solution targets Mobile Ad-hoc Network (MANET) especially.
- MANET Mobile Ad-hoc Network
- the multi metric approach used here uses data rate and reliability information for data links.
- a method for establishing an end-to-end route for traversing data from source to destination through wireless mesh networks characterized in that, the method is a method of incorporating multiple performance metrics into a shortest routing protocol in wireless mesh networks, the method includes the steps of determining Expected Transmission Count (ETX) of neighboring mesh nodes, determining Round Trip Time (RTT) of neighboring mesh nodes, sending a route discovery message in a wireless mesh network, receiving the route discovery message, calculating Incorporated Multiple Metrics Value (IMMV) for the route, selecting an optimum path based on the IMMV, saving information of the optimum path in a routing table and sending data packets based on the routing table.
- EX Expected Transmission Count
- RTT Round Trip Time
- IMMV Incorporated Multiple Metrics Value
- Figure 1 is a illustrates a flow chart showing a method for establishing an end-to-end route for traversing data from source to destination through wireless mesh networks, wherein the method is a method of incorporating multiple performance metrics into a shortest routing protocol in wireless mesh networks in the preferred embodiment of the invention.
- the present invention relates to a method for establishing an end-to-end route for traversing data from source to destination through wireless mesh networks. More particularly, the method is a method of incorporating multiple performance metrics into a shortest routing protocol in wireless mesh networks.
- this specification will describe the present invention according to the preferred embodiment of the present invention. However, it is to be understood that limiting the description to the preferred embodiment of the invention is merely to facilitate discussion of the present invention and it is envisioned that those skilled in the art may devise various modifications and equivalents without departing from the scope of the appended claims.
- Figure 1 illustrates a flow chart showing a method for establishing an end-to-end route for traversing data from source to destination through wireless mesh networks, wherein the method is a method of incorporating multiple performance metrics into a shortest routing protocol in wireless mesh networks.
- the method includes the steps of determining Expected Transmission Count (ETX) of neighboring mesh nodes, determining Round Trip Time (RTT) of neighboring mesh nodes, sending a route discovery message in a wireless mesh network, receiving the route discovery message, calculating Incorporated Multiple Metrics Value (IMMV) for the route, selecting an optimum path based on the IMMV, saving information of the optimum path in a routing table and sending data packets based on the routing table.
- EX Expected Transmission Count
- RTT Round Trip Time
- IMMV Incorporated Multiple Metrics Value
- the step of determining ETX further includes the steps of sending a beacon message to the neighboring mesh nodes, receiving the beacon message from at least one neighboring mesh nodes, determining the ETX of the at least one neighboring mesh nodes using the received beacon message and saving the ETX of the at least one neighboring mesh nodes in a table.
- the step of determining RTT further includes the steps of sending a beacon message to the at least one neighboring mesh nodes, receiving a response from the at least one neighboring mesh nodes, receiving the beacon message from the at least one neighboring mesh nodes, determining RTT of the at least one neighboring mesh nodes and saving the RTT of the at least one neighboring mesh nodes in a table.
- a mesh node For selecting the optimum path using the method, determination of ETX and RTT of neighboring mesh nodes are necessary. If a mesh node is required to send data to another mesh node, the routing table is checked to determine existence of any available path. If at least one path exists, the mesh node sends data through the available path. However, if no path is found to be in existence, a path must be discovered. A mesh node generates a route discovery message and sends the route discovery message throughout the wireless network. Other mesh nodes that do not have capability to reply to the route discovery message receive the route discovery message and forward the route discovery message. Further, mesh nodes that have the capability of responding proceed to generate a reply message and unicast a data packet to the source.
- a mesh node receives the reply message for the request message that was sent out. If only one path exists between the source node and the destination node, then the same path is a default choice. In the event that multiple paths exist, it now becomes necessary to calculate Incorporating Multiple Metrics Value (IMMV) to select an optimum path. Information related to the selected path is saved in the routing table. A mesh node is now able to send data to another mesh node through the selected path. As each individual routing metric consider some minimum related features, it was difficult to satisfy comprehensive requirements of wireless mesh networks (WMNs) by using a single metric.
- WSNs wireless mesh networks
- Multiple performance metrics are used in this method which includes, but not restricted to, a combination of ETX, RTT and traditional Hop Count, which guarantees a minimum hop count with loop free routing and avoiding highly loaded and lossy links.
- ETX is used to avoid lossy links and RTT is used to avoid highly loaded links.
- the ETX path metric is a sum of the ETX values for each link in that path.
- a node In calculating RTT, a node unicast one probe packet after a specific period, carrying a random timestamp to each of the node's neighbors. Upon receiving the probe packet, each neighbor immediately responds to the probe packet with an acknowledgement probe, echoing that of the timestamp. This enables a sending node to calculate a round trip time to each of the node's neighbors. Subsequently, the RTT value at a specific time, / for a neighbor, is calculated using (3):
- RTTi_i is an average round trip time for the neighboring node at time i-1 and RTT, is a newly calculated round trip time to the neighboring node.
- ETX and RTT values are determined using layer 3 beacon messages exchanged among neighboring nodes.
- the IMMV for a route can be calculated using (4): ⁇ f KIT . ffPC ' t
- IMMV IMMV
- IMMV IMMV
- This invention is adapted for use with permanent and non-permanent wireless mesh networks.
- the disclosed invention is suitable, but not restricted to, for use in performance optimizing of routing and forwarding mechanisms in wireless mesh networks.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A method for establishing an end-to-end route for traversing data from source to destination through wireless mesh networks, characterized in that, the method is a method of incorporating multiple performance metrics into a shortest routing protocol in wireless mesh networks is provided, the method includes the steps of determining Expected Transmission Count (ETX) of neighboring mesh nodes, determining Round Trip Time (RTT) of neighboring mesh nodes, sending a route discovery message in a wireless mesh network, receiving the route discovery message, calculating Incorporated Multiple Metrics Value (IMMV) for the route, selecting an optimum path based on the IMMV, saving information of the optimum path in a routing table and sending data packets based on the routing table.
Description
A METHOD FOR ESTABLISHING AN END-TO-END ROUTE FOR TRAVERSING
DATA FIELD OF INVENTION
The present invention relates to method for establishing an end-to-end route for traversing data from source to destination through wireless mesh networks. More particularly, the method is a method of incorporating multiple performance metrics into a shortest routing protocol in wireless mesh networks.
BACKGROUND OF INVENTION
Wireless mesh networks (WMNs) are dynamically self organizing, self configuring and self healing with nodes in the networks automatically establishing an ad hoc network and preserving mesh connectivity. Wireless mesh is functionally similar to standard IEEE 802.11 infrastructure network with respect to Basic Service Set (BSS) and Extended Service Set (ESS). Wireless Distribution Systems (WDS) use an extension of IEEE 802.11 MAC/PHY to provide a protocol for auto configuring paths between Mesh Points (MPs) in a multi-hop topology, supporting broadcast, multicast and unicast traffic.
WMNs are emerging rapidly as the WMNs support several applications such as Broadband Home Networking, Community and Neighbourhood Networking, Enterprise Networking, Metropolitan area networks, Disaster Recovery and Security Surveillance. Intel, Microsoft and Motorola have realized the potential of this technology and offering wireless mesh networking products. A few test beds are already established in university research labs. Existing solutions in mobile ad hoc and sensor networks cannot be directly
applied to WMNs due to the differences in traffic patterns, mobility scenarios, gateway functionalities and bandwidth requirements.
WO 2008/097221 describes a method of calculating a link cost for each end to end route. However, this prior art describes a solution for multi channel, multi radio environments with single metric routes. US 2000116393 describes yet another solution for cost based route calculation. However, this solution targets Mobile Ad-hoc Network (MANET) especially. The multi metric approach used here uses data rate and reliability information for data links.
However, there are still a range of issues that need to be solved such as scalability, Quality of Service (QoS) assurance, better performance metrics, throughput improvement and considerable research efforts are needed.
SUMMARY OF !NVENTION
Accordingly, there is provided a method for establishing an end-to-end route for traversing data from source to destination through wireless mesh networks, characterized in that, the method is a method of incorporating multiple performance metrics into a shortest routing protocol in wireless mesh networks, the method includes the steps of determining Expected Transmission Count (ETX) of neighboring mesh nodes, determining Round Trip Time (RTT) of neighboring mesh nodes, sending a route discovery message in a wireless mesh network, receiving the route discovery message, calculating Incorporated Multiple Metrics Value (IMMV) for the route, selecting an optimum path based on the IMMV, saving information of the optimum path in a routing table and sending data packets based on the routing table.
The present invention consists of several novel features and a combination of parts hereinafter fully described and illustrated in the accompanying description and drawings, it being understood that various changes in the details may be made without departing from the scope of the invention or sacrificing any of the advantages of the present invention.
BRIEF DESCRIPTION OF THE DRAWINGS
The present invention will be fully understood from the detailed description given herein below and the accompanying drawings which are given by way of illustration only, and thus are not limitative of the present invention, wherein:
Figure 1 is a illustrates a flow chart showing a method for establishing an end-to-end route for traversing data from source to destination through wireless mesh networks, wherein the method is a method of incorporating multiple performance metrics into a shortest routing protocol in wireless mesh networks in the preferred embodiment of the invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
The present invention relates to a method for establishing an end-to-end route for traversing data from source to destination through wireless mesh networks. More particularly, the method is a method of incorporating multiple performance metrics into a shortest routing protocol in wireless mesh networks. Hereinafter, this specification will describe the present invention according to the preferred embodiment of the present invention. However, it is to be understood that limiting the description to the preferred embodiment of the invention is merely to facilitate discussion of the present invention and it is envisioned that those skilled in the art may devise various modifications and equivalents without departing from the scope of the appended claims.
The following detailed description of the preferred embodiment will now be described in accordance with the attached drawings, either individually or in combination.
Figure 1 illustrates a flow chart showing a method for establishing an end-to-end route for traversing data from source to destination through wireless mesh networks, wherein the method is a method of incorporating multiple performance metrics into a shortest routing protocol in wireless mesh networks. The method includes the steps of determining Expected Transmission Count (ETX) of neighboring mesh nodes, determining Round Trip Time (RTT) of neighboring mesh nodes, sending a route discovery message in a wireless mesh network, receiving the route discovery message, calculating Incorporated Multiple Metrics Value (IMMV) for the route, selecting an optimum path based on the IMMV, saving information of the optimum path in a routing table and sending data packets based on the routing table.
The step of determining ETX further includes the steps of sending a beacon message to the neighboring mesh nodes, receiving the beacon message from at least one
neighboring mesh nodes, determining the ETX of the at least one neighboring mesh nodes using the received beacon message and saving the ETX of the at least one neighboring mesh nodes in a table. The step of determining RTT further includes the steps of sending a beacon message to the at least one neighboring mesh nodes, receiving a response from the at least one neighboring mesh nodes, receiving the beacon message from the at least one neighboring mesh nodes, determining RTT of the at least one neighboring mesh nodes and saving the RTT of the at least one neighboring mesh nodes in a table.
For selecting the optimum path using the method, determination of ETX and RTT of neighboring mesh nodes are necessary. If a mesh node is required to send data to another mesh node, the routing table is checked to determine existence of any available path. If at least one path exists, the mesh node sends data through the available path. However, if no path is found to be in existence, a path must be discovered. A mesh node generates a route discovery message and sends the route discovery message throughout the wireless network. Other mesh nodes that do not have capability to reply to the route discovery message receive the route discovery message and forward the route discovery message. Further, mesh nodes that have the capability of responding proceed to generate a reply message and unicast a data packet to the source. A mesh node receives the reply message for the request message that was sent out. If only one path exists between the source node and the destination node, then the same path is a default choice. In the event that multiple paths exist, it now becomes necessary to calculate Incorporating Multiple Metrics Value (IMMV) to select an optimum path. Information related to the selected path is saved in the routing table. A mesh node is now able to send data to another mesh node through the selected path.
As each individual routing metric consider some minimum related features, it was difficult to satisfy comprehensive requirements of wireless mesh networks (WMNs) by using a single metric. Multiple performance metrics are used in this method which includes, but not restricted to, a combination of ETX, RTT and traditional Hop Count, which guarantees a minimum hop count with loop free routing and avoiding highly loaded and lossy links. ETX is used to avoid lossy links and RTT is used to avoid highly loaded links.
Since Hop Count (HPC) metric implementation is default with most protocols, therefore implementation of ETX and RTT are described herein. A modified version of ETX is implemented, wherein only loss probability in reverse direction pr is considered to simplify calculation and to keep routing overhead analogous to implemented protocol. Therefore, probability that packet transmission of a link is not successful can be defined from (1 ): p = 1 - (1 - Pr) (1 ) where p denotes a probability that the packet transmission from x to y is not successful. Finally, an expected number of transmissions required to successfully deliver a packet from x to y is denoted by ETX:
The ETX path metric is a sum of the ETX values for each link in that path.
In calculating RTT, a node unicast one probe packet after a specific period, carrying a random timestamp to each of the node's neighbors. Upon receiving the probe packet, each neighbor immediately responds to the probe packet with an acknowledgement probe, echoing that of the timestamp. This enables a sending node to calculate a round
trip time to each of the node's neighbors. Subsequently, the RTT value at a specific time, / for a neighbor, is calculated using (3):
Where RTTi_i is an average round trip time for the neighboring node at time i-1 and RTT, is a newly calculated round trip time to the neighboring node. ETX and RTT values are determined using layer 3 beacon messages exchanged among neighboring nodes.
When only one path exists between source and destination, that path is the default choice for the source that initiated route discovery. However, if there are two or more paths, the IMMV is calculated to select a best path among them. The IMMV for a route can be calculated using (4): Γ f KIT . ffPC 't
U.K . KIT UPL
- / v, ρπ, a e,
Where, IMMV, and IMMV, are calculated for route i and j. Among these two paths, the path with the lower IMMV is selected. The route between the source node and destination node is established based on on-demand routing.
Several features had to be considered in designing an efficient routing protocol suitable for wireless mesh networks. Using improved performance metrics, a reliable path is established between source and destination. Minimum hop-count is the metric most commonly used by existing routing protocols. As this approach implicitly assumes that links either work well or do not work at all, this is often true in wired networks. Unfortunately, this is not a reasonable approximation in WMNs, since many wireless links have intermediate loss ratios, interference problems and low throughput. Existing
performance metrics were designed but were insufficient to deal with the issues. Since each individual routing metrics consider minimum and related features and is difficult to satisfy comprehensive requirements of WMNs, it is necessary to incorporate multiple performance metrics into a routing protocol to attain optimal performance.
This invention is adapted for use with permanent and non-permanent wireless mesh networks. The disclosed invention is suitable, but not restricted to, for use in performance optimizing of routing and forwarding mechanisms in wireless mesh networks.
Claims
1. A method for establishing an end-to-end route for traversing data from source to destination through wireless mesh networks, characterized in that, the method is a method of incorporating multiple performance metrics into a shortest routing protocol in wireless mesh networks, the method includes the steps of: i. determining Expected Transmission Count (ETX) of neighboring mesh nodes;
ii. determining Round Trip Time (RTT) of neighboring mesh nodes;
iii. sending a route discovery message in a wireless mesh network;
iv. receiving the route discovery message;
v. calculating Incorporated Multiple Metrics Value (IMMV) for the route;
vi. selecting an optimum path based on the IMMV;
vii. saving information of the optimum path in a routing table; and
viii. sending data packets based on the routing table.
2. The method as claimed in claim 1 , wherein determining ETX further includes the steps of:
i. sending a beacon message to the neighboring mesh nodes;
ii. receiving the beacon message from at least one neighboring mesh nodes; iii. determining the ETX of the at least one neighboring mesh nodes using the received beacon message; and
iv. saving the ETX of the at least one neighboring mesh nodes in a table.
3. The method as claimed in claim 1 and 2, wherein determining RTT further includes the steps of:
i. sending a beacon message to the at least one neighboring mesh nodes;
ii. receiving a response from the at least one neighboring mesh nodes; iii. receiving the beacon message from the at least one neighboring mesh nodes; iv. determining RTT of the at least one neighboring mesh nodes; and
v. saving the RTT of the at least one neighboring mesh nodes in a table.
The method as claimed in claim 1 , wherein the step of calculating IMMV for a route is only performed when multiple routes are found between the source node and destination node.
The method as claimed in claim 1 , wherein the route between the source node and destination node is established based on on-demand routing.
The method as claimed in claim 1 , wherein ETX, RTT and Hop Count are used to determine IMMV for a route.
The method as claimed in claim 1 , wherein ETX and RTT values are determined using layer 3 beacon messages exchanged among neighboring nodes.
The method as claimed in claim 1 , wherein the wireless mesh network is a permanent network.
The method as claimed in claim 1 , wherein the wireless mesh network is a semipermanent network.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| MYPI2011700211 | 2011-12-30 | ||
| MYPI2011700211 | 2011-12-30 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2013100752A1 true WO2013100752A1 (en) | 2013-07-04 |
Family
ID=46727518
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/MY2012/000150 WO2013100752A1 (en) | 2011-12-30 | 2012-06-28 | A method for establishing an end-to-end route for traversing data |
Country Status (1)
| Country | Link |
|---|---|
| WO (1) | WO2013100752A1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2015073193A (en) * | 2013-10-02 | 2015-04-16 | 任天堂株式会社 | Communication system, communication device, program, and communication method |
| WO2016156014A1 (en) | 2015-03-30 | 2016-10-06 | British Telecommunications Public Limited Company | Processing data items in a communications network |
| US9846052B2 (en) | 2016-04-29 | 2017-12-19 | Blackriver Systems, Inc. | Electronic route creation |
| CN113169938A (en) * | 2018-11-27 | 2021-07-23 | 瑞典爱立信有限公司 | Method for multi-channel discovery with partially disjoint paths |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050185632A1 (en) * | 2004-02-23 | 2005-08-25 | Microsoft Corporation | System and method for link quality source routing |
| WO2008097221A1 (en) | 2007-02-07 | 2008-08-14 | Thomson Licensing | A radio and bandwidth aware routing metric for multi-radio multi-channel multi-hop wireless networks |
| US20090116393A1 (en) | 2007-10-01 | 2009-05-07 | Hughes Timothy J | Multi-metric routing calculations |
-
2012
- 2012-06-28 WO PCT/MY2012/000150 patent/WO2013100752A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050185632A1 (en) * | 2004-02-23 | 2005-08-25 | Microsoft Corporation | System and method for link quality source routing |
| WO2008097221A1 (en) | 2007-02-07 | 2008-08-14 | Thomson Licensing | A radio and bandwidth aware routing metric for multi-radio multi-channel multi-hop wireless networks |
| US20090116393A1 (en) | 2007-10-01 | 2009-05-07 | Hughes Timothy J | Multi-metric routing calculations |
Non-Patent Citations (3)
| Title |
|---|
| BIJIL RAJ M B ET AL: "Weighted Integrated Metrics (WIM): A Generic Algorithm for Reliable Routing in Wireless Mesh Networks", WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING (WICOM), 2011 7TH INTERNATIONAL CONFERENCE ON, IEEE, 23 September 2011 (2011-09-23), pages 1 - 6, XP032059663, ISBN: 978-1-4244-6250-6, DOI: 10.1109/WICOM.2011.6040293 * |
| MD ARAFATUR RAHMAN ET AL: "Intergating Multiple Metrics to Improve the Performance of a Routing Protocol over Wireless Mesh Networks", 2009 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING SYSTEMS, IEEE, PISCATAWAY, NJ, USA, 15 May 2009 (2009-05-15), pages 784 - 787, XP031491312, ISBN: 978-0-7695-3654-5 * |
| THANTHRY N ET AL: "EM-AODV: Metric Based Enhancement to AODV Routing Protocol", 2006 IEEE 64TH VEHICULAR TECHNOLOGY CONFERENCE : VTC 2006-FALL ; 25 - 28 SEPTEMBER 2006, MONTREAL, QUEBEC, CANADA, PISCATAWAY, NJ : IEEE OPERATIONS CENTER, 1 September 2006 (2006-09-01), pages 1 - 5, XP031051542, ISBN: 978-1-4244-0062-1, DOI: 10.1109/VTCF.2006.534 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2015073193A (en) * | 2013-10-02 | 2015-04-16 | 任天堂株式会社 | Communication system, communication device, program, and communication method |
| EP2858416A3 (en) * | 2013-10-02 | 2015-08-05 | Nintendo Co., Ltd. | Communication system, communication device, programm, and communication method |
| US9331960B2 (en) | 2013-10-02 | 2016-05-03 | Nintendo Co., Ltd. | Communication system, communication device, storage medium, and communication method |
| WO2016156014A1 (en) | 2015-03-30 | 2016-10-06 | British Telecommunications Public Limited Company | Processing data items in a communications network |
| US10523571B2 (en) | 2015-03-30 | 2019-12-31 | British Telecommunications Public Limited Company | Processing data items in a communications network |
| US9846052B2 (en) | 2016-04-29 | 2017-12-19 | Blackriver Systems, Inc. | Electronic route creation |
| US10235386B2 (en) | 2016-04-29 | 2019-03-19 | Blackriver Systems, Inc. | Electronic route creation |
| CN113169938A (en) * | 2018-11-27 | 2021-07-23 | 瑞典爱立信有限公司 | Method for multi-channel discovery with partially disjoint paths |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100830364B1 (en) | System and method for selecting stable routes in wireless networks | |
| KR100915054B1 (en) | System and method to decrease the route convergence time and find optimal routes in a wireless communication network | |
| EP2280517B1 (en) | Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation | |
| US7561024B2 (en) | Ad-hoc network routing protocol including the use of forward and reverse multi-point relay (MPR) spanning tree routes | |
| US8958339B2 (en) | Method for supporting routing decisions in a wireless mesh network and wireless mesh network | |
| EP1557008B1 (en) | A method for use an ad-hoc wlan system | |
| WO2013100752A1 (en) | A method for establishing an end-to-end route for traversing data | |
| Ho et al. | Handling high mobility in next‐generation wireless ad hoc networks | |
| Chen et al. | Robust ad hoc routing for lossy wireless environment | |
| Bansal et al. | Improved routing protocol for MANET | |
| EP2335383B1 (en) | Network nodes | |
| Barz et al. | Extending OLSRv2 for tactical applications | |
| Sharma et al. | Efficient routing with reduced routing overhead and Retransmission of Manet | |
| CN113055945A (en) | Load balancing method and mobile ad hoc network | |
| Parekh et al. | Effects of Traffic Load and Mobility on AODV, DSR and DSDV Routing Protocols in MANET | |
| Rahman et al. | Integrated metric-ad hoc on-demand distance vector: a routing protocol over wireless mesh networks | |
| Pramod et al. | Characterization of wireless mesh network performance in an experimental test bed | |
| Huang et al. | Zone-based hierarchical routing in two-tier backbone ad hoc networks | |
| Oh | An adaptive routing algorithm for wireless mesh networks | |
| Patnaik et al. | An efficient route repairing technique of aodv protocol in manet | |
| Gurung et al. | A survey of multipath routing schemes of wireless mesh networks | |
| Arora et al. | Performance Evaluation and Improving Bandwidth Utilization of AODV Protocol by Finding Hidden Terminals in Wireless Networks | |
| Saha et al. | RBP: Reliable Broadcasting Protocol in Large Scale Mobile Ad Hoc Networks | |
| Gomes et al. | A spanning tree protocol over mobile wireless ad hoc networks | |
| Jayalakhsmi | FTSMR: A Failure Tolerant and Scalable Multipath Routing Protocol in MANET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 12750840 Country of ref document: EP Kind code of ref document: A1 |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| 122 | Ep: pct application non-entry in european phase |
Ref document number: 12750840 Country of ref document: EP Kind code of ref document: A1 |