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

Moshe Laifenfeld, Ari Trachtenberg, Reuven Cohen, David Starobinski

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

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 k-multicover problem. We also show how this same identifying-code 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.

Original languageEnglish
Pages (from-to)415-432
Number of pages18
JournalMobile Networks and Applications
Volume14
Issue number4
DOIs
StatePublished - Aug 2009
Externally publishedYes

Bibliographical note

Funding Information:
Acknowledgements This material is based, in part, upon work supported by the National Science Foundation under Grants 0132802, CCF-0729158, CCR-0133521 and CNS-0435312.

Keywords

  • Distributed algorithms
  • Robust identifying codes
  • Routing
  • Sensor networks

Fingerprint

Dive into the research topics of 'Joint monitoring and routing in wireless sensor networks using robust identifying codes'. Together they form a unique fingerprint.

Cite this