TY - JOUR
T1 - Minimizing total interference in asymmetric sensor networks
AU - Abu-Affash, A. Karim
AU - Carmi, Paz
AU - Katz, Matthew J.
N1 - Funding Information:
Work by A. K. Abu-Affash and P. Carmi was partially supported by Grant 2016116 from the United States - Israel Binational Science Foundation . Work by M. Katz was partially supported by grant 1884/16 from the Israel Science Foundation .
Publisher Copyright:
© 2021 Elsevier B.V.
PY - 2021/10/8
Y1 - 2021/10/8
N2 - 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 one 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(n3) 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.
AB - 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 one 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(n3) 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.
KW - Approximation algorithms
KW - Computational geometry
KW - Interference
KW - NP-hardness
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=85112515705&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2021.08.003
DO - 10.1016/j.tcs.2021.08.003
M3 - Article
AN - SCOPUS:85112515705
VL - 889
SP - 171
EP - 181
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
ER -