Cellular Automata for Distributed Sensor Networks

Authors:
Dylan G. Allegretti;Garrett T. Kenyon;William C. Priedhorsky
Affiliations:
P Division, Los Alamos National Laboratory, Los Alamos, NM 87545;P Division, Los Alamos National Laboratory, Los Alamos, NM 87545,;Threat Reduction Directorate, Los Alamos National Laboratory, Los Alamos, NM 87545
Venue:
International Journal of High Performance Computing Applications
Year:
2008

Citing 2
Cited 0

Next century challenges: scalable coordination in sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Tracking multiple targets with self-organizing distributed ground sensors

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed Sensor Networks (DSNs) may be useful for detecting and tracking moving objects. Although such systems have important surveillance and homeland security applications, several technical problems exist. The cheap, low-powered sensors necessary for deployment over large areas may function poorly in low signal-to-noise environments. Although combining information from multiple sensors improves detection capabilities, long-range communication with a central computer may exhaust local power resources. We consider cellular automata rules that address these problems. By communicating locally, sensors can accurately track a moving object in a noisy environment. By communicating anonymously, they can use low-powered radio transmitters and receivers and avoid complex digital communication protocols. Our computer simulations show that DSNs can use cellular automata to greatly enhance the detection capabilities of individual sensors and reduce the amount of long-range communication by an order of magnitude.