Abstract
We examine a directed network on which sensors exist at a subset of the nodes. At each node, a target (e.g., an intruder in a physical network, a fire in a building, or a virus in a computer network) may or may not exist. Sensors detect the presence of these targets by monitoring the nodes at which they are located and all nodes adjacent from their positions. However, in practical settings a limited-cardinality subset of sensors might fail. A failed sensor may report false positives or negatives and, as a result, the network owner may not be able to ascertain whether or not targets exist at some nodes. If it is not possible to deduce whether or not a target exists at a node with a given set of sensor readings, then the node is said to be ambiguous. We show that a network owner must solve a series of combinatorial optimization problems to determine which nodes are ambiguous. Furthermore, we determine the worst-case number of ambiguous nodes by optimizing over the set of all sensor readings that could possibly arise. We also present mathematical programming formulations for these problems under varying assumptions on how sensors fail, and on what assumptions a network owner makes on how sensors fail. Our computational results illustrate how these varying assumptions impact the number of ambiguous nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A. A. Abbasi and M. Younis. A survey on clustering algorithms for wireless sensor networks. Computer Communications, 30:2826–2841, 2007.
B. Balasundaram and S. Butenko. Graph domination, coloring and cliques in telecommunications. In M. G. C. Resende and P. M. Pardalos, editors, Handbook of Optimization in Telecommunications, pages 865–890. Springer, 2006.
N. Biggs. Perfect codes in graphs. Journal of Combinatorial Theory, Series B, 15(3):289–296, 1973.
E. Cockayne and S. Hedetniemi. Optimal domination in graphs. IEEE Transactions on Circuits and Systems, 22(11):855–857, 1975.
J. F. Fink and M. S. Jacobson. n-domination in graphs. In Y. Alavi, G. Chartrand, L. Lesniak, D. R. Lick, and C. E. Wall, editors, Graph Theory with Applications to Algorithms and Computer Science, pages 283–300. John Wiley & Sons, Inc., New York, 1985.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman & Co., Princeton, NJ, 1979.
F. Harary and R. A. Melter. On the metric dimension of a graph. Ars Combinatoria, 2:191–195, 1976.
T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of Domination in Graphs. Pure and Applied Mathematics. Marcel Dekker, New York, NY, 1998.
S. T. Hedetniemi and R. C. Laskar. Topics on Domination, volume 48 of Annals of Discrete Mathematics. North Holland, Amsterdam, 1991.
J. Kennington, E. Olinick, and D. Rajan, editors. Wireless Network Design: Optimization Models and Solution Procedures, volume 158 of International Series in Operations Research & Management Science. Springer, New York, NY, 2011.
H. Lim and C. Kim. Flooding in wireless ad hoc networks. Computer Communications, 24(3):353–363, 2001.
C. L. Liu. Introduction to Combinatorial Mathematics, volume 181. McGraw-Hill, New York, NY, 1968.
G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. Wiley-Interscience, New York, NY, 1999.
O. Ore. Theory of Graphs, volume 38. American Mathematical Society, Providence, RI, Third edition, 1967.
D. Rajan and A. Atamturk. Survivable network design: Routing of flows and slacks. In G. Anandalingam and S. Raghavan, editors, Telecommunications Network Design and Management, pages 65–81. Kluwer, Norwell, MA, 2002.
M. G. C. Resende and P. M. Pardalos, editors. Handbook of Optimization in Telecommunications, volume 10. Springer, New York, NY, 2006.
S. Shen. Domination problems. In J. J. Cochran, editor, Wiley Encyclopedia of Operations Research and Management Science, pages 1470–1488. Wiley, Hoboken, NJ, 2010.
S. Shen and J.C. Smith. A decomposition approach for solving a broadcast domination network design problem. Annals of Operations Research, 1–28, Springer US, 2011.
P. J. Slater. Fault-tolerant locating-dominating sets. Discrete Mathematics, 249(1):179–189, 2002.
P. J. Slater. Liar’s domination. Networks, 54(2):70–74, 2009.
J. C. Smith, C. Lim, and F. Sudargho. Survivable network design under optimal and heuristic interdiction scenarios. Journal of Global Optimization, 38:181–199, 2007.
S. Soni, R. Gupta, and H. Pirkul. Survivable network design: The state of the art. Information Systems Frontiers, 1(3):303–315, 1999.
H. von Stackelberg. The Theory of the Market Economy. William Hodge and Co., London, U.K., 1952.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this paper
Cite this paper
Sonuç, S.B., Smith, J.C. (2013). Models for Assessing Vulnerability in Imperfect Sensor Networks. In: Sorokin, A., Pardalos, P. (eds) Dynamics of Information Systems: Algorithmic Approaches. Springer Proceedings in Mathematics & Statistics, vol 51. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7582-8_9
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7582-8_9
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7581-1
Online ISBN: 978-1-4614-7582-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)