A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Introduction to algorithms
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
SIAM Journal on Computing
Theoretical Computer Science
Compact routing with minimum stretch
Journal of Algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Approximation algorithms
Dominating-set-based routing in ad hoc wireless networks
Handbook of wireless networks and mobile computing
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
Theoretical Computer Science
Global Optimization Using Local Information with Applications to Flow Control
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Compact routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A wireless sensor network For structural monitoring
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Proceedings of the 3rd international conference on Embedded networked sensor systems
On graphs on n vertices having an identifying code of cardinality ⌈log2(n + 1)⇸
Discrete Applied Mathematics
Identifying and locating–dominating codes in (random) geometric networks
Combinatorics, Probability and Computing
A survey of clustering schemes for mobile ad hoc networks
IEEE Communications Surveys & Tutorials
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
Identifying and locating-dominating codes: NP-completeness results for directed graphs
IEEE Transactions on Information Theory
On robust and dynamic identifying codes
IEEE Transactions on Information Theory
Identifying Codes and Covering Problems
IEEE Transactions on Information Theory
Discrete sensor placement problems in distribution networks
Mathematical and Computer Modelling: An International Journal
Robust location detection with sensor networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
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.