Yunhui Zheng
Abstract
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.
- Aigner, M. and Ziegler, G. M. 1998. Proofs from the Book. Springer-Verlag, Berlin, Germany.Google Scholar
- Bellutta, P., Ancona, N., and Poggio, T. 1991. A floor boundary sensor for autonomous robot navigation. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI).Google Scholar
- Bollobas, B. 1979. Graph Theory: An Introductory Course. Springer-Verlag, Berlin, Germany.Google ScholarCross Ref
- Chung, F. R. K. 1997. Spectral Graph Theory. American Mathematical Society, Providence, RI.Google Scholar
- Clouqueur, T., Phipatanasuphorn, V., Ramanathan, P., and Saluja, K. K. 2003. Sensor deployment strategy for detection of targets traversing a region. Mob. Netw. Appl. 8, 4, 453--461. Google ScholarDigital Library
- de Bruijn, N. and van Aardenne-Ehrenfest, T. 1951. Circuits and trees in oriented linear graphs. Simon Stevin 28, 203--217.Google Scholar
- Dougherty, B. C., Bunch, R. M., Lukens, R. E., Nagel, J., and Wolfe, W. L. 2004. Passive infrared device for detection of boundary crossings. United States Patent Application 20040129883.Google Scholar
- Gopinathan, U., Brady, D. J., and Pitsianis, N. P. 2003. Coded apertures for efficient pyroelectric motion tracking. Optics Express 11, 18, 2142--2152.Google ScholarCross Ref
- Harary, F. 1994. Graph Theory. Addison-Wesley, 376--379.Google Scholar
- Huang, C.-F. and Tseng, Y.-C. 2003. The coverage problem in a wireless sensor network. In ACM International Workshop on Wireless Sensor Networks and Applications. Google ScholarDigital Library
- Lucas, E. 1891. Recreations Mathematiques. Gauthier-Villares, Paris, France.Google Scholar
- Meguerdichian, S., Koushanfar, F., Potkonjak, M., and Srivastava, M. 2001a. Coverage problems in wireless ad-hoc sensor networks. In Proceedings of INFOCOM. 1380--1387.Google Scholar
- Meguerdichian, S., Koushanfar, F., Qu, G., and Potkonjak, M. 2001b. Exposure in wireless ad-hoc sensor networks. In Proceedings of MOBICOM. 139--150. Google ScholarDigital Library
- Meguerdichian, S., Slijepcevic, S., Karayan, V., and Potkonjak, M. 2001c. Localized algorithms in wireless ad-hoc networks: Location discovery and sensor exposure. In Proceedings of MOBIHOC. 106--116. Google ScholarDigital Library
- Potuluri, P., Gopinathan, U., Adleman, J. R., and Brady, D. J. 2003. Lensless sensor system using a reference structure. Optics Express 11, 8, 965--974.Google ScholarCross Ref
- Smith, C. and Tutte, W. 1941. On unicursal paths in a network of degree 4. Amer. Math. Month. 48, 233--237.Google ScholarCross Ref
- Tian, D. and Georganas, N. D. 2002. A coverage-preserving node scheduling scheme for large wireless sensor networks. In ACM International Workshop on Wireless Sensor Networks and Applications. Google ScholarDigital Library
- Ye, F., Zhong, G., Lu, S., and Zhang, L. 2003. A robust energy conserving protocol for long-lived sensor networks. In International Conference on Distributed Computing Systems. Google ScholarDigital Library
- Zahnd, S., Lichtsteiner, P., and Delbruck, T. 2003. Integrated vision sensor for detecting boundary crossings. In Proceedings of the IEEE International Symposium on Circuits and Systems. 376--379.Google Scholar
- Zheng, Y., Brady, D. J., Sullivan, M. E., and Guenther, B. 2005. Fiber optical localization by geometric space coding with 2d gray code. Appl. Optics 44, 20, 4306--4314.Google ScholarCross Ref
- Zheng, Y., Pitsianis, N. P., and Brady, D. J. 2006. A fiber sensor floor web for multi-person tracking. IEEE Sensor J. To appear.Google Scholar
Index Terms
- Localization using boundary sensors: An analysis based on graph theory
Recommendations
Methods of Sensors Localization in Wireless Sensor Networks
ECBS '07: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based SystemsIn recent years there has been a growing interest in wireless sensor networks (WSN) applications. Such sensor networks can be used to control temperature, humidity, contamination, pollution etc. Self-organization and routing algorithms dedicated to ...
Sequence mixed graphs
A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures are ...
Silent localization of underwater sensors using magnetometers
Special issue on advances in signal processing for maritime applicationsSensor localization is a central problem for sensor networks. If the sensor positions are uncertain, the target tracking ability of the sensor network is reduced. Sensor localization in underwater environments is traditionally addressed using acoustic ...
Comments