Routing in wireless mesh networks
First Claim
1. A method for communicating in a wireless mesh network, the method comprising:
- determining a next hop node having a lowest sum of cost metrics associated with communicating between a wireless node and a destination along two or more potential multi-hop paths, wherein a cost metric is based on a channel characteristic between each adjacent wireless node in each potential multi-hop path; and
updating a routing table in the wireless node to identify the determined next hop node.
0 Assignments
0 Petitions
Accused Products
Abstract
A method, apparatus and system for communicating in a wireless mesh network may entail using a Viterbi routing algorithm to determine a multi-hop path between a source node and a destination node having a lowest cost metric. In one example, the cost metric may be inversely proportional to the achievable transmission rate in the links of each potential multi-hop path. A next hop node in two or more potential multi-hop paths for routing a wireless communication to a destination node may be determined by each node based on the multi-hop path having a lowest cost metric associated with communicating to the destination node. Other embodiments and variations are described in the detailed description.
-
Citations
22 Claims
-
1. A method for communicating in a wireless mesh network, the method comprising:
-
determining a next hop node having a lowest sum of cost metrics associated with communicating between a wireless node and a destination along two or more potential multi-hop paths, wherein a cost metric is based on a channel characteristic between each adjacent wireless node in each potential multi-hop path; and
updating a routing table in the wireless node to identify the determined next hop node. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A method of communicating in a wireless mesh network, the method comprising:
routing a communication received at a wireless node to a destination node via one of at least two next adjacent wireless nodes in two or more potential multi-hop paths to the destination node, wherein the one next adjacent node is determined by the wireless node to be on a multi-hop path with a greatest potential transmission rate to the destination node. - View Dependent Claims (9, 10, 11)
-
12. A wireless device comprising:
a processing circuit including logic to determine a next hop node from nodes in one of least two potential multi-hop paths for routing a wireless communication to a destination node, wherein the next hop node is determined to be on a multi-hop path having a greatest potential transmission rate to the destination node. - View Dependent Claims (13, 14, 15, 16, 17)
-
18. A wireless system comprising:
-
a processing circuit including logic to determine a next hop node in two or more potential multi-hop paths for routing a wireless communication to a destination node, wherein the next hop node is determined to be on a multi-hop path having a lowest cost metric associated with communicating to the destination node;
a radio frequency (RF) interface communicatively coupled to the processing circuit; and
at least two antennas coupled to the RF interface for at least one of multiple input or multiple output communication. - View Dependent Claims (19, 20, 21, 22)
-
Specification