A Minimum Cost Source Location Problem for Wireless Sensor Networks

Wireless sensor networks consist of physically unprotected devices, therefore it is essential to design the network configuration in such a way that it is the most resistant against attacks. However, it is not at all obvious how to measure the robustness of a network to best serve the purposes of wireless sensor networks. In this paper we propose a metric that seems to be appropriate and then we address the problem of assigning the sink role to a subset of vertices such that the arising network is as robust with respect to the proposed metric as possible.

[1]  Levente Buttyán,et al.  Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality , 2012, GameSec.

[2]  Levente Buttyán,et al.  Designing robust network topologies for wireless sensor networks in adversarial environments , 2013, Pervasive Mob. Comput..

[3]  William H. Cunningham,et al.  Optimal attack and reinforcement of a network , 1985, JACM.

[4]  Vikram Krishnamurthy,et al.  Game Theory for Networks , 2012, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

[5]  John S. Baras,et al.  Decision and Game Theory for Security , 2010, Lecture Notes in Computer Science.

[6]  Levente Buttyán,et al.  Optimal selection of sink nodes in wireless sensor networks in adversarial environments , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[7]  S. Louis Hakimi,et al.  Recognizing tough graphs is NP-hard , 1990, Discret. Appl. Math..

[8]  Dan Gusfield,et al.  Connectivity and Edge-Disjoint Spanning Trees , 1983, Information Processing Letters.