Download Now Free registration required
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 paper, the authors 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 their case, they use it to provide a joint infrastructure for efficient and robust monitoring and routing in WSNs. Specifically, they 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 k-multicover problem.
- Format: PDF
- Size: 229.4 KB