Distributed Routing Algorithms for Wireless Multihop Networks
Lists
Only you see this
Abstract
We introduce distributed algorithms to find rate-optimal routes based on local knowledge of the pairwise error probability (reliability) matrix. The distributed algorithms are built by (re)-formulating optimization problems amenable to application of dual decomposition techniques. Convergence of our algorithms to the optimal routing matrix is guaranteed under mild conditions. Many rate-optimality criteria of practical interest can be casted in our framework including maximization of: i)worst user's rate; ii) weighted sum of rates; iii) product of rates; and iv) relay network rate. We test robustness of our algorithms to node mobility.
BibTeX
@inproceedings{ribeiro2007distributed,
author = {Alejandro Ribeiro and Georgios B. Giannakis and Nicholas D. Sidiropoulos},
title = {{Distributed Routing Algorithms for Wireless Multihop Networks}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2007},
doi = {10.1109/icassp.2007.366586},
}Loading related content...