Connecting identifying codes and fundamental bounds

We consider the problem of generating a connected robust identifying code of a graph, by which we mean a subgraph with two properties: (i) it is connected, (ii) it is robust identifying, in the sense that the (subgraph-) induced neighborhoods of any two vertices differ by at least 2r + 1 vertices, where r is the robustness parameter. This particular formulation builds upon a rich literature on the identifying code problem but adds a property that is important for some practical networking applications. We concretely show that this modified problem is NP-complete and provide an otherwise efficient algorithm for computing it for an arbitrary graph. We demonstrate a connection between the the sizes of certain connected identifying codes and error-correcting code of a given distance. One consequence of this is that robustness leads to connectivity of identifying codes.

[1]  Antoine Lobstein,et al.  Identifying Codes with Small Radius in Some Infinite Regular Graphs , 2002, Electron. J. Comb..

[2]  Kaveh Pahlavan,et al.  Localization Algorithms and Strategies for Wireless Sensor Networks: Monitoring and Surveillance Techniques for Target Tracking , 2009 .

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

[4]  Gaston H. Gonnet,et al.  On the LambertW function , 1996, Adv. Comput. Math..

[5]  Iiro S. Honkala,et al.  General Bounds for Identifying Codes in Some Infinite Regular Graphs , 2001, Electron. J. Comb..

[6]  Baris Fidan,et al.  Localization Algorithms and Strategies for Wireless Sensor Networks: Monitoring and Surveillance Techniques for Target Tracking , 2009 .

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

[8]  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).

[9]  Francesco De Pellegrini,et al.  Robust location detection in emergency sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Iiro S. Honkala,et al.  The minimum density of an identifying code in the king lattice , 2004, Discret. Math..

[11]  Ari Trachtenberg.  Designing lexicographic codes with a given trellis complexity , 2002, IEEE Trans. Inf. Theory.

[12]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

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

[14]  Tero Laihonen,et al.  Codes Identifying Sets of Vertices , 2001, AAECC.

[15]  Iiro S. Honkala,et al.  On Identifying Codes in Binary Hamming Spaces , 2002, J. Comb. Theory, Ser. A.

[16]  Sylvain Gravier,et al.  Construction of Codes Identifying Sets of Vertices , 2005, Electron. J. Comb..

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

[18]  François Chapeau-Blondeau,et al.  Numerical evaluation of the Lambert W function and application to generation of generalized Gaussian noise with exponent 1/2 , 2002, IEEE Trans. Signal Process..

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

[20]  David Starobinski,et al.  Connected identifying codes for sensor network monitoring , 2011, 2011 IEEE Wireless Communications and Networking Conference.

[21]  Jukka Suomela,et al.  Approximability of identifying codes and locating-dominating codes , 2007, Inf. Process. Lett..

[22]  Antoine Lobstein,et al.  Identifying and locating-dominating codes: NP-Completeness results for directed graphs , 2002, IEEE Trans. Inf. Theory.

[23]  Xiuzhen Cheng,et al.  Connected Dominating Set in Sensor Networks and MANETs , 2004 .

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

[25]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

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

[27]  Mark G. Karpovsky,et al.  On robust and dynamic identifying codes , 2006, IEEE Transactions on Information Theory.

[28]  T. Berger-Wolf,et al.  Identifying Codes and the Set Cover Problem , 2006 .

[29]  Simon Litsyn,et al.  Exact Minimum Density of Codes Identifying Vertices in the Square Grid , 2005, SIAM J. Discret. Math..