An Approach towards Link Positions Routing in Wireless Network-A Review
G. D. Govindwar, P. A. Tijare · 2013
We can analytically compute ETOP, which is not trivial, since ETOP is a noncommutative function of the link success probabilities. Although ETOP is a more involved metric, we show that the problem of computing paths with the minimum ETOP cost can be solved by a greedy algorithm. We will try to implement and evaluate a routing approach based on ETOP metric on wireless network.