Mixed-weight open locating-dominating sets

Wireless sensor networks (WSNs) and other monitoring systems often use sensors of multiple strengths within the same network. This information is lost when the network is modeled by a typical non-weighted graph. We introduce the mixed-weight open locating-dominating set (mixed-weight OLD-set), an extension of the open locating-dominating set, that allows vertices in the graph to have different weights. We show that finding the minimum mixed-weight OLD-set is NP-complete, establish probabilistic bounds for the size of mixed-weight OLD-sets in random graphs, and provide simulation results supporting those bounds.

[1]  Peter J. Slater,et al.  On open neighborhood locating-dominating in graphs , 2014, Electron. J. Graph Theory Appl..

[2]  Iiro S. Honkala,et al.  On strongly identifying codes , 2002, Discret. Math..

[3]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[4]  Kamarulzaman Ab. Aziz,et al.  Managing disaster with wireless sensor networks , 2011, 13th International Conference on Advanced Communication Technology (ICACT2011).

[5]  P. Hall.  On Representatives of Subsets , 1935 .

[6]  Alexandr V. Kostochka,et al.  An upper bound on the domination number of n-vertex connected cubic graphs , 2009, Discret. Math..

[7]  Sylvain Gravier,et al.  Identifying codes of cycles , 2006, Eur. J. Comb..

[8]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[9]  Gexin Yu,et al.  New bounds on the minimum density of an identifying code for the infinite hexagonal grid , 2013, Discret. Appl. Math..

[10]  Tero Laihonen,et al.  Optimal Identifying Codes in Cycles and Paths , 2012, Graphs Comb..

[11]  Ludovít Niepel,et al.  Locating and identifying codes in circulant networks , 2013, Discret. Appl. Math..

[12]  H. L. R. Ong,et al.  Glacial Environment Monitoring using Sensor Networks , 2005 .

[13]  Cynthia A. Phillips,et al.  Sensor Placement in Municipal Water Networks , 2003 .

[14]  Jean-Sébastien Sereni,et al.  Identifying and Locating-Dominating Codes in (Random) Geometric Networks , 2009, Comb. Probab. Comput..

[15]  D. Frank Hsu,et al.  Fault-tolerant routing in circulant networks and cycle prefix networks , 1998 .

[16]  Peter J. Slater,et al.  Open neighborhood locating-dominating in trees , 2011, Discret. Appl. Math..

[17]  Peter J. Slater,et al.  Open neighborhood locating-domination for infinite cylinders , 2011, ACM-SE '11.

[18]  Julien Moncel,et al.  On graphs on n vertices having an identifying code of cardinality [log2(n+1)] , 2006, Discret. Appl. Math..

[19]  Matt Welsh,et al.  Deploying a wireless sensor network on an active volcano , 2006, IEEE Internet Computing.

[20]  Sanna M. Ranto.  On binary linear r-identifying codes , 2011, Des. Codes Cryptogr..

[21]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[22]  Kay Römer,et al.  The design space of wireless sensor networks , 2004, IEEE Wireless Communications.

[23]  Yunghsiang Sam Han,et al.  A pairwise key pre-distribution scheme for wireless sensor networks , 2003, CCS '03.

[24]  Svante Janson,et al.  On the size of identifying codes in binary hypercubes , 2008, J. Comb. Theory A.

[25]  Paul D. Manuel.  Locating and Liar Domination of Circulant Networks , 2011, Ars Comb..

[26]  Gérard D. Cohen,et al.  On identifying codes , 1999, Codes and Association Schemes.

[27]  Dario Pompili,et al.  Underwater acoustic sensor networks: research challenges , 2005, Ad Hoc Networks.

[28]  Ari Trachtenberg,et al.  Disjoint identifying-codes for arbitrary graphs , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[29]  Iiro S. Honkala.  On r-locating-dominating sets in paths , 2009, Eur. J. Comb..

[30]  Kirk Martinez,et al.  Environmental Sensor Networks: A revolution in the earth system science? , 2006 .

[31]  Romano Fantacci,et al.  Distributed Monitoring Systems for Agriculture based on Wireless Sensor Network Technology , 2010 .

[32]  K. Appel,et al.  Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[33]  Peter J. Slater,et al.  Open neighborhood locating dominating sets , 2010, Australas. J Comb..

[34]  David L. Roberts,et al.  Locating sensors in paths and cycles: The case of 2-identifying codes , 2008, Eur. J. Comb..

