Approximating relay placement in sensor networks

Jukka Suomela

doi:10.1145/1163610.1163635

Approximating relay placement in sensor networks

Jukka Suomela

Avdelningen för datavetenskap

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review

Sammanfattning

The problem of placing relay nodes in a wireless sensor network is studied in the context of balanced data gathering. Previous work is extended by showing that even the simplest classes of the relay placement problem are hard to approximate. This work also presents a heuristic method for both lower-bounding and upper-bounding the maximum performance of a sensor network over all possible relay locations.

Originalspråk	engelska
Titel på värdpublikation	PE-WASUN 2006 : Proceedings of the Third ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor and Ubiquitous Networks. October 6, 2006. Torremolinos, Malaga, Spain
Redaktörer	Lichun Bao, Isabelle Guerin Lassous
Antal sidor	4
Förlag	ACM
Utgivningsdatum	2006
Sidor	145-148
ISBN (tryckt)	1-59593-487-1
DOI	https://doi.org/10.1145/1163610.1163635
Status	Publicerad - 2006
MoE-publikationstyp	A4 Artikel i en konferenspublikation
Evenemang	ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks - Torremolinos, Spanien Varaktighet: 6 okt. 2006 → 6 okt. 2006

Bibliografisk information

ACM Press cop.;
1-59593-487-1;

Vetenskapsgrenar

113 Data- och informationsvetenskap

Åtkomst av dokument

10.1145/1163610.1163635

Andra filer och länkar

Link to publication in Scopus

Citera det här

@inproceedings{5fa3a8ce5e7540cea21581a1713764dc,

title = "Approximating relay placement in sensor networks",

abstract = "The problem of placing relay nodes in a wireless sensor network is studied in the context of balanced data gathering. Previous work is extended by showing that even the simplest classes of the relay placement problem are hard to approximate. This work also presents a heuristic method for both lower-bounding and upper-bounding the maximum performance of a sensor network over all possible relay locations.",

keywords = "113 Computer and information sciences",

author = "Jukka Suomela",

note = "ACM Press cop.; 1-59593-487-1; ; ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks ; Conference date: 06-10-2006 Through 06-10-2006",

year = "2006",

doi = "10.1145/1163610.1163635",

language = "English",

isbn = "1-59593-487-1",

pages = "145--148",

editor = "Lichun Bao and \{Guerin Lassous\}, Isabelle",

booktitle = "PE-WASUN 2006",

publisher = "ACM",

address = "International",

}

Suomela, J 2006, Approximating relay placement in sensor networks. i L Bao & I Guerin Lassous (red), PE-WASUN 2006: Proceedings of the Third ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor and Ubiquitous Networks. October 6, 2006. Torremolinos, Malaga, Spain. ACM, s. 145-148, ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, Torremolinos, Spanien, 06/10/2006. https://doi.org/10.1145/1163610.1163635

Approximating relay placement in sensor networks. / Suomela, Jukka.
PE-WASUN 2006: Proceedings of the Third ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor and Ubiquitous Networks. October 6, 2006. Torremolinos, Malaga, Spain. red. / Lichun Bao; Isabelle Guerin Lassous. ACM, 2006. s. 145-148.

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review

TY - GEN

T1 - Approximating relay placement in sensor networks

AU - Suomela, Jukka

N1 - ACM Press cop.; 1-59593-487-1;

PY - 2006

Y1 - 2006

N2 - The problem of placing relay nodes in a wireless sensor network is studied in the context of balanced data gathering. Previous work is extended by showing that even the simplest classes of the relay placement problem are hard to approximate. This work also presents a heuristic method for both lower-bounding and upper-bounding the maximum performance of a sensor network over all possible relay locations.

AB - The problem of placing relay nodes in a wireless sensor network is studied in the context of balanced data gathering. Previous work is extended by showing that even the simplest classes of the relay placement problem are hard to approximate. This work also presents a heuristic method for both lower-bounding and upper-bounding the maximum performance of a sensor network over all possible relay locations.

KW - 113 Computer and information sciences

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

U2 - 10.1145/1163610.1163635

DO - 10.1145/1163610.1163635

M3 - Conference contribution

SN - 1-59593-487-1

SP - 145

EP - 148

BT - PE-WASUN 2006

A2 - Bao, Lichun

A2 - Guerin Lassous, Isabelle

PB - ACM

T2 - ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks

Y2 - 6 October 2006 through 6 October 2006

ER -