| 摘要 |
Method of detour path determination for data packets re-routing in a mesh network comprising a plurality of N nodes, arranged according to a network topology, each node has a K-hops neighborhood knowledge of the network topology, with 1≦̸K<N, primary paths are predefined for routing data packets within the mesh network. Detour paths are automatically discovered and set up while expending relatively few resources in terms of processing complexity, signaling and information spreading. The method is particularly advantageous when used in a wireless mesh network wherein the available bandwidth and the node resources and capabilities are much more limited than in wired networks. |
