Joint monitoring and routing in wireless sensor networks using robust identifying codes

Abstract

Abstract-Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their limitations present challenges to fundamental network services such as routing. In this work we utilize an abstraction of WSNs based on the theory of identifying codes. This abstraction has been useful in recent literature for a number of important monitoring problems, such as localization and contamination detection. In our case, we use it to provide a joint infrastructure for efficient and robust monitoring and routing in WSNs. Specifically, we make use of efficient and distributed algorithm for generating robust identifying codes, an NP-hard problem, with a logarithmic performance guarantee based on a reduction to the set kmulticover problem. We also show how this same identifyingcode infrastructure provides a natural labeling that can be used for near-optimal routing with very small routing tables. We provide experimental results for various topologies that illustrate the superior performance of our approximation algorithms over previous identifying code heuristics.

Localization and identification in networks using robust identifying codes

“…The neighborhood of each vertex in the graph intersects uniquely with this code, and such an intersection is called an identifying set 1 ; given an identifying set, one can thus uniquely identify the vertex in the graph that produced it. In this case, the code provided is also optimal, because one needs at least lg 8 = 3 code vertices to produce 8 distinct identifying sets (corresponding to the 8 vertices of the cube) 2 . The goal of 1 Unlike traditional identifying codes, the empty set is considered a valid identifying set here.…”

“…More recently, these codes were extended to applications for environmental monitoring [10], and joint monitoring and routing in wireless sensor networks [2]. In the former, sensors are placed in a subset of junctions of a utility network such as an air ventilation system, a water supply network, or a river bed, etc, in order to detect pollutants.…”

“…The goal of 1 Unlike traditional identifying codes, the empty set is considered a valid identifying set here. 2 As is common, we use the notation lg(x) to denote log 2 (x). the identifying code problem is to find an identifying code of minimum cardinality for any given graph.…”

“…In this paper we focus on a combinatorial approach, which is closely related to error-correcting codes, and specifically to identifying codes. Many of the results provided in this paper can be found in [1][2][3][4].…”

Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes

“…One can also mention applications to routing [44], to bioinformatics [37] (where identifying codes are called differentiating dominating sets) and to measuring the first-order logical complexity of graphs [41] (where locating-dominating sets are calledsieves).…”