Wireless networks with symmetric demands

It has been shown recently that a simple layering principle - local physical-layer schemes combined with global routing - can achieve approximately optimal performance in wireless networks. However, this result depends heavily on the assumption of reciprocity of wireless networks, which may be violated due to asymmetric power constraints, directional antennas or frequency-duplexing. In this paper, we show that the approximate optimality continues to hold even for wireless networks modeled as directed graphs as long as there is a symmetric demand constraint: every demand from source s _i to sink t _i at rate R _i has a counterpart demand from source node t _i to sink node s _i at the same rate. This models several practical scenarios including voice calls, video calls, and interactive gaming. We prove this result in the context of several channel models for which good local schemes exist. The key technical contributions are an outer bound based on a Generalized Network Sharing bound for wireless networks and an achievable strategy based on a connection to polymatroidal networks.