DocumentCode :
2781338
Title :
Optimal selection of sink nodes in wireless sensor networks in adversarial environments
Author :
Laszka, Áron ; Buttyán, Levente ; Szeszlér, Dávid
Author_Institution :
Dept. of Telecommun., Budapest Univ. of Technol. & Econ., Budapest, Hungary
fYear :
2011
fDate :
20-24 June 2011
Firstpage :
1
Lastpage :
6
Abstract :
In this paper, we address the problem of assigning the sink role to a subset of nodes in a wireless sensor network with a given topology such that the resulting network configuration is robust against denial-of-service type attacks such as node destruction, battery exhaustion and jamming. In order to measure robustness, we introduce new metrics based on a notion defined in [1]. We argue that our metrics are more appropriate to measure the robustness of network configurations than the widely known connectivity based metrics. We formalize the problem of selecting the sink nodes as an optimization problem aiming at minimizing the deployment budget while achieving a certain level of robustness.We propose an efficient greedy heuristic algorithm that approximates the optimal solution reasonably well.
Keywords :
greedy algorithms; optimisation; wireless sensor networks; adversarial environments; denial-of-service attacks; greedy heuristic algorithm; optimization problem; sink nodes; wireless sensor networks; Greedy algorithms; Jamming; Measurement; Network topology; Robustness; Topology; Wireless sensor networks; denial-of-service attacks; topology robustness measures; wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2011 IEEE International Symposium on a
Conference_Location :
Lucca
Print_ISBN :
978-1-4577-0352-2
Electronic_ISBN :
978-1-4577-0350-8
Type :
conf
DOI :
10.1109/WoWMoM.2011.5986167
Filename :
5986167
Link To Document :
بازگشت