Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks

A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability distribution. Generalizing (deterministic) shortest path routing, stochastic routing offers greater flexibility that matches the random nature of wireless links. Consider the pairwise reliability matrix R, whose (i, j)-th entry Rij represents the probability that a packet transmitted from the j-th user Uj is correctly received by the i-th user Ui. Using R to capture physical layer aspects of the wireless medium, several rate-oriented stochastic routing formulations can be reduced to centrally solvable convex optimization problems. The present paper, introduces distributed algorithms that find optimal routing probabilities without the burden of collecting R at a central node and then percolating the resulting routing probabilities through network nodes. The resultant schemes are distributed in the sense that:...

• Type: Journal
• Year: 2008
• Where: TWC
• Authors: Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgios B. Giannakis
• Keywords: Optimal Routing, Routing, Routing Probabilities, TWC 2008