Designing robust network topologies for wireless sensor networks in adversarial environments

Aron Laszka, L. Buttyán, Dávid Szeszlér

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

In this paper, we address the problem of deploying sink nodes in a wireless sensor network such that the resulting network topology be robust. In order to measure network robustness, we propose a new metric, called persistence, which better captures the notion of robustness than the widely known connectivity based metrics. We study two variants of the sink deployment problem: sink selection and sink placement. We prove that both problems are NP-hard, and show how the problem of sink placement can be traced back to the problem of sink selection using an optimal search space reduction technique, which may be of independent interest. To solve the problem of sink selection, we propose efficient heuristic algorithms. Finally, we provide experimental results on the performance of our proposed algorithms.

Original languageEnglish
Pages (from-to)546-563
Number of pages18
JournalPervasive and Mobile Computing
Volume9
Issue number4
DOIs
Publication statusPublished - Aug 2013

Fingerprint

Heuristic algorithms
Network Topology
Wireless Sensor Networks
Wireless sensor networks
Computational complexity
Topology
Placement
Robustness
Metric
Heuristic algorithm
Persistence
Search Space
Connectivity
Efficient Algorithms
NP-complete problem
Experimental Results
Vertex of a graph

Keywords

  • Denial-of-service attack
  • Graph metric
  • Node placement
  • Topology robustness
  • Wireless sensor network

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Applied Mathematics

Cite this

Designing robust network topologies for wireless sensor networks in adversarial environments. / Laszka, Aron; Buttyán, L.; Szeszlér, Dávid.

In: Pervasive and Mobile Computing, Vol. 9, No. 4, 08.2013, p. 546-563.

Research output: Contribution to journalArticle

@article{f1b06d8482d94efc8fb61c1d9fe81b59,
title = "Designing robust network topologies for wireless sensor networks in adversarial environments",
abstract = "In this paper, we address the problem of deploying sink nodes in a wireless sensor network such that the resulting network topology be robust. In order to measure network robustness, we propose a new metric, called persistence, which better captures the notion of robustness than the widely known connectivity based metrics. We study two variants of the sink deployment problem: sink selection and sink placement. We prove that both problems are NP-hard, and show how the problem of sink placement can be traced back to the problem of sink selection using an optimal search space reduction technique, which may be of independent interest. To solve the problem of sink selection, we propose efficient heuristic algorithms. Finally, we provide experimental results on the performance of our proposed algorithms.",
keywords = "Denial-of-service attack, Graph metric, Node placement, Topology robustness, Wireless sensor network",
author = "Aron Laszka and L. Butty{\'a}n and D{\'a}vid Szeszl{\'e}r",
year = "2013",
month = "8",
doi = "10.1016/j.pmcj.2012.05.001",
language = "English",
volume = "9",
pages = "546--563",
journal = "Pervasive and Mobile Computing",
issn = "1574-1192",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - Designing robust network topologies for wireless sensor networks in adversarial environments

AU - Laszka, Aron

AU - Buttyán, L.

AU - Szeszlér, Dávid

PY - 2013/8

Y1 - 2013/8

N2 - In this paper, we address the problem of deploying sink nodes in a wireless sensor network such that the resulting network topology be robust. In order to measure network robustness, we propose a new metric, called persistence, which better captures the notion of robustness than the widely known connectivity based metrics. We study two variants of the sink deployment problem: sink selection and sink placement. We prove that both problems are NP-hard, and show how the problem of sink placement can be traced back to the problem of sink selection using an optimal search space reduction technique, which may be of independent interest. To solve the problem of sink selection, we propose efficient heuristic algorithms. Finally, we provide experimental results on the performance of our proposed algorithms.

AB - In this paper, we address the problem of deploying sink nodes in a wireless sensor network such that the resulting network topology be robust. In order to measure network robustness, we propose a new metric, called persistence, which better captures the notion of robustness than the widely known connectivity based metrics. We study two variants of the sink deployment problem: sink selection and sink placement. We prove that both problems are NP-hard, and show how the problem of sink placement can be traced back to the problem of sink selection using an optimal search space reduction technique, which may be of independent interest. To solve the problem of sink selection, we propose efficient heuristic algorithms. Finally, we provide experimental results on the performance of our proposed algorithms.

KW - Denial-of-service attack

KW - Graph metric

KW - Node placement

KW - Topology robustness

KW - Wireless sensor network

UR - http://www.scopus.com/inward/record.url?scp=84878649481&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878649481&partnerID=8YFLogxK

U2 - 10.1016/j.pmcj.2012.05.001

DO - 10.1016/j.pmcj.2012.05.001

M3 - Article

AN - SCOPUS:84878649481

VL - 9

SP - 546

EP - 563

JO - Pervasive and Mobile Computing

JF - Pervasive and Mobile Computing

SN - 1574-1192

IS - 4

ER -