Analysis of Relaying Probability in Wireless Multi-hop Networks with QoS Routing

In wireless multi-hop networks, source and destination nodes usually have some candidate paths between them, and communication quality depends on selection of a multi-hop path from these candidates. We theoretically analyzed ETX which is a measure of communication quality, for three routing algorithms in one-dimensional multi-hop networks. In this paper, we theoretically analyze relaying probability of each relay node in a one-dimensional multi-hop network with QoS routing, which minimizes ETX and propose an algorithm that makes relaying probability of each node as uniform as possible.