Issue No. 12 - December (2010 vol. 21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.60
Jaehoon Jeong , University of Minnesota, Twin Cities, Minneapolis
Yu Gu , University of Minnesota, Twin Cities, Minneapolis
Tian He , University of Minnesota, Twin Cities, Minneapolis
David H.C. Du , University of Minnesota, Twin Cities, Minneapolis
This paper proposes a VIrtual Scanning Algorithm (VISA), tailored and optimized for road network surveillance. Our design uniquely leverages upon the facts that 1) the movement of targets (e.g., vehicles) is confined within roadways and 2) the road network maps are normally known. We guarantee the detection of moving targets before they reach designated protection points (such as temporary base camps), while maximizing the lifetime of the sensor network. The main idea of this work is virtual scan—waves of sensing activities scheduled for road network protection. We provide design-space analysis on the performance of virtual scan in terms of lifetime and average detection delay. Importantly, to our knowledge, this is the first work to study how to guarantee target detection while sensor network deteriorates, using a novel hole handling technique. Through theoretical analysis and extensive simulation, it is shown that a surveillance system, using our design, sustains orders-of-magnitude longer lifetime than full coverage algorithms, and as much as 10 times longer than legacy duty cycling algorithms.
Sensor network, road network, virtual scanning, surveillance, detection, protection.
J. Jeong, D. H. Du, Y. Gu and T. He, "Virtual Scanning Algorithm for Road Network Surveillance," in IEEE Transactions on Parallel & Distributed Systems, vol. 21, no. , pp. 1734-1749, 2010.