Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks

— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In particular, we develop a generic randomized routing, scheduling and flow control scheme that is applicable to a large class of interference models. We prove that any algorithm which satisfies the conditions of our generic scheme maximizes network throughput and utilization. Then, we focus on a specific interference model, namely the two-hop interference model, and develop distributed algorithms with polynomial communication and computation complexity. This is an important result given that earlier throughput-optimal algorithms developed for such a model relies on the solution to an NP-hard problem. To the best of our knowledge, this is the first polynomial complexity algorithm that guarantees full utilization in multi-hop wireless networks. We further show that our algorithmic approach enables us to efficie...

• Type: Conference
• Year: 2007
• Where: INFOCOM
• Authors: Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
• Keywords: Communications, Generic Randomized Routing, INFOCOM 2007, Interference Model, Multi-hop Wireless Network