A forest ranger helicopter flies over a forest, scattering sensors that can relay temperature data to the ranger station. To ensure minimal environmental impact with maximum robustness, the sensors are very simple: they are basically tiny, sturdy thermometers. After the sensors are scattered, they might be moved further by winds, rains, rivers, or even animals. Is there a way to take the local information sent by the sensor network and turn it into global information about the existence and location of fires in the forest" In particular, without knowing the exact locations of the sensors, can one nevertheless glean information about the coverage area of the sensor network.
As sensor technology has exploded, such fundamental questions have come to the forefront in many areas. In particular, national security measures increasingly depend on sensor technology to detect, for example, radiological or biological hazards, hidden mines and munitions, or specific individuals in a crowd. Mathematics, especially the area of topology, provides a way of addressing such questions.
The January 2007 issue of the Notices of the AMS will carry the article "Homological Sensor Networks" by Vin de Silva and Robert Ghrist. The article describes new results by the authors, which demonstrate how homology theory provides fundamental insights useful in analyzing sensor networks.
Suppose you have a network of sensors, each with a unique ID, scattered around a two-dimensional domain D---for example, D could be a region of forest, an open field, or a portion of the ocean floor. The sensors have a "broadcast radius", within which they can detect the identity of any other sensor, and a "cover radius", within which the sensors perform their sensing tasks. You can think of each sensor as surrounded by a disk whose radius is the coverage radius. The union of these disks is the "sensor cover". A basic question is, Does the sensor cover contain D"
Topology, which is the study of shapes, is well suited to attacking this question. In particular, homology theory provides a way of detecting whether shapes contain holes. De Silva and Ghrist were able to use homology theory to pinpoint some simple topological conditions that, if met by the sensor network, guarantee that the sensor cover contains the whole domain D without holes. What is striking about this result is that it provides information about the sensor cover without requiring knowledge of the exact locations of the sensors. Only the broadcast and cover radii are needed.
De Silva and Ghrist also adapted the above result to networks where the sensors are going on- and off-line periodically, so that holes open up and close in the sensor cover. Can an "evader" move through the sensor network, taking advantages of holes that open up in order to slip through undetected" The authors present topological conditions on the sensor network that guarantee that the evader will be caught, regardless of the evader's speed or cunning.
"It seems counterintuitive that one can provide rigorous answers for a network with neither localization capabilities nor distance measurements," the authors remark. "A topologist is not surprised that such coarse data can be integrated into a global picture. Some engineers are." De Silva and Ghrist call for mathematicians and engineers to collaborate on the design of effective sensor networks.
Ghrist is building such collaborations as a lead investigator for a research project called SToMP, short for "Sensor Topology & Minimal Planning." Funded by the Defense Advanced Research Projects Agency (DARPA), the $7.98 million project will run over four years. SToMP will support research at Ghrist's home institution, the University of Illinois at Urbana-Champaign, as well as at Bell Labs/Lucent, Arizona State University, Rochester University, Carnegie-Mellon University, Melbourne University, the University of Pennsylvania, and the University of Chicago.
Materials provided by American Mathematical Society. Note: Content may be edited for style and length.
Cite This Page: