Characterization of Minimum Route ETX in Multi-Hop Wireless Networks

Characterization of Wireless Multi-hop Paths with High Quality: Toward a Theoretical Framework

“…In Case 1, we showed in [7] that there is a direct relation between the best path and the parameters a, L, d, and u(z). Namely, we have a method to successfully identify the best path without executing any minimum cost algorithms owing to simplicity of the network structure.…”

“…Namely, we have a method to successfully identify the best path without executing any minimum cost algorithms owing to simplicity of the network structure. The following are the results in [7]: In this method, we do not have to construct any weighted graphs for inputs, and inputs are just a, L, d, and u(z). In Case 1, minimum route ETX is given as…”

“…As explained in this section, we can successfully identify the best path in Case 1. The results in [7] enable us to know all links included in the best path, as well as the number of hops in the best path, without executing any minimum cost algorithms like the Dijkstra algorithm. While this result is considered to be interesting from a theoretical point of view, it can be applied to optimization problems of multi-hop networks as well as estimation of the minimum route ETX.…”

“…Communication range: d. Function of link ETX: u(z). To theoretically identify the best path, the following assumptions are made in [7].…”

“…With this as background, in this paper, we introduce some recent results on theoretical identification of the best path and theoretical formulas to evaluate the quality of the best path in wireless multi-hop networks with regular structure [7]. We explain how the best path is identified using examples.…”