Efficient parallel algorithms for dead sensor diagnosis and multiple access channels

Authors:
Michael T. Goodrich;Daniel S. Hirschberg
Affiliations:
University of California, Irvine, CA;University of California, Irvine, CA
Venue:
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Year:
2006

Citing 12
Cited 2

Locating faults in a constant number of parallel testing rounds

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Fault diagnosis in a small constant number of parallel testing rounds

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
On the upper bound of the size of the r-cover-free families

Journal of Combinatorial Theory Series A
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels

Journal of the ACM (JACM)
Distributed Algorithms

Distributed Algorithms
Fault diagnosis in a flash

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Group Testing Problems with Sequences in Experimental Molecular Biology

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Impact of Network Density on Data Aggregation in Wireless Sensor Networks

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving the reliability of event reports in wireless sensor networks

ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Generalized framework for selectors with applications in optimal group testing

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Indexing information for data forensics

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Improved combinatorial group testing for real-world problem sizes

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

k+ decision trees

ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Space-efficient straggler identification in round-trip data streams via newton's identities and invertible bloom filters

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study parallel algorithms for identifying the dead sensors in a mobile ad hoc wireless network and for resolving broadcast conflicts on a multiple access channel (MAC). Our approach involves the development and application of new group-testing algorithms, where we are asked to identify all the defective items in a set of items when we can test arbitrary subsets of items. In the standard group-testing problem, the result of a test is binary--the tested subset either contains defective items or not. In the versions we study in this paper, the result of each test is non-binary. For example, it may indicate whether the number of defective items contained in the tested subset is zero, one, or at least two (i.e., the results are 0, 1, or 2+). We give adaptive algorithms that are provably more efficient than previous group testing algorithms (even for generalized response models). We also show how our algorithms can be implemented in parallel, because they possess a property we call conciseness, which allows them to be used to solve dead sensor diagnosis and conflict resolution on a MAC. Dead sensor diagnosis poses an interesting challenge compared to MAC resolution, because dead sensors are not locally detectable, nor are they themselves active participants. Even so, we present algorithms that can be applied in both contexts that are more efficient than previous methods. We also give lower bounds for generalized group testing.