2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (2011)
June 20, 2011 to June 24, 2011
A. Laszka , Dept. of Telecommun., Budapest Univ. of Technol. & Econ., Budapest, Hungary
L. Buttyan , Dept. of Telecommun., Budapest Univ. of Technol. & Econ., Budapest, Hungary
D. Szeszler , Dept. of Comput. Sci. & Inf. Theor., Budapest Univ. of Technol. & Econ., Budapest, Hungary
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 . 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.
greedy heuristic algorithm, sink nodes, wireless sensor networks, adversarial environments, denial-of-service attacks, optimization problem
A. Laszka, L. Buttyan and D. Szeszler, "Optimal selection of sink nodes in wireless sensor networks in adversarial environments," 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks(WOWMOM), Lucca, 2011, pp. 1-6.