  The problem of computing a connected network with minimum interference is a
fundamental problem in wireless sensor networks. Several models of interference
have been studied in the literature. The most common model is the
receiver-centric, in which the interference of a node $p$ is defined as the
number of other nodes whose transmission range covers $p$. In this paper, we
study the problem of assigning a transmission range to each sensor, such that
the resulting network is strongly connected and the total interference of the
network is minimized. For the one-dimensional case, we show how to solve the
problem optimally in $O(n^3)$ time. For the two-dimensional case, we show that
the problem is NP-complete and give a polynomial-time 2-approximation algorithm
for the problem.
