Computing the Capacity Region of a Wireless Network

—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient and distributed algorithm to determine the n2 dimensional unicast capacity region of such a wireless network. Equivalently, given a vector of end-to-end rates between various source-destination pairs, we seek to determine if it can be supported by the network through a combination of routing and scheduling decisions. This question is known to be NP-hard and hard to even approximate within n1−o(1) factor for general graphs. In this paper, we first show that the whole n2 dimensional unicast capacity region can be approximated to (1 ± ε) factor in polynomial time, and in a distributed manner, whenever the Max Weight Independent Set (MWIS) problem can be approximated in a similar fashion for the corresponding topology. We then consider wireless networks which are usually formed between nodes that are placed...

• Type: Conference
• Year: 2009
• Where: INFOCOM
• Authors: Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, Ramavarapu Sreenivas
• Keywords: Communications, Dimensional Unicast Capacity, INFOCOM 2009, Unicast Capacity Region, Wireless Networks