Maximizing Capacity with Power Control under Physical Interference Model in Simplex Mode

Abstract

Abstract. This paper addresses the join selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference model in the simplex mode. For the special setting in which all nodes have unlimited maximum transmission power, Kesselheim [8] developed an constant approximation algorithm. For the general setting in which all nodes have bounded maximum transmission power, the existence of constant approximation algorithm remains open. In this paper, we resolve this open problem by developing a constant-approximation algorithm for the general setting in which all nodes have bounded maximum transmission power.

Maximizing wireless network capacity with linear power: Breaking the logarithmic barrier

“…• In the unidirectional mode, the best-known approximation bound for SFLS is The vairants of wireless link scheduling with power control have been studied in [1], [4], [6], [7], [10], [12], [15], [16].…”

Link scheduling for throughput maximization in multihop wireless networks under physical interference

“…The last third inequality results from the generalized mean inequality (cf. [20]). The last step is built on Corollary 1.…”

“…For a specific link, the suffered interference from ambient noise and the previously assigned links is easy to calculate, the question is to estimate an upper bound of the interference from the later assigned links. Works in [19], [20] provide hints for the problem. The basic idea is to assign a power that is a scale of the summed interference from ambient noise and the preassigned links.…”

“…Consider a set L * of links, and let l 1 , l 2 , ..., l n be a permutation of links in L * . Note in this procedure, we do not need to order the links in the ordering of decreasing length as done in [19], [20]. It works for arbitrary ordering of links as long as the given set satisfies the sufficient condition we propose later.…”