Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#235504] of Pankaj K. Agarwal

Papers Published

  1. Zheng, Y; Brady, DJ; Agarwal, PK, Localization using boundary sensors: An analysis based on graph theory, ACM Transactions on Sensor Networks, vol. 3 no. 4 (2007), ISSN 1550-4859 [doi]
    (last updated on 2018/11/20)

    We consider sensors, such as fibers, lasers, and pyroelectric motion detectors, that fire when objects cross a boundary. A moving object can be localized by analyzing sequences of boundary crossings. We consider the number of distinct sequences and object positions that can be achieved using boundary sensors in one- and two-dimensional spaces. For 1D systems we use representations of sensor sequences on graphs to derive limits on the number of object locations that can be monitored by a given sensor population and sequence length. For 2D systems we show that in certain circumstances the ratio of the number of unique sensor sequences to the number of unique object paths is exponential in the sequence length and we argue that the probability of unique identification is high for sufficiently large sequences. We also prove the triangle grid can track an object with error limited to a small neighborhood. © 2007 ACM.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320