TY - JOUR
T1 - Designing robust network topologies for wireless sensor networks in adversarial environments
AU - Laszka, Aron
AU - Buttyán, Levente
AU - Szeszlér, Dávid
N1 - Funding Information:
The work presented in this paper has been carried out in the context of the WSAN4CIP Project, 3 3 which receives funding from the European Community through the Seventh Framework Programme (grant agreement no. 225186). The work is also related to the internal project of the authors’ hosting institution on “Talent care and cultivation in the scientific workshops of BME”, which is supported by the grant TÁMOP — 4.2.2.B-10/1-2010-0009 . Aron Laszka and Levente Buttyán are supported by HSNLab, Budapest University of Technology and Economics . 4 4 Dávid Szeszlér is supported by grant no. OTKA 103985 of the Hungarian National Science Fund . The authors are thankful to Géza Tóth for the insights he provided on the size of the optimal set of candidate locations and his proof of Theorem 5 .
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.
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
SN - 1574-1192
VL - 9
SP - 546
EP - 563
JO - Pervasive and Mobile Computing
JF - Pervasive and Mobile Computing
IS - 4
ER -