Qun Li
Abstract
We develop distributed algorithms for adaptive sensor networks that respond to directing a target through a region of space. We model this problem as an online distributed motion planning problem. Each sensor node senses values in its perception space and has the ability to trigger exceptions events we call “danger” and model as “obstacles”. The danger/obstacle landscape changes over time. We present algorithms for computing distributed maps in perception space and for using these maps to compute adaptive paths for a mobile node that can interact with the sensor network. We give the analysis to the protocol and report on hardware experiments using a physical sensor network consisting of Mote sensors. We also show how to reduce searching space and communication cost using Voronoi diagram.
- Aslam, J., Li, Q., and Rus, D. 2003. Three power-aware routing algorithms for sensor networks. Wirel. Comm. Mobile Comput. 3, 2 (Mar.), 187--208.Google Scholar
- Batalin, M. and Sukhatme, G. 2003. Efficient exploration without localization. In the International Conference on Robotics and Automation (ICRA'03). Taipei,Taiwan.Google Scholar
- Batalin, M. A. and Sukhatme, G. S. 2004. Coverage, exploration and deployment by a mobile robot and communication network. Telecomm. Syst. J. 26, 2--4.Google Scholar
- Capkun, S., Hamdi, M., and Hubaux, J. P. 2002. GPS-free positioning in mobile ad-hoc networks. J. Cluster Comput. Google Scholar
- Cheng, X., Thaeler, A., Xue, G., and Chen, D. 2004. Tps: A time-based positioning scheme for outdoor sensor networks. In the 23rd Conference of the IEEE Communications Society (INFOCOM '04). Hong Kong.Google Scholar
- Corke, P., Peterson, R., and Rus, D. 2003. Networked robots: Flying robot navigation using a sensor net. In the 11th International Symposium of Robotics Research. Sienna, Italy.Google Scholar
- Estrin, D., Govindan, R., and Heidemann, J. 2000. Embedding the internet. Comm. ACM 43, 5 (May), 39--41. Google Scholar
- Fang, Q., Gao, J., and Guibas, L. 2004. Locating and bypassing routing holes in sensor networks. In the 23rd Conference of the IEEE Communications Society (INFOCOM'04). Hong Kong.Google Scholar
- Ganesan, D., Krishnamachari, B., Woo, A., Culler, D., Estrin, D., and Wicker, S. 2002. Complex behavior at scale: An experimental study of low-power wireless sensor networks. UCLA Computer Science Tech. Rep. UCLA/CSD-TR 02-0013.Google Scholar
- Guibas, L. J. and Stolfi, J. 1983. Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams. In ACM Symposium on the Theory of Computing (STOC'83). 221--234. Google Scholar
- Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., and Pister, K. 2000. System architecture directions for network sensors. In Architectural Support for Programming Languages and Operating Systems (ASPLOS'00). Google Scholar
- Huang, Q., Lu, C., and Roman, C. 2003. Spatiotemporal multicast for sensor networks. In ACM SenSys '03. Los Angeles, CA. Google Scholar
- Intanagonwiwat, C., Govindan, R., and Estrin, D. 2000. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the Mobicom'00. Boston, MA. Google Scholar
- Koditschek, D. E. 1989. Planning and control via potential fuctions. Robotics Rev. I, 349--367. Google Scholar
- Latombe, J.-C. 1992. Robot Motion Planning. Kluwer, New York. Google Scholar
- Lengyel, J., Reichert, M., Donald, B., and Greenberg, D. 1990. Real-time robot motion planning using rasterizing computer graphics hardware. In Proceedings of SIGGRAPH. Dallas, TX, 327--336. Google Scholar
- Meguerdichian, S., Koushanfar, F., Qu, G., and Potkonjak, M. 2001. Exposure in wireless ad hoc sensor networks. In MOBICOM '01. Rome, Italy. 139--150. Google Scholar
- Moore, D., Leonard, J., Rus, D., and Teller, S. 2004. Robust distributed network localization with noisy range measurements. In ACM SenSys'04. Baltimore, MD. Google Scholar
- Niculescu, D. and Badrinath, B. R. 2003. Ad hoc positioning system (APS) using AOA. In the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '03). San Francisco, CA.Google Scholar
- Savvides, A., Han, C.-C., and Strivastava, M. B. 2001. Dynamic fine-grained localization in ad-hoc networks of sensors. In MOBICOM '01. Rome, Italy, 166--179. Google Scholar
- Sundaram, N. and Ramanathan, P. 2002. Connectivity based location estimation scheme for wireless ad hoc networks. In Proceedings of Globecom '02. Taipei, Taiwan.Google Scholar
- Takagi, H. and Kleinrock, L. 1984. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans. Comm. 32, 3 (Mar.).Google Scholar
- Veltri, G., Huang, Q., Qu, G., and Potkonjak, M. 2003. Minimal and maximal exposure path algorithms for wireless embedded sensor networks. In ACM SenSys '03. Los Angeles, CA. Google Scholar
- Wan, C.-Y., Campbell, A., and Krishnamurthy, L. 2002. PSFQ: A reliable transport protocol for wireless sensor networks. In the 1st ACM International Workshop on Wireless Sensor Networks and Applications. Atlanta, GA. Google Scholar
- Wan, C.-Y., Eisenman, S. B., and Campbell, A. T. 2003. Coda: Congestion detection and avoidance in sensor networks. In ACM SenSys '03. Los Angeles, CA. Google Scholar
- Woo, A., Tong, T., and Culler, D. 2003. Taming the underlying challenges of reliable multihop routing in sensor networks. In ACM SenSys '03. Los Angeles, CA. Google Scholar
- Yan, T., He, T., and Stankovic, J. A. 2003. Differentiated surveillance for sensor networks. In ACM SenSys '03. Los Angeles, CA. Google Scholar
- Ye, F., Luo, H., Cheng, J., Lu, S., and Zhang, L. 2002. A two-tier data dissemination model for large-scale wireless sensor networks. In ACM Mobicom '02. Atlanta, GA. Google Scholar
- Zhao, F., Shin, J., and Reich, J. 2002. Information-driven dynamic sensor collaboration for tracking applications. IEEE Signal Process. Mag. 19, 2 (Mar.), 61--72.Google Scholar
- Zhao, J. and Govindan, R. 2003. Understanding packet delivery performance in dense wireless sensor networks. In ACM SenSys '03. Los Angeles, CA. Google Scholar
Index Terms
- Navigation protocols in sensor networks
Recommendations
Distributed algorithms for guiding navigation across a sensor network
MobiCom '03: Proceedings of the 9th annual international conference on Mobile computing and networkingWe develop distributed algorithms for self-organizing sensor networks that respond to directing a target through a region. The sensor network models the danger levels sensed across its area and has the ability to adapt to changes. It represents the ...
The Tenet architecture for tiered sensor networks
Most sensor network research and software design has been guided by an architectural principle that permits multinode data fusion on small-form-factor, resource-poor nodes, or motes. While we were among the earliest promoters of this approach, through ...
An efficient cluster-based communication protocol for wireless sensor networks
A wireless sensor network is a network of large numbers of sensor nodes, where each sensor node is a tiny device that is equipped with a processing, sensing subsystem and a communication subsystem. The critical issue in wireless sensor networks is how ...
Comments