Minimizing Total Interference in Asymmetric Sensor Networks

A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz

doi:10.1007/978-3-030-62401-9_1

Minimizing Total Interference in Asymmetric Sensor Networks

A. Karim Abu-Affash
, Paz Carmi
, Matthew J. Katz

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

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 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.

Original language	English
Title of host publication	Algorithms for Sensor Systems - 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Revised Selected Papers
Editors	Cristina M. Pinotti, Alfredo Navarra, Amitabha Bagchi
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	1-16
Number of pages	16
ISBN (Print)	9783030624002
DOIs	https://doi.org/10.1007/978-3-030-62401-9_1
State	Published - 1 Jan 2020
Event	16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020 - Pisa, Italy Duration: 9 Sep 2020 → 10 Sep 2020

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12503 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020
Country/Territory	Italy
City	Pisa
Period	9/09/20 → 10/09/20

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-030-62401-9_1

Cite this

Abu-Affash, A. K., Carmi, P., & Katz, M. J. (2020). Minimizing Total Interference in Asymmetric Sensor Networks. In C. M. Pinotti, A. Navarra, & A. Bagchi (Eds.), Algorithms for Sensor Systems - 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Revised Selected Papers (pp. 1-16). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12503 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-62401-9_1

Abu-Affash, A. Karim ; Carmi, Paz ; Katz, Matthew J. / Minimizing Total Interference in Asymmetric Sensor Networks. Algorithms for Sensor Systems - 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Revised Selected Papers. editor / Cristina M. Pinotti ; Alfredo Navarra ; Amitabha Bagchi. Springer Science and Business Media Deutschland GmbH, 2020. pp. 1-16 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8591a5eaed874735bc8246b61d3f4d8d,

title = "Minimizing Total Interference in Asymmetric Sensor Networks",

abstract = "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 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.",

author = "Abu-Affash, \{A. Karim\} and Paz Carmi and Katz, \{Matthew J.\}",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020 ; Conference date: 09-09-2020 Through 10-09-2020",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/978-3-030-62401-9\_1",

language = "English",

isbn = "9783030624002",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "1--16",

editor = "Pinotti, \{Cristina M.\} and Alfredo Navarra and Amitabha Bagchi",

booktitle = "Algorithms for Sensor Systems - 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Revised Selected Papers",

address = "Germany",

}

Abu-Affash, AK, Carmi, P & Katz, MJ 2020, Minimizing Total Interference in Asymmetric Sensor Networks. in CM Pinotti, A Navarra & A Bagchi (eds), Algorithms for Sensor Systems - 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12503 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 1-16, 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Pisa, Italy, 9/09/20. https://doi.org/10.1007/978-3-030-62401-9_1

Minimizing Total Interference in Asymmetric Sensor Networks. / Abu-Affash, A. Karim; Carmi, Paz ; Katz, Matthew J.
Algorithms for Sensor Systems - 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Revised Selected Papers. ed. / Cristina M. Pinotti; Alfredo Navarra; Amitabha Bagchi. Springer Science and Business Media Deutschland GmbH, 2020. p. 1-16 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12503 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Minimizing Total Interference in Asymmetric Sensor Networks

AU - Abu-Affash, A. Karim

AU - Carmi, Paz

AU - Katz, Matthew J.

PY - 2020/1/1

Y1 - 2020/1/1

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 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 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 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 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.

UR - https://www.scopus.com/pages/publications/85096483838

U2 - 10.1007/978-3-030-62401-9_1

DO - 10.1007/978-3-030-62401-9_1

M3 - Conference contribution

AN - SCOPUS:85096483838

SN - 9783030624002

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 16

BT - Algorithms for Sensor Systems - 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Revised Selected Papers

A2 - Pinotti, Cristina M.

A2 - Navarra, Alfredo

A2 - Bagchi, Amitabha

PB - Springer Science and Business Media Deutschland GmbH

T2 - 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020

Y2 - 9 September 2020 through 10 September 2020

ER -

Abu-Affash AK, Carmi P , Katz MJ. Minimizing Total Interference in Asymmetric Sensor Networks. In Pinotti CM, Navarra A, Bagchi A, editors, Algorithms for Sensor Systems - 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Revised Selected Papers. Springer Science and Business Media Deutschland GmbH. 2020. p. 1-16. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-62401-9_1

Minimizing Total Interference in Asymmetric Sensor Networks

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this