Maximum Independent Set of Links with a Monotone and Sublinear Power Assignment
Ma, Chao . 2013
This paper studies the problem of selecting a maximum independent set of links with a fixed monotone and sublinear power assignment under the physical interference model. The best-known approximation bound for this problem is a very large constant. In this paper, we present an approximation algorithm for this problem, which not only has a much smaller approximation bound but also produces an independent set of links with a stronger property, i.e., strong independence.
Linear interference alignment (LIA) is one of the key interference mitigation techniques to enhance the wireless MIMO network capacity. The generic LIA feasibility amounts to whether or not a well…
Multi-packet reception (MPR) technology provides a means of boosting wireless network capacity without requiring additional spectrum. It has received widespread attention over the past two decades…
Fractional Link scheduling is one of the most fundamental problems in wireless networks. The prevailing approach for shortest fractional link scheduling is based on a reduction to the maximum-…