[35]  Zarka Cvetanovic.  Performance analysis of the Alpha 21364-based HP GS1280 multiprocessor , 2003, ISCA '03.

[36]  Brendon Stanton,et al.  Improved Bounds for r-Identifying Codes of the Hex Grid , 2010, SIAM J. Discret. Math..

[37]  Tero Laihonen,et al.  Optimal Lower Bound for 2-Identifying Codes in the Hexagonal Grid , 2012, Electron. J. Comb..

[38]  Shilpa Chakravartula,et al.  Complex Networks: Structure and Dynamics , 2014 .

[39]  Kavi Kumar Khedo,et al.  A Wireless Sensor Network Air Pollution Monitoring System , 2010, ArXiv.

[40]  JAMAL N. AL-KARAKI,et al.  Routing techniques in wireless sensor networks: a survey , 2004, IEEE Wireless Communications.

[41]  Rex K. Kincaid,et al.  An integer linear program for mixed-weight open locating-dominating sets , 2018, 2018 52nd Annual Conference on Information Sciences and Systems (CISS).

[42]  Antoine Lobstein,et al.  Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard , 2003, Theor. Comput. Sci..

[43]  Ari Trachtenberg,et al.  Identifying Codes and Covering Problems , 2008, IEEE Transactions on Information Theory.

[44]  Jaikumar Radhakrishnan,et al.  Greed is good: Approximating independent sets in sparse and bounded-degree graphs , 1997, Algorithmica.

[45]  Mikko Pelto.  New bounds for (r, ≤ 2)-identifying codes in the infinite king grid , 2009, Cryptography and Communications.

[46]  Changhong Lu,et al.  Identifying codes and locating-dominating sets on paths and cycles , 2011, Discret. Appl. Math..

[47]  Philip Sallis,et al.  Wireless Sensor Networks for Climate Data Management Systems , 2009 .

[48]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[49]  Tero Laihonen,et al.  Locating-dominating codes in cycles , 2011, Australas. J Comb..

[50]  Yunghsiang Sam Han,et al.  A pairwise key predistribution scheme for wireless sensor networks , 2005, TSEC.

[51]  David Starobinski,et al.  Robust location detection with sensor networks , 2004, IEEE Journal on Selected Areas in Communications.

[52]  Mark G. Karpovsky,et al.  Fault Isolation and Diagnosis in Multiprocessor Systems with Point-to-Point Communication Links , 1998 .

[53]  Daniel W. Cranston,et al.  A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid , 2009, Electron. J. Comb..

[54]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[55]  Vassil Guliashki,et al.  LINEAR INTEGER PROGRAMMING METHODS AND APPROACHES-A SURVEY , 2011 .

[56]  Alan M. Frieze,et al.  Codes identifying sets of vertices in random networks , 2007, Discret. Math..

[57]  Hideharu Amano,et al.  Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers , 2001, IEEE Trans. Parallel Distributed Syst..

[58]  Mark G. Karpovsky,et al.  On a New Class of Codes for Identifying Vertices in Graphs , 1998, IEEE Trans. Inf. Theory.

[59]  David Starobinski,et al.  An Implementation of Indoor Location Detection Systems Based on Identifying Codes , 2004, INTELLCOMM.

[60]  Gérard D. Cohen,et al.  New Bounds for Codes Identifying Vertices in Graphs , 1999, Electron. J. Comb..

[61]  Reuven Cohen,et al.  Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).

[62]  Rex K. Kincaid,et al.  Optimal open-locating-dominating sets in infinite triangular grids , 2014, Discret. Appl. Math..

[63]  William E. Hart,et al.  Discrete sensor placement problems in distribution networks , 2005, Math. Comput. Model..

[64]  Rex Kincaid,et al.  An integer program for Open Locating Dominating sets and its results on the hexagon-triangle infinite grid and other graphs , 2014, 2014 Systems and Information Engineering Design Symposium (SIEDS).

[65]  Manuel Laguna,et al.  Tabu Search , 1997 .

[66]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[67]  Sylvain Gravier,et al.  A linear algorithm for minimum 1-identifying codes in oriented trees , 2006, Discret. Appl. Math..

[68]  Michael A. Henning,et al.  Location-domination and matching in cubic graphs , 2016, Discret. Math..

[69]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[70]  Iiro S. Honkala,et al.  On Locating-Dominating Codes in Binary Hamming Spaces , 2004, Discret. Math. Theor. Comput. Sci..

[71]  Nathalie Bertrand,et al.  Identifying and locating-dominating codes on chains and cycles , 2004, Eur. J. Comb..