Users' demand of seamless connectivity has pushed for the development of alternatives to traditional infrastructure networks. Potential solutions should be low-cost, easily deployable and adaptive to the environment. One approach that has gained tremendous attention over the past few years consists in deploying a backbone of access points wirelessly interconnected, offering users access to the wired infrastructure via multi-hop communication. However, the limited transfer capacities and the interference resulting from a shared transmission medium can prevent further deployment if the network performance does not meet users' expectations. In this work, we explore different ways to improve the nominal network capacity while accounting for the phenomena of intra-interference (interference on a single path) and inter-interference (interference among flows on different paths). In particular, under the assumptions of splitable traffic flows, we present an interference-aware linear- programming formulation of the min-max congestion problem with and without constraints on the path length. Finally, we evaluate via simulations the potential bandwidth capacity gain resulting from the implementation of these different approaches.

We consider the problem of representing and performing computations on finite abelian groups. Assuming a lg n-bit1 word model and considering any abelian group of order n, we show how to represent the group in constant number of words and perform three fundamental group operations of equality testing, multiplication, and inversion in constant number of word operations, provided we have the platform instruction to reverse the bits of a word.